/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:17:23,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:17:23,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:17:23,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:17:23,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:17:23,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:17:23,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:17:23,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:17:23,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:17:23,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:17:23,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:17:23,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:17:23,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:17:23,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:17:23,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:17:23,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:17:23,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:17:23,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:17:23,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:17:23,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:17:23,727 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:17:23,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:17:23,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:17:23,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:17:23,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:17:23,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:17:23,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:17:23,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:17:23,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:17:23,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:17:23,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:17:23,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:17:23,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:17:23,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:17:23,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:17:23,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:17:23,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:17:23,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:17:23,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:17:23,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:17:23,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:17:23,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:17:23,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:17:23,751 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:17:23,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:17:23,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:17:23,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:17:23,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:17:23,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:17:23,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:17:23,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:17:23,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:17:23,754 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:17:23,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:17:23,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:17:23,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:17:23,754 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:17:23,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:17:23,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:17:23,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:17:23,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:17:23,754 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:17:23,755 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:17:23,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:17:23,755 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:17:23,755 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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/UAutomizer-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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 11:17:23,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:17:23,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:17:23,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:17:23,942 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:17:23,944 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:17:23,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound20.c [2022-04-28 11:17:23,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eefe89cf/e0882185e31b4a25a0ab2529b23b37ec/FLAGba2ff3fc1 [2022-04-28 11:17:24,363 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:17:24,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound20.c [2022-04-28 11:17:24,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eefe89cf/e0882185e31b4a25a0ab2529b23b37ec/FLAGba2ff3fc1 [2022-04-28 11:17:24,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eefe89cf/e0882185e31b4a25a0ab2529b23b37ec [2022-04-28 11:17:24,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:17:24,387 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:17:24,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:17:24,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:17:24,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:17:24,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:17:24" (1/1) ... [2022-04-28 11:17:24,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5cea3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:17:24, skipping insertion in model container [2022-04-28 11:17:24,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:17:24" (1/1) ... [2022-04-28 11:17:24,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:17:24,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:17:24,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound20.c[588,601] [2022-04-28 11:17:24,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:17:24,614 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:17:24,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound20.c[588,601] [2022-04-28 11:17:24,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:17:24,653 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:17:24,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:17:24 WrapperNode [2022-04-28 11:17:24,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:17:24,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:17:24,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:17:24,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:17:24,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:17:24" (1/1) ... [2022-04-28 11:17:24,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:17:24" (1/1) ... [2022-04-28 11:17:24,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:17:24" (1/1) ... [2022-04-28 11:17:24,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:17:24" (1/1) ... [2022-04-28 11:17:24,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:17:24" (1/1) ... [2022-04-28 11:17:24,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:17:24" (1/1) ... [2022-04-28 11:17:24,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:17:24" (1/1) ... [2022-04-28 11:17:24,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:17:24,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:17:24,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:17:24,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:17:24,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:17:24" (1/1) ... [2022-04-28 11:17:24,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:17:24,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:24,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 11:17:24,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 11:17:24,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:17:24,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:17:24,763 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:17:24,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:17:24,764 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:17:24,764 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:17:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:17:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:17:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:17:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:17:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 11:17:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:17:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:17:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:17:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:17:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:17:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:17:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:17:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:17:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:17:24,807 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:17:24,808 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:17:24,916 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:17:24,921 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:17:24,921 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 11:17:24,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:17:24 BoogieIcfgContainer [2022-04-28 11:17:24,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:17:24,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:17:24,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:17:24,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:17:24,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:17:24" (1/3) ... [2022-04-28 11:17:24,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3933e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:17:24, skipping insertion in model container [2022-04-28 11:17:24,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:17:24" (2/3) ... [2022-04-28 11:17:24,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3933e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:17:24, skipping insertion in model container [2022-04-28 11:17:24,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:17:24" (3/3) ... [2022-04-28 11:17:24,928 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound20.c [2022-04-28 11:17:24,977 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:17:24,977 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:17:25,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:17:25,039 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@439cfb20, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@737174ca [2022-04-28 11:17:25,039 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:17:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:17:25,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:17:25,057 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:25,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:25,057 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:25,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:25,061 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 1 times [2022-04-28 11:17:25,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:25,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1988097941] [2022-04-28 11:17:25,095 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:17:25,096 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 2 times [2022-04-28 11:17:25,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:25,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913626500] [2022-04-28 11:17:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:25,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:25,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:17:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:25,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-28 11:17:25,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 11:17:25,295 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 11:17:25,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:17:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:25,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 11:17:25,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 11:17:25,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 11:17:25,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 11:17:25,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:17:25,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-28 11:17:25,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 11:17:25,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 11:17:25,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2022-04-28 11:17:25,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {39#true} is VALID [2022-04-28 11:17:25,312 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {39#true} is VALID [2022-04-28 11:17:25,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 11:17:25,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 11:17:25,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 11:17:25,313 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 11:17:25,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {40#false} is VALID [2022-04-28 11:17:25,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-04-28 11:17:25,314 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {40#false} is VALID [2022-04-28 11:17:25,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-28 11:17:25,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-28 11:17:25,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-28 11:17:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:17:25,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:25,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913626500] [2022-04-28 11:17:25,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913626500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:25,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:25,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:17:25,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:25,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1988097941] [2022-04-28 11:17:25,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1988097941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:25,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:25,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:17:25,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140659491] [2022-04-28 11:17:25,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:25,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:17:25,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:25,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:17:25,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:25,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:17:25,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:25,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:17:25,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:17:25,377 INFO L87 Difference]: Start difference. First operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:17:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:25,546 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-04-28 11:17:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:17:25,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:17:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:17:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:17:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:17:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:17:25,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 11:17:25,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:25,674 INFO L225 Difference]: With dead ends: 63 [2022-04-28 11:17:25,674 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 11:17:25,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:17:25,680 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:25,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:17:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 11:17:25,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 11:17:25,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:25,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:17:25,705 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:17:25,706 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:17:25,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:25,715 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 11:17:25,715 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:17:25,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:25,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:25,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-28 11:17:25,717 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-28 11:17:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:25,722 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 11:17:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:17:25,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:25,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:25,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:25,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:17:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-04-28 11:17:25,734 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2022-04-28 11:17:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:25,734 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-04-28 11:17:25,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:17:25,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 41 transitions. [2022-04-28 11:17:25,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:17:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:17:25,779 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:25,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:25,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:17:25,779 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:25,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:25,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 1 times [2022-04-28 11:17:25,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:25,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1327857617] [2022-04-28 11:17:25,784 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:17:25,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 2 times [2022-04-28 11:17:25,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:25,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162767931] [2022-04-28 11:17:25,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:25,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:25,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:17:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:25,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-04-28 11:17:25,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:17:25,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 11:17:25,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:17:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:25,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 11:17:25,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 11:17:25,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:17:25,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 11:17:25,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:17:25,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-04-28 11:17:25,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:17:25,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 11:17:25,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-28 11:17:25,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {301#true} is VALID [2022-04-28 11:17:25,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {301#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {301#true} is VALID [2022-04-28 11:17:25,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 11:17:25,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 11:17:25,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:17:25,953 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 11:17:25,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:17:25,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !false; {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:17:25,956 INFO L272 TraceCheckUtils]: 13: Hoare triple {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {311#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:25,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {311#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {312#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:17:25,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {302#false} is VALID [2022-04-28 11:17:25,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-28 11:17:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:17:25,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:25,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162767931] [2022-04-28 11:17:25,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162767931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:25,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:25,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:17:25,957 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:25,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1327857617] [2022-04-28 11:17:25,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1327857617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:25,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:25,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:17:25,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984574193] [2022-04-28 11:17:25,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:25,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:17:25,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:25,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:17:25,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:25,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:17:25,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:25,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:17:25,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:17:25,977 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:17:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:26,371 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-28 11:17:26,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:17:26,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:17:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:17:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 11:17:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:17:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 11:17:26,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-28 11:17:26,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:26,420 INFO L225 Difference]: With dead ends: 37 [2022-04-28 11:17:26,420 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:17:26,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:17:26,421 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:26,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:17:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:17:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 11:17:26,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:26,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:17:26,427 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:17:26,427 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:17:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:26,429 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:17:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:17:26,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:26,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:26,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-28 11:17:26,430 INFO L87 Difference]: Start difference. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-28 11:17:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:26,431 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:17:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:17:26,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:26,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:26,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:26,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:17:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 11:17:26,434 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-04-28 11:17:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:26,434 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 11:17:26,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:17:26,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 11:17:26,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:17:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 11:17:26,475 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:26,475 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:26,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 11:17:26,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:26,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:26,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 1 times [2022-04-28 11:17:26,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:26,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1479353493] [2022-04-28 11:17:26,476 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:17:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 2 times [2022-04-28 11:17:26,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:26,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396667310] [2022-04-28 11:17:26,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:26,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:26,485 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:26,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1639444793] [2022-04-28 11:17:26,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:17:26,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:26,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:26,486 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:26,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 11:17:26,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:17:26,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:26,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:17:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:26,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:26,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-28 11:17:26,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {538#true} is VALID [2022-04-28 11:17:26,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:17:26,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #84#return; {538#true} is VALID [2022-04-28 11:17:26,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-28 11:17:26,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {538#true} is VALID [2022-04-28 11:17:26,630 INFO L272 TraceCheckUtils]: 6: Hoare triple {538#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {538#true} is VALID [2022-04-28 11:17:26,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 11:17:26,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 11:17:26,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:17:26,630 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {538#true} {538#true} #60#return; {538#true} is VALID [2022-04-28 11:17:26,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:17:26,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:17:26,631 INFO L272 TraceCheckUtils]: 13: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {538#true} is VALID [2022-04-28 11:17:26,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 11:17:26,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 11:17:26,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:17:26,632 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {538#true} {576#(and (= main_~n~0 0) (= main_~y~0 1))} #62#return; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:17:26,632 INFO L272 TraceCheckUtils]: 18: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:26,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:26,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-28 11:17:26,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-28 11:17:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:17:26,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:17:26,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:26,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396667310] [2022-04-28 11:17:26,634 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:26,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639444793] [2022-04-28 11:17:26,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639444793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:26,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:26,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:17:26,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:26,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1479353493] [2022-04-28 11:17:26,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1479353493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:26,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:26,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:17:26,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064843584] [2022-04-28 11:17:26,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:26,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 11:17:26,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:26,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:17:26,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:26,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:17:26,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:26,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:17:26,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:17:26,649 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:17:26,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:26,867 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 11:17:26,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:17:26,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 11:17:26,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:26,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:17:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:17:26,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:17:26,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:17:26,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:17:26,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:26,926 INFO L225 Difference]: With dead ends: 54 [2022-04-28 11:17:26,926 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 11:17:26,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:17:26,927 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:26,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:17:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 11:17:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-28 11:17:26,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:26,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:17:26,938 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:17:26,938 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:17:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:26,940 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:17:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:17:26,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:26,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:26,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-28 11:17:26,942 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-28 11:17:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:26,944 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:17:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:17:26,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:26,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:26,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:26,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:17:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-28 11:17:26,946 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2022-04-28 11:17:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:26,946 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-28 11:17:26,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:17:26,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 52 transitions. [2022-04-28 11:17:26,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-28 11:17:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 11:17:26,994 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:26,994 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:27,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 11:17:27,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:27,199 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:27,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:27,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 1 times [2022-04-28 11:17:27,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:27,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1953291555] [2022-04-28 11:17:27,200 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:17:27,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 2 times [2022-04-28 11:17:27,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:27,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425346876] [2022-04-28 11:17:27,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:27,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:27,211 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:27,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [770980881] [2022-04-28 11:17:27,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:17:27,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:27,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:27,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:27,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 11:17:27,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:17:27,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:27,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:17:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:27,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:27,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {906#true} is VALID [2022-04-28 11:17:27,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {906#true} is VALID [2022-04-28 11:17:27,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:17:27,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #84#return; {906#true} is VALID [2022-04-28 11:17:27,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret5 := main(); {906#true} is VALID [2022-04-28 11:17:27,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {906#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {906#true} is VALID [2022-04-28 11:17:27,335 INFO L272 TraceCheckUtils]: 6: Hoare triple {906#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {906#true} is VALID [2022-04-28 11:17:27,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:17:27,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:17:27,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:17:27,336 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {906#true} {906#true} #60#return; {906#true} is VALID [2022-04-28 11:17:27,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {906#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:17:27,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} assume !false; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:17:27,337 INFO L272 TraceCheckUtils]: 13: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {906#true} is VALID [2022-04-28 11:17:27,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:17:27,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:17:27,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:17:27,338 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {906#true} {944#(and (= main_~x~0 0) (= main_~n~0 0))} #62#return; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:17:27,338 INFO L272 TraceCheckUtils]: 18: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {906#true} is VALID [2022-04-28 11:17:27,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:17:27,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:17:27,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:17:27,339 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {906#true} {944#(and (= main_~x~0 0) (= main_~n~0 0))} #64#return; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:17:27,339 INFO L272 TraceCheckUtils]: 23: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {981#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:27,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {981#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {985#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:27,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {985#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {907#false} is VALID [2022-04-28 11:17:27,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-28 11:17:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:17:27,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:17:27,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:27,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425346876] [2022-04-28 11:17:27,340 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:27,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770980881] [2022-04-28 11:17:27,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770980881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:27,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:27,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:17:27,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:27,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1953291555] [2022-04-28 11:17:27,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1953291555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:27,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:27,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:17:27,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160228379] [2022-04-28 11:17:27,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:27,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 11:17:27,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:27,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:17:27,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:27,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:17:27,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:27,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:17:27,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:17:27,358 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:17:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:27,675 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-28 11:17:27,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:17:27,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 11:17:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:17:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:17:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:17:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:17:27,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:17:27,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:27,746 INFO L225 Difference]: With dead ends: 58 [2022-04-28 11:17:27,746 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 11:17:27,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:17:27,747 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:27,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:17:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 11:17:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-28 11:17:27,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:27,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:17:27,761 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:17:27,761 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:17:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:27,763 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 11:17:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 11:17:27,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:27,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:27,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-28 11:17:27,764 INFO L87 Difference]: Start difference. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-28 11:17:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:27,766 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 11:17:27,766 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 11:17:27,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:27,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:27,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:27,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:17:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-28 11:17:27,768 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 27 [2022-04-28 11:17:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:27,768 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-28 11:17:27,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:17:27,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 67 transitions. [2022-04-28 11:17:27,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-28 11:17:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 11:17:27,844 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:27,844 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:27,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 11:17:28,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 11:17:28,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:28,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:28,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 1 times [2022-04-28 11:17:28,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:28,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1067253166] [2022-04-28 11:17:28,065 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:17:28,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 2 times [2022-04-28 11:17:28,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:28,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271685591] [2022-04-28 11:17:28,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:28,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:28,087 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:28,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1032490619] [2022-04-28 11:17:28,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:17:28,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:28,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:28,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:28,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 11:17:28,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:17:28,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:28,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:17:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:28,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:28,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2022-04-28 11:17:28,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {1325#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1325#true} is VALID [2022-04-28 11:17:28,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:17:28,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #84#return; {1325#true} is VALID [2022-04-28 11:17:28,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret5 := main(); {1325#true} is VALID [2022-04-28 11:17:28,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {1325#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {1325#true} is VALID [2022-04-28 11:17:28,299 INFO L272 TraceCheckUtils]: 6: Hoare triple {1325#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {1325#true} is VALID [2022-04-28 11:17:28,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:17:28,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:17:28,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:17:28,300 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1325#true} {1325#true} #60#return; {1325#true} is VALID [2022-04-28 11:17:28,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {1325#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:28,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:28,301 INFO L272 TraceCheckUtils]: 13: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1325#true} is VALID [2022-04-28 11:17:28,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:17:28,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:17:28,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:17:28,303 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:28,303 INFO L272 TraceCheckUtils]: 18: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1325#true} is VALID [2022-04-28 11:17:28,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:17:28,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:17:28,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:17:28,311 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:28,313 INFO L272 TraceCheckUtils]: 23: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1325#true} is VALID [2022-04-28 11:17:28,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:17:28,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:17:28,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:17:28,315 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:28,315 INFO L272 TraceCheckUtils]: 28: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:28,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:28,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {1419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1326#false} is VALID [2022-04-28 11:17:28,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2022-04-28 11:17:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 11:17:28,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:17:28,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:28,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271685591] [2022-04-28 11:17:28,317 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:28,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032490619] [2022-04-28 11:17:28,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032490619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:28,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:28,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:17:28,318 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:28,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1067253166] [2022-04-28 11:17:28,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1067253166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:28,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:28,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:17:28,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076821585] [2022-04-28 11:17:28,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:28,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 11:17:28,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:28,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:17:28,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:28,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:17:28,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:28,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:17:28,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:17:28,338 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:17:28,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:28,674 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-04-28 11:17:28,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:17:28,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 11:17:28,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:17:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:17:28,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:17:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:17:28,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:17:28,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:28,715 INFO L225 Difference]: With dead ends: 66 [2022-04-28 11:17:28,715 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 11:17:28,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:17:28,717 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:28,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 135 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:17:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 11:17:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 11:17:28,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:28,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:17:28,740 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:17:28,740 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:17:28,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:28,743 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 11:17:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:17:28,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:28,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:28,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-28 11:17:28,743 INFO L87 Difference]: Start difference. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-28 11:17:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:28,745 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 11:17:28,745 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:17:28,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:28,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:28,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:28,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:17:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-28 11:17:28,747 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-28 11:17:28,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:28,747 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-28 11:17:28,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:17:28,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 65 transitions. [2022-04-28 11:17:28,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:17:28,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 11:17:28,816 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:28,817 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:28,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 11:17:29,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:29,033 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:29,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:29,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 1 times [2022-04-28 11:17:29,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:29,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1398812834] [2022-04-28 11:17:29,356 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:29,356 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:29,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 2 times [2022-04-28 11:17:29,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:29,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587026951] [2022-04-28 11:17:29,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:29,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:29,364 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:29,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281367760] [2022-04-28 11:17:29,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:17:29,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:29,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:29,366 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:29,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 11:17:29,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:17:29,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:29,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:17:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:29,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:29,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 11:17:29,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1775#true} is VALID [2022-04-28 11:17:29,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-28 11:17:29,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-28 11:17:29,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {1775#true} is VALID [2022-04-28 11:17:29,589 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:17:29,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:17:29,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:17:29,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,589 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-28 11:17:29,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:29,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:29,590 INFO L272 TraceCheckUtils]: 13: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:17:29,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:17:29,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:17:29,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,591 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:29,591 INFO L272 TraceCheckUtils]: 18: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1775#true} is VALID [2022-04-28 11:17:29,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:17:29,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:17:29,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,592 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:29,592 INFO L272 TraceCheckUtils]: 23: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:17:29,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:17:29,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:17:29,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,592 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:29,592 INFO L272 TraceCheckUtils]: 28: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:17:29,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:17:29,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:17:29,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,593 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:29,593 INFO L272 TraceCheckUtils]: 33: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1775#true} is VALID [2022-04-28 11:17:29,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:17:29,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:17:29,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,594 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:29,594 INFO L290 TraceCheckUtils]: 38: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:17:29,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} assume !false; {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:17:29,595 INFO L272 TraceCheckUtils]: 40: Hoare triple {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:17:29,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:17:29,595 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:17:29,595 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,596 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1775#true} {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} #62#return; {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:17:29,596 INFO L272 TraceCheckUtils]: 45: Hoare triple {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:29,596 INFO L290 TraceCheckUtils]: 46: Hoare triple {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:29,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {1921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 11:17:29,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 11:17:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:17:29,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:29,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 11:17:29,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {1921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 11:17:29,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:29,764 INFO L272 TraceCheckUtils]: 45: Hoare triple {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:29,765 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1775#true} {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:17:29,765 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:17:29,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:17:29,765 INFO L272 TraceCheckUtils]: 40: Hoare triple {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:17:29,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:17:29,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:17:29,769 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #70#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:17:29,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:17:29,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:17:29,769 INFO L272 TraceCheckUtils]: 33: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1775#true} is VALID [2022-04-28 11:17:29,775 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #68#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:17:29,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:17:29,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:17:29,776 INFO L272 TraceCheckUtils]: 28: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:17:29,795 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #66#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:17:29,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:17:29,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:17:29,796 INFO L272 TraceCheckUtils]: 23: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:17:29,796 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #64#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:17:29,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:17:29,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:17:29,796 INFO L272 TraceCheckUtils]: 18: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1775#true} is VALID [2022-04-28 11:17:29,798 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #62#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:17:29,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:17:29,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:17:29,798 INFO L272 TraceCheckUtils]: 13: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:17:29,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !false; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:17:29,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:17:29,799 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-28 11:17:29,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:17:29,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:17:29,799 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:17:29,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {1775#true} is VALID [2022-04-28 11:17:29,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-28 11:17:29,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-28 11:17:29,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:17:29,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1775#true} is VALID [2022-04-28 11:17:29,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 11:17:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:17:29,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:29,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587026951] [2022-04-28 11:17:29,802 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:29,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281367760] [2022-04-28 11:17:29,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281367760] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:17:29,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:17:29,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:17:29,803 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:29,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1398812834] [2022-04-28 11:17:29,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1398812834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:29,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:29,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:17:29,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480725963] [2022-04-28 11:17:29,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:29,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 49 [2022-04-28 11:17:29,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:29,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:17:29,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:29,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:17:29,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:29,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:17:29,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:17:29,832 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:17:30,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:30,154 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 11:17:30,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:17:30,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 49 [2022-04-28 11:17:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:17:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:17:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:17:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:17:30,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:17:30,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:30,222 INFO L225 Difference]: With dead ends: 81 [2022-04-28 11:17:30,222 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 11:17:30,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:17:30,223 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:30,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 180 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:17:30,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 11:17:30,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-04-28 11:17:30,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:30,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:17:30,251 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:17:30,251 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:17:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:30,253 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 11:17:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 11:17:30,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:30,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:30,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-28 11:17:30,254 INFO L87 Difference]: Start difference. First operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-28 11:17:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:30,256 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 11:17:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 11:17:30,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:30,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:30,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:30,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:17:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-04-28 11:17:30,258 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 49 [2022-04-28 11:17:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:30,259 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-04-28 11:17:30,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:17:30,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 79 transitions. [2022-04-28 11:17:30,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-28 11:17:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 11:17:30,335 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:30,335 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:30,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 11:17:30,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:30,547 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 3 times [2022-04-28 11:17:30,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:30,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197779559] [2022-04-28 11:17:30,897 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:30,897 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:30,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 4 times [2022-04-28 11:17:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:30,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767148660] [2022-04-28 11:17:30,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:30,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:30,915 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:30,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [706939933] [2022-04-28 11:17:30,916 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:17:30,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:30,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:30,917 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:30,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 11:17:30,955 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:17:30,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:30,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 11:17:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:30,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:31,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2022-04-28 11:17:31,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2536#true} is VALID [2022-04-28 11:17:31,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #84#return; {2536#true} is VALID [2022-04-28 11:17:31,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2022-04-28 11:17:31,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {2536#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {2536#true} is VALID [2022-04-28 11:17:31,173 INFO L272 TraceCheckUtils]: 6: Hoare triple {2536#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,174 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2536#true} {2536#true} #60#return; {2536#true} is VALID [2022-04-28 11:17:31,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {2536#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:17:31,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !false; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:17:31,175 INFO L272 TraceCheckUtils]: 13: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,180 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #62#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:17:31,180 INFO L272 TraceCheckUtils]: 18: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,182 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #64#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:17:31,182 INFO L272 TraceCheckUtils]: 23: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,199 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #66#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:17:31,200 INFO L272 TraceCheckUtils]: 28: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,200 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #68#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:17:31,201 INFO L272 TraceCheckUtils]: 33: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,201 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,201 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #70#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:17:31,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:17:31,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} assume !false; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:17:31,202 INFO L272 TraceCheckUtils]: 40: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,203 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2536#true} {2656#(and (= main_~x~0 1) (= main_~n~0 1))} #62#return; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:17:31,203 INFO L272 TraceCheckUtils]: 45: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,203 INFO L290 TraceCheckUtils]: 46: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,203 INFO L290 TraceCheckUtils]: 47: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,204 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2536#true} {2656#(and (= main_~x~0 1) (= main_~n~0 1))} #64#return; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:17:31,204 INFO L272 TraceCheckUtils]: 50: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:31,205 INFO L290 TraceCheckUtils]: 51: Hoare triple {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:31,205 INFO L290 TraceCheckUtils]: 52: Hoare triple {2697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2537#false} is VALID [2022-04-28 11:17:31,205 INFO L290 TraceCheckUtils]: 53: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-04-28 11:17:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 11:17:31,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:31,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-04-28 11:17:31,417 INFO L290 TraceCheckUtils]: 52: Hoare triple {2697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2537#false} is VALID [2022-04-28 11:17:31,418 INFO L290 TraceCheckUtils]: 51: Hoare triple {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:31,418 INFO L272 TraceCheckUtils]: 50: Hoare triple {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:31,418 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2536#true} {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:17:31,418 INFO L290 TraceCheckUtils]: 48: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,419 INFO L272 TraceCheckUtils]: 45: Hoare triple {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,419 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2536#true} {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:17:31,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,419 INFO L272 TraceCheckUtils]: 40: Hoare triple {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:17:31,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:17:31,422 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:31,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,422 INFO L272 TraceCheckUtils]: 33: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,423 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:31,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,424 INFO L272 TraceCheckUtils]: 28: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,424 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:31,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,425 INFO L272 TraceCheckUtils]: 23: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,425 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:31,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,426 INFO L272 TraceCheckUtils]: 18: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,426 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:31,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,426 INFO L272 TraceCheckUtils]: 13: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:31,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {2536#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:31,427 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2536#true} {2536#true} #60#return; {2536#true} is VALID [2022-04-28 11:17:31,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:17:31,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:17:31,427 INFO L272 TraceCheckUtils]: 6: Hoare triple {2536#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:17:31,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {2536#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {2536#true} is VALID [2022-04-28 11:17:31,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2022-04-28 11:17:31,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #84#return; {2536#true} is VALID [2022-04-28 11:17:31,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:17:31,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2536#true} is VALID [2022-04-28 11:17:31,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2022-04-28 11:17:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 11:17:31,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:31,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767148660] [2022-04-28 11:17:31,428 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:31,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706939933] [2022-04-28 11:17:31,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706939933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:17:31,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:17:31,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:17:31,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:31,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197779559] [2022-04-28 11:17:31,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197779559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:31,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:31,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:17:31,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049872612] [2022-04-28 11:17:31,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:31,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-28 11:17:31,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:31,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:17:31,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:31,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:17:31,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:31,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:17:31,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:17:31,459 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:17:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:31,806 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-28 11:17:31,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:17:31,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-28 11:17:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:17:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:17:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:17:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:17:31,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:17:31,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:31,876 INFO L225 Difference]: With dead ends: 85 [2022-04-28 11:17:31,876 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 11:17:31,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:17:31,877 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:31,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 196 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:17:31,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 11:17:31,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2022-04-28 11:17:31,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:31,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:17:31,930 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:17:31,930 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:17:31,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:31,932 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-04-28 11:17:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-04-28 11:17:31,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:31,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:31,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-28 11:17:31,933 INFO L87 Difference]: Start difference. First operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-28 11:17:31,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:31,936 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-04-28 11:17:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-04-28 11:17:31,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:31,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:31,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:31,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:17:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-04-28 11:17:31,939 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 54 [2022-04-28 11:17:31,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:31,939 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-04-28 11:17:31,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:17:31,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 84 transitions. [2022-04-28 11:17:32,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-04-28 11:17:32,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 11:17:32,013 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:32,013 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:32,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 11:17:32,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:32,228 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:32,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:32,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 5 times [2022-04-28 11:17:32,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:32,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1802621389] [2022-04-28 11:17:32,498 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:32,499 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:32,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 6 times [2022-04-28 11:17:32,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:32,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397578216] [2022-04-28 11:17:32,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:32,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:32,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:32,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [651214632] [2022-04-28 11:17:32,519 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:17:32,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:32,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:32,522 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:32,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 11:17:32,572 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 11:17:32,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:32,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 11:17:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:32,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:32,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 11:17:32,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3353#true} is VALID [2022-04-28 11:17:32,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:32,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #84#return; {3353#true} is VALID [2022-04-28 11:17:32,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret5 := main(); {3353#true} is VALID [2022-04-28 11:17:32,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {3353#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {3353#true} is VALID [2022-04-28 11:17:32,847 INFO L272 TraceCheckUtils]: 6: Hoare triple {3353#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:32,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:32,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:32,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:32,847 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3353#true} {3353#true} #60#return; {3353#true} is VALID [2022-04-28 11:17:32,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:32,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:32,848 INFO L272 TraceCheckUtils]: 13: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:32,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:32,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:32,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:32,848 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:32,848 INFO L272 TraceCheckUtils]: 18: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:32,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:32,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:32,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:32,849 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:32,849 INFO L272 TraceCheckUtils]: 23: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:32,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:32,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:32,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:32,850 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:32,850 INFO L272 TraceCheckUtils]: 28: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:32,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:32,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:32,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:32,851 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:32,851 INFO L272 TraceCheckUtils]: 33: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:32,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:32,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:32,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:32,851 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:32,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:17:32,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} assume !false; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:17:32,853 INFO L272 TraceCheckUtils]: 40: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:32,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:32,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:32,853 INFO L290 TraceCheckUtils]: 43: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:32,853 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3353#true} {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} #62#return; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:17:32,853 INFO L272 TraceCheckUtils]: 45: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:32,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:32,853 INFO L290 TraceCheckUtils]: 47: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:32,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:32,854 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3353#true} {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} #64#return; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:17:32,854 INFO L272 TraceCheckUtils]: 50: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:32,854 INFO L290 TraceCheckUtils]: 51: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:32,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:32,854 INFO L290 TraceCheckUtils]: 53: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:32,855 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3353#true} {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} #66#return; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:17:32,855 INFO L272 TraceCheckUtils]: 55: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:32,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:32,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {3529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 11:17:32,856 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 11:17:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 11:17:32,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:33,119 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 11:17:33,120 INFO L290 TraceCheckUtils]: 57: Hoare triple {3529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 11:17:33,120 INFO L290 TraceCheckUtils]: 56: Hoare triple {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:33,121 INFO L272 TraceCheckUtils]: 55: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:33,121 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3353#true} {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:17:33,121 INFO L290 TraceCheckUtils]: 53: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:33,121 INFO L290 TraceCheckUtils]: 52: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:33,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:33,121 INFO L272 TraceCheckUtils]: 50: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:33,122 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3353#true} {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:17:33,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:33,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:33,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:33,122 INFO L272 TraceCheckUtils]: 45: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:33,123 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3353#true} {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #62#return; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:17:33,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:33,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:33,123 INFO L290 TraceCheckUtils]: 41: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:33,123 INFO L272 TraceCheckUtils]: 40: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:33,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !false; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:17:33,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:17:33,127 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3353#true} {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #70#return; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:17:33,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:33,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:33,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:33,128 INFO L272 TraceCheckUtils]: 33: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:33,128 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3353#true} {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #68#return; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:17:33,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:33,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:33,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:33,129 INFO L272 TraceCheckUtils]: 28: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:33,129 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3353#true} {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #66#return; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:17:33,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:33,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:33,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:33,129 INFO L272 TraceCheckUtils]: 23: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:33,130 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3353#true} {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #64#return; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:17:33,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:33,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:33,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:33,130 INFO L272 TraceCheckUtils]: 18: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:33,130 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3353#true} {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #62#return; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:17:33,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:33,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:33,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:33,131 INFO L272 TraceCheckUtils]: 13: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:33,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !false; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:17:33,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:17:33,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3353#true} {3353#true} #60#return; {3353#true} is VALID [2022-04-28 11:17:33,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:33,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:17:33,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:17:33,132 INFO L272 TraceCheckUtils]: 6: Hoare triple {3353#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:17:33,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {3353#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {3353#true} is VALID [2022-04-28 11:17:33,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret5 := main(); {3353#true} is VALID [2022-04-28 11:17:33,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #84#return; {3353#true} is VALID [2022-04-28 11:17:33,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:17:33,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3353#true} is VALID [2022-04-28 11:17:33,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 11:17:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 11:17:33,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:33,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397578216] [2022-04-28 11:17:33,133 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:33,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651214632] [2022-04-28 11:17:33,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651214632] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:17:33,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:17:33,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:17:33,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:33,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1802621389] [2022-04-28 11:17:33,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1802621389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:33,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:33,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:17:33,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323147008] [2022-04-28 11:17:33,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:33,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2022-04-28 11:17:33,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:33,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:17:33,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:33,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:17:33,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:33,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:17:33,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:17:33,164 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:17:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:33,542 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-04-28 11:17:33,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:17:33,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2022-04-28 11:17:33,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:17:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:17:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:17:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:17:33,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:17:33,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:33,615 INFO L225 Difference]: With dead ends: 89 [2022-04-28 11:17:33,615 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 11:17:33,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:17:33,616 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:33,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 167 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:17:33,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 11:17:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-28 11:17:33,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:33,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:17:33,651 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:17:33,651 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:17:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:33,654 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2022-04-28 11:17:33,654 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:17:33,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:33,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:33,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 84 states. [2022-04-28 11:17:33,655 INFO L87 Difference]: Start difference. First operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 84 states. [2022-04-28 11:17:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:33,657 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2022-04-28 11:17:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:17:33,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:33,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:33,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:33,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:17:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2022-04-28 11:17:33,660 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 59 [2022-04-28 11:17:33,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:33,660 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2022-04-28 11:17:33,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:17:33,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 98 transitions. [2022-04-28 11:17:33,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:33,766 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:17:33,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 11:17:33,767 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:33,767 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:33,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 11:17:33,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:33,968 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:33,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:33,968 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 1 times [2022-04-28 11:17:33,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:33,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1489706501] [2022-04-28 11:17:34,231 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:34,233 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:34,233 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 2 times [2022-04-28 11:17:34,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:34,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481999054] [2022-04-28 11:17:34,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:34,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:34,252 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:34,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [917663290] [2022-04-28 11:17:34,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:17:34,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:34,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:34,263 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:34,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 11:17:34,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:17:34,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:34,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:17:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:34,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:34,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {4230#true} call ULTIMATE.init(); {4230#true} is VALID [2022-04-28 11:17:34,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {4230#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4230#true} is VALID [2022-04-28 11:17:34,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:17:34,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4230#true} {4230#true} #84#return; {4230#true} is VALID [2022-04-28 11:17:34,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {4230#true} call #t~ret5 := main(); {4230#true} is VALID [2022-04-28 11:17:34,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {4230#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {4230#true} is VALID [2022-04-28 11:17:34,703 INFO L272 TraceCheckUtils]: 6: Hoare triple {4230#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:17:34,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:17:34,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:17:34,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:17:34,704 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4230#true} {4230#true} #60#return; {4230#true} is VALID [2022-04-28 11:17:34,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {4230#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:34,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:34,704 INFO L272 TraceCheckUtils]: 13: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:17:34,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:17:34,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:17:34,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:17:34,706 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:34,706 INFO L272 TraceCheckUtils]: 18: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4230#true} is VALID [2022-04-28 11:17:34,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:17:34,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:17:34,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:17:34,707 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:34,707 INFO L272 TraceCheckUtils]: 23: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:17:34,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:17:34,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:17:34,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:17:34,707 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:34,708 INFO L272 TraceCheckUtils]: 28: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:17:34,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:17:34,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:17:34,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:17:34,708 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:34,708 INFO L272 TraceCheckUtils]: 33: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4230#true} is VALID [2022-04-28 11:17:34,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:17:34,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:17:34,708 INFO L290 TraceCheckUtils]: 36: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:17:34,709 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:34,709 INFO L290 TraceCheckUtils]: 38: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:17:34,709 INFO L290 TraceCheckUtils]: 39: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !false; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:17:34,710 INFO L272 TraceCheckUtils]: 40: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:17:34,710 INFO L290 TraceCheckUtils]: 41: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:17:34,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:17:34,710 INFO L290 TraceCheckUtils]: 43: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:17:34,710 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #62#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:17:34,710 INFO L272 TraceCheckUtils]: 45: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4230#true} is VALID [2022-04-28 11:17:34,710 INFO L290 TraceCheckUtils]: 46: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:17:34,710 INFO L290 TraceCheckUtils]: 47: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:17:34,710 INFO L290 TraceCheckUtils]: 48: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:17:34,712 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #64#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:17:34,713 INFO L272 TraceCheckUtils]: 50: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:17:34,713 INFO L290 TraceCheckUtils]: 51: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:17:34,713 INFO L290 TraceCheckUtils]: 52: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:17:34,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:17:34,714 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #66#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:17:34,715 INFO L272 TraceCheckUtils]: 55: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:17:34,715 INFO L290 TraceCheckUtils]: 56: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:17:34,715 INFO L290 TraceCheckUtils]: 57: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:17:34,715 INFO L290 TraceCheckUtils]: 58: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:17:34,731 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #68#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:17:34,732 INFO L272 TraceCheckUtils]: 60: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4230#true} is VALID [2022-04-28 11:17:34,732 INFO L290 TraceCheckUtils]: 61: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:17:34,732 INFO L290 TraceCheckUtils]: 62: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:17:34,732 INFO L290 TraceCheckUtils]: 63: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:17:34,732 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #70#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:17:34,733 INFO L290 TraceCheckUtils]: 65: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:17:34,733 INFO L272 TraceCheckUtils]: 66: Hoare triple {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:17:34,733 INFO L290 TraceCheckUtils]: 67: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:17:34,733 INFO L290 TraceCheckUtils]: 68: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:17:34,733 INFO L290 TraceCheckUtils]: 69: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:17:34,733 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4230#true} {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #72#return; {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:17:34,734 INFO L272 TraceCheckUtils]: 71: Hoare triple {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4451#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:34,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {4451#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4455#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:34,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {4455#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4231#false} is VALID [2022-04-28 11:17:34,734 INFO L290 TraceCheckUtils]: 74: Hoare triple {4231#false} assume !false; {4231#false} is VALID [2022-04-28 11:17:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:17:34,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:35,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:35,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481999054] [2022-04-28 11:17:35,023 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:35,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917663290] [2022-04-28 11:17:35,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917663290] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:17:35,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:17:35,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:17:35,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:35,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1489706501] [2022-04-28 11:17:35,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1489706501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:35,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:35,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:17:35,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412411955] [2022-04-28 11:17:35,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:35,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2022-04-28 11:17:35,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:35,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:17:35,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:35,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:17:35,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:35,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:17:35,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:17:35,058 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:17:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:35,607 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-04-28 11:17:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:17:35,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2022-04-28 11:17:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:17:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:17:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:17:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:17:35,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 11:17:35,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:35,701 INFO L225 Difference]: With dead ends: 94 [2022-04-28 11:17:35,701 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 11:17:35,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:17:35,702 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:35,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 186 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:17:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 11:17:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 11:17:35,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:35,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:17:35,771 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:17:35,771 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:17:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:35,779 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-28 11:17:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:17:35,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:35,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:35,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 92 states. [2022-04-28 11:17:35,781 INFO L87 Difference]: Start difference. First operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 92 states. [2022-04-28 11:17:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:35,784 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-28 11:17:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:17:35,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:35,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:35,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:35,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:17:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-04-28 11:17:35,786 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 75 [2022-04-28 11:17:35,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:35,786 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-04-28 11:17:35,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:17:35,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 104 transitions. [2022-04-28 11:17:35,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:17:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 11:17:35,886 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:35,886 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:35,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 11:17:36,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:36,103 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:36,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:36,104 INFO L85 PathProgramCache]: Analyzing trace with hash -63758730, now seen corresponding path program 7 times [2022-04-28 11:17:36,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:36,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1197538612] [2022-04-28 11:17:36,337 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:36,337 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:36,338 INFO L85 PathProgramCache]: Analyzing trace with hash -63758730, now seen corresponding path program 8 times [2022-04-28 11:17:36,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:36,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319573237] [2022-04-28 11:17:36,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:36,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:36,344 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:36,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2108356032] [2022-04-28 11:17:36,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:17:36,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:36,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:36,348 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:36,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 11:17:36,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:17:36,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:36,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 11:17:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:36,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:36,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5138#true} is VALID [2022-04-28 11:17:36,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {5138#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5138#true} is VALID [2022-04-28 11:17:36,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:36,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #84#return; {5138#true} is VALID [2022-04-28 11:17:36,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret5 := main(); {5138#true} is VALID [2022-04-28 11:17:36,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {5138#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {5138#true} is VALID [2022-04-28 11:17:36,708 INFO L272 TraceCheckUtils]: 6: Hoare triple {5138#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:36,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:36,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:36,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:36,708 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5138#true} {5138#true} #60#return; {5138#true} is VALID [2022-04-28 11:17:36,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {5138#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:17:36,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} assume !false; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:17:36,709 INFO L272 TraceCheckUtils]: 13: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:36,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:36,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:36,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:36,709 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #62#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:17:36,709 INFO L272 TraceCheckUtils]: 18: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:36,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:36,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:36,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:36,710 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #64#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:17:36,710 INFO L272 TraceCheckUtils]: 23: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:36,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:36,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:36,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:36,711 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #66#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:17:36,711 INFO L272 TraceCheckUtils]: 28: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:36,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:36,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:36,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:36,711 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #68#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:17:36,711 INFO L272 TraceCheckUtils]: 33: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:36,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:36,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:36,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:36,712 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #70#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:17:36,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:17:36,713 INFO L290 TraceCheckUtils]: 39: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} assume !false; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:17:36,713 INFO L272 TraceCheckUtils]: 40: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:36,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:36,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:36,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:36,713 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #62#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:17:36,713 INFO L272 TraceCheckUtils]: 45: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:36,713 INFO L290 TraceCheckUtils]: 46: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:36,713 INFO L290 TraceCheckUtils]: 47: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:36,713 INFO L290 TraceCheckUtils]: 48: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:36,714 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #64#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:17:36,714 INFO L272 TraceCheckUtils]: 50: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:36,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:36,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:36,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:36,714 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #66#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:17:36,715 INFO L272 TraceCheckUtils]: 55: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:36,715 INFO L290 TraceCheckUtils]: 56: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:36,715 INFO L290 TraceCheckUtils]: 57: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:36,715 INFO L290 TraceCheckUtils]: 58: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:36,716 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #68#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:17:36,716 INFO L272 TraceCheckUtils]: 60: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:36,716 INFO L290 TraceCheckUtils]: 61: Hoare triple {5138#true} ~cond := #in~cond; {5328#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:36,716 INFO L290 TraceCheckUtils]: 62: Hoare triple {5328#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:36,716 INFO L290 TraceCheckUtils]: 63: Hoare triple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:36,717 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #70#return; {5339#(and (= main_~z~0 12) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~n~0 1))} is VALID [2022-04-28 11:17:36,717 INFO L290 TraceCheckUtils]: 65: Hoare triple {5339#(and (= main_~z~0 12) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~n~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} is VALID [2022-04-28 11:17:36,718 INFO L290 TraceCheckUtils]: 66: Hoare triple {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} assume !false; {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} is VALID [2022-04-28 11:17:36,718 INFO L272 TraceCheckUtils]: 67: Hoare triple {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:36,718 INFO L290 TraceCheckUtils]: 68: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:36,718 INFO L290 TraceCheckUtils]: 69: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:36,718 INFO L290 TraceCheckUtils]: 70: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:36,718 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5138#true} {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} #62#return; {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} is VALID [2022-04-28 11:17:36,719 INFO L272 TraceCheckUtils]: 72: Hoare triple {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:36,719 INFO L290 TraceCheckUtils]: 73: Hoare triple {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5369#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:36,719 INFO L290 TraceCheckUtils]: 74: Hoare triple {5369#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5139#false} is VALID [2022-04-28 11:17:36,719 INFO L290 TraceCheckUtils]: 75: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-28 11:17:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 48 proven. 17 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-28 11:17:36,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:37,715 INFO L290 TraceCheckUtils]: 75: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-28 11:17:37,716 INFO L290 TraceCheckUtils]: 74: Hoare triple {5369#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5139#false} is VALID [2022-04-28 11:17:37,716 INFO L290 TraceCheckUtils]: 73: Hoare triple {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5369#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:37,717 INFO L272 TraceCheckUtils]: 72: Hoare triple {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:37,717 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5138#true} {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:17:37,717 INFO L290 TraceCheckUtils]: 70: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:37,717 INFO L290 TraceCheckUtils]: 69: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:37,717 INFO L290 TraceCheckUtils]: 68: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:37,717 INFO L272 TraceCheckUtils]: 67: Hoare triple {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:37,718 INFO L290 TraceCheckUtils]: 66: Hoare triple {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:17:37,722 INFO L290 TraceCheckUtils]: 65: Hoare triple {5407#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:17:37,723 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #70#return; {5407#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:17:37,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:37,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {5421#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:37,724 INFO L290 TraceCheckUtils]: 61: Hoare triple {5138#true} ~cond := #in~cond; {5421#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:17:37,724 INFO L272 TraceCheckUtils]: 60: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:37,724 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5138#true} {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #68#return; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:37,724 INFO L290 TraceCheckUtils]: 58: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:37,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:37,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:37,724 INFO L272 TraceCheckUtils]: 55: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:37,725 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5138#true} {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #66#return; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:37,725 INFO L290 TraceCheckUtils]: 53: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:37,725 INFO L290 TraceCheckUtils]: 52: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:37,725 INFO L290 TraceCheckUtils]: 51: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:37,725 INFO L272 TraceCheckUtils]: 50: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:37,726 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5138#true} {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #64#return; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:37,726 INFO L290 TraceCheckUtils]: 48: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:37,726 INFO L290 TraceCheckUtils]: 47: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:37,726 INFO L290 TraceCheckUtils]: 46: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:37,726 INFO L272 TraceCheckUtils]: 45: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:37,726 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5138#true} {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #62#return; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:37,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:37,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:37,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:37,726 INFO L272 TraceCheckUtils]: 40: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:37,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !false; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:37,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:37,733 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5138#true} {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #70#return; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:17:37,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:37,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:37,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:37,733 INFO L272 TraceCheckUtils]: 33: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:37,733 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5138#true} {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #68#return; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:17:37,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:37,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:37,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:37,733 INFO L272 TraceCheckUtils]: 28: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:37,734 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5138#true} {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #66#return; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:17:37,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:37,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:37,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:37,734 INFO L272 TraceCheckUtils]: 23: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:37,741 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5138#true} {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #64#return; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:17:37,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:37,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:37,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:37,741 INFO L272 TraceCheckUtils]: 18: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:37,742 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5138#true} {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #62#return; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:17:37,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:37,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:37,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:37,742 INFO L272 TraceCheckUtils]: 13: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:37,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} assume !false; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:17:37,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {5138#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:17:37,743 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5138#true} {5138#true} #60#return; {5138#true} is VALID [2022-04-28 11:17:37,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:37,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:17:37,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:17:37,743 INFO L272 TraceCheckUtils]: 6: Hoare triple {5138#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:17:37,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {5138#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {5138#true} is VALID [2022-04-28 11:17:37,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret5 := main(); {5138#true} is VALID [2022-04-28 11:17:37,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #84#return; {5138#true} is VALID [2022-04-28 11:17:37,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:17:37,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {5138#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5138#true} is VALID [2022-04-28 11:17:37,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5138#true} is VALID [2022-04-28 11:17:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 48 proven. 17 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-28 11:17:37,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:37,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319573237] [2022-04-28 11:17:37,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:37,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108356032] [2022-04-28 11:17:37,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108356032] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:17:37,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:17:37,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-28 11:17:37,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:37,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1197538612] [2022-04-28 11:17:37,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1197538612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:37,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:37,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:17:37,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869294961] [2022-04-28 11:17:37,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:37,745 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:17:37,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:37,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:17:37,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:37,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:17:37,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:37,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:17:37,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:17:37,783 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:17:39,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:39,048 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2022-04-28 11:17:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:17:39,048 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:17:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:17:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:17:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:17:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:17:39,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 100 transitions. [2022-04-28 11:17:39,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:39,124 INFO L225 Difference]: With dead ends: 115 [2022-04-28 11:17:39,124 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 11:17:39,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:17:39,125 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:39,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 151 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 11:17:39,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 11:17:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2022-04-28 11:17:39,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:39,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:17:39,200 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:17:39,201 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:17:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:39,204 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-04-28 11:17:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-04-28 11:17:39,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:39,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:39,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 113 states. [2022-04-28 11:17:39,205 INFO L87 Difference]: Start difference. First operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 113 states. [2022-04-28 11:17:39,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:39,210 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-04-28 11:17:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-04-28 11:17:39,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:39,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:39,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:39,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:39,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:17:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-04-28 11:17:39,215 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 76 [2022-04-28 11:17:39,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:39,215 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-04-28 11:17:39,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:17:39,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 115 transitions. [2022-04-28 11:17:39,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:39,338 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-28 11:17:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 11:17:39,339 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:39,339 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:39,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 11:17:39,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 11:17:39,540 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:39,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:39,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 1 times [2022-04-28 11:17:39,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:39,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1914273738] [2022-04-28 11:17:39,796 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:39,796 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:39,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 2 times [2022-04-28 11:17:39,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:39,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409412092] [2022-04-28 11:17:39,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:39,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:39,815 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:39,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584569644] [2022-04-28 11:17:39,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:17:39,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:39,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:39,817 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:39,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 11:17:39,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:17:39,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:39,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:17:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:39,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:40,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {6274#true} call ULTIMATE.init(); {6274#true} is VALID [2022-04-28 11:17:40,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {6274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6274#true} is VALID [2022-04-28 11:17:40,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:17:40,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6274#true} {6274#true} #84#return; {6274#true} is VALID [2022-04-28 11:17:40,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {6274#true} call #t~ret5 := main(); {6274#true} is VALID [2022-04-28 11:17:40,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {6274#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {6274#true} is VALID [2022-04-28 11:17:40,406 INFO L272 TraceCheckUtils]: 6: Hoare triple {6274#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:17:40,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:17:40,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:17:40,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:17:40,407 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6274#true} {6274#true} #60#return; {6274#true} is VALID [2022-04-28 11:17:40,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {6274#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:17:40,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !false; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:17:40,408 INFO L272 TraceCheckUtils]: 13: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:17:40,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:17:40,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:17:40,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:17:40,408 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #62#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:17:40,408 INFO L272 TraceCheckUtils]: 18: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:17:40,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:17:40,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:17:40,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:17:40,409 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #64#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:17:40,409 INFO L272 TraceCheckUtils]: 23: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:17:40,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:17:40,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:17:40,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:17:40,421 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #66#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:17:40,422 INFO L272 TraceCheckUtils]: 28: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:17:40,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:17:40,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:17:40,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:17:40,422 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #68#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:17:40,422 INFO L272 TraceCheckUtils]: 33: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:17:40,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:17:40,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:17:40,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:17:40,423 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #70#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:17:40,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:17:40,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !false; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:17:40,424 INFO L272 TraceCheckUtils]: 40: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:17:40,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:17:40,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:17:40,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:17:40,425 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #62#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:17:40,425 INFO L272 TraceCheckUtils]: 45: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:17:40,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:17:40,425 INFO L290 TraceCheckUtils]: 47: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:17:40,425 INFO L290 TraceCheckUtils]: 48: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:17:40,425 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #64#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:17:40,425 INFO L272 TraceCheckUtils]: 50: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:17:40,426 INFO L290 TraceCheckUtils]: 51: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:17:40,426 INFO L290 TraceCheckUtils]: 52: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:17:40,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:17:40,426 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #66#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:17:40,426 INFO L272 TraceCheckUtils]: 55: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:17:40,426 INFO L290 TraceCheckUtils]: 56: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:17:40,426 INFO L290 TraceCheckUtils]: 57: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:17:40,426 INFO L290 TraceCheckUtils]: 58: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:17:40,427 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #68#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:17:40,427 INFO L272 TraceCheckUtils]: 60: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:17:40,427 INFO L290 TraceCheckUtils]: 61: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:17:40,427 INFO L290 TraceCheckUtils]: 62: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:17:40,427 INFO L290 TraceCheckUtils]: 63: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:17:40,428 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #70#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:17:40,428 INFO L290 TraceCheckUtils]: 65: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:17:40,428 INFO L272 TraceCheckUtils]: 66: Hoare triple {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:17:40,428 INFO L290 TraceCheckUtils]: 67: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:17:40,428 INFO L290 TraceCheckUtils]: 68: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:17:40,428 INFO L290 TraceCheckUtils]: 69: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:17:40,429 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {6274#true} {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #72#return; {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:17:40,429 INFO L272 TraceCheckUtils]: 71: Hoare triple {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:17:40,429 INFO L290 TraceCheckUtils]: 72: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:17:40,429 INFO L290 TraceCheckUtils]: 73: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:17:40,429 INFO L290 TraceCheckUtils]: 74: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:17:40,430 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6274#true} {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #74#return; {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:17:40,431 INFO L272 TraceCheckUtils]: 76: Hoare triple {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:40,431 INFO L290 TraceCheckUtils]: 77: Hoare triple {6510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:40,432 INFO L290 TraceCheckUtils]: 78: Hoare triple {6514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6275#false} is VALID [2022-04-28 11:17:40,432 INFO L290 TraceCheckUtils]: 79: Hoare triple {6275#false} assume !false; {6275#false} is VALID [2022-04-28 11:17:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:17:40,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:45,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:45,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409412092] [2022-04-28 11:17:45,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:45,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584569644] [2022-04-28 11:17:45,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584569644] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:17:45,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:17:45,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:17:45,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:45,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1914273738] [2022-04-28 11:17:45,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1914273738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:45,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:45,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:17:45,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404946117] [2022-04-28 11:17:45,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:45,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 80 [2022-04-28 11:17:45,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:45,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:17:45,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:45,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:17:45,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:45,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:17:45,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:17:45,348 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:17:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:45,935 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-04-28 11:17:45,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:17:45,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 80 [2022-04-28 11:17:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:17:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:17:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:17:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:17:45,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 11:17:45,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:45,989 INFO L225 Difference]: With dead ends: 109 [2022-04-28 11:17:45,989 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 11:17:45,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:17:45,991 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 6 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:45,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 216 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:17:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 11:17:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-28 11:17:46,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:46,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:17:46,037 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:17:46,037 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:17:46,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:46,048 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-04-28 11:17:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:17:46,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:46,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:46,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 96 states. [2022-04-28 11:17:46,053 INFO L87 Difference]: Start difference. First operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 96 states. [2022-04-28 11:17:46,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:46,061 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-04-28 11:17:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:17:46,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:46,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:46,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:46,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:17:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2022-04-28 11:17:46,063 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 80 [2022-04-28 11:17:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:46,063 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2022-04-28 11:17:46,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:17:46,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 106 transitions. [2022-04-28 11:17:46,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:17:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 11:17:46,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:46,185 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:46,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 11:17:46,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:46,385 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:46,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:46,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 9 times [2022-04-28 11:17:46,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:46,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1025022101] [2022-04-28 11:17:46,600 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:46,600 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:46,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 10 times [2022-04-28 11:17:46,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:46,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933790317] [2022-04-28 11:17:46,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:46,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:46,619 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:46,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611631310] [2022-04-28 11:17:46,619 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:17:46,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:46,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:46,633 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:46,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 11:17:46,677 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:17:46,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:46,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 11:17:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:46,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:46,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {7258#true} call ULTIMATE.init(); {7258#true} is VALID [2022-04-28 11:17:46,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {7258#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7258#true} is VALID [2022-04-28 11:17:46,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:46,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7258#true} {7258#true} #84#return; {7258#true} is VALID [2022-04-28 11:17:46,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {7258#true} call #t~ret5 := main(); {7258#true} is VALID [2022-04-28 11:17:46,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {7258#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {7258#true} is VALID [2022-04-28 11:17:46,936 INFO L272 TraceCheckUtils]: 6: Hoare triple {7258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:46,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:46,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:46,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:46,936 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7258#true} {7258#true} #60#return; {7258#true} is VALID [2022-04-28 11:17:46,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {7258#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:46,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:46,937 INFO L272 TraceCheckUtils]: 13: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:46,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:46,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:46,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:46,937 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:46,937 INFO L272 TraceCheckUtils]: 18: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:46,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:46,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:46,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:46,938 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:46,938 INFO L272 TraceCheckUtils]: 23: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:46,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:46,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:46,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:46,939 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:46,939 INFO L272 TraceCheckUtils]: 28: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:46,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:46,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:46,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:46,939 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:46,940 INFO L272 TraceCheckUtils]: 33: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:46,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:46,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:46,941 INFO L290 TraceCheckUtils]: 36: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:46,941 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:46,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:46,943 INFO L290 TraceCheckUtils]: 39: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !false; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:46,946 INFO L272 TraceCheckUtils]: 40: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:46,946 INFO L290 TraceCheckUtils]: 41: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:46,947 INFO L290 TraceCheckUtils]: 42: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:46,947 INFO L290 TraceCheckUtils]: 43: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:46,947 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #62#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:46,947 INFO L272 TraceCheckUtils]: 45: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:46,947 INFO L290 TraceCheckUtils]: 46: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:46,947 INFO L290 TraceCheckUtils]: 47: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:46,947 INFO L290 TraceCheckUtils]: 48: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:46,948 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #64#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:46,948 INFO L272 TraceCheckUtils]: 50: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:46,948 INFO L290 TraceCheckUtils]: 51: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:46,948 INFO L290 TraceCheckUtils]: 52: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:46,948 INFO L290 TraceCheckUtils]: 53: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:46,948 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #66#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:46,948 INFO L272 TraceCheckUtils]: 55: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:46,948 INFO L290 TraceCheckUtils]: 56: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:46,949 INFO L290 TraceCheckUtils]: 57: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:46,949 INFO L290 TraceCheckUtils]: 58: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:46,949 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #68#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:46,949 INFO L272 TraceCheckUtils]: 60: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:46,949 INFO L290 TraceCheckUtils]: 61: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:46,949 INFO L290 TraceCheckUtils]: 62: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:46,949 INFO L290 TraceCheckUtils]: 63: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:46,950 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #70#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:46,950 INFO L290 TraceCheckUtils]: 65: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:17:46,950 INFO L290 TraceCheckUtils]: 66: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} assume !false; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:17:46,950 INFO L272 TraceCheckUtils]: 67: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:46,950 INFO L290 TraceCheckUtils]: 68: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:46,950 INFO L290 TraceCheckUtils]: 69: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:46,950 INFO L290 TraceCheckUtils]: 70: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:46,951 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7258#true} {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} #62#return; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:17:46,951 INFO L272 TraceCheckUtils]: 72: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:46,951 INFO L290 TraceCheckUtils]: 73: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:46,951 INFO L290 TraceCheckUtils]: 74: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:46,951 INFO L290 TraceCheckUtils]: 75: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:46,951 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7258#true} {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} #64#return; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:17:46,952 INFO L272 TraceCheckUtils]: 77: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:46,952 INFO L290 TraceCheckUtils]: 78: Hoare triple {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7501#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:46,952 INFO L290 TraceCheckUtils]: 79: Hoare triple {7501#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7259#false} is VALID [2022-04-28 11:17:46,952 INFO L290 TraceCheckUtils]: 80: Hoare triple {7259#false} assume !false; {7259#false} is VALID [2022-04-28 11:17:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:17:46,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:47,207 INFO L290 TraceCheckUtils]: 80: Hoare triple {7259#false} assume !false; {7259#false} is VALID [2022-04-28 11:17:47,207 INFO L290 TraceCheckUtils]: 79: Hoare triple {7501#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7259#false} is VALID [2022-04-28 11:17:47,208 INFO L290 TraceCheckUtils]: 78: Hoare triple {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7501#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:47,208 INFO L272 TraceCheckUtils]: 77: Hoare triple {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:47,209 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7258#true} {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:17:47,209 INFO L290 TraceCheckUtils]: 75: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:47,209 INFO L290 TraceCheckUtils]: 74: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:47,209 INFO L290 TraceCheckUtils]: 73: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:47,209 INFO L272 TraceCheckUtils]: 72: Hoare triple {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:47,210 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7258#true} {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:17:47,210 INFO L290 TraceCheckUtils]: 70: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:47,210 INFO L290 TraceCheckUtils]: 69: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:47,210 INFO L290 TraceCheckUtils]: 68: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:47,210 INFO L272 TraceCheckUtils]: 67: Hoare triple {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:47,210 INFO L290 TraceCheckUtils]: 66: Hoare triple {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:17:47,212 INFO L290 TraceCheckUtils]: 65: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:17:47,213 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:47,213 INFO L290 TraceCheckUtils]: 63: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:47,213 INFO L290 TraceCheckUtils]: 62: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:47,213 INFO L290 TraceCheckUtils]: 61: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:47,213 INFO L272 TraceCheckUtils]: 60: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:47,214 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:47,214 INFO L290 TraceCheckUtils]: 58: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:47,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:47,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:47,214 INFO L272 TraceCheckUtils]: 55: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:47,214 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:47,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:47,214 INFO L290 TraceCheckUtils]: 52: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:47,214 INFO L290 TraceCheckUtils]: 51: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:47,214 INFO L272 TraceCheckUtils]: 50: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:47,215 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:47,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:47,215 INFO L290 TraceCheckUtils]: 47: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:47,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:47,215 INFO L272 TraceCheckUtils]: 45: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:47,216 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:47,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:47,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:47,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:47,216 INFO L272 TraceCheckUtils]: 40: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:47,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:47,219 INFO L290 TraceCheckUtils]: 38: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:17:47,219 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:17:47,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:47,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:47,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:47,220 INFO L272 TraceCheckUtils]: 33: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:47,220 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:17:47,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:47,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:47,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:47,220 INFO L272 TraceCheckUtils]: 28: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:47,221 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:17:47,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:47,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:47,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:47,221 INFO L272 TraceCheckUtils]: 23: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:47,222 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:17:47,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:47,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:47,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:47,222 INFO L272 TraceCheckUtils]: 18: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:47,223 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:17:47,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:47,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:47,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:47,223 INFO L272 TraceCheckUtils]: 13: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:47,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:17:47,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {7258#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:17:47,224 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7258#true} {7258#true} #60#return; {7258#true} is VALID [2022-04-28 11:17:47,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:47,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:17:47,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:17:47,224 INFO L272 TraceCheckUtils]: 6: Hoare triple {7258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:17:47,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {7258#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {7258#true} is VALID [2022-04-28 11:17:47,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {7258#true} call #t~ret5 := main(); {7258#true} is VALID [2022-04-28 11:17:47,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7258#true} {7258#true} #84#return; {7258#true} is VALID [2022-04-28 11:17:47,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:17:47,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {7258#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7258#true} is VALID [2022-04-28 11:17:47,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {7258#true} call ULTIMATE.init(); {7258#true} is VALID [2022-04-28 11:17:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:17:47,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:47,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933790317] [2022-04-28 11:17:47,225 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:47,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611631310] [2022-04-28 11:17:47,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611631310] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:17:47,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:17:47,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 11:17:47,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:47,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1025022101] [2022-04-28 11:17:47,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1025022101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:47,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:47,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:17:47,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840009745] [2022-04-28 11:17:47,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:47,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 81 [2022-04-28 11:17:47,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:47,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:17:47,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:47,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:17:47,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:47,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:17:47,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:17:47,290 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:17:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:48,176 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2022-04-28 11:17:48,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:17:48,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 81 [2022-04-28 11:17:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:48,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:17:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-04-28 11:17:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:17:48,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-04-28 11:17:48,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 94 transitions. [2022-04-28 11:17:48,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:48,254 INFO L225 Difference]: With dead ends: 112 [2022-04-28 11:17:48,254 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 11:17:48,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:17:48,258 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 6 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:48,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 222 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 11:17:48,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 11:17:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2022-04-28 11:17:48,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:48,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:17:48,339 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:17:48,340 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:17:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:48,342 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 11:17:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 11:17:48,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:48,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:48,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 110 states. [2022-04-28 11:17:48,343 INFO L87 Difference]: Start difference. First operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 110 states. [2022-04-28 11:17:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:48,345 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 11:17:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 11:17:48,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:48,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:48,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:48,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:17:48,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-04-28 11:17:48,348 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 81 [2022-04-28 11:17:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:48,349 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-04-28 11:17:48,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:17:48,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 111 transitions. [2022-04-28 11:17:48,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 11:17:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 11:17:48,461 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:48,461 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:48,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 11:17:48,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 11:17:48,676 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:48,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:48,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1087104342, now seen corresponding path program 11 times [2022-04-28 11:17:48,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:48,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1288590013] [2022-04-28 11:17:48,928 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:48,928 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:48,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1087104342, now seen corresponding path program 12 times [2022-04-28 11:17:48,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:48,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833563763] [2022-04-28 11:17:48,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:48,936 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:48,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1720315777] [2022-04-28 11:17:48,936 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:17:48,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:48,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:48,937 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:48,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 11:17:48,977 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:17:48,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:48,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 11:17:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:48,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:49,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {8401#true} call ULTIMATE.init(); {8401#true} is VALID [2022-04-28 11:17:49,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {8401#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8401#true} is VALID [2022-04-28 11:17:49,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8401#true} {8401#true} #84#return; {8401#true} is VALID [2022-04-28 11:17:49,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {8401#true} call #t~ret5 := main(); {8401#true} is VALID [2022-04-28 11:17:49,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {8401#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {8401#true} is VALID [2022-04-28 11:17:49,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {8401#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,384 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8401#true} {8401#true} #60#return; {8401#true} is VALID [2022-04-28 11:17:49,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {8401#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:49,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:49,385 INFO L272 TraceCheckUtils]: 13: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,385 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:49,386 INFO L272 TraceCheckUtils]: 18: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,415 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:49,415 INFO L272 TraceCheckUtils]: 23: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,415 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:49,415 INFO L272 TraceCheckUtils]: 28: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,416 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:49,416 INFO L272 TraceCheckUtils]: 33: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,417 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:49,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:49,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !false; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:49,418 INFO L272 TraceCheckUtils]: 40: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,418 INFO L290 TraceCheckUtils]: 41: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,419 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #62#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:49,419 INFO L272 TraceCheckUtils]: 45: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,420 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #64#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:49,420 INFO L272 TraceCheckUtils]: 50: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,420 INFO L290 TraceCheckUtils]: 51: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,420 INFO L290 TraceCheckUtils]: 52: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,420 INFO L290 TraceCheckUtils]: 53: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,420 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #66#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:49,421 INFO L272 TraceCheckUtils]: 55: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,421 INFO L290 TraceCheckUtils]: 56: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,421 INFO L290 TraceCheckUtils]: 57: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,421 INFO L290 TraceCheckUtils]: 58: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,421 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #68#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:49,421 INFO L272 TraceCheckUtils]: 60: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,421 INFO L290 TraceCheckUtils]: 61: Hoare triple {8401#true} ~cond := #in~cond; {8591#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:49,422 INFO L290 TraceCheckUtils]: 62: Hoare triple {8591#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:49,422 INFO L290 TraceCheckUtils]: 63: Hoare triple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:49,423 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #70#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:49,423 INFO L290 TraceCheckUtils]: 65: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:17:49,423 INFO L290 TraceCheckUtils]: 66: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} assume !false; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:17:49,423 INFO L272 TraceCheckUtils]: 67: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,424 INFO L290 TraceCheckUtils]: 68: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,424 INFO L290 TraceCheckUtils]: 69: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,424 INFO L290 TraceCheckUtils]: 70: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,424 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8401#true} {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} #62#return; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:17:49,424 INFO L272 TraceCheckUtils]: 72: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,424 INFO L290 TraceCheckUtils]: 73: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,424 INFO L290 TraceCheckUtils]: 74: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,424 INFO L290 TraceCheckUtils]: 75: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,425 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8401#true} {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} #64#return; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:17:49,425 INFO L272 TraceCheckUtils]: 77: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,425 INFO L290 TraceCheckUtils]: 78: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,425 INFO L290 TraceCheckUtils]: 79: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,425 INFO L290 TraceCheckUtils]: 80: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,426 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8401#true} {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} #66#return; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:17:49,426 INFO L272 TraceCheckUtils]: 82: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:49,426 INFO L290 TraceCheckUtils]: 83: Hoare triple {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8661#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:49,427 INFO L290 TraceCheckUtils]: 84: Hoare triple {8661#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8402#false} is VALID [2022-04-28 11:17:49,427 INFO L290 TraceCheckUtils]: 85: Hoare triple {8402#false} assume !false; {8402#false} is VALID [2022-04-28 11:17:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 52 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-28 11:17:49,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:49,970 INFO L290 TraceCheckUtils]: 85: Hoare triple {8402#false} assume !false; {8402#false} is VALID [2022-04-28 11:17:49,971 INFO L290 TraceCheckUtils]: 84: Hoare triple {8661#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8402#false} is VALID [2022-04-28 11:17:49,971 INFO L290 TraceCheckUtils]: 83: Hoare triple {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8661#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:49,972 INFO L272 TraceCheckUtils]: 82: Hoare triple {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:49,972 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8401#true} {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:17:49,973 INFO L290 TraceCheckUtils]: 80: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,973 INFO L290 TraceCheckUtils]: 79: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,973 INFO L290 TraceCheckUtils]: 78: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,973 INFO L272 TraceCheckUtils]: 77: Hoare triple {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,976 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8401#true} {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:17:49,976 INFO L290 TraceCheckUtils]: 75: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,976 INFO L290 TraceCheckUtils]: 74: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,976 INFO L290 TraceCheckUtils]: 73: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,976 INFO L272 TraceCheckUtils]: 72: Hoare triple {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,977 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8401#true} {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #62#return; {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:17:49,977 INFO L290 TraceCheckUtils]: 70: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,977 INFO L290 TraceCheckUtils]: 69: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,977 INFO L290 TraceCheckUtils]: 68: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,977 INFO L272 TraceCheckUtils]: 67: Hoare triple {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,977 INFO L290 TraceCheckUtils]: 66: Hoare triple {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !false; {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:17:49,980 INFO L290 TraceCheckUtils]: 65: Hoare triple {8729#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:17:49,981 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #70#return; {8729#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:17:49,981 INFO L290 TraceCheckUtils]: 63: Hoare triple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:49,981 INFO L290 TraceCheckUtils]: 62: Hoare triple {8743#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:49,981 INFO L290 TraceCheckUtils]: 61: Hoare triple {8401#true} ~cond := #in~cond; {8743#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:17:49,981 INFO L272 TraceCheckUtils]: 60: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,982 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #68#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:49,982 INFO L290 TraceCheckUtils]: 58: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,982 INFO L290 TraceCheckUtils]: 57: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,982 INFO L290 TraceCheckUtils]: 56: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,982 INFO L272 TraceCheckUtils]: 55: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,982 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #66#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:49,982 INFO L290 TraceCheckUtils]: 53: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,982 INFO L290 TraceCheckUtils]: 52: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,982 INFO L272 TraceCheckUtils]: 50: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,983 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #64#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:49,983 INFO L290 TraceCheckUtils]: 48: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,983 INFO L290 TraceCheckUtils]: 47: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,983 INFO L290 TraceCheckUtils]: 46: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,984 INFO L272 TraceCheckUtils]: 45: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,990 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #62#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:49,990 INFO L290 TraceCheckUtils]: 43: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:49,990 INFO L290 TraceCheckUtils]: 42: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:49,990 INFO L290 TraceCheckUtils]: 41: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:49,990 INFO L272 TraceCheckUtils]: 40: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:49,991 INFO L290 TraceCheckUtils]: 39: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !false; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:51,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:51,148 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #70#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:51,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:51,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:51,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:51,148 INFO L272 TraceCheckUtils]: 33: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:51,149 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #68#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:51,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:51,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:51,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:51,149 INFO L272 TraceCheckUtils]: 28: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:51,149 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #66#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:51,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:51,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:51,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:51,150 INFO L272 TraceCheckUtils]: 23: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:51,150 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #64#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:51,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:51,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:51,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:51,150 INFO L272 TraceCheckUtils]: 18: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:51,151 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #62#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:51,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:51,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:51,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:51,151 INFO L272 TraceCheckUtils]: 13: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:51,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !false; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:51,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {8401#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:17:51,152 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8401#true} {8401#true} #60#return; {8401#true} is VALID [2022-04-28 11:17:51,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:51,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:17:51,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:17:51,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {8401#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:17:51,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {8401#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {8401#true} is VALID [2022-04-28 11:17:51,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {8401#true} call #t~ret5 := main(); {8401#true} is VALID [2022-04-28 11:17:51,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8401#true} {8401#true} #84#return; {8401#true} is VALID [2022-04-28 11:17:51,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:17:51,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {8401#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8401#true} is VALID [2022-04-28 11:17:51,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {8401#true} call ULTIMATE.init(); {8401#true} is VALID [2022-04-28 11:17:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 63 proven. 10 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2022-04-28 11:17:51,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:51,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833563763] [2022-04-28 11:17:51,153 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:51,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720315777] [2022-04-28 11:17:51,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720315777] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:17:51,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:17:51,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-04-28 11:17:51,154 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:51,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1288590013] [2022-04-28 11:17:51,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1288590013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:51,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:51,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:17:51,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250082843] [2022-04-28 11:17:51,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:51,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 86 [2022-04-28 11:17:51,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:51,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:17:51,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:51,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:17:51,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:51,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:17:51,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:17:51,201 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:17:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:52,826 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2022-04-28 11:17:52,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:17:52,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 86 [2022-04-28 11:17:52,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:17:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-28 11:17:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:17:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-28 11:17:52,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-28 11:17:52,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:52,911 INFO L225 Difference]: With dead ends: 116 [2022-04-28 11:17:52,912 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 11:17:52,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:17:52,915 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:52,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 151 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 11:17:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 11:17:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-28 11:17:52,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:52,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:17:52,977 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:17:52,977 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:17:52,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:52,979 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-28 11:17:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:17:52,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:52,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:52,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 111 states. [2022-04-28 11:17:52,985 INFO L87 Difference]: Start difference. First operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 111 states. [2022-04-28 11:17:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:53,009 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-28 11:17:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:17:53,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:53,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:53,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:53,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:17:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-04-28 11:17:53,015 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 86 [2022-04-28 11:17:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:53,015 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-04-28 11:17:53,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:17:53,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 125 transitions. [2022-04-28 11:17:53,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:17:53,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 11:17:53,150 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:53,150 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:53,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 11:17:53,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 11:17:53,361 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:53,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:53,361 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 3 times [2022-04-28 11:17:53,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:53,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [934324113] [2022-04-28 11:17:53,594 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:53,594 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:53,594 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 4 times [2022-04-28 11:17:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:53,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681031221] [2022-04-28 11:17:53,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:53,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:53,602 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:53,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [941440144] [2022-04-28 11:17:53,602 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:17:53,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:53,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:53,603 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:53,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 11:17:53,653 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:17:53,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:53,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 11:17:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:53,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:54,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {9609#true} call ULTIMATE.init(); {9609#true} is VALID [2022-04-28 11:17:54,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {9609#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9609#true} is VALID [2022-04-28 11:17:54,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9609#true} {9609#true} #84#return; {9609#true} is VALID [2022-04-28 11:17:54,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {9609#true} call #t~ret5 := main(); {9609#true} is VALID [2022-04-28 11:17:54,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {9609#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {9609#true} is VALID [2022-04-28 11:17:54,168 INFO L272 TraceCheckUtils]: 6: Hoare triple {9609#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,168 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9609#true} {9609#true} #60#return; {9609#true} is VALID [2022-04-28 11:17:54,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {9609#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:54,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:54,169 INFO L272 TraceCheckUtils]: 13: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,169 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:54,169 INFO L272 TraceCheckUtils]: 18: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,170 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:54,170 INFO L272 TraceCheckUtils]: 23: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,171 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:54,171 INFO L272 TraceCheckUtils]: 28: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,171 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:54,172 INFO L272 TraceCheckUtils]: 33: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,172 INFO L290 TraceCheckUtils]: 34: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,172 INFO L290 TraceCheckUtils]: 35: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,172 INFO L290 TraceCheckUtils]: 36: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,172 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:54,172 INFO L290 TraceCheckUtils]: 38: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:54,173 INFO L290 TraceCheckUtils]: 39: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !false; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:54,173 INFO L272 TraceCheckUtils]: 40: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,173 INFO L290 TraceCheckUtils]: 41: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,173 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #62#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:54,173 INFO L272 TraceCheckUtils]: 45: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,173 INFO L290 TraceCheckUtils]: 46: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,173 INFO L290 TraceCheckUtils]: 48: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,174 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #64#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:54,174 INFO L272 TraceCheckUtils]: 50: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,174 INFO L290 TraceCheckUtils]: 51: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,174 INFO L290 TraceCheckUtils]: 52: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,174 INFO L290 TraceCheckUtils]: 53: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,174 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #66#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:54,174 INFO L272 TraceCheckUtils]: 55: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,174 INFO L290 TraceCheckUtils]: 57: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,174 INFO L290 TraceCheckUtils]: 58: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,175 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #68#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:54,175 INFO L272 TraceCheckUtils]: 60: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,175 INFO L290 TraceCheckUtils]: 61: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,175 INFO L290 TraceCheckUtils]: 62: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,175 INFO L290 TraceCheckUtils]: 63: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,175 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #70#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:54,176 INFO L290 TraceCheckUtils]: 65: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:17:54,176 INFO L290 TraceCheckUtils]: 66: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} assume !false; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:17:54,176 INFO L272 TraceCheckUtils]: 67: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,176 INFO L290 TraceCheckUtils]: 68: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,176 INFO L290 TraceCheckUtils]: 69: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,176 INFO L290 TraceCheckUtils]: 70: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,176 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #62#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:17:54,176 INFO L272 TraceCheckUtils]: 72: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,176 INFO L290 TraceCheckUtils]: 73: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,176 INFO L290 TraceCheckUtils]: 74: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,177 INFO L290 TraceCheckUtils]: 75: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,177 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #64#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:17:54,177 INFO L272 TraceCheckUtils]: 77: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,177 INFO L290 TraceCheckUtils]: 78: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,177 INFO L290 TraceCheckUtils]: 79: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,177 INFO L290 TraceCheckUtils]: 80: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,177 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #66#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:17:54,177 INFO L272 TraceCheckUtils]: 82: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,177 INFO L290 TraceCheckUtils]: 83: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,177 INFO L290 TraceCheckUtils]: 84: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,178 INFO L290 TraceCheckUtils]: 85: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,178 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #68#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:17:54,178 INFO L272 TraceCheckUtils]: 87: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,178 INFO L290 TraceCheckUtils]: 88: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,178 INFO L290 TraceCheckUtils]: 89: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,178 INFO L290 TraceCheckUtils]: 90: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,178 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #70#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:17:54,179 INFO L290 TraceCheckUtils]: 92: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} assume !(~n~0 <= ~a~0); {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} is VALID [2022-04-28 11:17:54,179 INFO L272 TraceCheckUtils]: 93: Hoare triple {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:17:54,179 INFO L290 TraceCheckUtils]: 94: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:17:54,179 INFO L290 TraceCheckUtils]: 95: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:17:54,179 INFO L290 TraceCheckUtils]: 96: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:17:54,179 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {9609#true} {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} #72#return; {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} is VALID [2022-04-28 11:17:54,180 INFO L272 TraceCheckUtils]: 98: Hoare triple {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {9912#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:54,180 INFO L290 TraceCheckUtils]: 99: Hoare triple {9912#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9916#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:54,180 INFO L290 TraceCheckUtils]: 100: Hoare triple {9916#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9610#false} is VALID [2022-04-28 11:17:54,180 INFO L290 TraceCheckUtils]: 101: Hoare triple {9610#false} assume !false; {9610#false} is VALID [2022-04-28 11:17:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 11:17:54,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:54,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:54,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681031221] [2022-04-28 11:17:54,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:54,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941440144] [2022-04-28 11:17:54,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941440144] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:17:54,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:17:54,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 11:17:54,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:54,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [934324113] [2022-04-28 11:17:54,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [934324113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:54,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:54,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:17:54,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691346894] [2022-04-28 11:17:54,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:54,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 102 [2022-04-28 11:17:54,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:54,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:17:54,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:54,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:17:54,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:54,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:17:54,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:17:54,567 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:17:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:55,367 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2022-04-28 11:17:55,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:17:55,367 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 102 [2022-04-28 11:17:55,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:17:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:17:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:17:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:17:55,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-04-28 11:17:55,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:55,466 INFO L225 Difference]: With dead ends: 117 [2022-04-28 11:17:55,466 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 11:17:55,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:17:55,467 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:55,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 225 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 11:17:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 11:17:55,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-28 11:17:55,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:55,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:17:55,531 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:17:55,531 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:17:55,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:55,535 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-04-28 11:17:55,540 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:17:55,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:55,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:55,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 115 states. [2022-04-28 11:17:55,541 INFO L87 Difference]: Start difference. First operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 115 states. [2022-04-28 11:17:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:55,545 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-04-28 11:17:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:17:55,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:55,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:55,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:55,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:17:55,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2022-04-28 11:17:55,565 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 102 [2022-04-28 11:17:55,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:55,565 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2022-04-28 11:17:55,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:17:55,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 128 transitions. [2022-04-28 11:17:55,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:17:55,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 11:17:55,672 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:55,672 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:55,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 11:17:55,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 11:17:55,873 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:55,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:55,873 INFO L85 PathProgramCache]: Analyzing trace with hash -360684101, now seen corresponding path program 13 times [2022-04-28 11:17:55,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:55,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1472424025] [2022-04-28 11:17:56,170 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:56,170 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash -360684101, now seen corresponding path program 14 times [2022-04-28 11:17:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:56,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292241760] [2022-04-28 11:17:56,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:56,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:56,192 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:56,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315277794] [2022-04-28 11:17:56,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:17:56,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:56,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:56,195 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:56,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 11:17:56,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:17:56,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:56,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 11:17:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:56,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:56,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {10737#true} call ULTIMATE.init(); {10737#true} is VALID [2022-04-28 11:17:56,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {10737#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10737#true} is VALID [2022-04-28 11:17:56,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10737#true} {10737#true} #84#return; {10737#true} is VALID [2022-04-28 11:17:56,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {10737#true} call #t~ret5 := main(); {10737#true} is VALID [2022-04-28 11:17:56,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {10737#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {10737#true} is VALID [2022-04-28 11:17:56,697 INFO L272 TraceCheckUtils]: 6: Hoare triple {10737#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,697 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10737#true} {10737#true} #60#return; {10737#true} is VALID [2022-04-28 11:17:56,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {10737#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:56,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:56,698 INFO L272 TraceCheckUtils]: 13: Hoare triple {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,699 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:56,699 INFO L272 TraceCheckUtils]: 18: Hoare triple {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,699 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:56,700 INFO L272 TraceCheckUtils]: 23: Hoare triple {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,700 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:56,700 INFO L272 TraceCheckUtils]: 28: Hoare triple {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,701 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:56,701 INFO L272 TraceCheckUtils]: 33: Hoare triple {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,701 INFO L290 TraceCheckUtils]: 34: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,702 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:56,702 INFO L290 TraceCheckUtils]: 38: Hoare triple {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:56,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !false; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:56,703 INFO L272 TraceCheckUtils]: 40: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,703 INFO L290 TraceCheckUtils]: 41: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,703 INFO L290 TraceCheckUtils]: 42: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,703 INFO L290 TraceCheckUtils]: 43: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,703 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #62#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:56,703 INFO L272 TraceCheckUtils]: 45: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,703 INFO L290 TraceCheckUtils]: 46: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,703 INFO L290 TraceCheckUtils]: 47: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,703 INFO L290 TraceCheckUtils]: 48: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,704 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #64#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:56,704 INFO L272 TraceCheckUtils]: 50: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,704 INFO L290 TraceCheckUtils]: 51: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,704 INFO L290 TraceCheckUtils]: 52: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,704 INFO L290 TraceCheckUtils]: 53: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,704 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #66#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:56,705 INFO L272 TraceCheckUtils]: 55: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,705 INFO L290 TraceCheckUtils]: 56: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,705 INFO L290 TraceCheckUtils]: 57: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,705 INFO L290 TraceCheckUtils]: 58: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,705 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #68#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:56,705 INFO L272 TraceCheckUtils]: 60: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,705 INFO L290 TraceCheckUtils]: 61: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,705 INFO L290 TraceCheckUtils]: 62: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,705 INFO L290 TraceCheckUtils]: 63: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,706 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #70#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:56,706 INFO L290 TraceCheckUtils]: 65: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:17:56,707 INFO L290 TraceCheckUtils]: 66: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} assume !false; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:17:56,707 INFO L272 TraceCheckUtils]: 67: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,707 INFO L290 TraceCheckUtils]: 68: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,708 INFO L290 TraceCheckUtils]: 69: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,709 INFO L290 TraceCheckUtils]: 70: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,709 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #62#return; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:17:56,709 INFO L272 TraceCheckUtils]: 72: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,709 INFO L290 TraceCheckUtils]: 73: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,709 INFO L290 TraceCheckUtils]: 74: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,709 INFO L290 TraceCheckUtils]: 75: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,710 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #64#return; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:17:56,710 INFO L272 TraceCheckUtils]: 77: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,710 INFO L290 TraceCheckUtils]: 78: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,710 INFO L290 TraceCheckUtils]: 79: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,710 INFO L290 TraceCheckUtils]: 80: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,711 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #66#return; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:17:56,711 INFO L272 TraceCheckUtils]: 82: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,711 INFO L290 TraceCheckUtils]: 83: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,711 INFO L290 TraceCheckUtils]: 84: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,711 INFO L290 TraceCheckUtils]: 85: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,712 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #68#return; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:17:56,712 INFO L272 TraceCheckUtils]: 87: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,712 INFO L290 TraceCheckUtils]: 88: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,712 INFO L290 TraceCheckUtils]: 89: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,712 INFO L290 TraceCheckUtils]: 90: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,712 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #70#return; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:17:56,713 INFO L290 TraceCheckUtils]: 92: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11021#(and (= main_~n~0 3) (= main_~y~0 37))} is VALID [2022-04-28 11:17:56,713 INFO L290 TraceCheckUtils]: 93: Hoare triple {11021#(and (= main_~n~0 3) (= main_~y~0 37))} assume !false; {11021#(and (= main_~n~0 3) (= main_~y~0 37))} is VALID [2022-04-28 11:17:56,713 INFO L272 TraceCheckUtils]: 94: Hoare triple {11021#(and (= main_~n~0 3) (= main_~y~0 37))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:56,713 INFO L290 TraceCheckUtils]: 95: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:56,714 INFO L290 TraceCheckUtils]: 96: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:56,714 INFO L290 TraceCheckUtils]: 97: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:56,714 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10737#true} {11021#(and (= main_~n~0 3) (= main_~y~0 37))} #62#return; {11021#(and (= main_~n~0 3) (= main_~y~0 37))} is VALID [2022-04-28 11:17:56,714 INFO L272 TraceCheckUtils]: 99: Hoare triple {11021#(and (= main_~n~0 3) (= main_~y~0 37))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11043#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:56,715 INFO L290 TraceCheckUtils]: 100: Hoare triple {11043#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11047#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:56,715 INFO L290 TraceCheckUtils]: 101: Hoare triple {11047#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10738#false} is VALID [2022-04-28 11:17:56,715 INFO L290 TraceCheckUtils]: 102: Hoare triple {10738#false} assume !false; {10738#false} is VALID [2022-04-28 11:17:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 11:17:56,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:57,086 INFO L290 TraceCheckUtils]: 102: Hoare triple {10738#false} assume !false; {10738#false} is VALID [2022-04-28 11:17:57,086 INFO L290 TraceCheckUtils]: 101: Hoare triple {11047#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10738#false} is VALID [2022-04-28 11:17:57,087 INFO L290 TraceCheckUtils]: 100: Hoare triple {11043#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11047#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:57,087 INFO L272 TraceCheckUtils]: 99: Hoare triple {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11043#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:57,088 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10737#true} {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:17:57,088 INFO L290 TraceCheckUtils]: 97: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,088 INFO L290 TraceCheckUtils]: 96: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,088 INFO L290 TraceCheckUtils]: 95: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,088 INFO L272 TraceCheckUtils]: 94: Hoare triple {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,088 INFO L290 TraceCheckUtils]: 93: Hoare triple {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:17:57,092 INFO L290 TraceCheckUtils]: 92: Hoare triple {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:17:57,093 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {10737#true} {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #70#return; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:17:57,093 INFO L290 TraceCheckUtils]: 90: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,093 INFO L290 TraceCheckUtils]: 89: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,093 INFO L290 TraceCheckUtils]: 88: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,093 INFO L272 TraceCheckUtils]: 87: Hoare triple {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,093 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10737#true} {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #68#return; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:17:57,094 INFO L290 TraceCheckUtils]: 85: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,094 INFO L290 TraceCheckUtils]: 84: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,094 INFO L290 TraceCheckUtils]: 83: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,094 INFO L272 TraceCheckUtils]: 82: Hoare triple {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,094 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10737#true} {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #66#return; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:17:57,094 INFO L290 TraceCheckUtils]: 80: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,094 INFO L290 TraceCheckUtils]: 79: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,094 INFO L290 TraceCheckUtils]: 78: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,094 INFO L272 TraceCheckUtils]: 77: Hoare triple {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,095 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10737#true} {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #64#return; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:17:57,095 INFO L290 TraceCheckUtils]: 75: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,095 INFO L290 TraceCheckUtils]: 74: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,095 INFO L290 TraceCheckUtils]: 73: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,095 INFO L272 TraceCheckUtils]: 72: Hoare triple {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,095 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10737#true} {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #62#return; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:17:57,095 INFO L290 TraceCheckUtils]: 70: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,096 INFO L290 TraceCheckUtils]: 69: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,096 INFO L290 TraceCheckUtils]: 68: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,096 INFO L272 TraceCheckUtils]: 67: Hoare triple {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,096 INFO L290 TraceCheckUtils]: 66: Hoare triple {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !false; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:17:57,100 INFO L290 TraceCheckUtils]: 65: Hoare triple {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:17:57,101 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10737#true} {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #70#return; {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:17:57,101 INFO L290 TraceCheckUtils]: 63: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,101 INFO L290 TraceCheckUtils]: 62: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,101 INFO L290 TraceCheckUtils]: 61: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,101 INFO L272 TraceCheckUtils]: 60: Hoare triple {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,101 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10737#true} {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #68#return; {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:17:57,102 INFO L290 TraceCheckUtils]: 58: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,102 INFO L290 TraceCheckUtils]: 56: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,102 INFO L272 TraceCheckUtils]: 55: Hoare triple {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,102 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10737#true} {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #66#return; {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:17:57,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,102 INFO L272 TraceCheckUtils]: 50: Hoare triple {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,103 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10737#true} {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #64#return; {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:17:57,103 INFO L290 TraceCheckUtils]: 48: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,103 INFO L290 TraceCheckUtils]: 47: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,103 INFO L290 TraceCheckUtils]: 46: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,103 INFO L272 TraceCheckUtils]: 45: Hoare triple {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,104 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10737#true} {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #62#return; {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:17:57,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,104 INFO L272 TraceCheckUtils]: 40: Hoare triple {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} assume !false; {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:17:57,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:17:57,108 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10737#true} {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} #70#return; {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} is VALID [2022-04-28 11:17:57,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,109 INFO L290 TraceCheckUtils]: 35: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,109 INFO L272 TraceCheckUtils]: 33: Hoare triple {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,109 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10737#true} {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} #68#return; {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} is VALID [2022-04-28 11:17:57,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,109 INFO L272 TraceCheckUtils]: 28: Hoare triple {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,110 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10737#true} {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} #66#return; {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} is VALID [2022-04-28 11:17:57,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,110 INFO L272 TraceCheckUtils]: 23: Hoare triple {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,111 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10737#true} {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} #64#return; {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} is VALID [2022-04-28 11:17:57,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,111 INFO L272 TraceCheckUtils]: 18: Hoare triple {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,111 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10737#true} {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} #62#return; {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} is VALID [2022-04-28 11:17:57,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,111 INFO L272 TraceCheckUtils]: 13: Hoare triple {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} assume !false; {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} is VALID [2022-04-28 11:17:57,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {10737#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} is VALID [2022-04-28 11:17:57,112 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10737#true} {10737#true} #60#return; {10737#true} is VALID [2022-04-28 11:17:57,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:17:57,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:17:57,113 INFO L272 TraceCheckUtils]: 6: Hoare triple {10737#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:17:57,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {10737#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {10737#true} is VALID [2022-04-28 11:17:57,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {10737#true} call #t~ret5 := main(); {10737#true} is VALID [2022-04-28 11:17:57,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10737#true} {10737#true} #84#return; {10737#true} is VALID [2022-04-28 11:17:57,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:17:57,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {10737#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10737#true} is VALID [2022-04-28 11:17:57,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {10737#true} call ULTIMATE.init(); {10737#true} is VALID [2022-04-28 11:17:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 11:17:57,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:57,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292241760] [2022-04-28 11:17:57,113 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:57,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315277794] [2022-04-28 11:17:57,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315277794] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:17:57,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:17:57,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-28 11:17:57,114 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:57,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1472424025] [2022-04-28 11:17:57,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1472424025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:57,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:57,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:17:57,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025196804] [2022-04-28 11:17:57,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:57,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 103 [2022-04-28 11:17:57,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:57,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:17:57,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:57,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:17:57,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:57,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:17:57,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:17:57,162 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:17:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:58,087 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2022-04-28 11:17:58,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:17:58,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 103 [2022-04-28 11:17:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:17:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2022-04-28 11:17:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:17:58,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2022-04-28 11:17:58,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 112 transitions. [2022-04-28 11:17:58,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:58,155 INFO L225 Difference]: With dead ends: 142 [2022-04-28 11:17:58,155 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 11:17:58,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:17:58,156 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 7 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:58,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 270 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 11:17:58,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 11:17:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-04-28 11:17:58,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:58,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:17:58,208 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:17:58,208 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:17:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:58,229 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2022-04-28 11:17:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2022-04-28 11:17:58,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:58,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:58,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 140 states. [2022-04-28 11:17:58,230 INFO L87 Difference]: Start difference. First operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 140 states. [2022-04-28 11:17:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:58,234 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2022-04-28 11:17:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2022-04-28 11:17:58,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:58,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:58,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:58,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:17:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2022-04-28 11:17:58,237 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 103 [2022-04-28 11:17:58,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:58,237 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2022-04-28 11:17:58,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:17:58,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 142 transitions. [2022-04-28 11:17:58,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-04-28 11:17:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 11:17:58,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:58,418 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:17:58,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 11:17:58,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 11:17:58,619 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:58,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 3 times [2022-04-28 11:17:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:58,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [487046939] [2022-04-28 11:17:58,858 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:58,859 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:58,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 4 times [2022-04-28 11:17:58,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:58,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856569057] [2022-04-28 11:17:58,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:58,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:58,866 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:58,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1483962133] [2022-04-28 11:17:58,866 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:17:58,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:58,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:58,867 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:17:58,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 11:17:58,928 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:17:58,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:58,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 11:17:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:58,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:59,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {12192#true} call ULTIMATE.init(); {12192#true} is VALID [2022-04-28 11:17:59,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {12192#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12192#true} is VALID [2022-04-28 11:17:59,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12192#true} {12192#true} #84#return; {12192#true} is VALID [2022-04-28 11:17:59,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {12192#true} call #t~ret5 := main(); {12192#true} is VALID [2022-04-28 11:17:59,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {12192#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {12192#true} is VALID [2022-04-28 11:17:59,580 INFO L272 TraceCheckUtils]: 6: Hoare triple {12192#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,580 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12192#true} {12192#true} #60#return; {12192#true} is VALID [2022-04-28 11:17:59,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {12192#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:59,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:59,581 INFO L272 TraceCheckUtils]: 13: Hoare triple {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,591 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12192#true} {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:59,591 INFO L272 TraceCheckUtils]: 18: Hoare triple {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,591 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12192#true} {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:59,591 INFO L272 TraceCheckUtils]: 23: Hoare triple {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,592 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12192#true} {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:59,592 INFO L272 TraceCheckUtils]: 28: Hoare triple {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,592 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12192#true} {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:59,592 INFO L272 TraceCheckUtils]: 33: Hoare triple {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,593 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12192#true} {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:17:59,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:59,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !false; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:59,594 INFO L272 TraceCheckUtils]: 40: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,594 INFO L290 TraceCheckUtils]: 41: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,594 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {12192#true} {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #62#return; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:59,594 INFO L272 TraceCheckUtils]: 45: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,594 INFO L290 TraceCheckUtils]: 46: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,594 INFO L290 TraceCheckUtils]: 47: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,594 INFO L290 TraceCheckUtils]: 48: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,595 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {12192#true} {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #64#return; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:59,595 INFO L272 TraceCheckUtils]: 50: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,595 INFO L290 TraceCheckUtils]: 51: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,595 INFO L290 TraceCheckUtils]: 53: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,595 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12192#true} {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #66#return; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:59,595 INFO L272 TraceCheckUtils]: 55: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,595 INFO L290 TraceCheckUtils]: 57: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,595 INFO L290 TraceCheckUtils]: 58: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,596 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12192#true} {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #68#return; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:59,596 INFO L272 TraceCheckUtils]: 60: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,596 INFO L290 TraceCheckUtils]: 61: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,596 INFO L290 TraceCheckUtils]: 62: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,596 INFO L290 TraceCheckUtils]: 63: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,596 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12192#true} {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #70#return; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:17:59,597 INFO L290 TraceCheckUtils]: 65: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:17:59,597 INFO L290 TraceCheckUtils]: 66: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} assume !false; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:17:59,597 INFO L272 TraceCheckUtils]: 67: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,597 INFO L290 TraceCheckUtils]: 68: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,597 INFO L290 TraceCheckUtils]: 69: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,597 INFO L290 TraceCheckUtils]: 70: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,598 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12192#true} {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} #62#return; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:17:59,598 INFO L272 TraceCheckUtils]: 72: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,598 INFO L290 TraceCheckUtils]: 73: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,598 INFO L290 TraceCheckUtils]: 74: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,598 INFO L290 TraceCheckUtils]: 75: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,598 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12192#true} {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} #64#return; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:17:59,598 INFO L272 TraceCheckUtils]: 77: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,598 INFO L290 TraceCheckUtils]: 78: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,598 INFO L290 TraceCheckUtils]: 79: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,599 INFO L290 TraceCheckUtils]: 80: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,599 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {12192#true} {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} #66#return; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:17:59,599 INFO L272 TraceCheckUtils]: 82: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,599 INFO L290 TraceCheckUtils]: 83: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,599 INFO L290 TraceCheckUtils]: 84: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,599 INFO L290 TraceCheckUtils]: 85: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,599 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {12192#true} {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} #68#return; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:17:59,600 INFO L272 TraceCheckUtils]: 87: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,600 INFO L290 TraceCheckUtils]: 88: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,600 INFO L290 TraceCheckUtils]: 89: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,600 INFO L290 TraceCheckUtils]: 90: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,601 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {12192#true} {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} #70#return; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:17:59,601 INFO L290 TraceCheckUtils]: 92: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} assume !(~n~0 <= ~a~0); {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} is VALID [2022-04-28 11:17:59,601 INFO L272 TraceCheckUtils]: 93: Hoare triple {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,601 INFO L290 TraceCheckUtils]: 94: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,601 INFO L290 TraceCheckUtils]: 95: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,602 INFO L290 TraceCheckUtils]: 96: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,602 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {12192#true} {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} #72#return; {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} is VALID [2022-04-28 11:17:59,602 INFO L272 TraceCheckUtils]: 98: Hoare triple {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:17:59,602 INFO L290 TraceCheckUtils]: 99: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:17:59,602 INFO L290 TraceCheckUtils]: 100: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:17:59,602 INFO L290 TraceCheckUtils]: 101: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:17:59,602 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {12192#true} {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} #74#return; {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} is VALID [2022-04-28 11:17:59,604 INFO L272 TraceCheckUtils]: 103: Hoare triple {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {12510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:59,604 INFO L290 TraceCheckUtils]: 104: Hoare triple {12510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:59,604 INFO L290 TraceCheckUtils]: 105: Hoare triple {12514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12193#false} is VALID [2022-04-28 11:17:59,604 INFO L290 TraceCheckUtils]: 106: Hoare triple {12193#false} assume !false; {12193#false} is VALID [2022-04-28 11:17:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 11:17:59,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:05,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:05,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856569057] [2022-04-28 11:18:05,648 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:05,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483962133] [2022-04-28 11:18:05,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483962133] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:18:05,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:18:05,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 11:18:05,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:05,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [487046939] [2022-04-28 11:18:05,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [487046939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:05,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:05,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:18:05,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900720616] [2022-04-28 11:18:05,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:05,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-28 11:18:05,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:05,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:18:05,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:05,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:18:05,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:05,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:18:05,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:18:05,698 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:18:06,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:06,433 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-04-28 11:18:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:18:06,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-28 11:18:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:18:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:18:06,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:18:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:18:06,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-04-28 11:18:06,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:06,511 INFO L225 Difference]: With dead ends: 136 [2022-04-28 11:18:06,511 INFO L226 Difference]: Without dead ends: 123 [2022-04-28 11:18:06,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:18:06,511 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:18:06,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:18:06,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-28 11:18:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-04-28 11:18:06,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:06,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:18:06,577 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:18:06,577 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:18:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:06,579 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-04-28 11:18:06,579 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:18:06,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:06,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:06,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 123 states. [2022-04-28 11:18:06,580 INFO L87 Difference]: Start difference. First operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 123 states. [2022-04-28 11:18:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:06,581 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-04-28 11:18:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:18:06,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:06,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:06,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:06,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:18:06,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-04-28 11:18:06,584 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 107 [2022-04-28 11:18:06,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:06,584 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-04-28 11:18:06,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:18:06,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 133 transitions. [2022-04-28 11:18:06,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:18:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 11:18:06,729 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:06,730 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:18:06,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 11:18:06,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:06,930 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:06,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:06,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1388085622, now seen corresponding path program 15 times [2022-04-28 11:18:06,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:06,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2076366124] [2022-04-28 11:18:07,178 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:07,178 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:07,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1388085622, now seen corresponding path program 16 times [2022-04-28 11:18:07,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:07,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985490321] [2022-04-28 11:18:07,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:07,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:07,190 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:07,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394399796] [2022-04-28 11:18:07,190 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:18:07,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:07,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:07,191 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:18:07,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 11:18:07,235 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:18:07,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:07,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 11:18:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:07,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:07,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {13420#true} call ULTIMATE.init(); {13420#true} is VALID [2022-04-28 11:18:07,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {13420#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13420#true} is VALID [2022-04-28 11:18:07,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13420#true} {13420#true} #84#return; {13420#true} is VALID [2022-04-28 11:18:07,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {13420#true} call #t~ret5 := main(); {13420#true} is VALID [2022-04-28 11:18:07,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {13420#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {13420#true} is VALID [2022-04-28 11:18:07,608 INFO L272 TraceCheckUtils]: 6: Hoare triple {13420#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,608 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13420#true} {13420#true} #60#return; {13420#true} is VALID [2022-04-28 11:18:07,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {13420#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:07,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:07,609 INFO L272 TraceCheckUtils]: 13: Hoare triple {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,609 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13420#true} {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:07,609 INFO L272 TraceCheckUtils]: 18: Hoare triple {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,610 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13420#true} {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:07,610 INFO L272 TraceCheckUtils]: 23: Hoare triple {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,610 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13420#true} {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:07,610 INFO L272 TraceCheckUtils]: 28: Hoare triple {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,611 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13420#true} {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:07,611 INFO L272 TraceCheckUtils]: 33: Hoare triple {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,611 INFO L290 TraceCheckUtils]: 36: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,612 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13420#true} {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:07,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:18:07,612 INFO L290 TraceCheckUtils]: 39: Hoare triple {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} assume !false; {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:18:07,613 INFO L272 TraceCheckUtils]: 40: Hoare triple {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,613 INFO L290 TraceCheckUtils]: 42: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,613 INFO L290 TraceCheckUtils]: 43: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,613 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13420#true} {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #62#return; {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:18:07,613 INFO L272 TraceCheckUtils]: 45: Hoare triple {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,613 INFO L290 TraceCheckUtils]: 47: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,613 INFO L290 TraceCheckUtils]: 48: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,614 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13420#true} {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #64#return; {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:18:07,614 INFO L272 TraceCheckUtils]: 50: Hoare triple {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,614 INFO L290 TraceCheckUtils]: 51: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,614 INFO L290 TraceCheckUtils]: 52: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,614 INFO L290 TraceCheckUtils]: 53: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,614 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13420#true} {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #66#return; {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:18:07,614 INFO L272 TraceCheckUtils]: 55: Hoare triple {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,615 INFO L290 TraceCheckUtils]: 56: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,615 INFO L290 TraceCheckUtils]: 57: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,615 INFO L290 TraceCheckUtils]: 58: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,615 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13420#true} {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #68#return; {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:18:07,615 INFO L272 TraceCheckUtils]: 60: Hoare triple {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,615 INFO L290 TraceCheckUtils]: 61: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,615 INFO L290 TraceCheckUtils]: 62: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,615 INFO L290 TraceCheckUtils]: 63: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,616 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13420#true} {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #70#return; {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:18:07,616 INFO L290 TraceCheckUtils]: 65: Hoare triple {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:18:07,616 INFO L290 TraceCheckUtils]: 66: Hoare triple {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} assume !false; {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:18:07,616 INFO L272 TraceCheckUtils]: 67: Hoare triple {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,617 INFO L290 TraceCheckUtils]: 68: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,617 INFO L290 TraceCheckUtils]: 69: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,617 INFO L290 TraceCheckUtils]: 70: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,617 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13420#true} {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} #62#return; {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:18:07,617 INFO L272 TraceCheckUtils]: 72: Hoare triple {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,617 INFO L290 TraceCheckUtils]: 73: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,617 INFO L290 TraceCheckUtils]: 74: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,617 INFO L290 TraceCheckUtils]: 75: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,618 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13420#true} {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} #64#return; {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:18:07,618 INFO L272 TraceCheckUtils]: 77: Hoare triple {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,618 INFO L290 TraceCheckUtils]: 78: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,618 INFO L290 TraceCheckUtils]: 79: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,618 INFO L290 TraceCheckUtils]: 80: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,618 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13420#true} {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} #66#return; {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:18:07,618 INFO L272 TraceCheckUtils]: 82: Hoare triple {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,618 INFO L290 TraceCheckUtils]: 83: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,618 INFO L290 TraceCheckUtils]: 84: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,619 INFO L290 TraceCheckUtils]: 85: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,619 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13420#true} {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} #68#return; {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:18:07,619 INFO L272 TraceCheckUtils]: 87: Hoare triple {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,619 INFO L290 TraceCheckUtils]: 88: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,619 INFO L290 TraceCheckUtils]: 89: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,619 INFO L290 TraceCheckUtils]: 90: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,620 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {13420#true} {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} #70#return; {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:18:07,620 INFO L290 TraceCheckUtils]: 92: Hoare triple {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13704#(and (= main_~n~0 3) (= main_~x~0 27))} is VALID [2022-04-28 11:18:07,620 INFO L290 TraceCheckUtils]: 93: Hoare triple {13704#(and (= main_~n~0 3) (= main_~x~0 27))} assume !false; {13704#(and (= main_~n~0 3) (= main_~x~0 27))} is VALID [2022-04-28 11:18:07,620 INFO L272 TraceCheckUtils]: 94: Hoare triple {13704#(and (= main_~n~0 3) (= main_~x~0 27))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,620 INFO L290 TraceCheckUtils]: 95: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,620 INFO L290 TraceCheckUtils]: 96: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,620 INFO L290 TraceCheckUtils]: 97: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,621 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {13420#true} {13704#(and (= main_~n~0 3) (= main_~x~0 27))} #62#return; {13704#(and (= main_~n~0 3) (= main_~x~0 27))} is VALID [2022-04-28 11:18:07,621 INFO L272 TraceCheckUtils]: 99: Hoare triple {13704#(and (= main_~n~0 3) (= main_~x~0 27))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,621 INFO L290 TraceCheckUtils]: 100: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,621 INFO L290 TraceCheckUtils]: 101: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,621 INFO L290 TraceCheckUtils]: 102: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,621 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {13420#true} {13704#(and (= main_~n~0 3) (= main_~x~0 27))} #64#return; {13704#(and (= main_~n~0 3) (= main_~x~0 27))} is VALID [2022-04-28 11:18:07,622 INFO L272 TraceCheckUtils]: 104: Hoare triple {13704#(and (= main_~n~0 3) (= main_~x~0 27))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13741#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:07,622 INFO L290 TraceCheckUtils]: 105: Hoare triple {13741#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13745#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:07,622 INFO L290 TraceCheckUtils]: 106: Hoare triple {13745#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13421#false} is VALID [2022-04-28 11:18:07,622 INFO L290 TraceCheckUtils]: 107: Hoare triple {13421#false} assume !false; {13421#false} is VALID [2022-04-28 11:18:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 34 proven. 33 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 11:18:07,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:07,913 INFO L290 TraceCheckUtils]: 107: Hoare triple {13421#false} assume !false; {13421#false} is VALID [2022-04-28 11:18:07,914 INFO L290 TraceCheckUtils]: 106: Hoare triple {13745#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13421#false} is VALID [2022-04-28 11:18:07,914 INFO L290 TraceCheckUtils]: 105: Hoare triple {13741#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13745#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:07,914 INFO L272 TraceCheckUtils]: 104: Hoare triple {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13741#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:07,915 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {13420#true} {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:07,915 INFO L290 TraceCheckUtils]: 102: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,915 INFO L290 TraceCheckUtils]: 101: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,915 INFO L290 TraceCheckUtils]: 100: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,915 INFO L272 TraceCheckUtils]: 99: Hoare triple {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,915 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {13420#true} {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:07,915 INFO L290 TraceCheckUtils]: 97: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,915 INFO L290 TraceCheckUtils]: 96: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,915 INFO L290 TraceCheckUtils]: 95: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,915 INFO L272 TraceCheckUtils]: 94: Hoare triple {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,915 INFO L290 TraceCheckUtils]: 93: Hoare triple {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:07,917 INFO L290 TraceCheckUtils]: 92: Hoare triple {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:07,918 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {13420#true} {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:07,918 INFO L290 TraceCheckUtils]: 90: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,918 INFO L290 TraceCheckUtils]: 89: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,918 INFO L290 TraceCheckUtils]: 88: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,918 INFO L272 TraceCheckUtils]: 87: Hoare triple {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,918 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13420#true} {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:07,918 INFO L290 TraceCheckUtils]: 85: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,918 INFO L290 TraceCheckUtils]: 84: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,918 INFO L290 TraceCheckUtils]: 83: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,918 INFO L272 TraceCheckUtils]: 82: Hoare triple {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,919 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13420#true} {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:07,919 INFO L290 TraceCheckUtils]: 80: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,919 INFO L290 TraceCheckUtils]: 79: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,919 INFO L290 TraceCheckUtils]: 78: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,919 INFO L272 TraceCheckUtils]: 77: Hoare triple {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,919 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13420#true} {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:07,919 INFO L290 TraceCheckUtils]: 75: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,919 INFO L290 TraceCheckUtils]: 74: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,919 INFO L290 TraceCheckUtils]: 73: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,919 INFO L272 TraceCheckUtils]: 72: Hoare triple {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,920 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13420#true} {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:07,920 INFO L290 TraceCheckUtils]: 70: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,920 INFO L290 TraceCheckUtils]: 69: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,920 INFO L290 TraceCheckUtils]: 68: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,920 INFO L272 TraceCheckUtils]: 67: Hoare triple {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,920 INFO L290 TraceCheckUtils]: 66: Hoare triple {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:07,923 INFO L290 TraceCheckUtils]: 65: Hoare triple {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:07,923 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13420#true} {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:18:07,923 INFO L290 TraceCheckUtils]: 63: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,923 INFO L290 TraceCheckUtils]: 62: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,923 INFO L290 TraceCheckUtils]: 61: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,923 INFO L272 TraceCheckUtils]: 60: Hoare triple {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,923 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13420#true} {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:18:07,923 INFO L290 TraceCheckUtils]: 58: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,923 INFO L290 TraceCheckUtils]: 57: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,924 INFO L272 TraceCheckUtils]: 55: Hoare triple {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,924 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13420#true} {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:18:07,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,924 INFO L290 TraceCheckUtils]: 51: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,924 INFO L272 TraceCheckUtils]: 50: Hoare triple {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,924 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13420#true} {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:18:07,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,925 INFO L290 TraceCheckUtils]: 46: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,925 INFO L272 TraceCheckUtils]: 45: Hoare triple {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,925 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13420#true} {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:18:07,925 INFO L290 TraceCheckUtils]: 43: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,925 INFO L272 TraceCheckUtils]: 40: Hoare triple {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:18:07,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:18:07,929 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13420#true} {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #70#return; {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:18:07,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,929 INFO L272 TraceCheckUtils]: 33: Hoare triple {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,929 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13420#true} {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #68#return; {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:18:07,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,929 INFO L272 TraceCheckUtils]: 28: Hoare triple {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,930 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13420#true} {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #66#return; {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:18:07,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,930 INFO L272 TraceCheckUtils]: 23: Hoare triple {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,930 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13420#true} {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #64#return; {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:18:07,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,930 INFO L272 TraceCheckUtils]: 18: Hoare triple {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,931 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13420#true} {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #62#return; {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:18:07,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,931 INFO L272 TraceCheckUtils]: 13: Hoare triple {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} assume !false; {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:18:07,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {13420#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:18:07,932 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13420#true} {13420#true} #60#return; {13420#true} is VALID [2022-04-28 11:18:07,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:18:07,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:18:07,933 INFO L272 TraceCheckUtils]: 6: Hoare triple {13420#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:18:07,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {13420#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {13420#true} is VALID [2022-04-28 11:18:07,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {13420#true} call #t~ret5 := main(); {13420#true} is VALID [2022-04-28 11:18:07,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13420#true} {13420#true} #84#return; {13420#true} is VALID [2022-04-28 11:18:07,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:18:07,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {13420#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13420#true} is VALID [2022-04-28 11:18:07,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {13420#true} call ULTIMATE.init(); {13420#true} is VALID [2022-04-28 11:18:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 34 proven. 33 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 11:18:07,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:07,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985490321] [2022-04-28 11:18:07,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:07,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394399796] [2022-04-28 11:18:07,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394399796] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:18:07,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:18:07,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-28 11:18:07,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:07,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2076366124] [2022-04-28 11:18:07,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2076366124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:07,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:07,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:18:07,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172510856] [2022-04-28 11:18:07,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:07,934 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 108 [2022-04-28 11:18:07,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:07,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:18:07,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:07,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:18:07,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:07,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:18:07,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:18:07,974 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:18:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:09,425 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2022-04-28 11:18:09,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:18:09,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 108 [2022-04-28 11:18:09,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:18:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2022-04-28 11:18:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:18:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2022-04-28 11:18:09,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 106 transitions. [2022-04-28 11:18:09,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:09,539 INFO L225 Difference]: With dead ends: 139 [2022-04-28 11:18:09,539 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 11:18:09,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:18:09,540 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:18:09,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 259 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 11:18:09,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 11:18:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2022-04-28 11:18:09,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:09,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:18:09,614 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:18:09,614 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:18:09,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:09,619 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-04-28 11:18:09,619 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2022-04-28 11:18:09,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:09,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:09,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 137 states. [2022-04-28 11:18:09,619 INFO L87 Difference]: Start difference. First operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 137 states. [2022-04-28 11:18:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:09,621 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-04-28 11:18:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2022-04-28 11:18:09,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:09,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:09,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:09,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:18:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2022-04-28 11:18:09,624 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 108 [2022-04-28 11:18:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:09,624 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2022-04-28 11:18:09,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:18:09,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 138 transitions. [2022-04-28 11:18:09,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:09,819 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2022-04-28 11:18:09,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 11:18:09,820 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:09,820 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:18:09,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 11:18:10,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 11:18:10,037 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash 34642523, now seen corresponding path program 17 times [2022-04-28 11:18:10,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:10,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [689119704] [2022-04-28 11:18:10,276 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:10,276 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash 34642523, now seen corresponding path program 18 times [2022-04-28 11:18:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:10,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642027669] [2022-04-28 11:18:10,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:10,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:10,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:10,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [697519549] [2022-04-28 11:18:10,291 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:18:10,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:10,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:10,292 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:18:10,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 11:18:10,889 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:18:10,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:10,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 11:18:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:10,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:18,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {14889#true} call ULTIMATE.init(); {14889#true} is VALID [2022-04-28 11:18:18,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {14889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14889#true} {14889#true} #84#return; {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {14889#true} call #t~ret5 := main(); {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {14889#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L272 TraceCheckUtils]: 6: Hoare triple {14889#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14889#true} {14889#true} #60#return; {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {14889#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {14889#true} assume !false; {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L272 TraceCheckUtils]: 13: Hoare triple {14889#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14889#true} {14889#true} #62#return; {14889#true} is VALID [2022-04-28 11:18:18,314 INFO L272 TraceCheckUtils]: 18: Hoare triple {14889#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14889#true} {14889#true} #64#return; {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L272 TraceCheckUtils]: 23: Hoare triple {14889#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14889#true} {14889#true} #66#return; {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L272 TraceCheckUtils]: 28: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14889#true} {14889#true} #68#return; {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L272 TraceCheckUtils]: 33: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14889#true} {14889#true} #70#return; {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {14889#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {14889#true} assume !false; {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L272 TraceCheckUtils]: 40: Hoare triple {14889#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14889#true} {14889#true} #62#return; {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L272 TraceCheckUtils]: 45: Hoare triple {14889#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14889#true} {14889#true} #64#return; {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L272 TraceCheckUtils]: 50: Hoare triple {14889#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L290 TraceCheckUtils]: 51: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L290 TraceCheckUtils]: 52: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L290 TraceCheckUtils]: 53: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14889#true} {14889#true} #66#return; {14889#true} is VALID [2022-04-28 11:18:18,316 INFO L272 TraceCheckUtils]: 55: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L290 TraceCheckUtils]: 56: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14889#true} {14889#true} #68#return; {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L272 TraceCheckUtils]: 60: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L290 TraceCheckUtils]: 61: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L290 TraceCheckUtils]: 62: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L290 TraceCheckUtils]: 63: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14889#true} {14889#true} #70#return; {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L290 TraceCheckUtils]: 65: Hoare triple {14889#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L290 TraceCheckUtils]: 66: Hoare triple {14889#true} assume !false; {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L272 TraceCheckUtils]: 67: Hoare triple {14889#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L290 TraceCheckUtils]: 68: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L290 TraceCheckUtils]: 69: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L290 TraceCheckUtils]: 70: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {14889#true} {14889#true} #62#return; {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L272 TraceCheckUtils]: 72: Hoare triple {14889#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L290 TraceCheckUtils]: 73: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,317 INFO L290 TraceCheckUtils]: 74: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,318 INFO L290 TraceCheckUtils]: 75: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,318 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14889#true} {14889#true} #64#return; {14889#true} is VALID [2022-04-28 11:18:18,318 INFO L272 TraceCheckUtils]: 77: Hoare triple {14889#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,318 INFO L290 TraceCheckUtils]: 78: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,318 INFO L290 TraceCheckUtils]: 79: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,318 INFO L290 TraceCheckUtils]: 80: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,318 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14889#true} {14889#true} #66#return; {14889#true} is VALID [2022-04-28 11:18:18,318 INFO L272 TraceCheckUtils]: 82: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,318 INFO L290 TraceCheckUtils]: 83: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,318 INFO L290 TraceCheckUtils]: 84: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,318 INFO L290 TraceCheckUtils]: 85: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,318 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {14889#true} {14889#true} #68#return; {14889#true} is VALID [2022-04-28 11:18:18,318 INFO L272 TraceCheckUtils]: 87: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,321 INFO L290 TraceCheckUtils]: 88: Hoare triple {14889#true} ~cond := #in~cond; {15158#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:18,321 INFO L290 TraceCheckUtils]: 89: Hoare triple {15158#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:18,322 INFO L290 TraceCheckUtils]: 90: Hoare triple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:18,322 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} {14889#true} #70#return; {15169#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:18:18,324 INFO L290 TraceCheckUtils]: 92: Hoare triple {15169#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {15169#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:18:18,325 INFO L290 TraceCheckUtils]: 93: Hoare triple {15169#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} assume !false; {15169#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:18:18,325 INFO L272 TraceCheckUtils]: 94: Hoare triple {15169#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,325 INFO L290 TraceCheckUtils]: 95: Hoare triple {14889#true} ~cond := #in~cond; {15158#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:18,325 INFO L290 TraceCheckUtils]: 96: Hoare triple {15158#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:18,326 INFO L290 TraceCheckUtils]: 97: Hoare triple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:18,326 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} {15169#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} #62#return; {15191#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:18:18,326 INFO L272 TraceCheckUtils]: 99: Hoare triple {15191#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,326 INFO L290 TraceCheckUtils]: 100: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:18:18,326 INFO L290 TraceCheckUtils]: 101: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:18:18,326 INFO L290 TraceCheckUtils]: 102: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:18:18,327 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {14889#true} {15191#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} #64#return; {15191#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:18:18,327 INFO L272 TraceCheckUtils]: 104: Hoare triple {15191#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:18:18,327 INFO L290 TraceCheckUtils]: 105: Hoare triple {14889#true} ~cond := #in~cond; {15158#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:18,327 INFO L290 TraceCheckUtils]: 106: Hoare triple {15158#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:18,328 INFO L290 TraceCheckUtils]: 107: Hoare triple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:18,330 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} {15191#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} #66#return; {15222#(and (= main_~x~0 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:18:20,333 WARN L272 TraceCheckUtils]: 109: Hoare triple {15222#(and (= main_~x~0 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15226#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-28 11:18:20,333 INFO L290 TraceCheckUtils]: 110: Hoare triple {15226#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15230#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:20,333 INFO L290 TraceCheckUtils]: 111: Hoare triple {15230#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14890#false} is VALID [2022-04-28 11:18:20,334 INFO L290 TraceCheckUtils]: 112: Hoare triple {14890#false} assume !false; {14890#false} is VALID [2022-04-28 11:18:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 179 proven. 9 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-28 11:18:20,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:46,150 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_div_main_~z~0_17 Int)) (let ((.cse0 (div (+ (- 6) (* 6 aux_div_main_~z~0_17)) 6))) (= (+ (* 42 .cse0) (* (* .cse0 .cse0 .cse0) 18) (* (* .cse0 .cse0) 54)) (+ (* 6 (* .cse0 (+ (* (- 3) aux_div_main_~z~0_17) (* 3 aux_div_main_~z~0_17 aux_div_main_~z~0_17) 1))) (* (* .cse0 aux_div_main_~z~0_17) 36))))) is different from false [2022-04-28 11:20:17,773 INFO L290 TraceCheckUtils]: 112: Hoare triple {14890#false} assume !false; {14890#false} is VALID [2022-04-28 11:20:17,773 INFO L290 TraceCheckUtils]: 111: Hoare triple {15230#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14890#false} is VALID [2022-04-28 11:20:17,773 INFO L290 TraceCheckUtils]: 110: Hoare triple {15226#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15230#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:17,774 INFO L272 TraceCheckUtils]: 109: Hoare triple {15246#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15226#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:20:17,775 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} {15250#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {15246#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:20:17,775 INFO L290 TraceCheckUtils]: 107: Hoare triple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:17,775 INFO L290 TraceCheckUtils]: 106: Hoare triple {15260#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:17,776 INFO L290 TraceCheckUtils]: 105: Hoare triple {14889#true} ~cond := #in~cond; {15260#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:20:17,776 INFO L272 TraceCheckUtils]: 104: Hoare triple {15250#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:17,776 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {14889#true} {15250#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {15250#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:20:17,776 INFO L290 TraceCheckUtils]: 102: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:17,776 INFO L290 TraceCheckUtils]: 101: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:17,776 INFO L290 TraceCheckUtils]: 100: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:17,776 INFO L272 TraceCheckUtils]: 99: Hoare triple {15250#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:17,777 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} {15282#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #62#return; {15250#(= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:20:17,777 INFO L290 TraceCheckUtils]: 97: Hoare triple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:17,778 INFO L290 TraceCheckUtils]: 96: Hoare triple {15260#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:17,778 INFO L290 TraceCheckUtils]: 95: Hoare triple {14889#true} ~cond := #in~cond; {15260#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:20:17,778 INFO L272 TraceCheckUtils]: 94: Hoare triple {15282#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:17,778 INFO L290 TraceCheckUtils]: 93: Hoare triple {15282#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !false; {15282#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:20:19,412 INFO L290 TraceCheckUtils]: 92: Hoare triple {15301#(or (not (= (mod main_~z~0 6) 0)) (= (+ (* (+ (* (div (+ main_~z~0 (- 6)) 6) 6) 12) (+ main_~z~0 main_~y~0)) (* (div (+ main_~z~0 (- 6)) 6) 12) 24) (+ (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 18) (* main_~y~0 12) 6 (* main_~z~0 12))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {15282#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:20:20,273 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} {14889#true} #70#return; {15301#(or (not (= (mod main_~z~0 6) 0)) (= (+ (* (+ (* (div (+ main_~z~0 (- 6)) 6) 6) 12) (+ main_~z~0 main_~y~0)) (* (div (+ main_~z~0 (- 6)) 6) 12) 24) (+ (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 18) (* main_~y~0 12) 6 (* main_~z~0 12))))} is VALID [2022-04-28 11:20:20,274 INFO L290 TraceCheckUtils]: 90: Hoare triple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:20,274 INFO L290 TraceCheckUtils]: 89: Hoare triple {15260#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:20,274 INFO L290 TraceCheckUtils]: 88: Hoare triple {14889#true} ~cond := #in~cond; {15260#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:20:20,274 INFO L272 TraceCheckUtils]: 87: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,274 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {14889#true} {14889#true} #68#return; {14889#true} is VALID [2022-04-28 11:20:20,274 INFO L290 TraceCheckUtils]: 85: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,274 INFO L290 TraceCheckUtils]: 84: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:20,274 INFO L290 TraceCheckUtils]: 83: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L272 TraceCheckUtils]: 82: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14889#true} {14889#true} #66#return; {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L290 TraceCheckUtils]: 80: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L290 TraceCheckUtils]: 79: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L290 TraceCheckUtils]: 78: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L272 TraceCheckUtils]: 77: Hoare triple {14889#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14889#true} {14889#true} #64#return; {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L290 TraceCheckUtils]: 75: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L290 TraceCheckUtils]: 74: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L290 TraceCheckUtils]: 73: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L272 TraceCheckUtils]: 72: Hoare triple {14889#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {14889#true} {14889#true} #62#return; {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L290 TraceCheckUtils]: 70: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L290 TraceCheckUtils]: 69: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L290 TraceCheckUtils]: 68: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L272 TraceCheckUtils]: 67: Hoare triple {14889#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,275 INFO L290 TraceCheckUtils]: 66: Hoare triple {14889#true} assume !false; {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L290 TraceCheckUtils]: 65: Hoare triple {14889#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14889#true} {14889#true} #70#return; {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L290 TraceCheckUtils]: 63: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L290 TraceCheckUtils]: 62: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L290 TraceCheckUtils]: 61: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L272 TraceCheckUtils]: 60: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14889#true} {14889#true} #68#return; {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L290 TraceCheckUtils]: 58: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L290 TraceCheckUtils]: 57: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L290 TraceCheckUtils]: 56: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L272 TraceCheckUtils]: 55: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14889#true} {14889#true} #66#return; {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L290 TraceCheckUtils]: 53: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L290 TraceCheckUtils]: 52: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L290 TraceCheckUtils]: 51: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L272 TraceCheckUtils]: 50: Hoare triple {14889#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,276 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14889#true} {14889#true} #64#return; {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L290 TraceCheckUtils]: 48: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L290 TraceCheckUtils]: 47: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L290 TraceCheckUtils]: 46: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L272 TraceCheckUtils]: 45: Hoare triple {14889#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14889#true} {14889#true} #62#return; {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L290 TraceCheckUtils]: 43: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L290 TraceCheckUtils]: 41: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L272 TraceCheckUtils]: 40: Hoare triple {14889#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L290 TraceCheckUtils]: 39: Hoare triple {14889#true} assume !false; {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {14889#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14889#true} {14889#true} #70#return; {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L272 TraceCheckUtils]: 33: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14889#true} {14889#true} #68#return; {14889#true} is VALID [2022-04-28 11:20:20,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L272 TraceCheckUtils]: 28: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14889#true} {14889#true} #66#return; {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L272 TraceCheckUtils]: 23: Hoare triple {14889#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14889#true} {14889#true} #64#return; {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L272 TraceCheckUtils]: 18: Hoare triple {14889#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14889#true} {14889#true} #62#return; {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:20,278 INFO L272 TraceCheckUtils]: 13: Hoare triple {14889#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {14889#true} assume !false; {14889#true} is VALID [2022-04-28 11:20:20,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {14889#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {14889#true} is VALID [2022-04-28 11:20:20,279 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14889#true} {14889#true} #60#return; {14889#true} is VALID [2022-04-28 11:20:20,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:20,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:20,279 INFO L272 TraceCheckUtils]: 6: Hoare triple {14889#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:20,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {14889#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {14889#true} is VALID [2022-04-28 11:20:20,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {14889#true} call #t~ret5 := main(); {14889#true} is VALID [2022-04-28 11:20:20,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14889#true} {14889#true} #84#return; {14889#true} is VALID [2022-04-28 11:20:20,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:20,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {14889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14889#true} is VALID [2022-04-28 11:20:20,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {14889#true} call ULTIMATE.init(); {14889#true} is VALID [2022-04-28 11:20:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 179 proven. 9 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-28 11:20:20,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:20:20,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642027669] [2022-04-28 11:20:20,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:20:20,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697519549] [2022-04-28 11:20:20,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697519549] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:20:20,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:20:20,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2022-04-28 11:20:20,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:20:20,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [689119704] [2022-04-28 11:20:20,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [689119704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:20:20,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:20:20,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:20:20,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365302916] [2022-04-28 11:20:20,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:20:20,281 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 113 [2022-04-28 11:20:20,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:20:20,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:20:22,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:22,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:20:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:22,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:20:22,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=142, Unknown=4, NotChecked=0, Total=182 [2022-04-28 11:20:22,368 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:20:30,401 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:32,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:34,405 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:36,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:38,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:42,443 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:44,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:46,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:49,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:51,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:53,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:55,788 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:57,790 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:20:59,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:21:01,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:21:05,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:21:07,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:21:09,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:21:12,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:21:14,491 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:21:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:14,501 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2022-04-28 11:21:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:21:14,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 113 [2022-04-28 11:21:14,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:21:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:21:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 11:21:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:21:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 11:21:14,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-28 11:21:18,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 54 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:18,765 INFO L225 Difference]: With dead ends: 136 [2022-04-28 11:21:18,765 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 11:21:18,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=57, Invalid=210, Unknown=5, NotChecked=0, Total=272 [2022-04-28 11:21:18,766 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 40 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:21:18,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 94 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 120 Invalid, 19 Unknown, 0 Unchecked, 40.5s Time] [2022-04-28 11:21:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 11:21:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-04-28 11:21:18,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:21:18,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 130 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 30 states have call successors, (30), 23 states have call predecessors, (30), 22 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:21:18,849 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 130 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 30 states have call successors, (30), 23 states have call predecessors, (30), 22 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:21:18,849 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 130 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 30 states have call successors, (30), 23 states have call predecessors, (30), 22 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:21:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:18,851 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-28 11:21:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-28 11:21:18,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:18,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:18,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 30 states have call successors, (30), 23 states have call predecessors, (30), 22 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 130 states. [2022-04-28 11:21:18,852 INFO L87 Difference]: Start difference. First operand has 130 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 30 states have call successors, (30), 23 states have call predecessors, (30), 22 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 130 states. [2022-04-28 11:21:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:18,853 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-28 11:21:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-28 11:21:18,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:18,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:18,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:21:18,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:21:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 77 states have (on average 1.025974025974026) internal successors, (79), 79 states have internal predecessors, (79), 30 states have call successors, (30), 23 states have call predecessors, (30), 22 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:21:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2022-04-28 11:21:18,856 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 113 [2022-04-28 11:21:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:21:18,856 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2022-04-28 11:21:18,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:21:18,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 137 transitions. [2022-04-28 11:21:21,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 136 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-28 11:21:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 11:21:21,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:21:21,287 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:21:21,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-28 11:21:21,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 11:21:21,487 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:21:21,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:21:21,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 5 times [2022-04-28 11:21:21,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:21,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1245527060] [2022-04-28 11:21:21,719 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:21:21,719 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:21:21,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 6 times [2022-04-28 11:21:21,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:21:21,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830917802] [2022-04-28 11:21:21,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:21:21,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:21:21,735 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:21:21,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1293481105] [2022-04-28 11:21:21,736 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:21:21,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:21:21,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:21:21,741 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:21:21,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 11:21:22,084 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:21:22,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:21:22,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 11:21:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:21:22,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:21:27,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {16379#true} call ULTIMATE.init(); {16379#true} is VALID [2022-04-28 11:21:27,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {16379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16379#true} is VALID [2022-04-28 11:21:27,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16379#true} {16379#true} #84#return; {16379#true} is VALID [2022-04-28 11:21:27,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {16379#true} call #t~ret5 := main(); {16379#true} is VALID [2022-04-28 11:21:27,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {16379#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {16379#true} is VALID [2022-04-28 11:21:27,580 INFO L272 TraceCheckUtils]: 6: Hoare triple {16379#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {16379#true} ~cond := #in~cond; {16405#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:21:27,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {16405#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {16409#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:21:27,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {16409#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {16409#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:21:27,581 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16409#(not (= |assume_abort_if_not_#in~cond| 0))} {16379#true} #60#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !false; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,582 INFO L272 TraceCheckUtils]: 13: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,583 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16379#true} {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #62#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,583 INFO L272 TraceCheckUtils]: 18: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,583 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16379#true} {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #64#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,583 INFO L272 TraceCheckUtils]: 23: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,584 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16379#true} {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #66#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,584 INFO L272 TraceCheckUtils]: 28: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,585 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16379#true} {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #68#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,585 INFO L272 TraceCheckUtils]: 33: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,585 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16379#true} {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #70#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !false; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,586 INFO L272 TraceCheckUtils]: 40: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,586 INFO L290 TraceCheckUtils]: 41: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,587 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16379#true} {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #62#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,587 INFO L272 TraceCheckUtils]: 45: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,587 INFO L290 TraceCheckUtils]: 48: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,587 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {16379#true} {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #64#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,587 INFO L272 TraceCheckUtils]: 50: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,587 INFO L290 TraceCheckUtils]: 51: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,587 INFO L290 TraceCheckUtils]: 53: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,590 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16379#true} {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #66#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,591 INFO L272 TraceCheckUtils]: 55: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,591 INFO L290 TraceCheckUtils]: 56: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,591 INFO L290 TraceCheckUtils]: 57: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,591 INFO L290 TraceCheckUtils]: 58: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,591 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16379#true} {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #68#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,591 INFO L272 TraceCheckUtils]: 60: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,591 INFO L290 TraceCheckUtils]: 61: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,591 INFO L290 TraceCheckUtils]: 62: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,591 INFO L290 TraceCheckUtils]: 63: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,592 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16379#true} {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #70#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,592 INFO L290 TraceCheckUtils]: 65: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,592 INFO L290 TraceCheckUtils]: 66: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !false; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,593 INFO L272 TraceCheckUtils]: 67: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,593 INFO L290 TraceCheckUtils]: 68: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,593 INFO L290 TraceCheckUtils]: 69: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,593 INFO L290 TraceCheckUtils]: 70: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,593 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16379#true} {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #62#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,593 INFO L272 TraceCheckUtils]: 72: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,593 INFO L290 TraceCheckUtils]: 73: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,593 INFO L290 TraceCheckUtils]: 74: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,593 INFO L290 TraceCheckUtils]: 75: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,594 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16379#true} {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #64#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,594 INFO L272 TraceCheckUtils]: 77: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,594 INFO L290 TraceCheckUtils]: 78: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,594 INFO L290 TraceCheckUtils]: 79: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,594 INFO L290 TraceCheckUtils]: 80: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,594 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16379#true} {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #66#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,594 INFO L272 TraceCheckUtils]: 82: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,594 INFO L290 TraceCheckUtils]: 83: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,594 INFO L290 TraceCheckUtils]: 84: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,595 INFO L290 TraceCheckUtils]: 85: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,595 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16379#true} {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #68#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,595 INFO L272 TraceCheckUtils]: 87: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,595 INFO L290 TraceCheckUtils]: 88: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,595 INFO L290 TraceCheckUtils]: 89: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,595 INFO L290 TraceCheckUtils]: 90: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,599 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {16379#true} {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #70#return; {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,601 INFO L290 TraceCheckUtils]: 92: Hoare triple {16416#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {16663#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,601 INFO L290 TraceCheckUtils]: 93: Hoare triple {16663#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (<= 0 main_~a~0))} assume !false; {16663#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,601 INFO L272 TraceCheckUtils]: 94: Hoare triple {16663#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,601 INFO L290 TraceCheckUtils]: 95: Hoare triple {16379#true} ~cond := #in~cond; {16673#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:27,602 INFO L290 TraceCheckUtils]: 96: Hoare triple {16673#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16677#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:27,602 INFO L290 TraceCheckUtils]: 97: Hoare triple {16677#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16677#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:27,602 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16677#(not (= |__VERIFIER_assert_#in~cond| 0))} {16663#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (<= 0 main_~a~0))} #62#return; {16684#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,602 INFO L272 TraceCheckUtils]: 99: Hoare triple {16684#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,603 INFO L290 TraceCheckUtils]: 100: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,603 INFO L290 TraceCheckUtils]: 101: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,603 INFO L290 TraceCheckUtils]: 102: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,603 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {16379#true} {16684#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #64#return; {16684#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,603 INFO L272 TraceCheckUtils]: 104: Hoare triple {16684#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,603 INFO L290 TraceCheckUtils]: 105: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,603 INFO L290 TraceCheckUtils]: 106: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,603 INFO L290 TraceCheckUtils]: 107: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,604 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16379#true} {16684#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #66#return; {16684#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,604 INFO L272 TraceCheckUtils]: 109: Hoare triple {16684#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,604 INFO L290 TraceCheckUtils]: 110: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,604 INFO L290 TraceCheckUtils]: 111: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,604 INFO L290 TraceCheckUtils]: 112: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,604 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {16379#true} {16684#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #68#return; {16684#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,605 INFO L272 TraceCheckUtils]: 114: Hoare triple {16684#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,605 INFO L290 TraceCheckUtils]: 115: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,605 INFO L290 TraceCheckUtils]: 116: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,605 INFO L290 TraceCheckUtils]: 117: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,605 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {16379#true} {16684#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #70#return; {16684#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:27,606 INFO L290 TraceCheckUtils]: 119: Hoare triple {16684#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} assume !(~n~0 <= ~a~0); {16748#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:21:27,606 INFO L272 TraceCheckUtils]: 120: Hoare triple {16748#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16379#true} is VALID [2022-04-28 11:21:27,606 INFO L290 TraceCheckUtils]: 121: Hoare triple {16379#true} ~cond := #in~cond; {16379#true} is VALID [2022-04-28 11:21:27,606 INFO L290 TraceCheckUtils]: 122: Hoare triple {16379#true} assume !(0 == ~cond); {16379#true} is VALID [2022-04-28 11:21:27,606 INFO L290 TraceCheckUtils]: 123: Hoare triple {16379#true} assume true; {16379#true} is VALID [2022-04-28 11:21:27,607 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16379#true} {16748#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #72#return; {16748#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:21:27,845 INFO L272 TraceCheckUtils]: 125: Hoare triple {16748#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {16767#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:21:27,846 INFO L290 TraceCheckUtils]: 126: Hoare triple {16767#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16771#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:27,846 INFO L290 TraceCheckUtils]: 127: Hoare triple {16771#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16380#false} is VALID [2022-04-28 11:21:27,846 INFO L290 TraceCheckUtils]: 128: Hoare triple {16380#false} assume !false; {16380#false} is VALID [2022-04-28 11:21:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 107 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2022-04-28 11:21:27,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:21:28,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:21:28,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830917802] [2022-04-28 11:21:28,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:21:28,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293481105] [2022-04-28 11:21:28,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293481105] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:21:28,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:21:28,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 11:21:28,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:21:28,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1245527060] [2022-04-28 11:21:28,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1245527060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:21:28,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:21:28,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 11:21:28,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387459944] [2022-04-28 11:21:28,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:21:28,058 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 129 [2022-04-28 11:21:28,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:21:28,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 11:21:28,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:28,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 11:21:28,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:28,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 11:21:28,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:21:28,299 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 11:21:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:29,823 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2022-04-28 11:21:29,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:21:29,823 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 129 [2022-04-28 11:21:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:21:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 11:21:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-28 11:21:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 11:21:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-28 11:21:29,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2022-04-28 11:21:29,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:29,939 INFO L225 Difference]: With dead ends: 136 [2022-04-28 11:21:29,939 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 11:21:29,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:21:29,939 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:21:29,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 110 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 11:21:29,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 11:21:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-04-28 11:21:30,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:21:30,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 134 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 30 states have call successors, (30), 24 states have call predecessors, (30), 23 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:21:30,072 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 134 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 30 states have call successors, (30), 24 states have call predecessors, (30), 23 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:21:30,072 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 134 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 30 states have call successors, (30), 24 states have call predecessors, (30), 23 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:21:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:30,088 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2022-04-28 11:21:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2022-04-28 11:21:30,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:30,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:30,089 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 30 states have call successors, (30), 24 states have call predecessors, (30), 23 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 134 states. [2022-04-28 11:21:30,089 INFO L87 Difference]: Start difference. First operand has 134 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 30 states have call successors, (30), 24 states have call predecessors, (30), 23 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 134 states. [2022-04-28 11:21:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:30,090 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2022-04-28 11:21:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2022-04-28 11:21:30,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:30,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:30,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:21:30,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:21:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 80 states have (on average 1.025) internal successors, (82), 82 states have internal predecessors, (82), 30 states have call successors, (30), 24 states have call predecessors, (30), 23 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:21:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2022-04-28 11:21:30,097 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 129 [2022-04-28 11:21:30,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:21:30,097 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2022-04-28 11:21:30,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 11:21:30,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 140 transitions. [2022-04-28 11:21:34,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 139 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2022-04-28 11:21:34,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 11:21:34,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:21:34,002 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:21:34,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 11:21:34,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:21:34,203 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:21:34,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:21:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 5 times [2022-04-28 11:21:34,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:34,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1814148552] [2022-04-28 11:21:34,426 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:21:34,427 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:21:34,427 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 6 times [2022-04-28 11:21:34,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:21:34,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061660537] [2022-04-28 11:21:34,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:21:34,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:21:34,434 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:21:34,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186406269] [2022-04-28 11:21:34,435 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:21:34,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:21:34,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:21:34,440 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:21:34,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 11:21:35,120 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:21:35,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:21:35,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 11:21:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:21:35,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:21:45,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {17609#true} call ULTIMATE.init(); {17609#true} is VALID [2022-04-28 11:21:45,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {17609#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17609#true} is VALID [2022-04-28 11:21:45,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17609#true} {17609#true} #84#return; {17609#true} is VALID [2022-04-28 11:21:45,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {17609#true} call #t~ret5 := main(); {17609#true} is VALID [2022-04-28 11:21:45,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {17609#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {17609#true} is VALID [2022-04-28 11:21:45,552 INFO L272 TraceCheckUtils]: 6: Hoare triple {17609#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {17609#true} ~cond := #in~cond; {17635#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:21:45,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {17635#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {17639#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:21:45,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {17639#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {17639#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:21:45,553 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17639#(not (= |assume_abort_if_not_#in~cond| 0))} {17609#true} #60#return; {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !false; {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,554 INFO L272 TraceCheckUtils]: 13: Hoare triple {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,555 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17609#true} {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #62#return; {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,555 INFO L272 TraceCheckUtils]: 18: Hoare triple {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,555 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17609#true} {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #64#return; {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,555 INFO L272 TraceCheckUtils]: 23: Hoare triple {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,556 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17609#true} {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #66#return; {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,556 INFO L272 TraceCheckUtils]: 28: Hoare triple {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,556 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17609#true} {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #68#return; {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,556 INFO L272 TraceCheckUtils]: 33: Hoare triple {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,557 INFO L290 TraceCheckUtils]: 35: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,557 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17609#true} {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #70#return; {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,558 INFO L290 TraceCheckUtils]: 39: Hoare triple {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} assume !false; {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,558 INFO L272 TraceCheckUtils]: 40: Hoare triple {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,558 INFO L290 TraceCheckUtils]: 43: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,558 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17609#true} {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #62#return; {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,558 INFO L272 TraceCheckUtils]: 45: Hoare triple {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,558 INFO L290 TraceCheckUtils]: 46: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,558 INFO L290 TraceCheckUtils]: 47: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,558 INFO L290 TraceCheckUtils]: 48: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,559 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17609#true} {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #64#return; {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,559 INFO L272 TraceCheckUtils]: 50: Hoare triple {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,559 INFO L290 TraceCheckUtils]: 51: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,559 INFO L290 TraceCheckUtils]: 52: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,559 INFO L290 TraceCheckUtils]: 53: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,571 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17609#true} {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #66#return; {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,572 INFO L272 TraceCheckUtils]: 55: Hoare triple {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,572 INFO L290 TraceCheckUtils]: 56: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,572 INFO L290 TraceCheckUtils]: 57: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,572 INFO L290 TraceCheckUtils]: 58: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,572 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17609#true} {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #68#return; {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,572 INFO L272 TraceCheckUtils]: 60: Hoare triple {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,572 INFO L290 TraceCheckUtils]: 61: Hoare triple {17609#true} ~cond := #in~cond; {17800#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:45,573 INFO L290 TraceCheckUtils]: 62: Hoare triple {17800#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:45,573 INFO L290 TraceCheckUtils]: 63: Hoare triple {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:45,573 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} {17646#(and (<= main_~a~0 20) (<= 0 main_~a~0))} #70#return; {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,576 INFO L290 TraceCheckUtils]: 65: Hoare triple {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,576 INFO L290 TraceCheckUtils]: 66: Hoare triple {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} assume !false; {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,576 INFO L272 TraceCheckUtils]: 67: Hoare triple {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,576 INFO L290 TraceCheckUtils]: 68: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,576 INFO L290 TraceCheckUtils]: 69: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,576 INFO L290 TraceCheckUtils]: 70: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,577 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17609#true} {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #62#return; {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,577 INFO L272 TraceCheckUtils]: 72: Hoare triple {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,577 INFO L290 TraceCheckUtils]: 73: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,577 INFO L290 TraceCheckUtils]: 74: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,577 INFO L290 TraceCheckUtils]: 75: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,577 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {17609#true} {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #64#return; {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,577 INFO L272 TraceCheckUtils]: 77: Hoare triple {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,577 INFO L290 TraceCheckUtils]: 78: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,577 INFO L290 TraceCheckUtils]: 79: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,577 INFO L290 TraceCheckUtils]: 80: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,578 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17609#true} {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #66#return; {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,578 INFO L272 TraceCheckUtils]: 82: Hoare triple {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,578 INFO L290 TraceCheckUtils]: 83: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,578 INFO L290 TraceCheckUtils]: 84: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,578 INFO L290 TraceCheckUtils]: 85: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,578 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17609#true} {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #68#return; {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,579 INFO L272 TraceCheckUtils]: 87: Hoare triple {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,579 INFO L290 TraceCheckUtils]: 88: Hoare triple {17609#true} ~cond := #in~cond; {17800#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:45,579 INFO L290 TraceCheckUtils]: 89: Hoare triple {17800#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:45,579 INFO L290 TraceCheckUtils]: 90: Hoare triple {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:45,580 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #70#return; {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,581 INFO L290 TraceCheckUtils]: 92: Hoare triple {17811#(and (<= main_~a~0 20) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17896#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,582 INFO L290 TraceCheckUtils]: 93: Hoare triple {17896#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (<= 0 main_~a~0))} assume !false; {17896#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,582 INFO L272 TraceCheckUtils]: 94: Hoare triple {17896#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,582 INFO L290 TraceCheckUtils]: 95: Hoare triple {17609#true} ~cond := #in~cond; {17800#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:45,582 INFO L290 TraceCheckUtils]: 96: Hoare triple {17800#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:45,583 INFO L290 TraceCheckUtils]: 97: Hoare triple {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:21:45,583 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} {17896#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (<= 0 main_~a~0))} #62#return; {17915#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,583 INFO L272 TraceCheckUtils]: 99: Hoare triple {17915#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,583 INFO L290 TraceCheckUtils]: 100: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,583 INFO L290 TraceCheckUtils]: 101: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,583 INFO L290 TraceCheckUtils]: 102: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,584 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {17609#true} {17915#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #64#return; {17915#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,584 INFO L272 TraceCheckUtils]: 104: Hoare triple {17915#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,584 INFO L290 TraceCheckUtils]: 105: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,584 INFO L290 TraceCheckUtils]: 106: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,584 INFO L290 TraceCheckUtils]: 107: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,584 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17609#true} {17915#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #66#return; {17915#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,585 INFO L272 TraceCheckUtils]: 109: Hoare triple {17915#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,585 INFO L290 TraceCheckUtils]: 110: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,585 INFO L290 TraceCheckUtils]: 111: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,585 INFO L290 TraceCheckUtils]: 112: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,585 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17609#true} {17915#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #68#return; {17915#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,585 INFO L272 TraceCheckUtils]: 114: Hoare triple {17915#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,585 INFO L290 TraceCheckUtils]: 115: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,585 INFO L290 TraceCheckUtils]: 116: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,585 INFO L290 TraceCheckUtils]: 117: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,586 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {17609#true} {17915#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #70#return; {17915#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:21:45,587 INFO L290 TraceCheckUtils]: 119: Hoare triple {17915#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} assume !(~n~0 <= ~a~0); {17979#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:21:45,587 INFO L272 TraceCheckUtils]: 120: Hoare triple {17979#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,587 INFO L290 TraceCheckUtils]: 121: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,587 INFO L290 TraceCheckUtils]: 122: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,587 INFO L290 TraceCheckUtils]: 123: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,587 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17609#true} {17979#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #72#return; {17979#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:21:45,587 INFO L272 TraceCheckUtils]: 125: Hoare triple {17979#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:21:45,587 INFO L290 TraceCheckUtils]: 126: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:21:45,587 INFO L290 TraceCheckUtils]: 127: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:21:45,588 INFO L290 TraceCheckUtils]: 128: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:21:45,588 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17609#true} {17979#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #74#return; {17979#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:21:45,867 INFO L272 TraceCheckUtils]: 130: Hoare triple {17979#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 20) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {18013#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:21:45,868 INFO L290 TraceCheckUtils]: 131: Hoare triple {18013#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18017#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:45,868 INFO L290 TraceCheckUtils]: 132: Hoare triple {18017#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17610#false} is VALID [2022-04-28 11:21:45,868 INFO L290 TraceCheckUtils]: 133: Hoare triple {17610#false} assume !false; {17610#false} is VALID [2022-04-28 11:21:45,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 181 proven. 69 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-04-28 11:21:45,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:22:09,444 INFO L290 TraceCheckUtils]: 133: Hoare triple {17610#false} assume !false; {17610#false} is VALID [2022-04-28 11:22:09,444 INFO L290 TraceCheckUtils]: 132: Hoare triple {18017#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17610#false} is VALID [2022-04-28 11:22:09,445 INFO L290 TraceCheckUtils]: 131: Hoare triple {18013#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18017#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:09,445 INFO L272 TraceCheckUtils]: 130: Hoare triple {18033#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {18013#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:09,446 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17609#true} {18033#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #74#return; {18033#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:22:09,446 INFO L290 TraceCheckUtils]: 128: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:09,446 INFO L290 TraceCheckUtils]: 127: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:09,446 INFO L290 TraceCheckUtils]: 126: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:09,446 INFO L272 TraceCheckUtils]: 125: Hoare triple {18033#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:09,446 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17609#true} {18033#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #72#return; {18033#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:22:09,446 INFO L290 TraceCheckUtils]: 123: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:09,446 INFO L290 TraceCheckUtils]: 122: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:09,446 INFO L290 TraceCheckUtils]: 121: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:09,447 INFO L272 TraceCheckUtils]: 120: Hoare triple {18033#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:09,447 INFO L290 TraceCheckUtils]: 119: Hoare triple {18067#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} assume !(~n~0 <= ~a~0); {18033#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:22:09,447 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {17609#true} {18067#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #70#return; {18067#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:22:09,447 INFO L290 TraceCheckUtils]: 117: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:09,448 INFO L290 TraceCheckUtils]: 116: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:09,448 INFO L290 TraceCheckUtils]: 115: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:09,448 INFO L272 TraceCheckUtils]: 114: Hoare triple {18067#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:09,448 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17609#true} {18067#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #68#return; {18067#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:22:09,448 INFO L290 TraceCheckUtils]: 112: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:09,448 INFO L290 TraceCheckUtils]: 111: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:09,448 INFO L290 TraceCheckUtils]: 110: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:09,448 INFO L272 TraceCheckUtils]: 109: Hoare triple {18067#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:09,449 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17609#true} {18067#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #66#return; {18067#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:22:09,449 INFO L290 TraceCheckUtils]: 107: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:09,449 INFO L290 TraceCheckUtils]: 106: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:09,449 INFO L290 TraceCheckUtils]: 105: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:09,449 INFO L272 TraceCheckUtils]: 104: Hoare triple {18067#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:09,450 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {17609#true} {18067#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #64#return; {18067#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:22:09,450 INFO L290 TraceCheckUtils]: 102: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:09,450 INFO L290 TraceCheckUtils]: 101: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:09,450 INFO L290 TraceCheckUtils]: 100: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:09,450 INFO L272 TraceCheckUtils]: 99: Hoare triple {18067#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:09,450 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} {18131#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #62#return; {18067#(or (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:22:09,451 INFO L290 TraceCheckUtils]: 97: Hoare triple {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:09,451 INFO L290 TraceCheckUtils]: 96: Hoare triple {18141#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:09,451 INFO L290 TraceCheckUtils]: 95: Hoare triple {17609#true} ~cond := #in~cond; {18141#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:22:09,451 INFO L272 TraceCheckUtils]: 94: Hoare triple {18131#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:09,452 INFO L290 TraceCheckUtils]: 93: Hoare triple {18131#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} assume !false; {18131#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:22:09,456 INFO L290 TraceCheckUtils]: 92: Hoare triple {18151#(or (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)) (<= (+ (div (+ main_~z~0 (- 6)) 6) 1) main_~a~0) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 12) (* main_~a~0 (+ (* (div (+ main_~z~0 (- 6)) 6) 6) 12)) 24) (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {18131#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:22:11,481 WARN L284 TraceCheckUtils]: 91: Hoare quadruple {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} {17609#true} #70#return; {18151#(or (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)) (<= (+ (div (+ main_~z~0 (- 6)) 6) 1) main_~a~0) (= (+ (* (div (+ main_~z~0 (- 6)) 6) 12) (* main_~a~0 (+ (* (div (+ main_~z~0 (- 6)) 6) 6) 12)) 24) (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10)))} is UNKNOWN [2022-04-28 11:22:11,481 INFO L290 TraceCheckUtils]: 90: Hoare triple {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:11,482 INFO L290 TraceCheckUtils]: 89: Hoare triple {18141#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17804#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:11,482 INFO L290 TraceCheckUtils]: 88: Hoare triple {17609#true} ~cond := #in~cond; {18141#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:22:11,482 INFO L272 TraceCheckUtils]: 87: Hoare triple {17609#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,482 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17609#true} {17609#true} #68#return; {17609#true} is VALID [2022-04-28 11:22:11,482 INFO L290 TraceCheckUtils]: 85: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,482 INFO L290 TraceCheckUtils]: 84: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:11,482 INFO L290 TraceCheckUtils]: 83: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:11,482 INFO L272 TraceCheckUtils]: 82: Hoare triple {17609#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,482 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17609#true} {17609#true} #66#return; {17609#true} is VALID [2022-04-28 11:22:11,482 INFO L290 TraceCheckUtils]: 80: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,482 INFO L290 TraceCheckUtils]: 79: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:11,482 INFO L290 TraceCheckUtils]: 78: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:11,482 INFO L272 TraceCheckUtils]: 77: Hoare triple {17609#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {17609#true} {17609#true} #64#return; {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L290 TraceCheckUtils]: 75: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L290 TraceCheckUtils]: 74: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L290 TraceCheckUtils]: 73: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L272 TraceCheckUtils]: 72: Hoare triple {17609#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17609#true} {17609#true} #62#return; {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L290 TraceCheckUtils]: 70: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L290 TraceCheckUtils]: 69: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L290 TraceCheckUtils]: 68: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L272 TraceCheckUtils]: 67: Hoare triple {17609#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L290 TraceCheckUtils]: 66: Hoare triple {17609#true} assume !false; {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L290 TraceCheckUtils]: 65: Hoare triple {17609#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17609#true} {17609#true} #70#return; {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L290 TraceCheckUtils]: 63: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L290 TraceCheckUtils]: 62: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L272 TraceCheckUtils]: 60: Hoare triple {17609#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17609#true} {17609#true} #68#return; {17609#true} is VALID [2022-04-28 11:22:11,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L290 TraceCheckUtils]: 57: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L290 TraceCheckUtils]: 56: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L272 TraceCheckUtils]: 55: Hoare triple {17609#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17609#true} {17609#true} #66#return; {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L290 TraceCheckUtils]: 53: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L290 TraceCheckUtils]: 52: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L290 TraceCheckUtils]: 51: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L272 TraceCheckUtils]: 50: Hoare triple {17609#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17609#true} {17609#true} #64#return; {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L290 TraceCheckUtils]: 48: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L290 TraceCheckUtils]: 47: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L290 TraceCheckUtils]: 46: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L272 TraceCheckUtils]: 45: Hoare triple {17609#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17609#true} {17609#true} #62#return; {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L272 TraceCheckUtils]: 40: Hoare triple {17609#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,484 INFO L290 TraceCheckUtils]: 39: Hoare triple {17609#true} assume !false; {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L290 TraceCheckUtils]: 38: Hoare triple {17609#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17609#true} {17609#true} #70#return; {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L290 TraceCheckUtils]: 35: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L272 TraceCheckUtils]: 33: Hoare triple {17609#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17609#true} {17609#true} #68#return; {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L272 TraceCheckUtils]: 28: Hoare triple {17609#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17609#true} {17609#true} #66#return; {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L272 TraceCheckUtils]: 23: Hoare triple {17609#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17609#true} {17609#true} #64#return; {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:11,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L272 TraceCheckUtils]: 18: Hoare triple {17609#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17609#true} {17609#true} #62#return; {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L272 TraceCheckUtils]: 13: Hoare triple {17609#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {17609#true} assume !false; {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {17609#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17609#true} {17609#true} #60#return; {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {17609#true} assume !(0 == ~cond); {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {17609#true} ~cond := #in~cond; {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L272 TraceCheckUtils]: 6: Hoare triple {17609#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {17609#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {17609#true} call #t~ret5 := main(); {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17609#true} {17609#true} #84#return; {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {17609#true} assume true; {17609#true} is VALID [2022-04-28 11:22:11,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {17609#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17609#true} is VALID [2022-04-28 11:22:11,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {17609#true} call ULTIMATE.init(); {17609#true} is VALID [2022-04-28 11:22:11,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 148 proven. 39 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2022-04-28 11:22:11,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:11,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061660537] [2022-04-28 11:22:11,487 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:11,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186406269] [2022-04-28 11:22:11,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186406269] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:22:11,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:22:11,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-28 11:22:11,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:11,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1814148552] [2022-04-28 11:22:11,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1814148552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:11,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:11,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:22:11,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77260493] [2022-04-28 11:22:11,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:11,489 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 134 [2022-04-28 11:22:11,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:11,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-28 11:22:12,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:12,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:22:12,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:12,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:22:12,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:22:12,092 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-28 11:22:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:17,815 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2022-04-28 11:22:17,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:22:17,815 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 134 [2022-04-28 11:22:17,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-28 11:22:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-28 11:22:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-28 11:22:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-28 11:22:17,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2022-04-28 11:22:18,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:18,150 INFO L225 Difference]: With dead ends: 144 [2022-04-28 11:22:18,150 INFO L226 Difference]: Without dead ends: 142 [2022-04-28 11:22:18,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-04-28 11:22:18,151 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:18,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 98 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 11:22:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-28 11:22:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-04-28 11:22:18,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:18,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 142 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 30 states have call successors, (30), 26 states have call predecessors, (30), 25 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:22:18,292 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 142 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 30 states have call successors, (30), 26 states have call predecessors, (30), 25 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:22:18,292 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 142 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 30 states have call successors, (30), 26 states have call predecessors, (30), 25 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:22:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:18,293 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2022-04-28 11:22:18,293 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2022-04-28 11:22:18,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:18,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:18,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 30 states have call successors, (30), 26 states have call predecessors, (30), 25 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 142 states. [2022-04-28 11:22:18,294 INFO L87 Difference]: Start difference. First operand has 142 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 30 states have call successors, (30), 26 states have call predecessors, (30), 25 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 142 states. [2022-04-28 11:22:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:18,295 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2022-04-28 11:22:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2022-04-28 11:22:18,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:18,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:18,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:18,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 88 states have internal predecessors, (88), 30 states have call successors, (30), 26 states have call predecessors, (30), 25 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:22:18,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 146 transitions. [2022-04-28 11:22:18,298 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 146 transitions. Word has length 134 [2022-04-28 11:22:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:18,298 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 146 transitions. [2022-04-28 11:22:18,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-28 11:22:18,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 146 transitions. [2022-04-28 11:22:21,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 145 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2022-04-28 11:22:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 11:22:21,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:21,215 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:21,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 11:22:21,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:21,416 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1923910469, now seen corresponding path program 19 times [2022-04-28 11:22:21,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:21,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [650864405] [2022-04-28 11:22:21,666 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:22:21,666 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:22:21,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1923910469, now seen corresponding path program 20 times [2022-04-28 11:22:21,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:21,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911257746] [2022-04-28 11:22:21,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:21,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:21,675 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:21,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260915871] [2022-04-28 11:22:21,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:21,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:21,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:21,685 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:22:21,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 11:22:21,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:22:21,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:21,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 11:22:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:21,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:22,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {19294#true} call ULTIMATE.init(); {19294#true} is VALID [2022-04-28 11:22:22,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {19294#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19294#true} is VALID [2022-04-28 11:22:22,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19294#true} {19294#true} #84#return; {19294#true} is VALID [2022-04-28 11:22:22,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {19294#true} call #t~ret5 := main(); {19294#true} is VALID [2022-04-28 11:22:22,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {19294#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {19294#true} is VALID [2022-04-28 11:22:22,480 INFO L272 TraceCheckUtils]: 6: Hoare triple {19294#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,480 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19294#true} {19294#true} #60#return; {19294#true} is VALID [2022-04-28 11:22:22,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {19294#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:22,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:22,481 INFO L272 TraceCheckUtils]: 13: Hoare triple {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,481 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19294#true} {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:22,481 INFO L272 TraceCheckUtils]: 18: Hoare triple {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,482 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19294#true} {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:22,482 INFO L272 TraceCheckUtils]: 23: Hoare triple {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,483 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19294#true} {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:22,483 INFO L272 TraceCheckUtils]: 28: Hoare triple {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,483 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19294#true} {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:22,483 INFO L272 TraceCheckUtils]: 33: Hoare triple {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,483 INFO L290 TraceCheckUtils]: 36: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,484 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {19294#true} {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:22,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {19332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:22:22,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} assume !false; {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:22:22,485 INFO L272 TraceCheckUtils]: 40: Hoare triple {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,486 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19294#true} {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} #62#return; {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:22:22,486 INFO L272 TraceCheckUtils]: 45: Hoare triple {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,486 INFO L290 TraceCheckUtils]: 46: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,486 INFO L290 TraceCheckUtils]: 47: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,486 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {19294#true} {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} #64#return; {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:22:22,486 INFO L272 TraceCheckUtils]: 50: Hoare triple {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,486 INFO L290 TraceCheckUtils]: 51: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,487 INFO L290 TraceCheckUtils]: 52: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,487 INFO L290 TraceCheckUtils]: 53: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,487 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19294#true} {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} #66#return; {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:22:22,487 INFO L272 TraceCheckUtils]: 55: Hoare triple {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,487 INFO L290 TraceCheckUtils]: 56: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,487 INFO L290 TraceCheckUtils]: 57: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,487 INFO L290 TraceCheckUtils]: 58: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,488 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19294#true} {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} #68#return; {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:22:22,488 INFO L272 TraceCheckUtils]: 60: Hoare triple {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,488 INFO L290 TraceCheckUtils]: 61: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,488 INFO L290 TraceCheckUtils]: 62: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,488 INFO L290 TraceCheckUtils]: 63: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,489 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {19294#true} {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} #70#return; {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:22:22,489 INFO L290 TraceCheckUtils]: 65: Hoare triple {19414#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:22:22,490 INFO L290 TraceCheckUtils]: 66: Hoare triple {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} assume !false; {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:22:22,490 INFO L272 TraceCheckUtils]: 67: Hoare triple {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,490 INFO L290 TraceCheckUtils]: 68: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,490 INFO L290 TraceCheckUtils]: 69: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,490 INFO L290 TraceCheckUtils]: 70: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,490 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19294#true} {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} #62#return; {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:22:22,491 INFO L272 TraceCheckUtils]: 72: Hoare triple {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,491 INFO L290 TraceCheckUtils]: 73: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,491 INFO L290 TraceCheckUtils]: 74: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,491 INFO L290 TraceCheckUtils]: 75: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,491 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19294#true} {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} #64#return; {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:22:22,491 INFO L272 TraceCheckUtils]: 77: Hoare triple {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,491 INFO L290 TraceCheckUtils]: 78: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,491 INFO L290 TraceCheckUtils]: 79: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,491 INFO L290 TraceCheckUtils]: 80: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,492 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19294#true} {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} #66#return; {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:22:22,492 INFO L272 TraceCheckUtils]: 82: Hoare triple {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,492 INFO L290 TraceCheckUtils]: 83: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,492 INFO L290 TraceCheckUtils]: 84: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,492 INFO L290 TraceCheckUtils]: 85: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,493 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19294#true} {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} #68#return; {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:22:22,493 INFO L272 TraceCheckUtils]: 87: Hoare triple {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,493 INFO L290 TraceCheckUtils]: 88: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,493 INFO L290 TraceCheckUtils]: 89: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,493 INFO L290 TraceCheckUtils]: 90: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,493 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {19294#true} {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} #70#return; {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:22:22,494 INFO L290 TraceCheckUtils]: 92: Hoare triple {19496#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:22:22,494 INFO L290 TraceCheckUtils]: 93: Hoare triple {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} assume !false; {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:22:22,494 INFO L272 TraceCheckUtils]: 94: Hoare triple {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,495 INFO L290 TraceCheckUtils]: 95: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,495 INFO L290 TraceCheckUtils]: 96: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,495 INFO L290 TraceCheckUtils]: 97: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,495 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {19294#true} {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} #62#return; {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:22:22,495 INFO L272 TraceCheckUtils]: 99: Hoare triple {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,495 INFO L290 TraceCheckUtils]: 100: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,495 INFO L290 TraceCheckUtils]: 101: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,495 INFO L290 TraceCheckUtils]: 102: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,496 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {19294#true} {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} #64#return; {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:22:22,496 INFO L272 TraceCheckUtils]: 104: Hoare triple {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,496 INFO L290 TraceCheckUtils]: 105: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,496 INFO L290 TraceCheckUtils]: 106: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,496 INFO L290 TraceCheckUtils]: 107: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,497 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19294#true} {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} #66#return; {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:22:22,497 INFO L272 TraceCheckUtils]: 109: Hoare triple {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,497 INFO L290 TraceCheckUtils]: 110: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,497 INFO L290 TraceCheckUtils]: 111: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,497 INFO L290 TraceCheckUtils]: 112: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,497 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19294#true} {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} #68#return; {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:22:22,497 INFO L272 TraceCheckUtils]: 114: Hoare triple {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,497 INFO L290 TraceCheckUtils]: 115: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,497 INFO L290 TraceCheckUtils]: 116: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,497 INFO L290 TraceCheckUtils]: 117: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,498 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {19294#true} {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} #70#return; {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:22:22,498 INFO L290 TraceCheckUtils]: 119: Hoare triple {19578#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {19660#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:22:22,499 INFO L290 TraceCheckUtils]: 120: Hoare triple {19660#(and (= main_~n~0 4) (= 64 main_~x~0))} assume !false; {19660#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:22:22,499 INFO L272 TraceCheckUtils]: 121: Hoare triple {19660#(and (= main_~n~0 4) (= 64 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,499 INFO L290 TraceCheckUtils]: 122: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,499 INFO L290 TraceCheckUtils]: 123: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,499 INFO L290 TraceCheckUtils]: 124: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,499 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {19294#true} {19660#(and (= main_~n~0 4) (= 64 main_~x~0))} #62#return; {19660#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:22:22,499 INFO L272 TraceCheckUtils]: 126: Hoare triple {19660#(and (= main_~n~0 4) (= 64 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,499 INFO L290 TraceCheckUtils]: 127: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,499 INFO L290 TraceCheckUtils]: 128: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,500 INFO L290 TraceCheckUtils]: 129: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,500 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {19294#true} {19660#(and (= main_~n~0 4) (= 64 main_~x~0))} #64#return; {19660#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:22:22,500 INFO L272 TraceCheckUtils]: 131: Hoare triple {19660#(and (= main_~n~0 4) (= 64 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19697#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:22,501 INFO L290 TraceCheckUtils]: 132: Hoare triple {19697#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19701#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:22,501 INFO L290 TraceCheckUtils]: 133: Hoare triple {19701#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19295#false} is VALID [2022-04-28 11:22:22,501 INFO L290 TraceCheckUtils]: 134: Hoare triple {19295#false} assume !false; {19295#false} is VALID [2022-04-28 11:22:22,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 44 proven. 58 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-28 11:22:22,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:22:22,962 INFO L290 TraceCheckUtils]: 134: Hoare triple {19295#false} assume !false; {19295#false} is VALID [2022-04-28 11:22:22,962 INFO L290 TraceCheckUtils]: 133: Hoare triple {19701#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19295#false} is VALID [2022-04-28 11:22:22,962 INFO L290 TraceCheckUtils]: 132: Hoare triple {19697#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19701#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:22,963 INFO L272 TraceCheckUtils]: 131: Hoare triple {19717#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19697#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:22,963 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {19294#true} {19717#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {19717#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:22:22,963 INFO L290 TraceCheckUtils]: 129: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,963 INFO L290 TraceCheckUtils]: 128: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,963 INFO L290 TraceCheckUtils]: 127: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,963 INFO L272 TraceCheckUtils]: 126: Hoare triple {19717#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,964 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {19294#true} {19717#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {19717#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:22:22,964 INFO L290 TraceCheckUtils]: 124: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,964 INFO L290 TraceCheckUtils]: 123: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,964 INFO L290 TraceCheckUtils]: 122: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,964 INFO L272 TraceCheckUtils]: 121: Hoare triple {19717#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,964 INFO L290 TraceCheckUtils]: 120: Hoare triple {19717#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {19717#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:22:22,967 INFO L290 TraceCheckUtils]: 119: Hoare triple {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {19717#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:22:22,968 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {19294#true} {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #70#return; {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:22:22,968 INFO L290 TraceCheckUtils]: 117: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,968 INFO L290 TraceCheckUtils]: 116: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,968 INFO L290 TraceCheckUtils]: 115: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,968 INFO L272 TraceCheckUtils]: 114: Hoare triple {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,968 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19294#true} {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #68#return; {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:22:22,968 INFO L290 TraceCheckUtils]: 112: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,969 INFO L290 TraceCheckUtils]: 111: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,969 INFO L290 TraceCheckUtils]: 110: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,969 INFO L272 TraceCheckUtils]: 109: Hoare triple {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,969 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19294#true} {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #66#return; {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:22:22,969 INFO L290 TraceCheckUtils]: 107: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,969 INFO L290 TraceCheckUtils]: 106: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,969 INFO L290 TraceCheckUtils]: 105: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,969 INFO L272 TraceCheckUtils]: 104: Hoare triple {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,970 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {19294#true} {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #64#return; {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:22:22,970 INFO L290 TraceCheckUtils]: 102: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,970 INFO L290 TraceCheckUtils]: 101: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,970 INFO L290 TraceCheckUtils]: 100: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,970 INFO L272 TraceCheckUtils]: 99: Hoare triple {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,970 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {19294#true} {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #62#return; {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:22:22,970 INFO L290 TraceCheckUtils]: 97: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,970 INFO L290 TraceCheckUtils]: 96: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,971 INFO L290 TraceCheckUtils]: 95: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,971 INFO L272 TraceCheckUtils]: 94: Hoare triple {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,971 INFO L290 TraceCheckUtils]: 93: Hoare triple {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} assume !false; {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:22:22,973 INFO L290 TraceCheckUtils]: 92: Hoare triple {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {19754#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:22:22,974 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {19294#true} {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #70#return; {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:22:22,974 INFO L290 TraceCheckUtils]: 90: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,974 INFO L290 TraceCheckUtils]: 89: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,974 INFO L290 TraceCheckUtils]: 88: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,974 INFO L272 TraceCheckUtils]: 87: Hoare triple {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,974 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19294#true} {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #68#return; {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:22:22,974 INFO L290 TraceCheckUtils]: 85: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,974 INFO L290 TraceCheckUtils]: 84: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,974 INFO L290 TraceCheckUtils]: 83: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,975 INFO L272 TraceCheckUtils]: 82: Hoare triple {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,975 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19294#true} {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #66#return; {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:22:22,975 INFO L290 TraceCheckUtils]: 80: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,975 INFO L290 TraceCheckUtils]: 79: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,975 INFO L290 TraceCheckUtils]: 78: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,975 INFO L272 TraceCheckUtils]: 77: Hoare triple {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,976 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19294#true} {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #64#return; {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:22:22,976 INFO L290 TraceCheckUtils]: 75: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,976 INFO L290 TraceCheckUtils]: 74: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,976 INFO L290 TraceCheckUtils]: 73: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,976 INFO L272 TraceCheckUtils]: 72: Hoare triple {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,976 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19294#true} {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #62#return; {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:22:22,976 INFO L290 TraceCheckUtils]: 70: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,976 INFO L290 TraceCheckUtils]: 69: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,977 INFO L290 TraceCheckUtils]: 68: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,977 INFO L272 TraceCheckUtils]: 67: Hoare triple {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,977 INFO L290 TraceCheckUtils]: 66: Hoare triple {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} assume !false; {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:22:22,980 INFO L290 TraceCheckUtils]: 65: Hoare triple {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {19836#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:22:22,980 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {19294#true} {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #70#return; {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:22:22,980 INFO L290 TraceCheckUtils]: 63: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,981 INFO L290 TraceCheckUtils]: 62: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,981 INFO L290 TraceCheckUtils]: 61: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,981 INFO L272 TraceCheckUtils]: 60: Hoare triple {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,981 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19294#true} {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #68#return; {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:22:22,981 INFO L290 TraceCheckUtils]: 58: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,981 INFO L290 TraceCheckUtils]: 57: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,981 INFO L290 TraceCheckUtils]: 56: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,981 INFO L272 TraceCheckUtils]: 55: Hoare triple {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,982 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19294#true} {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #66#return; {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:22:22,982 INFO L290 TraceCheckUtils]: 53: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,982 INFO L290 TraceCheckUtils]: 52: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,982 INFO L272 TraceCheckUtils]: 50: Hoare triple {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,982 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {19294#true} {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #64#return; {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:22:22,983 INFO L290 TraceCheckUtils]: 48: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,983 INFO L290 TraceCheckUtils]: 47: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,983 INFO L290 TraceCheckUtils]: 46: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,983 INFO L272 TraceCheckUtils]: 45: Hoare triple {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,983 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19294#true} {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #62#return; {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:22:22,983 INFO L290 TraceCheckUtils]: 43: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,983 INFO L290 TraceCheckUtils]: 41: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,983 INFO L272 TraceCheckUtils]: 40: Hoare triple {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} assume !false; {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:22:22,986 INFO L290 TraceCheckUtils]: 38: Hoare triple {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {19918#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:22:22,987 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {19294#true} {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #70#return; {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:22:22,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,987 INFO L272 TraceCheckUtils]: 33: Hoare triple {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,988 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19294#true} {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #68#return; {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:22:22,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,988 INFO L272 TraceCheckUtils]: 28: Hoare triple {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,988 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19294#true} {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #66#return; {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:22:22,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,988 INFO L272 TraceCheckUtils]: 23: Hoare triple {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,989 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19294#true} {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #64#return; {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:22:22,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,989 INFO L272 TraceCheckUtils]: 18: Hoare triple {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,990 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19294#true} {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #62#return; {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:22:22,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,990 INFO L272 TraceCheckUtils]: 13: Hoare triple {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} assume !false; {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:22:22,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {19294#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {20000#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:22:22,991 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19294#true} {19294#true} #60#return; {19294#true} is VALID [2022-04-28 11:22:22,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {19294#true} assume !(0 == ~cond); {19294#true} is VALID [2022-04-28 11:22:22,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {19294#true} ~cond := #in~cond; {19294#true} is VALID [2022-04-28 11:22:22,991 INFO L272 TraceCheckUtils]: 6: Hoare triple {19294#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {19294#true} is VALID [2022-04-28 11:22:22,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {19294#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {19294#true} is VALID [2022-04-28 11:22:22,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {19294#true} call #t~ret5 := main(); {19294#true} is VALID [2022-04-28 11:22:22,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19294#true} {19294#true} #84#return; {19294#true} is VALID [2022-04-28 11:22:22,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {19294#true} assume true; {19294#true} is VALID [2022-04-28 11:22:22,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {19294#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19294#true} is VALID [2022-04-28 11:22:22,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {19294#true} call ULTIMATE.init(); {19294#true} is VALID [2022-04-28 11:22:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 44 proven. 58 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-28 11:22:22,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:22,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911257746] [2022-04-28 11:22:22,992 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:22,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260915871] [2022-04-28 11:22:22,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260915871] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:22:22,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:22:22,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 11:22:22,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:22,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [650864405] [2022-04-28 11:22:22,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [650864405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:22,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:22,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:22:22,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493754086] [2022-04-28 11:22:22,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:22,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 135 [2022-04-28 11:22:22,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:22,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:22:23,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:23,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:22:23,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:23,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:22:23,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:22:23,066 INFO L87 Difference]: Start difference. First operand 142 states and 146 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:22:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:24,923 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2022-04-28 11:22:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:22:24,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 135 [2022-04-28 11:22:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:22:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2022-04-28 11:22:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:22:24,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2022-04-28 11:22:24,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 118 transitions. [2022-04-28 11:22:25,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:25,060 INFO L225 Difference]: With dead ends: 178 [2022-04-28 11:22:25,060 INFO L226 Difference]: Without dead ends: 172 [2022-04-28 11:22:25,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:22:25,060 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 7 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:25,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 273 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 11:22:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-28 11:22:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2022-04-28 11:22:25,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:25,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 165 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 35 states have call successors, (35), 30 states have call predecessors, (35), 29 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 11:22:25,232 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 165 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 35 states have call successors, (35), 30 states have call predecessors, (35), 29 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 11:22:25,244 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 165 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 35 states have call successors, (35), 30 states have call predecessors, (35), 29 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 11:22:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:25,247 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2022-04-28 11:22:25,247 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 183 transitions. [2022-04-28 11:22:25,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:25,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:25,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 35 states have call successors, (35), 30 states have call predecessors, (35), 29 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) Second operand 172 states. [2022-04-28 11:22:25,247 INFO L87 Difference]: Start difference. First operand has 165 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 35 states have call successors, (35), 30 states have call predecessors, (35), 29 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) Second operand 172 states. [2022-04-28 11:22:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:25,250 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2022-04-28 11:22:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 183 transitions. [2022-04-28 11:22:25,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:25,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:25,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:25,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 100 states have (on average 1.02) internal successors, (102), 102 states have internal predecessors, (102), 35 states have call successors, (35), 30 states have call predecessors, (35), 29 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 11:22:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 170 transitions. [2022-04-28 11:22:25,252 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 170 transitions. Word has length 135 [2022-04-28 11:22:25,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:25,253 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 170 transitions. [2022-04-28 11:22:25,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:22:25,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 165 states and 170 transitions. [2022-04-28 11:22:29,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 169 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 170 transitions. [2022-04-28 11:22:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-28 11:22:29,219 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:29,219 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:29,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 11:22:29,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:29,419 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:29,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:29,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1219256746, now seen corresponding path program 21 times [2022-04-28 11:22:29,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:29,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1561334280] [2022-04-28 11:22:29,665 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:22:29,665 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:22:29,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1219256746, now seen corresponding path program 22 times [2022-04-28 11:22:29,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:29,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380419356] [2022-04-28 11:22:29,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:29,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:29,675 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:29,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2046579059] [2022-04-28 11:22:29,675 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:22:29,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:29,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:29,676 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:22:29,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 11:22:29,758 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:22:29,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:29,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 11:22:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:29,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:30,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {21149#true} call ULTIMATE.init(); {21149#true} is VALID [2022-04-28 11:22:30,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {21149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21149#true} is VALID [2022-04-28 11:22:30,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21149#true} {21149#true} #84#return; {21149#true} is VALID [2022-04-28 11:22:30,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {21149#true} call #t~ret5 := main(); {21149#true} is VALID [2022-04-28 11:22:30,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {21149#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {21149#true} is VALID [2022-04-28 11:22:30,433 INFO L272 TraceCheckUtils]: 6: Hoare triple {21149#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,433 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21149#true} {21149#true} #60#return; {21149#true} is VALID [2022-04-28 11:22:30,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {21149#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:30,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:30,434 INFO L272 TraceCheckUtils]: 13: Hoare triple {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,434 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21149#true} {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:30,434 INFO L272 TraceCheckUtils]: 18: Hoare triple {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,435 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21149#true} {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:30,435 INFO L272 TraceCheckUtils]: 23: Hoare triple {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,435 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {21149#true} {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:30,435 INFO L272 TraceCheckUtils]: 28: Hoare triple {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,436 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21149#true} {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:30,436 INFO L272 TraceCheckUtils]: 33: Hoare triple {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,436 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21149#true} {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:30,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {21187#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:22:30,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !false; {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:22:30,437 INFO L272 TraceCheckUtils]: 40: Hoare triple {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,437 INFO L290 TraceCheckUtils]: 42: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,437 INFO L290 TraceCheckUtils]: 43: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,437 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {21149#true} {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #62#return; {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:22:30,437 INFO L272 TraceCheckUtils]: 45: Hoare triple {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,437 INFO L290 TraceCheckUtils]: 47: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,438 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {21149#true} {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #64#return; {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:22:30,438 INFO L272 TraceCheckUtils]: 50: Hoare triple {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,438 INFO L290 TraceCheckUtils]: 51: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,438 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21149#true} {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #66#return; {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:22:30,438 INFO L272 TraceCheckUtils]: 55: Hoare triple {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,438 INFO L290 TraceCheckUtils]: 56: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,438 INFO L290 TraceCheckUtils]: 57: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,439 INFO L290 TraceCheckUtils]: 58: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,439 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21149#true} {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #68#return; {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:22:30,439 INFO L272 TraceCheckUtils]: 60: Hoare triple {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,439 INFO L290 TraceCheckUtils]: 61: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,439 INFO L290 TraceCheckUtils]: 62: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,439 INFO L290 TraceCheckUtils]: 63: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,439 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21149#true} {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #70#return; {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:22:30,440 INFO L290 TraceCheckUtils]: 65: Hoare triple {21269#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:22:30,440 INFO L290 TraceCheckUtils]: 66: Hoare triple {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} assume !false; {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:22:30,440 INFO L272 TraceCheckUtils]: 67: Hoare triple {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,440 INFO L290 TraceCheckUtils]: 68: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,440 INFO L290 TraceCheckUtils]: 69: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,440 INFO L290 TraceCheckUtils]: 70: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,440 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21149#true} {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #62#return; {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:22:30,440 INFO L272 TraceCheckUtils]: 72: Hoare triple {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,441 INFO L290 TraceCheckUtils]: 73: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,441 INFO L290 TraceCheckUtils]: 74: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,441 INFO L290 TraceCheckUtils]: 75: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,441 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {21149#true} {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #64#return; {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:22:30,441 INFO L272 TraceCheckUtils]: 77: Hoare triple {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,441 INFO L290 TraceCheckUtils]: 78: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,441 INFO L290 TraceCheckUtils]: 79: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,441 INFO L290 TraceCheckUtils]: 80: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,441 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {21149#true} {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #66#return; {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:22:30,441 INFO L272 TraceCheckUtils]: 82: Hoare triple {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,442 INFO L290 TraceCheckUtils]: 83: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,442 INFO L290 TraceCheckUtils]: 84: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,442 INFO L290 TraceCheckUtils]: 85: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,442 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21149#true} {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #68#return; {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:22:30,442 INFO L272 TraceCheckUtils]: 87: Hoare triple {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,442 INFO L290 TraceCheckUtils]: 88: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,442 INFO L290 TraceCheckUtils]: 89: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,442 INFO L290 TraceCheckUtils]: 90: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,442 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21149#true} {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #70#return; {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:22:30,443 INFO L290 TraceCheckUtils]: 92: Hoare triple {21351#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:22:30,443 INFO L290 TraceCheckUtils]: 93: Hoare triple {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} assume !false; {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:22:30,443 INFO L272 TraceCheckUtils]: 94: Hoare triple {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,443 INFO L290 TraceCheckUtils]: 95: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,443 INFO L290 TraceCheckUtils]: 96: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,443 INFO L290 TraceCheckUtils]: 97: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,444 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {21149#true} {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} #62#return; {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:22:30,444 INFO L272 TraceCheckUtils]: 99: Hoare triple {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,444 INFO L290 TraceCheckUtils]: 100: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,444 INFO L290 TraceCheckUtils]: 101: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,444 INFO L290 TraceCheckUtils]: 102: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,444 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {21149#true} {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} #64#return; {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:22:30,444 INFO L272 TraceCheckUtils]: 104: Hoare triple {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,444 INFO L290 TraceCheckUtils]: 105: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,444 INFO L290 TraceCheckUtils]: 106: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,444 INFO L290 TraceCheckUtils]: 107: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,445 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21149#true} {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} #66#return; {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:22:30,445 INFO L272 TraceCheckUtils]: 109: Hoare triple {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,445 INFO L290 TraceCheckUtils]: 110: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,445 INFO L290 TraceCheckUtils]: 111: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,445 INFO L290 TraceCheckUtils]: 112: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,445 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {21149#true} {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} #68#return; {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:22:30,445 INFO L272 TraceCheckUtils]: 114: Hoare triple {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,445 INFO L290 TraceCheckUtils]: 115: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,445 INFO L290 TraceCheckUtils]: 116: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,445 INFO L290 TraceCheckUtils]: 117: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,446 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21149#true} {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} #70#return; {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:22:30,446 INFO L290 TraceCheckUtils]: 119: Hoare triple {21433#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} is VALID [2022-04-28 11:22:30,446 INFO L290 TraceCheckUtils]: 120: Hoare triple {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} assume !false; {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} is VALID [2022-04-28 11:22:30,446 INFO L272 TraceCheckUtils]: 121: Hoare triple {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,446 INFO L290 TraceCheckUtils]: 122: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,446 INFO L290 TraceCheckUtils]: 123: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,446 INFO L290 TraceCheckUtils]: 124: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,447 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {21149#true} {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} #62#return; {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} is VALID [2022-04-28 11:22:30,447 INFO L272 TraceCheckUtils]: 126: Hoare triple {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,447 INFO L290 TraceCheckUtils]: 127: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,447 INFO L290 TraceCheckUtils]: 128: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,447 INFO L290 TraceCheckUtils]: 129: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,447 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {21149#true} {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} #64#return; {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} is VALID [2022-04-28 11:22:30,447 INFO L272 TraceCheckUtils]: 131: Hoare triple {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,447 INFO L290 TraceCheckUtils]: 132: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,447 INFO L290 TraceCheckUtils]: 133: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,447 INFO L290 TraceCheckUtils]: 134: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,448 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {21149#true} {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} #66#return; {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} is VALID [2022-04-28 11:22:30,448 INFO L272 TraceCheckUtils]: 136: Hoare triple {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,448 INFO L290 TraceCheckUtils]: 137: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,448 INFO L290 TraceCheckUtils]: 138: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,448 INFO L290 TraceCheckUtils]: 139: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,448 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {21149#true} {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} #68#return; {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} is VALID [2022-04-28 11:22:30,448 INFO L272 TraceCheckUtils]: 141: Hoare triple {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,448 INFO L290 TraceCheckUtils]: 142: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,448 INFO L290 TraceCheckUtils]: 143: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,448 INFO L290 TraceCheckUtils]: 144: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,449 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {21149#true} {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} #70#return; {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} is VALID [2022-04-28 11:22:30,449 INFO L290 TraceCheckUtils]: 146: Hoare triple {21515#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21597#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} is VALID [2022-04-28 11:22:30,449 INFO L290 TraceCheckUtils]: 147: Hoare triple {21597#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} assume !false; {21597#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} is VALID [2022-04-28 11:22:30,449 INFO L272 TraceCheckUtils]: 148: Hoare triple {21597#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,449 INFO L290 TraceCheckUtils]: 149: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,449 INFO L290 TraceCheckUtils]: 150: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,449 INFO L290 TraceCheckUtils]: 151: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,450 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {21149#true} {21597#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} #62#return; {21597#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} is VALID [2022-04-28 11:22:30,450 INFO L272 TraceCheckUtils]: 153: Hoare triple {21597#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:30,450 INFO L290 TraceCheckUtils]: 154: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:30,450 INFO L290 TraceCheckUtils]: 155: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:30,450 INFO L290 TraceCheckUtils]: 156: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:30,450 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21149#true} {21597#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} #64#return; {21597#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} is VALID [2022-04-28 11:22:30,450 INFO L272 TraceCheckUtils]: 158: Hoare triple {21597#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21634#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:30,451 INFO L290 TraceCheckUtils]: 159: Hoare triple {21634#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21638#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:30,451 INFO L290 TraceCheckUtils]: 160: Hoare triple {21638#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21150#false} is VALID [2022-04-28 11:22:30,451 INFO L290 TraceCheckUtils]: 161: Hoare triple {21150#false} assume !false; {21150#false} is VALID [2022-04-28 11:22:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 54 proven. 90 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-04-28 11:22:30,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:22:31,007 INFO L290 TraceCheckUtils]: 161: Hoare triple {21150#false} assume !false; {21150#false} is VALID [2022-04-28 11:22:31,007 INFO L290 TraceCheckUtils]: 160: Hoare triple {21638#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21150#false} is VALID [2022-04-28 11:22:31,007 INFO L290 TraceCheckUtils]: 159: Hoare triple {21634#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21638#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:31,008 INFO L272 TraceCheckUtils]: 158: Hoare triple {21654#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21634#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:31,008 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21149#true} {21654#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {21654#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:22:31,009 INFO L290 TraceCheckUtils]: 156: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,009 INFO L290 TraceCheckUtils]: 155: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,009 INFO L290 TraceCheckUtils]: 154: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,009 INFO L272 TraceCheckUtils]: 153: Hoare triple {21654#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,009 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {21149#true} {21654#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {21654#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:22:31,009 INFO L290 TraceCheckUtils]: 151: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,009 INFO L290 TraceCheckUtils]: 150: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,009 INFO L290 TraceCheckUtils]: 149: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,009 INFO L272 TraceCheckUtils]: 148: Hoare triple {21654#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,010 INFO L290 TraceCheckUtils]: 147: Hoare triple {21654#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {21654#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:22:31,012 INFO L290 TraceCheckUtils]: 146: Hoare triple {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21654#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:22:31,012 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {21149#true} {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:22:31,012 INFO L290 TraceCheckUtils]: 144: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,012 INFO L290 TraceCheckUtils]: 143: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,012 INFO L290 TraceCheckUtils]: 142: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,012 INFO L272 TraceCheckUtils]: 141: Hoare triple {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,013 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {21149#true} {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:22:31,013 INFO L290 TraceCheckUtils]: 139: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,013 INFO L290 TraceCheckUtils]: 138: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,013 INFO L290 TraceCheckUtils]: 137: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,013 INFO L272 TraceCheckUtils]: 136: Hoare triple {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,013 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {21149#true} {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:22:31,013 INFO L290 TraceCheckUtils]: 134: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,014 INFO L290 TraceCheckUtils]: 133: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,014 INFO L290 TraceCheckUtils]: 132: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,014 INFO L272 TraceCheckUtils]: 131: Hoare triple {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,014 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {21149#true} {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:22:31,014 INFO L290 TraceCheckUtils]: 129: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,014 INFO L290 TraceCheckUtils]: 128: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,014 INFO L290 TraceCheckUtils]: 127: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,014 INFO L272 TraceCheckUtils]: 126: Hoare triple {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,015 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {21149#true} {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:22:31,015 INFO L290 TraceCheckUtils]: 124: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,015 INFO L290 TraceCheckUtils]: 123: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,015 INFO L290 TraceCheckUtils]: 122: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,015 INFO L272 TraceCheckUtils]: 121: Hoare triple {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,015 INFO L290 TraceCheckUtils]: 120: Hoare triple {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:22:31,018 INFO L290 TraceCheckUtils]: 119: Hoare triple {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21691#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:22:31,019 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21149#true} {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:22:31,019 INFO L290 TraceCheckUtils]: 117: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,019 INFO L290 TraceCheckUtils]: 116: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,019 INFO L290 TraceCheckUtils]: 115: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,019 INFO L272 TraceCheckUtils]: 114: Hoare triple {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,019 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {21149#true} {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:22:31,019 INFO L290 TraceCheckUtils]: 112: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,019 INFO L290 TraceCheckUtils]: 111: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,019 INFO L290 TraceCheckUtils]: 110: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,019 INFO L272 TraceCheckUtils]: 109: Hoare triple {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,020 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21149#true} {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:22:31,020 INFO L290 TraceCheckUtils]: 107: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,020 INFO L290 TraceCheckUtils]: 106: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,020 INFO L290 TraceCheckUtils]: 105: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,020 INFO L272 TraceCheckUtils]: 104: Hoare triple {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,021 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {21149#true} {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:22:31,021 INFO L290 TraceCheckUtils]: 102: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,021 INFO L290 TraceCheckUtils]: 101: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,021 INFO L290 TraceCheckUtils]: 100: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,021 INFO L272 TraceCheckUtils]: 99: Hoare triple {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,021 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {21149#true} {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:22:31,021 INFO L290 TraceCheckUtils]: 97: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,021 INFO L290 TraceCheckUtils]: 96: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,022 INFO L290 TraceCheckUtils]: 95: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,022 INFO L272 TraceCheckUtils]: 94: Hoare triple {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,022 INFO L290 TraceCheckUtils]: 93: Hoare triple {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:22:31,024 INFO L290 TraceCheckUtils]: 92: Hoare triple {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21773#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:22:31,025 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21149#true} {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #70#return; {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:22:31,025 INFO L290 TraceCheckUtils]: 90: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,025 INFO L290 TraceCheckUtils]: 89: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,025 INFO L290 TraceCheckUtils]: 88: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,025 INFO L272 TraceCheckUtils]: 87: Hoare triple {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,026 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21149#true} {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #68#return; {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:22:31,026 INFO L290 TraceCheckUtils]: 85: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,026 INFO L290 TraceCheckUtils]: 84: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,026 INFO L290 TraceCheckUtils]: 83: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,026 INFO L272 TraceCheckUtils]: 82: Hoare triple {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,026 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {21149#true} {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #66#return; {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:22:31,026 INFO L290 TraceCheckUtils]: 80: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,026 INFO L290 TraceCheckUtils]: 79: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,026 INFO L290 TraceCheckUtils]: 78: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,027 INFO L272 TraceCheckUtils]: 77: Hoare triple {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,027 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {21149#true} {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #64#return; {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:22:31,027 INFO L290 TraceCheckUtils]: 75: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,027 INFO L290 TraceCheckUtils]: 74: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,027 INFO L290 TraceCheckUtils]: 73: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,027 INFO L272 TraceCheckUtils]: 72: Hoare triple {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,028 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21149#true} {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #62#return; {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:22:31,028 INFO L290 TraceCheckUtils]: 70: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,028 INFO L290 TraceCheckUtils]: 69: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,028 INFO L290 TraceCheckUtils]: 68: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,028 INFO L272 TraceCheckUtils]: 67: Hoare triple {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,028 INFO L290 TraceCheckUtils]: 66: Hoare triple {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} assume !false; {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:22:31,031 INFO L290 TraceCheckUtils]: 65: Hoare triple {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21855#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:22:31,031 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21149#true} {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #70#return; {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:22:31,031 INFO L290 TraceCheckUtils]: 63: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,031 INFO L290 TraceCheckUtils]: 62: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,031 INFO L290 TraceCheckUtils]: 61: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,032 INFO L272 TraceCheckUtils]: 60: Hoare triple {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,032 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21149#true} {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #68#return; {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:22:31,032 INFO L290 TraceCheckUtils]: 58: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,032 INFO L290 TraceCheckUtils]: 56: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,032 INFO L272 TraceCheckUtils]: 55: Hoare triple {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,033 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21149#true} {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #66#return; {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:22:31,033 INFO L290 TraceCheckUtils]: 53: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,033 INFO L290 TraceCheckUtils]: 52: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,033 INFO L290 TraceCheckUtils]: 51: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,033 INFO L272 TraceCheckUtils]: 50: Hoare triple {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,033 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {21149#true} {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #64#return; {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:22:31,033 INFO L290 TraceCheckUtils]: 48: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,033 INFO L290 TraceCheckUtils]: 47: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,034 INFO L290 TraceCheckUtils]: 46: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,034 INFO L272 TraceCheckUtils]: 45: Hoare triple {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,034 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {21149#true} {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #62#return; {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:22:31,034 INFO L290 TraceCheckUtils]: 43: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,034 INFO L290 TraceCheckUtils]: 42: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,034 INFO L290 TraceCheckUtils]: 41: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,034 INFO L272 TraceCheckUtils]: 40: Hoare triple {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} assume !false; {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:22:31,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21937#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:22:31,038 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21149#true} {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #70#return; {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:22:31,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,038 INFO L272 TraceCheckUtils]: 33: Hoare triple {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,038 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21149#true} {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #68#return; {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:22:31,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,039 INFO L272 TraceCheckUtils]: 28: Hoare triple {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,039 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {21149#true} {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #66#return; {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:22:31,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,039 INFO L272 TraceCheckUtils]: 23: Hoare triple {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,040 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21149#true} {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #64#return; {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:22:31,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,040 INFO L272 TraceCheckUtils]: 18: Hoare triple {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,040 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21149#true} {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #62#return; {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:22:31,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,041 INFO L272 TraceCheckUtils]: 13: Hoare triple {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} assume !false; {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:22:31,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {21149#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {22019#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:22:31,042 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21149#true} {21149#true} #60#return; {21149#true} is VALID [2022-04-28 11:22:31,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {21149#true} assume !(0 == ~cond); {21149#true} is VALID [2022-04-28 11:22:31,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {21149#true} ~cond := #in~cond; {21149#true} is VALID [2022-04-28 11:22:31,042 INFO L272 TraceCheckUtils]: 6: Hoare triple {21149#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {21149#true} is VALID [2022-04-28 11:22:31,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {21149#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {21149#true} is VALID [2022-04-28 11:22:31,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {21149#true} call #t~ret5 := main(); {21149#true} is VALID [2022-04-28 11:22:31,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21149#true} {21149#true} #84#return; {21149#true} is VALID [2022-04-28 11:22:31,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {21149#true} assume true; {21149#true} is VALID [2022-04-28 11:22:31,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {21149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21149#true} is VALID [2022-04-28 11:22:31,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {21149#true} call ULTIMATE.init(); {21149#true} is VALID [2022-04-28 11:22:31,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 54 proven. 90 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-04-28 11:22:31,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:31,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380419356] [2022-04-28 11:22:31,043 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:31,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046579059] [2022-04-28 11:22:31,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046579059] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:22:31,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:22:31,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-28 11:22:31,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:31,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1561334280] [2022-04-28 11:22:31,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1561334280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:31,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:31,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:22:31,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79651119] [2022-04-28 11:22:31,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:31,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) Word has length 162 [2022-04-28 11:22:31,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:31,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:22:31,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:31,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:22:31,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:31,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:22:31,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:22:31,130 INFO L87 Difference]: Start difference. First operand 165 states and 170 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:22:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:34,911 INFO L93 Difference]: Finished difference Result 193 states and 211 transitions. [2022-04-28 11:22:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:22:34,911 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) Word has length 162 [2022-04-28 11:22:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:22:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2022-04-28 11:22:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:22:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2022-04-28 11:22:34,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 130 transitions. [2022-04-28 11:22:35,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:35,074 INFO L225 Difference]: With dead ends: 193 [2022-04-28 11:22:35,074 INFO L226 Difference]: Without dead ends: 191 [2022-04-28 11:22:35,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:22:35,075 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 7 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:35,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 324 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 11:22:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-28 11:22:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 180. [2022-04-28 11:22:35,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:35,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 180 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 40 states have call successors, (40), 32 states have call predecessors, (40), 31 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:22:35,253 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 180 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 40 states have call successors, (40), 32 states have call predecessors, (40), 31 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:22:35,253 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 180 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 40 states have call successors, (40), 32 states have call predecessors, (40), 31 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:22:35,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:35,272 INFO L93 Difference]: Finished difference Result 191 states and 209 transitions. [2022-04-28 11:22:35,272 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 209 transitions. [2022-04-28 11:22:35,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:35,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:35,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 40 states have call successors, (40), 32 states have call predecessors, (40), 31 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) Second operand 191 states. [2022-04-28 11:22:35,272 INFO L87 Difference]: Start difference. First operand has 180 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 40 states have call successors, (40), 32 states have call predecessors, (40), 31 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) Second operand 191 states. [2022-04-28 11:22:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:35,275 INFO L93 Difference]: Finished difference Result 191 states and 209 transitions. [2022-04-28 11:22:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 209 transitions. [2022-04-28 11:22:35,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:35,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:35,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:35,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 110 states have internal predecessors, (111), 40 states have call successors, (40), 32 states have call predecessors, (40), 31 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:22:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 189 transitions. [2022-04-28 11:22:35,277 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 189 transitions. Word has length 162 [2022-04-28 11:22:35,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:35,278 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 189 transitions. [2022-04-28 11:22:35,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:22:35,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 180 states and 189 transitions. [2022-04-28 11:22:38,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 188 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 189 transitions. [2022-04-28 11:22:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-04-28 11:22:38,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:38,253 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:38,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-28 11:22:38,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 11:22:38,454 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:38,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:38,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1267842796, now seen corresponding path program 1 times [2022-04-28 11:22:38,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:38,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1589581969] [2022-04-28 11:22:38,709 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:22:38,709 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:22:38,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1267842796, now seen corresponding path program 2 times [2022-04-28 11:22:38,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:38,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293558901] [2022-04-28 11:22:38,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:38,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:38,717 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:38,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1277619465] [2022-04-28 11:22:38,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:38,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:38,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:38,718 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:22:38,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 11:22:38,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:22:38,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:38,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 11:22:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:38,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:46,231 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:22:46,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {23266#true} call ULTIMATE.init(); {23266#true} is VALID [2022-04-28 11:22:46,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {23266#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23266#true} is VALID [2022-04-28 11:22:46,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23266#true} {23266#true} #84#return; {23266#true} is VALID [2022-04-28 11:22:46,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {23266#true} call #t~ret5 := main(); {23266#true} is VALID [2022-04-28 11:22:46,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {23266#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {23266#true} is VALID [2022-04-28 11:22:46,306 INFO L272 TraceCheckUtils]: 6: Hoare triple {23266#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,307 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23266#true} {23266#true} #60#return; {23266#true} is VALID [2022-04-28 11:22:46,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {23266#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:46,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:46,307 INFO L272 TraceCheckUtils]: 13: Hoare triple {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,308 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23266#true} {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:46,308 INFO L272 TraceCheckUtils]: 18: Hoare triple {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,309 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {23266#true} {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:46,309 INFO L272 TraceCheckUtils]: 23: Hoare triple {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,309 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {23266#true} {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:46,309 INFO L272 TraceCheckUtils]: 28: Hoare triple {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,310 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23266#true} {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:46,310 INFO L272 TraceCheckUtils]: 33: Hoare triple {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,310 INFO L290 TraceCheckUtils]: 36: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,311 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23266#true} {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:22:46,311 INFO L290 TraceCheckUtils]: 38: Hoare triple {23304#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:22:46,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !false; {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:22:46,312 INFO L272 TraceCheckUtils]: 40: Hoare triple {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,312 INFO L290 TraceCheckUtils]: 42: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,312 INFO L290 TraceCheckUtils]: 43: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,312 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {23266#true} {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #62#return; {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:22:46,312 INFO L272 TraceCheckUtils]: 45: Hoare triple {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,312 INFO L290 TraceCheckUtils]: 47: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,312 INFO L290 TraceCheckUtils]: 48: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,313 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {23266#true} {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #64#return; {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:22:46,313 INFO L272 TraceCheckUtils]: 50: Hoare triple {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,313 INFO L290 TraceCheckUtils]: 51: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,313 INFO L290 TraceCheckUtils]: 52: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,313 INFO L290 TraceCheckUtils]: 53: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,314 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {23266#true} {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #66#return; {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:22:46,314 INFO L272 TraceCheckUtils]: 55: Hoare triple {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,314 INFO L290 TraceCheckUtils]: 56: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,314 INFO L290 TraceCheckUtils]: 57: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,314 INFO L290 TraceCheckUtils]: 58: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,314 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23266#true} {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #68#return; {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:22:46,314 INFO L272 TraceCheckUtils]: 60: Hoare triple {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,314 INFO L290 TraceCheckUtils]: 61: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,314 INFO L290 TraceCheckUtils]: 62: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,314 INFO L290 TraceCheckUtils]: 63: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,315 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23266#true} {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #70#return; {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:22:46,316 INFO L290 TraceCheckUtils]: 65: Hoare triple {23386#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} is VALID [2022-04-28 11:22:46,317 INFO L290 TraceCheckUtils]: 66: Hoare triple {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} assume !false; {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} is VALID [2022-04-28 11:22:46,317 INFO L272 TraceCheckUtils]: 67: Hoare triple {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,317 INFO L290 TraceCheckUtils]: 68: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,317 INFO L290 TraceCheckUtils]: 69: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,317 INFO L290 TraceCheckUtils]: 70: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,317 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23266#true} {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} #62#return; {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} is VALID [2022-04-28 11:22:46,317 INFO L272 TraceCheckUtils]: 72: Hoare triple {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,317 INFO L290 TraceCheckUtils]: 73: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,317 INFO L290 TraceCheckUtils]: 74: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,317 INFO L290 TraceCheckUtils]: 75: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,318 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {23266#true} {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} #64#return; {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} is VALID [2022-04-28 11:22:46,318 INFO L272 TraceCheckUtils]: 77: Hoare triple {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,318 INFO L290 TraceCheckUtils]: 78: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,318 INFO L290 TraceCheckUtils]: 79: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,318 INFO L290 TraceCheckUtils]: 80: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,319 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {23266#true} {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} #66#return; {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} is VALID [2022-04-28 11:22:46,319 INFO L272 TraceCheckUtils]: 82: Hoare triple {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,319 INFO L290 TraceCheckUtils]: 83: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,319 INFO L290 TraceCheckUtils]: 84: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,319 INFO L290 TraceCheckUtils]: 85: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,319 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {23266#true} {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} #68#return; {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} is VALID [2022-04-28 11:22:46,319 INFO L272 TraceCheckUtils]: 87: Hoare triple {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,319 INFO L290 TraceCheckUtils]: 88: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,319 INFO L290 TraceCheckUtils]: 89: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,320 INFO L290 TraceCheckUtils]: 90: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,320 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {23266#true} {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} #70#return; {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} is VALID [2022-04-28 11:22:46,321 INFO L290 TraceCheckUtils]: 92: Hoare triple {23468#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} is VALID [2022-04-28 11:22:46,321 INFO L290 TraceCheckUtils]: 93: Hoare triple {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} assume !false; {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} is VALID [2022-04-28 11:22:46,321 INFO L272 TraceCheckUtils]: 94: Hoare triple {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,322 INFO L290 TraceCheckUtils]: 95: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,322 INFO L290 TraceCheckUtils]: 96: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,322 INFO L290 TraceCheckUtils]: 97: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,322 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23266#true} {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} #62#return; {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} is VALID [2022-04-28 11:22:46,322 INFO L272 TraceCheckUtils]: 99: Hoare triple {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,322 INFO L290 TraceCheckUtils]: 100: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,322 INFO L290 TraceCheckUtils]: 101: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,322 INFO L290 TraceCheckUtils]: 102: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,323 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {23266#true} {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} #64#return; {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} is VALID [2022-04-28 11:22:46,323 INFO L272 TraceCheckUtils]: 104: Hoare triple {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,323 INFO L290 TraceCheckUtils]: 105: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,323 INFO L290 TraceCheckUtils]: 106: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,323 INFO L290 TraceCheckUtils]: 107: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,323 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {23266#true} {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} #66#return; {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} is VALID [2022-04-28 11:22:46,323 INFO L272 TraceCheckUtils]: 109: Hoare triple {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,324 INFO L290 TraceCheckUtils]: 110: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,324 INFO L290 TraceCheckUtils]: 111: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,324 INFO L290 TraceCheckUtils]: 112: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,324 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {23266#true} {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} #68#return; {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} is VALID [2022-04-28 11:22:46,324 INFO L272 TraceCheckUtils]: 114: Hoare triple {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,324 INFO L290 TraceCheckUtils]: 115: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,324 INFO L290 TraceCheckUtils]: 116: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,324 INFO L290 TraceCheckUtils]: 117: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,325 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {23266#true} {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} #70#return; {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} is VALID [2022-04-28 11:22:46,326 INFO L290 TraceCheckUtils]: 119: Hoare triple {23550#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:22:46,326 INFO L290 TraceCheckUtils]: 120: Hoare triple {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} assume !false; {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:22:46,326 INFO L272 TraceCheckUtils]: 121: Hoare triple {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,326 INFO L290 TraceCheckUtils]: 122: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,326 INFO L290 TraceCheckUtils]: 123: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,326 INFO L290 TraceCheckUtils]: 124: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,327 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {23266#true} {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} #62#return; {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:22:46,327 INFO L272 TraceCheckUtils]: 126: Hoare triple {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,327 INFO L290 TraceCheckUtils]: 127: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,327 INFO L290 TraceCheckUtils]: 128: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,327 INFO L290 TraceCheckUtils]: 129: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,328 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {23266#true} {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} #64#return; {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:22:46,328 INFO L272 TraceCheckUtils]: 131: Hoare triple {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,328 INFO L290 TraceCheckUtils]: 132: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,328 INFO L290 TraceCheckUtils]: 133: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,328 INFO L290 TraceCheckUtils]: 134: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,328 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {23266#true} {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} #66#return; {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:22:46,328 INFO L272 TraceCheckUtils]: 136: Hoare triple {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,328 INFO L290 TraceCheckUtils]: 137: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,329 INFO L290 TraceCheckUtils]: 138: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,329 INFO L290 TraceCheckUtils]: 139: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,329 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {23266#true} {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} #68#return; {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:22:46,329 INFO L272 TraceCheckUtils]: 141: Hoare triple {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,329 INFO L290 TraceCheckUtils]: 142: Hoare triple {23266#true} ~cond := #in~cond; {23702#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:46,347 INFO L290 TraceCheckUtils]: 143: Hoare triple {23702#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23706#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:46,347 INFO L290 TraceCheckUtils]: 144: Hoare triple {23706#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23706#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:46,348 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {23706#(not (= |__VERIFIER_assert_#in~cond| 0))} {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} #70#return; {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:22:46,348 INFO L290 TraceCheckUtils]: 146: Hoare triple {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} assume !(~n~0 <= ~a~0); {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:22:46,348 INFO L272 TraceCheckUtils]: 147: Hoare triple {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,348 INFO L290 TraceCheckUtils]: 148: Hoare triple {23266#true} ~cond := #in~cond; {23266#true} is VALID [2022-04-28 11:22:46,348 INFO L290 TraceCheckUtils]: 149: Hoare triple {23266#true} assume !(0 == ~cond); {23266#true} is VALID [2022-04-28 11:22:46,348 INFO L290 TraceCheckUtils]: 150: Hoare triple {23266#true} assume true; {23266#true} is VALID [2022-04-28 11:22:46,349 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {23266#true} {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} #72#return; {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:22:46,349 INFO L272 TraceCheckUtils]: 152: Hoare triple {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,349 INFO L290 TraceCheckUtils]: 153: Hoare triple {23266#true} ~cond := #in~cond; {23702#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:46,349 INFO L290 TraceCheckUtils]: 154: Hoare triple {23702#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23706#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:46,350 INFO L290 TraceCheckUtils]: 155: Hoare triple {23706#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23706#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:46,350 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {23706#(not (= |__VERIFIER_assert_#in~cond| 0))} {23632#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} #74#return; {23746#(and (= (+ 29 main_~y~0) (* main_~z~0 3)) (= (+ main_~x~0 (* main_~z~0 9)) (+ 90 (* main_~y~0 4))) (= 30 main_~z~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-28 11:22:46,351 INFO L272 TraceCheckUtils]: 157: Hoare triple {23746#(and (= (+ 29 main_~y~0) (* main_~z~0 3)) (= (+ main_~x~0 (* main_~z~0 9)) (+ 90 (* main_~y~0 4))) (= 30 main_~z~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {23266#true} is VALID [2022-04-28 11:22:46,351 INFO L290 TraceCheckUtils]: 158: Hoare triple {23266#true} ~cond := #in~cond; {23702#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:46,351 INFO L290 TraceCheckUtils]: 159: Hoare triple {23702#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23706#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:46,351 INFO L290 TraceCheckUtils]: 160: Hoare triple {23706#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23706#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:46,352 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {23706#(not (= |__VERIFIER_assert_#in~cond| 0))} {23746#(and (= (+ 29 main_~y~0) (* main_~z~0 3)) (= (+ main_~x~0 (* main_~z~0 9)) (+ 90 (* main_~y~0 4))) (= 30 main_~z~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #76#return; {23762#(and (= (+ 29 main_~y~0) (* main_~z~0 3)) (= (+ main_~x~0 (* main_~z~0 9)) (+ 90 (* main_~y~0 4))) (= 30 main_~z~0))} is VALID [2022-04-28 11:22:46,354 INFO L272 TraceCheckUtils]: 162: Hoare triple {23762#(and (= (+ 29 main_~y~0) (* main_~z~0 3)) (= (+ main_~x~0 (* main_~z~0 9)) (+ 90 (* main_~y~0 4))) (= 30 main_~z~0))} call __VERIFIER_assert((if 0 == 2 * ~y~0 * ~y~0 - 3 * ~x~0 * ~z~0 - 18 * ~x~0 - 10 * ~y~0 + 3 * ~z~0 - 10 then 1 else 0)); {23766#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:46,354 INFO L290 TraceCheckUtils]: 163: Hoare triple {23766#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23770#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:46,354 INFO L290 TraceCheckUtils]: 164: Hoare triple {23770#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23267#false} is VALID [2022-04-28 11:22:46,354 INFO L290 TraceCheckUtils]: 165: Hoare triple {23267#false} assume !false; {23267#false} is VALID [2022-04-28 11:22:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2022-04-28 11:22:46,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:23:08,328 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:23:50,976 WARN L232 SmtUtils]: Spent 33.69s on a formula simplification. DAG size of input: 65 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 11:23:55,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:55,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293558901] [2022-04-28 11:23:55,101 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:23:55,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277619465] [2022-04-28 11:23:55,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277619465] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:23:55,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:23:55,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 11:23:55,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:55,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1589581969] [2022-04-28 11:23:55,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1589581969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:55,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:55,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:23:55,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441344092] [2022-04-28 11:23:55,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:55,102 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) Word has length 166 [2022-04-28 11:23:55,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:55,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) [2022-04-28 11:23:55,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:55,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:23:55,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:55,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:23:55,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=258, Unknown=1, NotChecked=0, Total=342 [2022-04-28 11:23:55,188 INFO L87 Difference]: Start difference. First operand 180 states and 189 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) [2022-04-28 11:23:58,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:58,020 INFO L93 Difference]: Finished difference Result 202 states and 210 transitions. [2022-04-28 11:23:58,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:23:58,020 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) Word has length 166 [2022-04-28 11:23:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) [2022-04-28 11:23:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2022-04-28 11:23:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) [2022-04-28 11:23:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2022-04-28 11:23:58,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 110 transitions. [2022-04-28 11:23:58,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:58,141 INFO L225 Difference]: With dead ends: 202 [2022-04-28 11:23:58,141 INFO L226 Difference]: Without dead ends: 188 [2022-04-28 11:23:58,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=96, Invalid=323, Unknown=1, NotChecked=0, Total=420 [2022-04-28 11:23:58,141 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:58,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 218 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 11:23:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-04-28 11:23:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-04-28 11:23:58,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:23:58,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 188 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 40 states have call successors, (40), 34 states have call predecessors, (40), 33 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:23:58,358 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 188 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 40 states have call successors, (40), 34 states have call predecessors, (40), 33 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:23:58,358 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 188 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 40 states have call successors, (40), 34 states have call predecessors, (40), 33 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:23:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:58,360 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2022-04-28 11:23:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 194 transitions. [2022-04-28 11:23:58,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:58,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:58,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 40 states have call successors, (40), 34 states have call predecessors, (40), 33 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) Second operand 188 states. [2022-04-28 11:23:58,361 INFO L87 Difference]: Start difference. First operand has 188 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 40 states have call successors, (40), 34 states have call predecessors, (40), 33 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) Second operand 188 states. [2022-04-28 11:23:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:58,363 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2022-04-28 11:23:58,363 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 194 transitions. [2022-04-28 11:23:58,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:58,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:58,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:23:58,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:23:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 116 states have internal predecessors, (116), 40 states have call successors, (40), 34 states have call predecessors, (40), 33 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 11:23:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 194 transitions. [2022-04-28 11:23:58,366 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 194 transitions. Word has length 166 [2022-04-28 11:23:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:23:58,366 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 194 transitions. [2022-04-28 11:23:58,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) [2022-04-28 11:23:58,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 188 states and 194 transitions. [2022-04-28 11:24:01,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 193 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 194 transitions. [2022-04-28 11:24:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-04-28 11:24:01,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:01,634 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 32, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:01,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 11:24:01,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 11:24:01,834 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:01,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:01,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1777251365, now seen corresponding path program 23 times [2022-04-28 11:24:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:01,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [555566547] [2022-04-28 11:24:02,080 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:24:02,080 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:24:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1777251365, now seen corresponding path program 24 times [2022-04-28 11:24:02,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:02,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615822138] [2022-04-28 11:24:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:02,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:02,097 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:02,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [34602418] [2022-04-28 11:24:02,097 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:24:02,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:02,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:02,098 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:24:02,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 11:24:02,196 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:24:02,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:02,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 11:24:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:02,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:02,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {25086#true} call ULTIMATE.init(); {25086#true} is VALID [2022-04-28 11:24:02,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {25086#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {25086#true} is VALID [2022-04-28 11:24:02,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25086#true} {25086#true} #84#return; {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {25086#true} call #t~ret5 := main(); {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {25086#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L272 TraceCheckUtils]: 6: Hoare triple {25086#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25086#true} {25086#true} #60#return; {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {25086#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {25086#true} assume !false; {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L272 TraceCheckUtils]: 13: Hoare triple {25086#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25086#true} {25086#true} #62#return; {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L272 TraceCheckUtils]: 18: Hoare triple {25086#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25086#true} {25086#true} #64#return; {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L272 TraceCheckUtils]: 23: Hoare triple {25086#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25086#true} {25086#true} #66#return; {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L272 TraceCheckUtils]: 28: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25086#true} {25086#true} #68#return; {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L272 TraceCheckUtils]: 33: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25086#true} {25086#true} #70#return; {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L290 TraceCheckUtils]: 38: Hoare triple {25086#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25086#true} is VALID [2022-04-28 11:24:02,843 INFO L290 TraceCheckUtils]: 39: Hoare triple {25086#true} assume !false; {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L272 TraceCheckUtils]: 40: Hoare triple {25086#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L290 TraceCheckUtils]: 41: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L290 TraceCheckUtils]: 42: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L290 TraceCheckUtils]: 43: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {25086#true} {25086#true} #62#return; {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L272 TraceCheckUtils]: 45: Hoare triple {25086#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L290 TraceCheckUtils]: 46: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L290 TraceCheckUtils]: 47: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L290 TraceCheckUtils]: 48: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {25086#true} {25086#true} #64#return; {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L272 TraceCheckUtils]: 50: Hoare triple {25086#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L290 TraceCheckUtils]: 51: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L290 TraceCheckUtils]: 52: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L290 TraceCheckUtils]: 53: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {25086#true} {25086#true} #66#return; {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L272 TraceCheckUtils]: 55: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L290 TraceCheckUtils]: 56: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L290 TraceCheckUtils]: 57: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,844 INFO L290 TraceCheckUtils]: 58: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25086#true} {25086#true} #68#return; {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L272 TraceCheckUtils]: 60: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L290 TraceCheckUtils]: 61: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L290 TraceCheckUtils]: 62: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L290 TraceCheckUtils]: 63: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25086#true} {25086#true} #70#return; {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L290 TraceCheckUtils]: 65: Hoare triple {25086#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L290 TraceCheckUtils]: 66: Hoare triple {25086#true} assume !false; {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L272 TraceCheckUtils]: 67: Hoare triple {25086#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L290 TraceCheckUtils]: 68: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L290 TraceCheckUtils]: 69: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L290 TraceCheckUtils]: 70: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25086#true} {25086#true} #62#return; {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L272 TraceCheckUtils]: 72: Hoare triple {25086#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L290 TraceCheckUtils]: 73: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L290 TraceCheckUtils]: 74: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L290 TraceCheckUtils]: 75: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {25086#true} {25086#true} #64#return; {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L272 TraceCheckUtils]: 77: Hoare triple {25086#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,845 INFO L290 TraceCheckUtils]: 78: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L290 TraceCheckUtils]: 79: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L290 TraceCheckUtils]: 80: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25086#true} {25086#true} #66#return; {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L272 TraceCheckUtils]: 82: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L290 TraceCheckUtils]: 83: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L290 TraceCheckUtils]: 84: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L290 TraceCheckUtils]: 85: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25086#true} {25086#true} #68#return; {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L272 TraceCheckUtils]: 87: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L290 TraceCheckUtils]: 88: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L290 TraceCheckUtils]: 89: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L290 TraceCheckUtils]: 90: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {25086#true} {25086#true} #70#return; {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L290 TraceCheckUtils]: 92: Hoare triple {25086#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L290 TraceCheckUtils]: 93: Hoare triple {25086#true} assume !false; {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L272 TraceCheckUtils]: 94: Hoare triple {25086#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L290 TraceCheckUtils]: 95: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L290 TraceCheckUtils]: 96: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,846 INFO L290 TraceCheckUtils]: 97: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25086#true} {25086#true} #62#return; {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L272 TraceCheckUtils]: 99: Hoare triple {25086#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L290 TraceCheckUtils]: 100: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L290 TraceCheckUtils]: 101: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L290 TraceCheckUtils]: 102: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25086#true} {25086#true} #64#return; {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L272 TraceCheckUtils]: 104: Hoare triple {25086#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L290 TraceCheckUtils]: 105: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L290 TraceCheckUtils]: 106: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L290 TraceCheckUtils]: 107: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25086#true} {25086#true} #66#return; {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L272 TraceCheckUtils]: 109: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L290 TraceCheckUtils]: 110: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L290 TraceCheckUtils]: 111: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L290 TraceCheckUtils]: 112: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {25086#true} {25086#true} #68#return; {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L272 TraceCheckUtils]: 114: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L290 TraceCheckUtils]: 115: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,847 INFO L290 TraceCheckUtils]: 116: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L290 TraceCheckUtils]: 117: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {25086#true} {25086#true} #70#return; {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L290 TraceCheckUtils]: 119: Hoare triple {25086#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L290 TraceCheckUtils]: 120: Hoare triple {25086#true} assume !false; {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L272 TraceCheckUtils]: 121: Hoare triple {25086#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L290 TraceCheckUtils]: 122: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L290 TraceCheckUtils]: 123: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L290 TraceCheckUtils]: 124: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {25086#true} {25086#true} #62#return; {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L272 TraceCheckUtils]: 126: Hoare triple {25086#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L290 TraceCheckUtils]: 127: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L290 TraceCheckUtils]: 128: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L290 TraceCheckUtils]: 129: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25086#true} {25086#true} #64#return; {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L272 TraceCheckUtils]: 131: Hoare triple {25086#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L290 TraceCheckUtils]: 132: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L290 TraceCheckUtils]: 133: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L290 TraceCheckUtils]: 134: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25086#true} {25086#true} #66#return; {25086#true} is VALID [2022-04-28 11:24:02,848 INFO L272 TraceCheckUtils]: 136: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L290 TraceCheckUtils]: 137: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L290 TraceCheckUtils]: 138: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L290 TraceCheckUtils]: 139: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25086#true} {25086#true} #68#return; {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L272 TraceCheckUtils]: 141: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L290 TraceCheckUtils]: 142: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L290 TraceCheckUtils]: 143: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L290 TraceCheckUtils]: 144: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25086#true} {25086#true} #70#return; {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L290 TraceCheckUtils]: 146: Hoare triple {25086#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L290 TraceCheckUtils]: 147: Hoare triple {25086#true} assume !false; {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L272 TraceCheckUtils]: 148: Hoare triple {25086#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L290 TraceCheckUtils]: 149: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L290 TraceCheckUtils]: 150: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L290 TraceCheckUtils]: 151: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {25086#true} {25086#true} #62#return; {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L272 TraceCheckUtils]: 153: Hoare triple {25086#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L290 TraceCheckUtils]: 154: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,849 INFO L290 TraceCheckUtils]: 155: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,850 INFO L290 TraceCheckUtils]: 156: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,850 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25086#true} {25086#true} #64#return; {25086#true} is VALID [2022-04-28 11:24:02,850 INFO L272 TraceCheckUtils]: 158: Hoare triple {25086#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,850 INFO L290 TraceCheckUtils]: 159: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:24:02,850 INFO L290 TraceCheckUtils]: 160: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:24:02,850 INFO L290 TraceCheckUtils]: 161: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:24:02,850 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {25086#true} {25086#true} #66#return; {25086#true} is VALID [2022-04-28 11:24:02,850 INFO L272 TraceCheckUtils]: 163: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,850 INFO L290 TraceCheckUtils]: 164: Hoare triple {25086#true} ~cond := #in~cond; {25583#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:02,850 INFO L290 TraceCheckUtils]: 165: Hoare triple {25583#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:02,851 INFO L290 TraceCheckUtils]: 166: Hoare triple {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:02,851 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} {25086#true} #68#return; {25594#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:24:02,851 INFO L272 TraceCheckUtils]: 168: Hoare triple {25594#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,852 INFO L290 TraceCheckUtils]: 169: Hoare triple {25086#true} ~cond := #in~cond; {25583#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:02,852 INFO L290 TraceCheckUtils]: 170: Hoare triple {25583#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:02,852 INFO L290 TraceCheckUtils]: 171: Hoare triple {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:02,852 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} {25594#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #70#return; {25610#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:24:02,857 INFO L290 TraceCheckUtils]: 173: Hoare triple {25610#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25610#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:24:02,858 INFO L290 TraceCheckUtils]: 174: Hoare triple {25610#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !false; {25610#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:24:02,858 INFO L272 TraceCheckUtils]: 175: Hoare triple {25610#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,858 INFO L290 TraceCheckUtils]: 176: Hoare triple {25086#true} ~cond := #in~cond; {25583#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:02,858 INFO L290 TraceCheckUtils]: 177: Hoare triple {25583#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:02,858 INFO L290 TraceCheckUtils]: 178: Hoare triple {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:02,862 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} {25610#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #62#return; {25632#(and (= (+ (* (+ (* main_~n~0 6) 6) (+ (* main_~n~0 6) 6)) 12) (+ (* main_~y~0 12) 36 (* main_~n~0 36))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~n~0 12) (* (+ (* main_~n~0 6) 6) main_~y~0) 12)))} is VALID [2022-04-28 11:24:02,862 INFO L272 TraceCheckUtils]: 180: Hoare triple {25632#(and (= (+ (* (+ (* main_~n~0 6) 6) (+ (* main_~n~0 6) 6)) 12) (+ (* main_~y~0 12) 36 (* main_~n~0 36))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~n~0 12) (* (+ (* main_~n~0 6) 6) main_~y~0) 12)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:24:02,862 INFO L290 TraceCheckUtils]: 181: Hoare triple {25086#true} ~cond := #in~cond; {25583#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:02,862 INFO L290 TraceCheckUtils]: 182: Hoare triple {25583#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:02,863 INFO L290 TraceCheckUtils]: 183: Hoare triple {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:02,864 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} {25632#(and (= (+ (* (+ (* main_~n~0 6) 6) (+ (* main_~n~0 6) 6)) 12) (+ (* main_~y~0 12) 36 (* main_~n~0 36))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~n~0 12) (* (+ (* main_~n~0 6) 6) main_~y~0) 12)))} #64#return; {25648#(= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18))} is VALID [2022-04-28 11:24:02,865 INFO L272 TraceCheckUtils]: 185: Hoare triple {25648#(= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:02,865 INFO L290 TraceCheckUtils]: 186: Hoare triple {25652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:02,865 INFO L290 TraceCheckUtils]: 187: Hoare triple {25656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25087#false} is VALID [2022-04-28 11:24:02,865 INFO L290 TraceCheckUtils]: 188: Hoare triple {25087#false} assume !false; {25087#false} is VALID [2022-04-28 11:24:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 430 proven. 4 refuted. 0 times theorem prover too weak. 1743 trivial. 0 not checked. [2022-04-28 11:24:02,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:27:34,160 INFO L290 TraceCheckUtils]: 188: Hoare triple {25087#false} assume !false; {25087#false} is VALID [2022-04-28 11:27:34,161 INFO L290 TraceCheckUtils]: 187: Hoare triple {25656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25087#false} is VALID [2022-04-28 11:27:34,161 INFO L290 TraceCheckUtils]: 186: Hoare triple {25652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:27:34,161 INFO L272 TraceCheckUtils]: 185: Hoare triple {25648#(= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:27:34,162 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} {25675#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18)))} #64#return; {25648#(= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18))} is VALID [2022-04-28 11:27:34,162 INFO L290 TraceCheckUtils]: 183: Hoare triple {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:34,162 INFO L290 TraceCheckUtils]: 182: Hoare triple {25685#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:34,163 INFO L290 TraceCheckUtils]: 181: Hoare triple {25086#true} ~cond := #in~cond; {25685#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:27:34,163 INFO L272 TraceCheckUtils]: 180: Hoare triple {25675#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:34,934 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} {25692#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} #62#return; {25675#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18)))} is VALID [2022-04-28 11:27:34,934 INFO L290 TraceCheckUtils]: 178: Hoare triple {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:34,934 INFO L290 TraceCheckUtils]: 177: Hoare triple {25685#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:34,935 INFO L290 TraceCheckUtils]: 176: Hoare triple {25086#true} ~cond := #in~cond; {25685#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:27:34,935 INFO L272 TraceCheckUtils]: 175: Hoare triple {25692#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:34,935 INFO L290 TraceCheckUtils]: 174: Hoare triple {25692#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} assume !false; {25692#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} is VALID [2022-04-28 11:27:35,120 INFO L290 TraceCheckUtils]: 173: Hoare triple {25692#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25692#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} is VALID [2022-04-28 11:27:35,121 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25086#true} {25692#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} #70#return; {25692#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} is VALID [2022-04-28 11:27:35,121 INFO L290 TraceCheckUtils]: 171: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,121 INFO L290 TraceCheckUtils]: 170: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,121 INFO L290 TraceCheckUtils]: 169: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,121 INFO L272 TraceCheckUtils]: 168: Hoare triple {25692#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,304 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} {25086#true} #68#return; {25692#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} is VALID [2022-04-28 11:27:35,304 INFO L290 TraceCheckUtils]: 166: Hoare triple {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:35,305 INFO L290 TraceCheckUtils]: 165: Hoare triple {25685#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:35,305 INFO L290 TraceCheckUtils]: 164: Hoare triple {25086#true} ~cond := #in~cond; {25685#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:27:35,305 INFO L272 TraceCheckUtils]: 163: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,305 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {25086#true} {25086#true} #66#return; {25086#true} is VALID [2022-04-28 11:27:35,305 INFO L290 TraceCheckUtils]: 161: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,305 INFO L290 TraceCheckUtils]: 160: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,305 INFO L290 TraceCheckUtils]: 159: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,305 INFO L272 TraceCheckUtils]: 158: Hoare triple {25086#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25086#true} {25086#true} #64#return; {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L290 TraceCheckUtils]: 156: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L290 TraceCheckUtils]: 155: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L290 TraceCheckUtils]: 154: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L272 TraceCheckUtils]: 153: Hoare triple {25086#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {25086#true} {25086#true} #62#return; {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L290 TraceCheckUtils]: 151: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L290 TraceCheckUtils]: 150: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L290 TraceCheckUtils]: 149: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L272 TraceCheckUtils]: 148: Hoare triple {25086#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L290 TraceCheckUtils]: 147: Hoare triple {25086#true} assume !false; {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L290 TraceCheckUtils]: 146: Hoare triple {25086#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25086#true} {25086#true} #70#return; {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L290 TraceCheckUtils]: 144: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L290 TraceCheckUtils]: 143: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L290 TraceCheckUtils]: 142: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L272 TraceCheckUtils]: 141: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25086#true} {25086#true} #68#return; {25086#true} is VALID [2022-04-28 11:27:35,306 INFO L290 TraceCheckUtils]: 139: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L290 TraceCheckUtils]: 138: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L290 TraceCheckUtils]: 137: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L272 TraceCheckUtils]: 136: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25086#true} {25086#true} #66#return; {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L290 TraceCheckUtils]: 134: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L290 TraceCheckUtils]: 133: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L290 TraceCheckUtils]: 132: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L272 TraceCheckUtils]: 131: Hoare triple {25086#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25086#true} {25086#true} #64#return; {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L290 TraceCheckUtils]: 129: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L290 TraceCheckUtils]: 128: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L290 TraceCheckUtils]: 127: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L272 TraceCheckUtils]: 126: Hoare triple {25086#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {25086#true} {25086#true} #62#return; {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L290 TraceCheckUtils]: 124: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L290 TraceCheckUtils]: 123: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L290 TraceCheckUtils]: 122: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L272 TraceCheckUtils]: 121: Hoare triple {25086#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,307 INFO L290 TraceCheckUtils]: 120: Hoare triple {25086#true} assume !false; {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L290 TraceCheckUtils]: 119: Hoare triple {25086#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {25086#true} {25086#true} #70#return; {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L290 TraceCheckUtils]: 117: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L290 TraceCheckUtils]: 116: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L290 TraceCheckUtils]: 115: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L272 TraceCheckUtils]: 114: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {25086#true} {25086#true} #68#return; {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L290 TraceCheckUtils]: 112: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L290 TraceCheckUtils]: 111: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L290 TraceCheckUtils]: 110: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L272 TraceCheckUtils]: 109: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25086#true} {25086#true} #66#return; {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L290 TraceCheckUtils]: 107: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L290 TraceCheckUtils]: 106: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L290 TraceCheckUtils]: 105: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L272 TraceCheckUtils]: 104: Hoare triple {25086#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25086#true} {25086#true} #64#return; {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L290 TraceCheckUtils]: 102: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L290 TraceCheckUtils]: 101: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,308 INFO L290 TraceCheckUtils]: 100: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L272 TraceCheckUtils]: 99: Hoare triple {25086#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25086#true} {25086#true} #62#return; {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L290 TraceCheckUtils]: 97: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L290 TraceCheckUtils]: 96: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L290 TraceCheckUtils]: 95: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L272 TraceCheckUtils]: 94: Hoare triple {25086#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L290 TraceCheckUtils]: 93: Hoare triple {25086#true} assume !false; {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L290 TraceCheckUtils]: 92: Hoare triple {25086#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {25086#true} {25086#true} #70#return; {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L290 TraceCheckUtils]: 90: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L290 TraceCheckUtils]: 89: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L290 TraceCheckUtils]: 88: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L272 TraceCheckUtils]: 87: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25086#true} {25086#true} #68#return; {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L290 TraceCheckUtils]: 85: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L290 TraceCheckUtils]: 84: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L290 TraceCheckUtils]: 83: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L272 TraceCheckUtils]: 82: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,309 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25086#true} {25086#true} #66#return; {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L290 TraceCheckUtils]: 80: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L290 TraceCheckUtils]: 79: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L290 TraceCheckUtils]: 78: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L272 TraceCheckUtils]: 77: Hoare triple {25086#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {25086#true} {25086#true} #64#return; {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L290 TraceCheckUtils]: 75: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L290 TraceCheckUtils]: 74: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L290 TraceCheckUtils]: 73: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L272 TraceCheckUtils]: 72: Hoare triple {25086#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25086#true} {25086#true} #62#return; {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L290 TraceCheckUtils]: 70: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L290 TraceCheckUtils]: 69: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L290 TraceCheckUtils]: 68: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L272 TraceCheckUtils]: 67: Hoare triple {25086#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L290 TraceCheckUtils]: 66: Hoare triple {25086#true} assume !false; {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L290 TraceCheckUtils]: 65: Hoare triple {25086#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25086#true} {25086#true} #70#return; {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L290 TraceCheckUtils]: 63: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,310 INFO L290 TraceCheckUtils]: 62: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L290 TraceCheckUtils]: 61: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L272 TraceCheckUtils]: 60: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25086#true} {25086#true} #68#return; {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L290 TraceCheckUtils]: 58: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L290 TraceCheckUtils]: 57: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L290 TraceCheckUtils]: 56: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L272 TraceCheckUtils]: 55: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {25086#true} {25086#true} #66#return; {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L290 TraceCheckUtils]: 53: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L290 TraceCheckUtils]: 52: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L290 TraceCheckUtils]: 51: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L272 TraceCheckUtils]: 50: Hoare triple {25086#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {25086#true} {25086#true} #64#return; {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L290 TraceCheckUtils]: 48: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L290 TraceCheckUtils]: 47: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L272 TraceCheckUtils]: 45: Hoare triple {25086#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {25086#true} {25086#true} #62#return; {25086#true} is VALID [2022-04-28 11:27:35,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L290 TraceCheckUtils]: 42: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L272 TraceCheckUtils]: 40: Hoare triple {25086#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {25086#true} assume !false; {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {25086#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25086#true} {25086#true} #70#return; {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L272 TraceCheckUtils]: 33: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25086#true} {25086#true} #68#return; {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L272 TraceCheckUtils]: 28: Hoare triple {25086#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25086#true} {25086#true} #66#return; {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,312 INFO L272 TraceCheckUtils]: 23: Hoare triple {25086#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25086#true} {25086#true} #64#return; {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L272 TraceCheckUtils]: 18: Hoare triple {25086#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25086#true} {25086#true} #62#return; {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L272 TraceCheckUtils]: 13: Hoare triple {25086#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {25086#true} assume !false; {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {25086#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25086#true} {25086#true} #60#return; {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {25086#true} assume !(0 == ~cond); {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {25086#true} ~cond := #in~cond; {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L272 TraceCheckUtils]: 6: Hoare triple {25086#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {25086#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {25086#true} is VALID [2022-04-28 11:27:35,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {25086#true} call #t~ret5 := main(); {25086#true} is VALID [2022-04-28 11:27:35,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25086#true} {25086#true} #84#return; {25086#true} is VALID [2022-04-28 11:27:35,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {25086#true} assume true; {25086#true} is VALID [2022-04-28 11:27:35,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {25086#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {25086#true} is VALID [2022-04-28 11:27:35,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {25086#true} call ULTIMATE.init(); {25086#true} is VALID [2022-04-28 11:27:35,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 353 proven. 6 refuted. 0 times theorem prover too weak. 1818 trivial. 0 not checked. [2022-04-28 11:27:35,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:27:35,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615822138] [2022-04-28 11:27:35,315 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:27:35,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34602418] [2022-04-28 11:27:35,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34602418] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:27:35,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:27:35,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-28 11:27:35,326 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:27:35,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [555566547] [2022-04-28 11:27:35,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [555566547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:27:35,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:27:35,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:27:35,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821982727] [2022-04-28 11:27:35,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:27:35,326 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 189 [2022-04-28 11:27:35,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:27:35,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:27:35,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:35,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:27:35,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:35,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:27:35,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:27:35,372 INFO L87 Difference]: Start difference. First operand 188 states and 194 transitions. Second operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:27:38,527 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:27:40,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:27:40,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:40,555 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2022-04-28 11:27:40,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:27:40,555 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 189 [2022-04-28 11:27:40,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:27:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:27:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-28 11:27:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:27:40,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-28 11:27:40,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-04-28 11:27:40,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:40,832 INFO L225 Difference]: With dead ends: 188 [2022-04-28 11:27:40,832 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:27:40,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 362 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:27:40,833 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:27:40,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 99 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 11:27:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:27:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:27:40,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:27:40,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-28 11:27:40,834 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-28 11:27:40,834 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-28 11:27:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:40,834 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:27:40,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:27:40,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:40,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:40,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) Second operand 0 states. [2022-04-28 11:27:40,834 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) Second operand 0 states. [2022-04-28 11:27:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:40,834 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:27:40,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:27:40,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:40,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:40,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:27:40,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:27:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-28 11:27:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:27:40,835 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 189 [2022-04-28 11:27:40,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:27:40,835 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:27:40,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:27:40,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:27:40,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:27:40,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:40,837 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:27:40,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 11:27:41,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:27:41,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:27:57,735 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 11:27:57,735 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 11:27:57,735 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 11:27:57,735 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 11:27:57,735 INFO L895 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 11:27:57,735 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 11:27:57,735 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 11:27:57,735 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:27:57,735 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse1 main_~a~0)) (<= main_~a~0 20) (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)))))) [2022-04-28 11:27:57,735 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 56) the Hoare annotation is: true [2022-04-28 11:27:57,736 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (= main_~x~0 (let ((.cse0 (div (+ main_~z~0 (- 6)) 6))) (* .cse0 .cse0 .cse0))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0)) [2022-04-28 11:27:57,736 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse1 (+ main_~z~0 main_~x~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) .cse1) (= main_~y~0 (+ main_~x~0 6))) (let ((.cse2 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse2 main_~a~0)) (<= main_~a~0 20) (= main_~x~0 (* .cse2 .cse2 .cse2)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse2 (+ main_~a~0 1)))) (and (= (+ main_~x~0 10) main_~z~0) .cse0 (= (+ 7 main_~y~0) .cse1) (= main_~x~0 8)))) [2022-04-28 11:27:57,736 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse1 main_~a~0)) (<= main_~a~0 20) (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)))))) [2022-04-28 11:27:57,736 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 56) the Hoare annotation is: true [2022-04-28 11:27:57,736 INFO L895 garLoopResultBuilder]: At program point L38(lines 33 46) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:27:57,736 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:27:57,736 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:27:57,736 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:27:57,736 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 56) the Hoare annotation is: true [2022-04-28 11:27:57,736 INFO L902 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2022-04-28 11:27:57,736 INFO L895 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= main_~a~0 20) (<= 0 main_~a~0)) [2022-04-28 11:27:57,736 INFO L902 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: true [2022-04-28 11:27:57,736 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (and (= main_~x~0 (let ((.cse0 (div (+ main_~z~0 (- 6)) 6))) (* .cse0 .cse0 .cse0))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0)) [2022-04-28 11:27:57,736 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse1 main_~a~0)) (<= main_~a~0 20) (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)))))) [2022-04-28 11:27:57,736 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:27:57,736 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 20) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:27:57,737 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:27:57,737 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 11:27:57,737 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:27:57,737 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:27:57,737 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 11:27:57,737 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 11:27:57,737 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:27:57,737 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 11:27:57,737 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-28 11:27:57,737 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 11:27:57,737 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 11:27:57,737 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 11:27:57,737 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 11:27:57,739 INFO L356 BasicCegarLoop]: Path program histogram: [24, 6, 6, 2, 2, 2, 2, 2, 2] [2022-04-28 11:27:57,740 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:27:57,742 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:27:57,749 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:27:58,389 INFO L163 areAnnotationChecker]: CFG has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 11:27:58,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:27:58 BoogieIcfgContainer [2022-04-28 11:27:58,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:27:58,425 INFO L158 Benchmark]: Toolchain (without parser) took 634038.07ms. Allocated memory was 194.0MB in the beginning and 407.9MB in the end (delta: 213.9MB). Free memory was 143.1MB in the beginning and 272.7MB in the end (delta: -129.6MB). Peak memory consumption was 222.8MB. Max. memory is 8.0GB. [2022-04-28 11:27:58,425 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:27:58,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.36ms. Allocated memory was 194.0MB in the beginning and 235.9MB in the end (delta: 41.9MB). Free memory was 142.9MB in the beginning and 211.6MB in the end (delta: -68.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 11:27:58,427 INFO L158 Benchmark]: Boogie Preprocessor took 23.80ms. Allocated memory is still 235.9MB. Free memory was 211.6MB in the beginning and 210.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 11:27:58,427 INFO L158 Benchmark]: RCFGBuilder took 234.66ms. Allocated memory is still 235.9MB. Free memory was 210.0MB in the beginning and 197.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 11:27:58,427 INFO L158 Benchmark]: TraceAbstraction took 633487.68ms. Allocated memory was 235.9MB in the beginning and 407.9MB in the end (delta: 172.0MB). Free memory was 197.4MB in the beginning and 272.7MB in the end (delta: -75.3MB). Peak memory consumption was 234.7MB. Max. memory is 8.0GB. [2022-04-28 11:27:58,435 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.36ms. Allocated memory was 194.0MB in the beginning and 235.9MB in the end (delta: 41.9MB). Free memory was 142.9MB in the beginning and 211.6MB in the end (delta: -68.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.80ms. Allocated memory is still 235.9MB. Free memory was 211.6MB in the beginning and 210.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 234.66ms. Allocated memory is still 235.9MB. Free memory was 210.0MB in the beginning and 197.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 633487.68ms. Allocated memory was 235.9MB in the beginning and 407.9MB in the end (delta: 172.0MB). Free memory was 197.4MB in the beginning and 272.7MB in the end (delta: -75.3MB). Peak memory consumption was 234.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 632.7s, OverallIterations: 24, TraceHistogramMax: 33, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 91.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 57.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 4185 SdHoareTripleChecker+Invalid, 57.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3030 mSDsCounter, 347 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5491 IncrementalHoareTripleChecker+Invalid, 5857 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 347 mSolverCounterUnsat, 1155 mSDtfsCounter, 5491 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3692 GetRequests, 3410 SyntacticMatches, 28 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 62.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=23, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 89 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 486 PreInvPairs, 732 NumberOfFragments, 894 HoareAnnotationTreeSize, 486 FomulaSimplifications, 6339 FormulaSimplificationTreeSizeReduction, 3.9s HoareSimplificationTime, 36 FomulaSimplificationsInter, 211540 FormulaSimplificationTreeSizeReductionInter, 12.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((n <= a + 1 && a <= 20) && n * 6 + 6 == z) && 0 <= a) && n * 12 + n * y * 6 + 6 == x * 18 + y * 6) && y * 12 == 36 * (n * n) + 12 + n * 36 - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (\old(cond) == cond || !(1 <= \old(cond))) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-04-28 11:27:58,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...