/usr/lib/jvm/java-1.11.0-openjdk-amd64/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/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION --traceabstraction.number.of.independence.relations.to.use.for.por 2 --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL '--traceabstraction.abstraction.used.for.commutativity.in.por.#2' NONE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 12:37:57,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 12:37:57,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-01-26 12:37:57,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 12:37:57,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 12:37:57,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 12:37:57,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 12:37:57,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 12:37:57,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 12:37:57,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 12:37:57,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 12:37:57,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 12:37:57,873 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 12:37:57,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 12:37:57,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 12:37:57,875 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 12:37:57,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 12:37:57,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 12:37:57,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 12:37:57,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 12:37:57,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 12:37:57,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 12:37:57,876 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 12:37:57,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 12:37:57,878 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 12:37:57,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 12:37:57,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 12:37:57,879 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 12:37:57,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 12:37:57,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 12:37:57,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 12:37:57,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 12:37:57,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-26 12:37:57,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 12:37:57,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 12:37:57,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 12:37:57,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 12:37:57,881 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 12:37:57,881 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-01-26 12:37:57,881 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Number of independence relations to use for POR -> 2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR #2 -> NONE [2024-01-26 12:37:58,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 12:37:58,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 12:37:58,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 12:37:58,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 12:37:58,132 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 12:37:58,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2024-01-26 12:37:59,403 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 12:37:59,628 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 12:37:59,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2024-01-26 12:37:59,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d9f1732e2/814ae79b6f8c467bab2b6456273fef73/FLAGd06a65a72 [2024-01-26 12:37:59,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d9f1732e2/814ae79b6f8c467bab2b6456273fef73 [2024-01-26 12:37:59,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 12:37:59,652 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 12:37:59,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 12:37:59,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 12:37:59,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 12:37:59,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:37:59" (1/1) ... [2024-01-26 12:37:59,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f10145c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:37:59, skipping insertion in model container [2024-01-26 12:37:59,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:37:59" (1/1) ... [2024-01-26 12:37:59,679 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 12:37:59,842 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-more-max-array-hom.wvr.c[2625,2638] [2024-01-26 12:37:59,850 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 12:37:59,858 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 12:37:59,875 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-more-max-array-hom.wvr.c[2625,2638] [2024-01-26 12:37:59,878 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 12:37:59,890 INFO L206 MainTranslator]: Completed translation [2024-01-26 12:37:59,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:37:59 WrapperNode [2024-01-26 12:37:59,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 12:37:59,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 12:37:59,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 12:37:59,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 12:37:59,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:37:59" (1/1) ... [2024-01-26 12:37:59,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:37:59" (1/1) ... [2024-01-26 12:37:59,931 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2024-01-26 12:37:59,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 12:37:59,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 12:37:59,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 12:37:59,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 12:37:59,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:37:59" (1/1) ... [2024-01-26 12:37:59,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:37:59" (1/1) ... [2024-01-26 12:37:59,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:37:59" (1/1) ... [2024-01-26 12:37:59,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:37:59" (1/1) ... [2024-01-26 12:37:59,950 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:37:59" (1/1) ... [2024-01-26 12:37:59,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:37:59" (1/1) ... [2024-01-26 12:37:59,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:37:59" (1/1) ... [2024-01-26 12:37:59,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:37:59" (1/1) ... [2024-01-26 12:37:59,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 12:37:59,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 12:37:59,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 12:37:59,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 12:37:59,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:37:59" (1/1) ... [2024-01-26 12:37:59,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 12:37:59,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:37:59,997 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-01-26 12:38:00,005 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-01-26 12:38:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 12:38:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 12:38:00,020 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 12:38:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 12:38:00,020 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 12:38:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-26 12:38:00,020 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-26 12:38:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 12:38:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 12:38:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 12:38:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-26 12:38:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-26 12:38:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 12:38:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 12:38:00,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 12:38:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 12:38:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 12:38:00,022 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 12:38:00,094 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 12:38:00,095 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 12:38:00,345 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 12:38:00,447 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 12:38:00,447 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-26 12:38:00,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:38:00 BoogieIcfgContainer [2024-01-26 12:38:00,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 12:38:00,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 12:38:00,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 12:38:00,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 12:38:00,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 12:37:59" (1/3) ... [2024-01-26 12:38:00,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438f4951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:38:00, skipping insertion in model container [2024-01-26 12:38:00,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:37:59" (2/3) ... [2024-01-26 12:38:00,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438f4951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:38:00, skipping insertion in model container [2024-01-26 12:38:00,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:38:00" (3/3) ... [2024-01-26 12:38:00,463 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2024-01-26 12:38:00,470 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 12:38:00,477 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 12:38:00,477 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 12:38:00,477 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 12:38:00,545 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-26 12:38:00,583 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 12:38:00,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 12:38:00,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:38:00,588 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-01-26 12:38:00,590 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-01-26 12:38:00,612 INFO L103 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 12:38:00,618 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2024-01-26 12:38:00,618 WARN L169 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2024-01-26 12:38:00,619 WARN L170 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2024-01-26 12:38:00,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 12:38:00,628 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=LoopHeads, 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;@1f03a825, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 12:38:00,628 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-01-26 12:38:01,267 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:38:01,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:38:01,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1811752127, now seen corresponding path program 1 times [2024-01-26 12:38:01,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:38:01,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956166728] [2024-01-26 12:38:01,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:01,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:38:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:38:01,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:38:01,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956166728] [2024-01-26 12:38:01,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956166728] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 12:38:01,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 12:38:01,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 12:38:01,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378294985] [2024-01-26 12:38:01,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 12:38:01,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 12:38:01,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:38:01,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 12:38:01,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 12:38:01,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:01,594 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:38:01,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 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-01-26 12:38:01,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:01,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:01,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 12:38:01,808 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:38:01,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:38:01,810 INFO L85 PathProgramCache]: Analyzing trace with hash -91942350, now seen corresponding path program 1 times [2024-01-26 12:38:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:38:01,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621753227] [2024-01-26 12:38:01,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:38:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:38:02,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:38:02,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621753227] [2024-01-26 12:38:02,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621753227] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 12:38:02,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 12:38:02,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-26 12:38:02,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688786841] [2024-01-26 12:38:02,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 12:38:02,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-26 12:38:02,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:38:02,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-26 12:38:02,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-26 12:38:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:02,399 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:38:02,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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-01-26 12:38:02,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:02,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:02,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 12:38:02,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:38:02,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:38:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash 413118951, now seen corresponding path program 1 times [2024-01-26 12:38:02,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:38:02,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26386584] [2024-01-26 12:38:02,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:02,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:38:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:38:03,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:38:03,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26386584] [2024-01-26 12:38:03,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26386584] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 12:38:03,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 12:38:03,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-01-26 12:38:03,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343047225] [2024-01-26 12:38:03,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 12:38:03,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-26 12:38:03,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:38:03,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-26 12:38:03,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-01-26 12:38:03,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:03,165 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:38:03,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 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-01-26 12:38:03,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:03,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:03,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:03,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:03,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:03,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:03,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-26 12:38:03,464 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:38:03,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:38:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash -827457376, now seen corresponding path program 1 times [2024-01-26 12:38:03,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:38:03,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094300003] [2024-01-26 12:38:03,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:03,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:38:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 12:38:03,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:38:03,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094300003] [2024-01-26 12:38:03,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094300003] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:38:03,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575765492] [2024-01-26 12:38:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:03,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:38:03,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:38:03,707 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-01-26 12:38:03,741 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-01-26 12:38:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:03,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-26 12:38:03,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:38:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 12:38:04,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:38:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 12:38:04,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575765492] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-26 12:38:04,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-26 12:38:04,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2024-01-26 12:38:04,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704658362] [2024-01-26 12:38:04,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 12:38:04,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-26 12:38:04,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:38:04,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-26 12:38:04,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-01-26 12:38:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:04,205 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:38:04,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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-01-26 12:38:04,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:04,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:04,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:04,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:04,327 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-01-26 12:38:04,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:38:04,511 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:38:04,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:38:04,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1980166771, now seen corresponding path program 1 times [2024-01-26 12:38:04,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:38:04,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442942096] [2024-01-26 12:38:04,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:04,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:38:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:38:06,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:38:06,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442942096] [2024-01-26 12:38:06,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442942096] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:38:06,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991391454] [2024-01-26 12:38:06,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:06,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:38:06,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:38:06,217 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-01-26 12:38:06,242 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-01-26 12:38:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:06,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 57 conjunts are in the unsatisfiable core [2024-01-26 12:38:06,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:38:06,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-01-26 12:38:06,482 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-01-26 12:38:06,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-01-26 12:38:07,093 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-26 12:38:07,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-01-26 12:38:07,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-01-26 12:38:08,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-01-26 12:38:08,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-01-26 12:38:08,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-01-26 12:38:08,742 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 55 treesize of output 31 [2024-01-26 12:38:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:38:08,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:38:10,508 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~max2~0 1))) (let ((.cse5 (< c_~max3~0 .cse2)) (.cse14 (< c_~max2~0 c_~max3~0)) (.cse7 (+ c_~max1~0 1)) (.cse1 (+ c_~max3~0 1)) (.cse4 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse13 (= c_~max1~0 c_~max2~0))) (and (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse4))) (or (< .cse0 .cse1) (< .cse0 .cse2) (< c_~max1~0 (select .cse3 c_~A~0.offset)) (= c_~max1~0 .cse0))))) (or .cse5 (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse6 (select .cse8 c_~A~0.offset))) (or (= .cse6 c_~max3~0) (< .cse6 .cse7) (< c_~max3~0 (select .cse8 .cse4))))))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse9 (select .cse11 .cse4)) (.cse10 (select .cse11 c_~A~0.offset))) (or (< .cse9 .cse1) (< .cse9 .cse2) (= .cse10 .cse9) (< .cse10 .cse7))))) (or (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (or (< c_~max1~0 (select .cse12 c_~A~0.offset)) (< c_~max3~0 (select .cse12 .cse4))))) (and (or .cse13 .cse14) (or (= c_~max1~0 c_~max3~0) .cse5))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse16 (select .cse17 c_~A~0.offset)) (.cse15 (select .cse17 .cse4))) (or (< .cse15 .cse1) (= .cse16 c_~max2~0) (< .cse16 .cse7) (< c_~max2~0 .cse15))))) (or .cse14 (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse18 (select .cse19 c_~A~0.offset))) (or (= .cse18 c_~max2~0) (< .cse18 .cse7) (< c_~max3~0 (select .cse19 .cse4))))))) (or (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse4))) (or (< .cse20 .cse1) (< c_~max1~0 (select .cse21 c_~A~0.offset)) (< c_~max2~0 .cse20))))) .cse13)))) is different from false [2024-01-26 12:38:11,676 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~max2~0 1))) (let ((.cse12 (= c_~max1~0 c_~max2~0)) (.cse9 (< c_~max2~0 c_~max3~0)) (.cse3 (+ c_~max3~0 1)) (.cse6 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse4 (+ c_~max1~0 1)) (.cse14 (< c_~max3~0 .cse2))) (and (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse0 (select .cse5 .cse6)) (.cse1 (select .cse5 c_~A~0.offset))) (or (= .cse0 .cse1) (< .cse0 .cse2) (< .cse0 .cse3) (< .cse1 .cse4))))) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset))) (or (= c_~max2~0 .cse7) (< c_~max3~0 (select .cse8 .cse6)) (< .cse7 .cse4))))) .cse9) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse6))) (or (< c_~max2~0 .cse10) (< .cse10 .cse3) (< c_~max1~0 (select .cse11 c_~A~0.offset)))))) .cse12) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (or (< c_~max3~0 (select .cse13 .cse6)) (< c_~max1~0 (select .cse13 c_~A~0.offset))))) (and (or .cse12 .cse9) (or (= c_~max1~0 c_~max3~0) .cse14))) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse6)) (.cse16 (select .cse17 c_~A~0.offset))) (or (< c_~max2~0 .cse15) (= c_~max2~0 .cse16) (< .cse15 .cse3) (< .cse16 .cse4))))) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse6))) (or (= .cse18 c_~max1~0) (< .cse18 .cse2) (< .cse18 .cse3) (< c_~max1~0 (select .cse19 c_~A~0.offset)))))) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse20 (select .cse21 c_~A~0.offset))) (or (= .cse20 c_~max3~0) (< c_~max3~0 (select .cse21 .cse6)) (< .cse20 .cse4))))) .cse14)))) is different from false [2024-01-26 12:38:12,066 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~max2~0 1))) (let ((.cse12 (= c_~max1~0 c_~max2~0)) (.cse9 (< c_~max2~0 c_~max3~0)) (.cse3 (+ c_~max3~0 1)) (.cse6 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse4 (+ c_~max1~0 1)) (.cse14 (< c_~max3~0 .cse2))) (and (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse0 (select .cse5 .cse6)) (.cse1 (select .cse5 c_~A~0.offset))) (or (= .cse0 .cse1) (< .cse0 .cse2) (< .cse0 .cse3) (< .cse1 .cse4))))) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset))) (or (= c_~max2~0 .cse7) (< c_~max3~0 (select .cse8 .cse6)) (< .cse7 .cse4))))) .cse9) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse6))) (or (< c_~max2~0 .cse10) (< .cse10 .cse3) (< c_~max1~0 (select .cse11 c_~A~0.offset)))))) .cse12) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (or (< c_~max3~0 (select .cse13 .cse6)) (< c_~max1~0 (select .cse13 c_~A~0.offset))))) (and (or .cse12 .cse9) (or (= c_~max1~0 c_~max3~0) .cse14))) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse6)) (.cse16 (select .cse17 c_~A~0.offset))) (or (< c_~max2~0 .cse15) (= c_~max2~0 .cse16) (< .cse15 .cse3) (< .cse16 .cse4))))) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse6))) (or (= .cse18 c_~max1~0) (< .cse18 .cse2) (< .cse18 .cse3) (< c_~max1~0 (select .cse19 c_~A~0.offset)))))) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse20 (select .cse21 c_~A~0.offset))) (or (= .cse20 c_~max3~0) (< c_~max3~0 (select .cse21 .cse6)) (< .cse20 .cse4))))) .cse14)))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) is different from false [2024-01-26 12:38:12,167 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~max2~0 1))) (let ((.cse12 (= c_~max1~0 c_~max2~0)) (.cse9 (< c_~max2~0 c_~max3~0)) (.cse3 (+ c_~max3~0 1)) (.cse6 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse4 (+ c_~max1~0 1)) (.cse14 (< c_~max3~0 .cse2))) (and (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse0 (select .cse5 .cse6)) (.cse1 (select .cse5 c_~A~0.offset))) (or (= .cse0 .cse1) (< .cse0 .cse2) (< .cse0 .cse3) (< .cse1 .cse4))))) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset))) (or (= c_~max2~0 .cse7) (< c_~max3~0 (select .cse8 .cse6)) (< .cse7 .cse4))))) .cse9) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse6))) (or (< c_~max2~0 .cse10) (< .cse10 .cse3) (< c_~max1~0 (select .cse11 c_~A~0.offset)))))) .cse12) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (or (< c_~max3~0 (select .cse13 .cse6)) (< c_~max1~0 (select .cse13 c_~A~0.offset))))) (and (or .cse12 .cse9) (or (= c_~max1~0 c_~max3~0) .cse14))) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse6)) (.cse16 (select .cse17 c_~A~0.offset))) (or (< c_~max2~0 .cse15) (= c_~max2~0 .cse16) (< .cse15 .cse3) (< .cse16 .cse4))))) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse6))) (or (= .cse18 c_~max1~0) (< .cse18 .cse2) (< .cse18 .cse3) (< c_~max1~0 (select .cse19 c_~A~0.offset)))))) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse20 (select .cse21 c_~A~0.offset))) (or (= .cse20 c_~max3~0) (< c_~max3~0 (select .cse21 .cse6)) (< .cse20 .cse4))))) .cse14)))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2024-01-26 12:38:13,861 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (+ c_~max2~0 1))) (let ((.cse2 (< c_~max2~0 c_~max3~0)) (.cse3 (< c_~max3~0 .cse12)) (.cse1 (= c_~max1~0 c_~max2~0)) (.cse6 (+ c_~max1~0 1)) (.cse10 (+ c_~max3~0 1))) (and (or (forall ((~M~0 Int) (v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< c_~max3~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (< c_~max1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (and (or .cse1 .cse2) (or (= c_~max1~0 c_~max3~0) .cse3))) (or (forall ((~M~0 Int) (v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max3~0 (select .cse4 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (= .cse5 c_~max2~0) (< ~M~0 0) (< .cse5 .cse6) (< c_~N~0 (+ ~M~0 1)))))) .cse2) (or .cse3 (forall ((~M~0 Int) (v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max3~0 (select .cse7 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< ~M~0 0) (< .cse8 .cse6) (< c_~N~0 (+ ~M~0 1)) (= .cse8 c_~max3~0)))))) (forall ((~M~0 Int)) (or (< ~M~0 0) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse9 (select .cse13 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse9 .cse10) (< .cse11 .cse6) (< .cse9 .cse12) (= .cse11 .cse9))))) (< c_~N~0 (+ ~M~0 1)))) (or (forall ((~M~0 Int) (v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse14 (select .cse15 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse14 .cse10) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (< c_~max1~0 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max2~0 .cse14))))) .cse1) (forall ((~M~0 Int)) (or (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse18 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse16 (select .cse18 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse16 .cse10) (= .cse17 c_~max2~0) (< .cse17 .cse6) (< c_~max2~0 .cse16))))))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse19 (select .cse20 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse19 .cse10) (= c_~max1~0 .cse19) (< .cse19 .cse12) (< c_~max1~0 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1))))))) is different from false [2024-01-26 12:38:17,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:38:17,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 93 [2024-01-26 12:38:17,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:38:17,280 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 1189 treesize of output 1141 [2024-01-26 12:38:17,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:38:17,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 529 treesize of output 457 [2024-01-26 12:38:17,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:38:17,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 217 treesize of output 205 [2024-01-26 12:38:17,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:38:17,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 201 [2024-01-26 12:38:19,029 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:38:19,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 1 [2024-01-26 12:38:19,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:38:19,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2024-01-26 12:38:19,052 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-26 12:38:19,052 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 531 treesize of output 511 [2024-01-26 12:38:19,080 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-26 12:38:19,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 263 [2024-01-26 12:38:19,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 12:38:19,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 125 [2024-01-26 12:38:19,162 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-26 12:38:19,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 223 [2024-01-26 12:38:19,305 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:38:19,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2024-01-26 12:38:19,318 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:38:19,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 1 [2024-01-26 12:38:19,326 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:38:19,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 1 [2024-01-26 12:38:19,340 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 12:38:19,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2024-01-26 12:38:20,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2024-01-26 12:38:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:38:20,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991391454] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:38:20,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:38:20,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31, 28] total 75 [2024-01-26 12:38:20,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159322094] [2024-01-26 12:38:20,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:38:20,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-01-26 12:38:20,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:38:20,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-01-26 12:38:20,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=4055, Unknown=72, NotChecked=700, Total=5550 [2024-01-26 12:38:20,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:20,763 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:38:20,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.706666666666667) internal successors, (353), 75 states have internal predecessors, (353), 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-01-26 12:38:20,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:20,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:20,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:20,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:20,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:28,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:28,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:28,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:28,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-01-26 12:38:28,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-01-26 12:38:29,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:38:29,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:38:29,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:38:29,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1399724122, now seen corresponding path program 2 times [2024-01-26 12:38:29,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:38:29,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658501842] [2024-01-26 12:38:29,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:29,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:38:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 12:38:29,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:38:29,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658501842] [2024-01-26 12:38:29,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658501842] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:38:29,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896031717] [2024-01-26 12:38:29,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 12:38:29,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:38:29,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:38:29,346 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-01-26 12:38:29,348 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-01-26 12:38:29,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 12:38:29,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 12:38:29,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-26 12:38:29,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:38:29,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 12:38:29,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:38:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 12:38:29,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896031717] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:38:29,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:38:29,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-01-26 12:38:29,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251294692] [2024-01-26 12:38:29,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:38:29,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-01-26 12:38:29,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:38:29,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-01-26 12:38:29,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2024-01-26 12:38:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:29,964 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:38:29,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.833333333333333) internal successors, (188), 24 states have internal predecessors, (188), 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-01-26 12:38:29,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:29,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:29,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:29,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:29,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-01-26 12:38:29,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:30,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-01-26 12:38:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 12:38:30,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-01-26 12:38:30,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:38:30,563 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:38:30,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:38:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1713544953, now seen corresponding path program 3 times [2024-01-26 12:38:30,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:38:30,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942872332] [2024-01-26 12:38:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:38:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-26 12:38:30,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:38:30,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942872332] [2024-01-26 12:38:30,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942872332] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:38:30,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687224990] [2024-01-26 12:38:30,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 12:38:30,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:38:30,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:38:30,758 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-01-26 12:38:30,761 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-01-26 12:38:31,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-26 12:38:31,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 12:38:31,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-26 12:38:31,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:38:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-26 12:38:31,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:38:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-26 12:38:31,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687224990] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:38:31,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:38:31,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 22 [2024-01-26 12:38:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374632879] [2024-01-26 12:38:31,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:38:31,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-01-26 12:38:31,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:38:31,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-01-26 12:38:31,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-01-26 12:38:31,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:31,306 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:38:31,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 22 states have internal predecessors, (224), 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-01-26 12:38:31,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:31,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:31,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:31,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:31,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-01-26 12:38:31,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 12:38:31,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-01-26 12:38:32,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 12:38:32,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:38:32,990 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-01-26 12:38:33,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-01-26 12:38:33,171 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:38:33,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:38:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1608063660, now seen corresponding path program 1 times [2024-01-26 12:38:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:38:33,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64204826] [2024-01-26 12:38:33,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:38:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:38:35,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:38:35,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64204826] [2024-01-26 12:38:35,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64204826] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:38:35,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790234142] [2024-01-26 12:38:35,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:35,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:38:35,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:38:35,869 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-01-26 12:38:35,887 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-01-26 12:38:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:35,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 53 conjunts are in the unsatisfiable core [2024-01-26 12:38:35,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:38:38,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:38:38,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 74 [2024-01-26 12:38:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:38:38,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:38:42,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:38:42,377 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 527 treesize of output 263 [2024-01-26 12:38:45,646 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:38:45,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790234142] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:38:45,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:38:45,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 31, 27] total 76 [2024-01-26 12:38:45,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752192226] [2024-01-26 12:38:45,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:38:45,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-01-26 12:38:45,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:38:45,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-01-26 12:38:45,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=5050, Unknown=0, NotChecked=0, Total=5700 [2024-01-26 12:38:45,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:45,651 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:38:45,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 4.921052631578948) internal successors, (374), 76 states have internal predecessors, (374), 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-01-26 12:38:45,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:45,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:45,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:45,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:45,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-01-26 12:38:45,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 12:38:45,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:38:45,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-01-26 12:38:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 12:38:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:38:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-01-26 12:38:50,051 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-01-26 12:38:50,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:38:50,249 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:38:50,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:38:50,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1861242052, now seen corresponding path program 2 times [2024-01-26 12:38:50,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:38:50,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029876787] [2024-01-26 12:38:50,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:50,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:38:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:38:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-01-26 12:38:50,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:38:50,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029876787] [2024-01-26 12:38:50,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029876787] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:38:50,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311113707] [2024-01-26 12:38:50,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 12:38:50,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:38:50,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:38:50,633 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-01-26 12:38:50,636 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-01-26 12:38:50,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 12:38:50,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 12:38:50,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 16 conjunts are in the unsatisfiable core [2024-01-26 12:38:50,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:38:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-01-26 12:38:51,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:38:51,558 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-01-26 12:38:51,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311113707] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:38:51,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:38:51,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2024-01-26 12:38:51,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796692753] [2024-01-26 12:38:51,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:38:51,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-01-26 12:38:51,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:38:51,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-01-26 12:38:51,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2024-01-26 12:38:51,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:51,562 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:38:51,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.078947368421052) internal successors, (231), 38 states have internal predecessors, (231), 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-01-26 12:38:51,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:51,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:51,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:51,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:51,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-01-26 12:38:51,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 12:38:51,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:38:51,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-01-26 12:38:51,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:38:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:38:53,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:38:53,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-01-26 12:38:53,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 12:38:53,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:38:53,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-01-26 12:38:53,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-01-26 12:38:53,288 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-01-26 12:38:53,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-01-26 12:38:53,486 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:38:53,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:38:53,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1610044353, now seen corresponding path program 3 times [2024-01-26 12:38:53,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:38:53,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736036698] [2024-01-26 12:38:53,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:38:53,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:38:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:39:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:39:01,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:39:01,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736036698] [2024-01-26 12:39:01,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736036698] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:39:01,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61147516] [2024-01-26 12:39:01,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 12:39:01,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:39:01,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:39:01,263 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-01-26 12:39:01,263 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-01-26 12:39:01,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-01-26 12:39:01,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 12:39:01,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 61 conjunts are in the unsatisfiable core [2024-01-26 12:39:01,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:39:10,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 12:39:10,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:10,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 506 treesize of output 230 [2024-01-26 12:39:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-26 12:39:17,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:39:30,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:39:30,294 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 809 treesize of output 328 [2024-01-26 12:39:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-26 12:39:35,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61147516] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:39:35,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:39:35,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 41, 34] total 111 [2024-01-26 12:39:35,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802870785] [2024-01-26 12:39:35,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:39:35,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2024-01-26 12:39:35,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:39:35,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2024-01-26 12:39:35,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=11450, Unknown=0, NotChecked=0, Total=12210 [2024-01-26 12:39:35,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:39:35,218 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:39:35,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 3.981981981981982) internal successors, (442), 111 states have internal predecessors, (442), 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-01-26 12:39:35,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:39:35,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:39:35,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:39:35,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:39:35,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-01-26 12:39:35,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 12:39:35,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:39:35,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-01-26 12:39:35,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-01-26 12:39:35,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:40:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:40:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:40:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:40:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:40:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-01-26 12:40:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 12:40:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:40:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-01-26 12:40:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-01-26 12:40:14,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2024-01-26 12:40:14,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-01-26 12:40:15,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:40:15,066 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:40:15,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:40:15,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1373807509, now seen corresponding path program 4 times [2024-01-26 12:40:15,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:40:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965486640] [2024-01-26 12:40:15,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:40:15,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:40:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:40:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-01-26 12:40:15,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:40:15,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965486640] [2024-01-26 12:40:15,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965486640] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:40:15,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084131897] [2024-01-26 12:40:15,526 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-26 12:40:15,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:40:15,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:40:15,527 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-01-26 12:40:15,549 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-01-26 12:40:15,644 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-26 12:40:15,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 12:40:15,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 20 conjunts are in the unsatisfiable core [2024-01-26 12:40:15,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:40:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 27 proven. 33 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-01-26 12:40:16,060 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 12:40:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 52 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-01-26 12:40:16,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084131897] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 12:40:16,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 12:40:16,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 48 [2024-01-26 12:40:16,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406851592] [2024-01-26 12:40:16,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 12:40:16,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-01-26 12:40:16,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 12:40:16,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-01-26 12:40:16,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2024-01-26 12:40:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:40:16,363 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 12:40:16,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 5.520833333333333) internal successors, (265), 48 states have internal predecessors, (265), 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-01-26 12:40:16,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:40:16,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:40:16,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:40:16,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:40:16,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-01-26 12:40:16,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 12:40:16,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:40:16,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-01-26 12:40:16,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-01-26 12:40:16,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2024-01-26 12:40:16,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:40:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 12:40:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:40:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 12:40:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 12:40:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-01-26 12:40:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 12:40:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-01-26 12:40:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-01-26 12:40:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-01-26 12:40:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2024-01-26 12:40:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-01-26 12:40:18,385 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-01-26 12:40:18,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:40:18,584 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 12:40:18,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 12:40:18,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1251275898, now seen corresponding path program 5 times [2024-01-26 12:40:18,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 12:40:18,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21859574] [2024-01-26 12:40:18,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 12:40:18,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 12:40:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 12:40:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 5 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:40:28,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 12:40:28,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21859574] [2024-01-26 12:40:28,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21859574] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 12:40:28,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961376203] [2024-01-26 12:40:28,262 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-26 12:40:28,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 12:40:28,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 12:40:28,263 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-01-26 12:40:28,264 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-01-26 12:40:28,379 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-01-26 12:40:28,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 12:40:28,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 76 conjunts are in the unsatisfiable core [2024-01-26 12:40:28,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 12:40:41,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 12:40:41,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 600 treesize of output 268 [2024-01-26 12:40:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 12:40:42,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2024-01-26 12:52:07,764 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 12:52:07,764 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-01-26 12:52:07,764 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-01-26 12:52:08,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-01-26 12:52:08,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-01-26 12:52:08,805 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-01-26 12:52:08,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-26 12:52:08,805 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 54 more [2024-01-26 12:52:08,809 INFO L158 Benchmark]: Toolchain (without parser) took 849157.05ms. Allocated memory was 438.3MB in the beginning and 2.5GB in the end (delta: 2.0GB). Free memory was 385.8MB in the beginning and 2.1GB in the end (delta: -1.7GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2024-01-26 12:52:08,809 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 219.2MB. Free memory was 167.5MB in the beginning and 167.3MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 12:52:08,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.22ms. Allocated memory is still 438.3MB. Free memory was 385.6MB in the beginning and 373.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-01-26 12:52:08,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.56ms. Allocated memory is still 438.3MB. Free memory was 373.2MB in the beginning and 371.4MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-01-26 12:52:08,810 INFO L158 Benchmark]: Boogie Preprocessor took 26.17ms. Allocated memory is still 438.3MB. Free memory was 371.4MB in the beginning and 369.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 12:52:08,810 INFO L158 Benchmark]: RCFGBuilder took 495.10ms. Allocated memory is still 438.3MB. Free memory was 369.9MB in the beginning and 399.1MB in the end (delta: -29.2MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. [2024-01-26 12:52:08,810 INFO L158 Benchmark]: TraceAbstraction took 848351.92ms. Allocated memory was 438.3MB in the beginning and 2.5GB in the end (delta: 2.0GB). Free memory was 398.5MB in the beginning and 2.1GB in the end (delta: -1.7GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2024-01-26 12:52:08,811 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 219.2MB. Free memory was 167.5MB in the beginning and 167.3MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.22ms. Allocated memory is still 438.3MB. Free memory was 385.6MB in the beginning and 373.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.56ms. Allocated memory is still 438.3MB. Free memory was 373.2MB in the beginning and 371.4MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.17ms. Allocated memory is still 438.3MB. Free memory was 371.4MB in the beginning and 369.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 495.10ms. Allocated memory is still 438.3MB. Free memory was 369.9MB in the beginning and 399.1MB in the end (delta: -29.2MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. * TraceAbstraction took 848351.92ms. Allocated memory was 438.3MB in the beginning and 2.5GB in the end (delta: 2.0GB). Free memory was 398.5MB in the beginning and 2.1GB in the end (delta: -1.7GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown