/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:36:51,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:36:51,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:36:51,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:36:51,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:36:51,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:36:51,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:36:51,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:36:51,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:36:51,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:36:51,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:36:51,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:36:51,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:36:51,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:36:51,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:36:51,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:36:51,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:36:51,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:36:51,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:36:51,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:36:51,728 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:36:51,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:36:51,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:36:51,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:36:51,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:36:51,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:36:51,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:36:51,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:36:51,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:36:51,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:36:51,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:36:51,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:36:51,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:36:51,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:36:51,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:36:51,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:36:51,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:36:51,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:36:51,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:36:51,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:36:51,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:36:51,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:36:51,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:36:51,761 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:36:51,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:36:51,761 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:36:51,761 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:36:51,762 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:36:51,762 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:36:51,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:36:51,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:36:51,762 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:36:51,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:36:51,763 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:36:51,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:36:51,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:36:51,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:36:51,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:36:51,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:36:51,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:36:51,764 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:36:51,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:36:51,764 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:36:51,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:36:51,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:36:51,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:36:51,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:36:51,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:36:51,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:36:51,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:36:51,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:36:51,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:36:51,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:36:51,765 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:36:51,765 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:36:51,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:36:51,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/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-27 14:36:51,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:36:51,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:36:51,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:36:51,951 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:36:51,952 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:36:51,953 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound100.c [2022-04-27 14:36:51,996 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489e1ff64/c006c8d206ea45a5817aa0bf54d9e8cc/FLAG91c3c3a9a [2022-04-27 14:36:52,298 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:36:52,298 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound100.c [2022-04-27 14:36:52,304 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489e1ff64/c006c8d206ea45a5817aa0bf54d9e8cc/FLAG91c3c3a9a [2022-04-27 14:36:52,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489e1ff64/c006c8d206ea45a5817aa0bf54d9e8cc [2022-04-27 14:36:52,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:36:52,739 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:36:52,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:36:52,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:36:52,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:36:52,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:36:52" (1/1) ... [2022-04-27 14:36:52,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@750bddc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:52, skipping insertion in model container [2022-04-27 14:36:52,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:36:52" (1/1) ... [2022-04-27 14:36:52,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:36:52,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:36:52,860 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/ps4-ll_valuebound100.c[458,471] [2022-04-27 14:36:52,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:36:52,875 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:36:52,881 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/ps4-ll_valuebound100.c[458,471] [2022-04-27 14:36:52,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:36:52,895 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:36:52,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:52 WrapperNode [2022-04-27 14:36:52,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:36:52,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:36:52,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:36:52,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:36:52,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:52" (1/1) ... [2022-04-27 14:36:52,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:52" (1/1) ... [2022-04-27 14:36:52,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:52" (1/1) ... [2022-04-27 14:36:52,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:52" (1/1) ... [2022-04-27 14:36:52,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:52" (1/1) ... [2022-04-27 14:36:52,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:52" (1/1) ... [2022-04-27 14:36:52,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:52" (1/1) ... [2022-04-27 14:36:52,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:36:52,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:36:52,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:36:52,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:36:52,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:52" (1/1) ... [2022-04-27 14:36:52,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:36:52,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:52,949 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-27 14:36:52,954 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-27 14:36:52,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:36:52,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:36:52,972 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:36:52,973 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:36:52,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:36:52,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:36:52,973 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:36:52,973 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:36:52,974 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:36:52,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:36:52,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:36:52,974 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:36:52,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:36:52,976 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:36:52,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:36:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:36:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:36:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:36:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:36:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:36:53,022 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:36:53,024 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:36:53,156 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:36:53,179 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:36:53,180 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:36:53,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:36:53 BoogieIcfgContainer [2022-04-27 14:36:53,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:36:53,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:36:53,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:36:53,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:36:53,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:36:52" (1/3) ... [2022-04-27 14:36:53,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618c91e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:36:53, skipping insertion in model container [2022-04-27 14:36:53,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:36:52" (2/3) ... [2022-04-27 14:36:53,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618c91e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:36:53, skipping insertion in model container [2022-04-27 14:36:53,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:36:53" (3/3) ... [2022-04-27 14:36:53,186 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound100.c [2022-04-27 14:36:53,197 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:36:53,198 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:36:53,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:36:53,251 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@25843192, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3bbf9fdf [2022-04-27 14:36:53,252 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:36:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:36:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:36:53,263 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:53,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:53,264 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:53,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:53,268 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-27 14:36:53,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:53,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441150638] [2022-04-27 14:36:53,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:53,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:53,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:36:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:53,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(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(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-27 14:36:53,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 14:36:53,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-27 14:36:53,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:36:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:53,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-27 14:36:53,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-27 14:36:53,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-27 14:36:53,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-27 14:36:53,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:36:53,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(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(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-27 14:36:53,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 14:36:53,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-27 14:36:53,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-27 14:36:53,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {31#true} is VALID [2022-04-27 14:36:53,439 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {31#true} is VALID [2022-04-27 14:36:53,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-27 14:36:53,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-27 14:36:53,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-27 14:36:53,440 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-27 14:36:53,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-27 14:36:53,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-27 14:36:53,440 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {32#false} is VALID [2022-04-27 14:36:53,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-27 14:36:53,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-27 14:36:53,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-27 14:36:53,441 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-27 14:36:53,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:53,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441150638] [2022-04-27 14:36:53,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441150638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:36:53,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:36:53,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:36:53,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195302307] [2022-04-27 14:36:53,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:36:53,448 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-27 14:36:53,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:53,451 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-27 14:36:53,477 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-27 14:36:53,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:36:53,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:53,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:36:53,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:36:53,498 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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-27 14:36:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:53,599 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-27 14:36:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:36:53,600 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-27 14:36:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:53,601 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-27 14:36:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 14:36:53,609 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-27 14:36:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 14:36:53,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-27 14:36:53,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:53,693 INFO L225 Difference]: With dead ends: 47 [2022-04-27 14:36:53,693 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 14:36:53,695 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-27 14:36:53,698 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:53,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:36:53,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 14:36:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 14:36:53,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:53,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:53,721 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:53,722 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:53,724 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 14:36:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:36:53,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:53,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:53,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-27 14:36:53,725 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-27 14:36:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:53,729 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 14:36:53,730 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:36:53,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:53,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:53,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:53,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-27 14:36:53,735 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-27 14:36:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:53,736 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-27 14:36:53,737 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-27 14:36:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:36:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:36:53,737 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:53,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:53,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:36:53,738 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:53,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:53,743 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-27 14:36:53,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:53,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675157968] [2022-04-27 14:36:53,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:53,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:53,767 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:53,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [19295558] [2022-04-27 14:36:53,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:53,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:53,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:53,769 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-27 14:36:53,770 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-27 14:36:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:53,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:36:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:53,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:53,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {186#true} call ULTIMATE.init(); {186#true} is VALID [2022-04-27 14:36:53,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#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(9, 2);call #Ultimate.allocInit(12, 3); {186#true} is VALID [2022-04-27 14:36:53,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-27 14:36:53,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} #60#return; {186#true} is VALID [2022-04-27 14:36:53,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {186#true} call #t~ret5 := main(); {186#true} is VALID [2022-04-27 14:36:53,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {186#true} is VALID [2022-04-27 14:36:53,946 INFO L272 TraceCheckUtils]: 6: Hoare triple {186#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {186#true} is VALID [2022-04-27 14:36:53,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#true} ~cond := #in~cond; {186#true} is VALID [2022-04-27 14:36:53,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#true} assume !(0 == ~cond); {186#true} is VALID [2022-04-27 14:36:53,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-27 14:36:53,947 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {186#true} {186#true} #52#return; {186#true} is VALID [2022-04-27 14:36:53,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {224#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:53,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {224#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {224#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:53,950 INFO L272 TraceCheckUtils]: 13: Hoare triple {224#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:53,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:53,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {187#false} is VALID [2022-04-27 14:36:53,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {187#false} assume !false; {187#false} is VALID [2022-04-27 14:36:53,951 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-27 14:36:53,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:36:53,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:53,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675157968] [2022-04-27 14:36:53,952 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:53,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19295558] [2022-04-27 14:36:53,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19295558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:36:53,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:36:53,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:36:53,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343692986] [2022-04-27 14:36:53,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:36:53,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 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-27 14:36:53,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:53,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 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-27 14:36:53,970 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-27 14:36:53,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:36:53,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:53,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:36:53,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:36:53,972 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 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-27 14:36:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:54,109 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 14:36:54,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:36:54,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 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-27 14:36:54,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 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-27 14:36:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 14:36:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 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-27 14:36:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 14:36:54,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-27 14:36:54,162 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-27 14:36:54,163 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:36:54,163 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 14:36:54,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-27 14:36:54,164 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:54,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:36:54,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 14:36:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 14:36:54,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:54,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:54,169 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:54,170 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:54,171 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 14:36:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:36:54,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:54,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:54,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 14:36:54,172 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 14:36:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:54,174 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 14:36:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:36:54,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:54,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:54,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:54,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:54,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:54,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-27 14:36:54,176 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-27 14:36:54,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:54,176 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-27 14:36:54,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 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-27 14:36:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:36:54,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 14:36:54,177 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:54,177 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:54,198 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-27 14:36:54,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:54,378 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:54,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:54,379 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-27 14:36:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:54,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811119210] [2022-04-27 14:36:54,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:54,392 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:54,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [344718929] [2022-04-27 14:36:54,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:54,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:54,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:54,398 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-27 14:36:54,400 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-27 14:36:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:54,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:36:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:54,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:54,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-27 14:36:54,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#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(9, 2);call #Ultimate.allocInit(12, 3); {397#true} is VALID [2022-04-27 14:36:54,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:36:54,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-27 14:36:54,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-27 14:36:54,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {397#true} is VALID [2022-04-27 14:36:54,568 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {397#true} is VALID [2022-04-27 14:36:54,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:36:54,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:36:54,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:36:54,571 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-27 14:36:54,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:54,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:54,573 INFO L272 TraceCheckUtils]: 13: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {397#true} is VALID [2022-04-27 14:36:54,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:36:54,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:36:54,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:36:54,575 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {397#true} {435#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:54,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 14:36:54,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 14:36:54,577 INFO L272 TraceCheckUtils]: 20: Hoare triple {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {464#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:54,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:54,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-27 14:36:54,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-27 14:36:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:36:54,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:54,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-27 14:36:54,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-27 14:36:54,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:54,834 INFO L272 TraceCheckUtils]: 20: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {464#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:54,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:36:54,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:36:54,840 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {397#true} {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #54#return; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:36:54,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:36:54,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:36:54,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:36:54,841 INFO L272 TraceCheckUtils]: 13: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {397#true} is VALID [2022-04-27 14:36:54,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:36:54,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:36:54,843 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-27 14:36:54,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:36:54,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:36:54,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:36:54,844 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {397#true} is VALID [2022-04-27 14:36:54,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {397#true} is VALID [2022-04-27 14:36:54,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-27 14:36:54,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-27 14:36:54,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:36:54,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#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(9, 2);call #Ultimate.allocInit(12, 3); {397#true} is VALID [2022-04-27 14:36:54,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-27 14:36:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 14:36:54,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:54,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811119210] [2022-04-27 14:36:54,847 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:54,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344718929] [2022-04-27 14:36:54,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344718929] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:54,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:54,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:36:54,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701473317] [2022-04-27 14:36:54,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:36:54,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 24 [2022-04-27 14:36:54,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:54,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-27 14:36:54,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:54,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:36:54,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:54,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:36:54,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:36:54,875 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-27 14:36:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:54,967 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-27 14:36:54,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:36:54,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 24 [2022-04-27 14:36:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-27 14:36:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 14:36:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-27 14:36:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 14:36:54,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-27 14:36:55,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:55,005 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:36:55,005 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 14:36:55,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:36:55,006 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:55,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:36:55,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 14:36:55,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 14:36:55,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:55,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:55,015 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:55,015 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:55,018 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-27 14:36:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:36:55,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:55,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:55,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-27 14:36:55,020 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-27 14:36:55,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:55,021 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-27 14:36:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:36:55,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:55,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:55,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:55,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:36:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-27 14:36:55,023 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-27 14:36:55,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:55,023 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-27 14:36:55,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-27 14:36:55,024 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:36:55,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 14:36:55,024 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:55,024 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:55,043 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-27 14:36:55,225 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,SelfDestructingSolverStorable2 [2022-04-27 14:36:55,225 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:55,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:55,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-27 14:36:55,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:55,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945082481] [2022-04-27 14:36:55,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:55,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:55,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:55,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367691707] [2022-04-27 14:36:55,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:55,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:55,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:55,251 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-27 14:36:55,263 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-27 14:36:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:55,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:36:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:55,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:55,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2022-04-27 14:36:55,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {707#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(9, 2);call #Ultimate.allocInit(12, 3); {707#true} is VALID [2022-04-27 14:36:55,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:36:55,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #60#return; {707#true} is VALID [2022-04-27 14:36:55,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret5 := main(); {707#true} is VALID [2022-04-27 14:36:55,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {707#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {707#true} is VALID [2022-04-27 14:36:55,529 INFO L272 TraceCheckUtils]: 6: Hoare triple {707#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {707#true} is VALID [2022-04-27 14:36:55,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:36:55,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:36:55,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:36:55,529 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {707#true} {707#true} #52#return; {707#true} is VALID [2022-04-27 14:36:55,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {707#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {745#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:55,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {745#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {745#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:55,530 INFO L272 TraceCheckUtils]: 13: Hoare triple {745#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {707#true} is VALID [2022-04-27 14:36:55,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:36:55,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:36:55,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:36:55,535 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {707#true} {745#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {745#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:55,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {745#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:36:55,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:36:55,536 INFO L272 TraceCheckUtils]: 20: Hoare triple {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {707#true} is VALID [2022-04-27 14:36:55,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:36:55,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:36:55,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:36:55,537 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {707#true} {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:36:55,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {789#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:36:55,539 INFO L272 TraceCheckUtils]: 26: Hoare triple {789#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {793#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:55,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {793#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {797#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:55,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {797#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {708#false} is VALID [2022-04-27 14:36:55,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {708#false} assume !false; {708#false} is VALID [2022-04-27 14:36:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:36:55,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:55,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:55,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945082481] [2022-04-27 14:36:55,763 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:55,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367691707] [2022-04-27 14:36:55,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367691707] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:55,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:55,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:36:55,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273348832] [2022-04-27 14:36:55,764 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:55,764 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-27 14:36:55,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:55,765 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:36:55,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:55,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:36:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:55,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:36:55,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:36:55,789 INFO L87 Difference]: Start difference. First operand 31 states and 31 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:36:55,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:55,937 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-27 14:36:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:36:55,938 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-27 14:36:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:55,938 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:36:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-27 14:36:55,939 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:36:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-27 14:36:55,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-27 14:36:55,964 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-27 14:36:55,965 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:36:55,965 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 14:36:55,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 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-27 14:36:55,966 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 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-27 14:36:55,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:36:55,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 14:36:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 14:36:55,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:55,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:55,978 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:55,978 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:55,979 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 14:36:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:36:55,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:55,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:55,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 14:36:55,980 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 14:36:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:55,981 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 14:36:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:36:55,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:55,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:55,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:55,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:36:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-27 14:36:55,983 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-27 14:36:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:55,983 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-27 14:36:55,983 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:36:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:36:55,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:36:55,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:55,984 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:56,002 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-27 14:36:56,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:56,185 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:56,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:56,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 2 times [2022-04-27 14:36:56,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:56,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377374667] [2022-04-27 14:36:56,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:56,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:56,206 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:56,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825928411] [2022-04-27 14:36:56,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:36:56,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:56,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:56,208 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-27 14:36:56,208 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-27 14:36:56,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:36:56,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:56,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:36:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:56,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:56,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-27 14:36:56,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#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(9, 2);call #Ultimate.allocInit(12, 3); {1024#true} is VALID [2022-04-27 14:36:56,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:36:56,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #60#return; {1024#true} is VALID [2022-04-27 14:36:56,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret5 := main(); {1024#true} is VALID [2022-04-27 14:36:56,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {1024#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1024#true} is VALID [2022-04-27 14:36:56,536 INFO L272 TraceCheckUtils]: 6: Hoare triple {1024#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:36:56,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:36:56,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:36:56,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:36:56,536 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1024#true} {1024#true} #52#return; {1024#true} is VALID [2022-04-27 14:36:56,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1062#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:56,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {1062#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1062#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:56,542 INFO L272 TraceCheckUtils]: 13: Hoare triple {1062#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:36:56,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:36:56,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:36:56,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:36:56,543 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1024#true} {1062#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1062#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:56,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {1062#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1084#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:56,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {1084#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1084#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:56,543 INFO L272 TraceCheckUtils]: 20: Hoare triple {1084#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:36:56,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:36:56,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:36:56,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:36:56,544 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1024#true} {1084#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {1084#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:36:56,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {1084#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:36:56,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:36:56,545 INFO L272 TraceCheckUtils]: 27: Hoare triple {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:36:56,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:36:56,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:36:56,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:36:56,546 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1024#true} {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #54#return; {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:36:56,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1128#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-27 14:36:56,547 INFO L272 TraceCheckUtils]: 33: Hoare triple {1128#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:56,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1136#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:56,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {1136#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1025#false} is VALID [2022-04-27 14:36:56,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-27 14:36:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:36:56,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:56,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:56,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377374667] [2022-04-27 14:36:56,809 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:56,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825928411] [2022-04-27 14:36:56,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825928411] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:56,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:56,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:36:56,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565218823] [2022-04-27 14:36:56,810 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:56,810 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:36:56,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:56,810 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:36:56,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:56,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:36:56,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:56,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:36:56,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:36:56,865 INFO L87 Difference]: Start difference. First operand 34 states and 35 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:36:57,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:57,100 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-27 14:36:57,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:36:57,100 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:36:57,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:57,100 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:36:57,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-27 14:36:57,102 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:36:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-27 14:36:57,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-27 14:36:57,143 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-27 14:36:57,144 INFO L225 Difference]: With dead ends: 42 [2022-04-27 14:36:57,144 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 14:36:57,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 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-27 14:36:57,145 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:57,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:36:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 14:36:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 14:36:57,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:57,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:36:57,155 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:36:57,155 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:36:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:57,156 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:36:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 14:36:57,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:57,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:57,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-27 14:36:57,157 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-27 14:36:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:57,170 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:36:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 14:36:57,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:57,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:57,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:57,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:57,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:36:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-27 14:36:57,173 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 37 [2022-04-27 14:36:57,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:57,174 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-27 14:36:57,174 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:36:57,174 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 14:36:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 14:36:57,175 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:57,175 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:57,191 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-27 14:36:57,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:57,376 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:57,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:57,376 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 3 times [2022-04-27 14:36:57,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:57,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041583502] [2022-04-27 14:36:57,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:57,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:57,385 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:57,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1462681749] [2022-04-27 14:36:57,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:36:57,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:57,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:57,387 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-27 14:36:57,387 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-27 14:36:57,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:36:57,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:57,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:36:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:57,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:57,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-27 14:36:57,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#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(9, 2);call #Ultimate.allocInit(12, 3); {1379#true} is VALID [2022-04-27 14:36:57,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:36:57,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #60#return; {1379#true} is VALID [2022-04-27 14:36:57,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret5 := main(); {1379#true} is VALID [2022-04-27 14:36:57,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1379#true} is VALID [2022-04-27 14:36:57,755 INFO L272 TraceCheckUtils]: 6: Hoare triple {1379#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:36:57,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:36:57,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:36:57,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:36:57,755 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1379#true} {1379#true} #52#return; {1379#true} is VALID [2022-04-27 14:36:57,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {1379#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1417#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:57,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {1417#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1417#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:57,756 INFO L272 TraceCheckUtils]: 13: Hoare triple {1417#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:36:57,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:36:57,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:36:57,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:36:57,757 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1379#true} {1417#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1417#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:57,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {1417#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:57,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:57,758 INFO L272 TraceCheckUtils]: 20: Hoare triple {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:36:57,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:36:57,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:36:57,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:36:57,759 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1379#true} {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:36:57,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:57,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:57,760 INFO L272 TraceCheckUtils]: 27: Hoare triple {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:36:57,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:36:57,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:36:57,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:36:57,763 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1379#true} {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:57,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:36:57,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !false; {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:36:57,764 INFO L272 TraceCheckUtils]: 34: Hoare triple {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:36:57,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:36:57,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:36:57,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:36:57,764 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1379#true} {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #54#return; {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:36:57,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1505#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:36:57,765 INFO L272 TraceCheckUtils]: 40: Hoare triple {1505#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1509#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:57,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {1509#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1513#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:57,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {1513#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1380#false} is VALID [2022-04-27 14:36:57,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-27 14:36:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:36:57,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:58,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:58,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041583502] [2022-04-27 14:36:58,037 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:58,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462681749] [2022-04-27 14:36:58,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462681749] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:58,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:58,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:36:58,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295633502] [2022-04-27 14:36:58,037 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:58,038 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-27 14:36:58,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:58,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:36:58,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:58,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:36:58,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:58,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:36:58,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:36:58,061 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:36:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:58,369 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-27 14:36:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:36:58,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-27 14:36:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:36:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:36:58,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:36:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:36:58,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-27 14:36:58,399 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-27 14:36:58,400 INFO L225 Difference]: With dead ends: 45 [2022-04-27 14:36:58,400 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 14:36:58,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:36:58,401 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:58,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:36:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 14:36:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-27 14:36:58,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:58,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:36:58,412 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:36:58,412 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:36:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:58,413 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 14:36:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 14:36:58,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:58,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:58,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-27 14:36:58,414 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-27 14:36:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:58,415 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 14:36:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 14:36:58,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:58,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:58,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:58,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:36:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-27 14:36:58,417 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 44 [2022-04-27 14:36:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:58,417 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-27 14:36:58,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:36:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 14:36:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 14:36:58,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:58,418 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:58,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 14:36:58,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:58,622 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:36:58,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:36:58,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 4 times [2022-04-27 14:36:58,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:36:58,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793768864] [2022-04-27 14:36:58,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:36:58,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:36:58,632 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:36:58,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997683057] [2022-04-27 14:36:58,632 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:36:58,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:36:58,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:36:58,633 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-27 14:36:58,634 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-27 14:36:58,839 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:36:58,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:36:58,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:36:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:36:58,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:59,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {1772#true} call ULTIMATE.init(); {1772#true} is VALID [2022-04-27 14:36:59,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {1772#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(9, 2);call #Ultimate.allocInit(12, 3); {1772#true} is VALID [2022-04-27 14:36:59,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:36:59,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1772#true} {1772#true} #60#return; {1772#true} is VALID [2022-04-27 14:36:59,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {1772#true} call #t~ret5 := main(); {1772#true} is VALID [2022-04-27 14:36:59,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {1772#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1772#true} is VALID [2022-04-27 14:36:59,129 INFO L272 TraceCheckUtils]: 6: Hoare triple {1772#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:36:59,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:36:59,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:36:59,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:36:59,129 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1772#true} {1772#true} #52#return; {1772#true} is VALID [2022-04-27 14:36:59,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {1772#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1810#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:59,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {1810#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1810#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:59,130 INFO L272 TraceCheckUtils]: 13: Hoare triple {1810#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:36:59,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:36:59,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:36:59,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:36:59,130 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1772#true} {1810#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1810#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:36:59,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {1810#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:36:59,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:36:59,131 INFO L272 TraceCheckUtils]: 20: Hoare triple {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:36:59,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:36:59,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:36:59,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:36:59,132 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1772#true} {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:36:59,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:59,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:59,133 INFO L272 TraceCheckUtils]: 27: Hoare triple {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:36:59,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:36:59,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:36:59,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:36:59,133 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1772#true} {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:36:59,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:36:59,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:36:59,134 INFO L272 TraceCheckUtils]: 34: Hoare triple {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:36:59,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:36:59,135 INFO L290 TraceCheckUtils]: 36: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:36:59,135 INFO L290 TraceCheckUtils]: 37: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:36:59,135 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1772#true} {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #54#return; {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:36:59,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:36:59,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:36:59,136 INFO L272 TraceCheckUtils]: 41: Hoare triple {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:36:59,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:36:59,136 INFO L290 TraceCheckUtils]: 43: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:36:59,136 INFO L290 TraceCheckUtils]: 44: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:36:59,137 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1772#true} {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:36:59,137 INFO L290 TraceCheckUtils]: 46: Hoare triple {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {1920#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:36:59,138 INFO L272 TraceCheckUtils]: 47: Hoare triple {1920#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1924#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:59,140 INFO L290 TraceCheckUtils]: 48: Hoare triple {1924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:59,141 INFO L290 TraceCheckUtils]: 49: Hoare triple {1928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1773#false} is VALID [2022-04-27 14:36:59,141 INFO L290 TraceCheckUtils]: 50: Hoare triple {1773#false} assume !false; {1773#false} is VALID [2022-04-27 14:36:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 14:36:59,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:59,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:59,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793768864] [2022-04-27 14:36:59,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:59,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997683057] [2022-04-27 14:36:59,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997683057] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:36:59,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:36:59,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:36:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096550350] [2022-04-27 14:36:59,371 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:59,372 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-27 14:36:59,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:59,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:36:59,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:59,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:36:59,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:59,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:36:59,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:36:59,400 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:36:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:59,759 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-27 14:36:59,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:36:59,759 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-27 14:36:59,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:36:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:36:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-27 14:36:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:36:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-27 14:36:59,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-27 14:36:59,806 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-27 14:36:59,807 INFO L225 Difference]: With dead ends: 48 [2022-04-27 14:36:59,807 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 14:36:59,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:36:59,808 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:36:59,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:36:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 14:36:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 14:36:59,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:36:59,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:36:59,826 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:36:59,826 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:36:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:59,828 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-27 14:36:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 14:36:59,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:59,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:59,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-27 14:36:59,829 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-27 14:36:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:36:59,833 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-27 14:36:59,833 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 14:36:59,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:36:59,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:36:59,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:36:59,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:36:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:36:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-27 14:36:59,835 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 51 [2022-04-27 14:36:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:36:59,835 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-27 14:36:59,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:36:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 14:36:59,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 14:36:59,838 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:36:59,838 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:36:59,854 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-27 14:37:00,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:00,047 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:00,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 5 times [2022-04-27 14:37:00,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:00,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982713717] [2022-04-27 14:37:00,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:00,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:00,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:00,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2130928677] [2022-04-27 14:37:00,071 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:37:00,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:00,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:00,077 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-27 14:37:00,078 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-27 14:37:00,188 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:37:00,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:00,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:37:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:00,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:00,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {2203#true} call ULTIMATE.init(); {2203#true} is VALID [2022-04-27 14:37:00,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {2203#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(9, 2);call #Ultimate.allocInit(12, 3); {2203#true} is VALID [2022-04-27 14:37:00,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:00,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2203#true} {2203#true} #60#return; {2203#true} is VALID [2022-04-27 14:37:00,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {2203#true} call #t~ret5 := main(); {2203#true} is VALID [2022-04-27 14:37:00,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {2203#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2203#true} is VALID [2022-04-27 14:37:00,557 INFO L272 TraceCheckUtils]: 6: Hoare triple {2203#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:37:00,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:37:00,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:37:00,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:00,557 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2203#true} {2203#true} #52#return; {2203#true} is VALID [2022-04-27 14:37:00,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {2203#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2241#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:00,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {2241#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2241#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:00,560 INFO L272 TraceCheckUtils]: 13: Hoare triple {2241#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:37:00,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:37:00,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:37:00,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:00,561 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2203#true} {2241#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2241#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:00,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {2241#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:00,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:00,561 INFO L272 TraceCheckUtils]: 20: Hoare triple {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:37:00,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:37:00,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:37:00,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:00,562 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2203#true} {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:00,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:37:00,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:37:00,563 INFO L272 TraceCheckUtils]: 27: Hoare triple {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:37:00,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:37:00,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:37:00,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:00,564 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2203#true} {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:37:00,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:00,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:00,565 INFO L272 TraceCheckUtils]: 34: Hoare triple {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:37:00,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:37:00,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:37:00,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:00,565 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2203#true} {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:00,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:00,566 INFO L290 TraceCheckUtils]: 40: Hoare triple {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:00,566 INFO L272 TraceCheckUtils]: 41: Hoare triple {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:37:00,566 INFO L290 TraceCheckUtils]: 42: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:37:00,566 INFO L290 TraceCheckUtils]: 43: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:37:00,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:00,567 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2203#true} {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #54#return; {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:00,567 INFO L290 TraceCheckUtils]: 46: Hoare triple {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:37:00,568 INFO L290 TraceCheckUtils]: 47: Hoare triple {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !false; {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:37:00,568 INFO L272 TraceCheckUtils]: 48: Hoare triple {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:37:00,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:37:00,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:37:00,568 INFO L290 TraceCheckUtils]: 51: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:37:00,568 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2203#true} {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #54#return; {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:37:00,570 INFO L290 TraceCheckUtils]: 53: Hoare triple {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2373#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:37:00,570 INFO L272 TraceCheckUtils]: 54: Hoare triple {2373#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2377#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:00,571 INFO L290 TraceCheckUtils]: 55: Hoare triple {2377#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2381#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:00,571 INFO L290 TraceCheckUtils]: 56: Hoare triple {2381#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2204#false} is VALID [2022-04-27 14:37:00,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {2204#false} assume !false; {2204#false} is VALID [2022-04-27 14:37:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 14:37:00,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:00,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:00,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982713717] [2022-04-27 14:37:00,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:00,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130928677] [2022-04-27 14:37:00,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130928677] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:00,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:00,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:37:00,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626859140] [2022-04-27 14:37:00,855 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:00,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-27 14:37:00,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:00,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:37:00,882 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-27 14:37:00,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:37:00,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:00,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:37:00,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:37:00,883 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:37:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:01,338 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-27 14:37:01,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:37:01,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-27 14:37:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:01,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:37:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-27 14:37:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:37:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-27 14:37:01,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-27 14:37:01,378 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-27 14:37:01,379 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:37:01,379 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 14:37:01,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:37:01,380 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:01,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 239 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:37:01,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 14:37:01,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-27 14:37:01,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:01,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:37:01,403 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:37:01,404 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:37:01,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:01,406 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-27 14:37:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 14:37:01,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:01,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:01,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-27 14:37:01,406 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-27 14:37:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:01,407 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-27 14:37:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 14:37:01,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:01,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:01,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:01,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:37:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-27 14:37:01,409 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 58 [2022-04-27 14:37:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:01,409 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-27 14:37:01,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:37:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 14:37:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 14:37:01,410 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:01,410 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:01,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 14:37:01,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:01,618 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:01,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:01,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 6 times [2022-04-27 14:37:01,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:01,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477918870] [2022-04-27 14:37:01,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:01,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:01,636 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:01,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963114105] [2022-04-27 14:37:01,636 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:37:01,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:01,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:01,638 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-27 14:37:01,639 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-27 14:37:01,791 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:37:01,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:01,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 14:37:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:01,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:02,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2672#true} is VALID [2022-04-27 14:37:02,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#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(9, 2);call #Ultimate.allocInit(12, 3); {2672#true} is VALID [2022-04-27 14:37:02,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:02,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #60#return; {2672#true} is VALID [2022-04-27 14:37:02,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret5 := main(); {2672#true} is VALID [2022-04-27 14:37:02,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2672#true} is VALID [2022-04-27 14:37:02,176 INFO L272 TraceCheckUtils]: 6: Hoare triple {2672#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:37:02,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:02,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:02,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:02,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2672#true} {2672#true} #52#return; {2672#true} is VALID [2022-04-27 14:37:02,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {2672#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2710#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:02,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {2710#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2710#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:02,176 INFO L272 TraceCheckUtils]: 13: Hoare triple {2710#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:37:02,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:02,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:02,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:02,177 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2672#true} {2710#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2710#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:02,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {2710#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2732#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:02,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {2732#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2732#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:02,178 INFO L272 TraceCheckUtils]: 20: Hoare triple {2732#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:37:02,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:02,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:02,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:02,179 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2672#true} {2732#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {2732#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:02,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {2732#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2754#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:37:02,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {2754#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {2754#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:37:02,184 INFO L272 TraceCheckUtils]: 27: Hoare triple {2754#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:37:02,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:02,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:02,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:02,184 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2672#true} {2754#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {2754#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:37:02,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {2754#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2776#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:37:02,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {2776#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {2776#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:37:02,185 INFO L272 TraceCheckUtils]: 34: Hoare triple {2776#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:37:02,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:02,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:02,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:02,186 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2672#true} {2776#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #54#return; {2776#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 14:37:02,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {2776#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2798#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:37:02,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {2798#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {2798#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:37:02,187 INFO L272 TraceCheckUtils]: 41: Hoare triple {2798#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:37:02,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:02,187 INFO L290 TraceCheckUtils]: 43: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:02,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:02,188 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2672#true} {2798#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {2798#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:37:02,188 INFO L290 TraceCheckUtils]: 46: Hoare triple {2798#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2820#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:02,188 INFO L290 TraceCheckUtils]: 47: Hoare triple {2820#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {2820#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:02,188 INFO L272 TraceCheckUtils]: 48: Hoare triple {2820#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:37:02,188 INFO L290 TraceCheckUtils]: 49: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:02,188 INFO L290 TraceCheckUtils]: 50: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:02,189 INFO L290 TraceCheckUtils]: 51: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:02,189 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2672#true} {2820#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {2820#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:02,189 INFO L290 TraceCheckUtils]: 53: Hoare triple {2820#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2842#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:37:02,190 INFO L290 TraceCheckUtils]: 54: Hoare triple {2842#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {2842#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:37:02,190 INFO L272 TraceCheckUtils]: 55: Hoare triple {2842#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:37:02,190 INFO L290 TraceCheckUtils]: 56: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:37:02,190 INFO L290 TraceCheckUtils]: 57: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:37:02,190 INFO L290 TraceCheckUtils]: 58: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:37:02,190 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2672#true} {2842#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #54#return; {2842#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:37:02,191 INFO L290 TraceCheckUtils]: 60: Hoare triple {2842#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {2864#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:37:02,191 INFO L272 TraceCheckUtils]: 61: Hoare triple {2864#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2868#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:02,192 INFO L290 TraceCheckUtils]: 62: Hoare triple {2868#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2872#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:02,192 INFO L290 TraceCheckUtils]: 63: Hoare triple {2872#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2673#false} is VALID [2022-04-27 14:37:02,192 INFO L290 TraceCheckUtils]: 64: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-27 14:37:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 14 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 14:37:02,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:02,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:02,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477918870] [2022-04-27 14:37:02,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:02,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963114105] [2022-04-27 14:37:02,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963114105] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:02,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:02,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 14:37:02,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982665610] [2022-04-27 14:37:02,438 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:02,439 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-27 14:37:02,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:02,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:37:02,472 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-27 14:37:02,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:37:02,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:02,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:37:02,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:37:02,472 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:37:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:02,994 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-27 14:37:02,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:37:02,994 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-27 14:37:02,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:37:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 14:37:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:37:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 14:37:02,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-27 14:37:03,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:03,035 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:37:03,035 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 14:37:03,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:37:03,036 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:03,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:37:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 14:37:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-27 14:37:03,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:03,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:37:03,056 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:37:03,057 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:37:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:03,058 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-27 14:37:03,058 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-27 14:37:03,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:03,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:03,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-27 14:37:03,059 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-27 14:37:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:03,060 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-27 14:37:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-27 14:37:03,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:03,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:03,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:03,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:37:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-04-27 14:37:03,062 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 65 [2022-04-27 14:37:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:03,062 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-04-27 14:37:03,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:37:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-27 14:37:03,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-27 14:37:03,063 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:03,063 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:03,074 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-27 14:37:03,274 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,SelfDestructingSolverStorable8 [2022-04-27 14:37:03,274 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:03,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 7 times [2022-04-27 14:37:03,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:03,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893319377] [2022-04-27 14:37:03,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:03,289 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:03,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1127166849] [2022-04-27 14:37:03,289 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:37:03,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:03,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:03,290 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-27 14:37:03,291 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-27 14:37:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:03,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 14:37:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:03,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:04,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {3179#true} call ULTIMATE.init(); {3179#true} is VALID [2022-04-27 14:37:04,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {3179#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(9, 2);call #Ultimate.allocInit(12, 3); {3179#true} is VALID [2022-04-27 14:37:04,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:04,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3179#true} {3179#true} #60#return; {3179#true} is VALID [2022-04-27 14:37:04,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {3179#true} call #t~ret5 := main(); {3179#true} is VALID [2022-04-27 14:37:04,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {3179#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3179#true} is VALID [2022-04-27 14:37:04,034 INFO L272 TraceCheckUtils]: 6: Hoare triple {3179#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {3179#true} is VALID [2022-04-27 14:37:04,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:04,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:04,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:04,034 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3179#true} {3179#true} #52#return; {3179#true} is VALID [2022-04-27 14:37:04,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {3179#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3217#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:04,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {3217#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3217#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:04,043 INFO L272 TraceCheckUtils]: 13: Hoare triple {3217#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3179#true} is VALID [2022-04-27 14:37:04,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:04,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:04,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:04,046 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3179#true} {3217#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3217#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:04,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {3217#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:37:04,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {3239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:37:04,046 INFO L272 TraceCheckUtils]: 20: Hoare triple {3239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3179#true} is VALID [2022-04-27 14:37:04,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:04,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:04,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:04,047 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3179#true} {3239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {3239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:37:04,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {3239#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3261#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:04,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {3261#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {3261#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:04,048 INFO L272 TraceCheckUtils]: 27: Hoare triple {3261#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3179#true} is VALID [2022-04-27 14:37:04,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:04,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:04,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:04,048 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3179#true} {3261#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {3261#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:04,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {3261#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3283#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:37:04,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {3283#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {3283#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:37:04,049 INFO L272 TraceCheckUtils]: 34: Hoare triple {3283#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3179#true} is VALID [2022-04-27 14:37:04,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:04,049 INFO L290 TraceCheckUtils]: 36: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:04,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:04,050 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3179#true} {3283#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {3283#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:37:04,050 INFO L290 TraceCheckUtils]: 39: Hoare triple {3283#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3305#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:37:04,050 INFO L290 TraceCheckUtils]: 40: Hoare triple {3305#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {3305#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:37:04,050 INFO L272 TraceCheckUtils]: 41: Hoare triple {3305#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3179#true} is VALID [2022-04-27 14:37:04,050 INFO L290 TraceCheckUtils]: 42: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:04,051 INFO L290 TraceCheckUtils]: 43: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:04,051 INFO L290 TraceCheckUtils]: 44: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:04,051 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3179#true} {3305#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {3305#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:37:04,051 INFO L290 TraceCheckUtils]: 46: Hoare triple {3305#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3327#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:04,052 INFO L290 TraceCheckUtils]: 47: Hoare triple {3327#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {3327#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:04,065 INFO L272 TraceCheckUtils]: 48: Hoare triple {3327#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3179#true} is VALID [2022-04-27 14:37:04,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:04,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:04,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:04,066 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3179#true} {3327#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {3327#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:04,066 INFO L290 TraceCheckUtils]: 53: Hoare triple {3327#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3349#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:04,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {3349#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3349#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:04,067 INFO L272 TraceCheckUtils]: 55: Hoare triple {3349#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3179#true} is VALID [2022-04-27 14:37:04,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:04,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:04,067 INFO L290 TraceCheckUtils]: 58: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:04,067 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3179#true} {3349#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {3349#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:04,068 INFO L290 TraceCheckUtils]: 60: Hoare triple {3349#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3371#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 14:37:04,068 INFO L290 TraceCheckUtils]: 61: Hoare triple {3371#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !false; {3371#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 14:37:04,068 INFO L272 TraceCheckUtils]: 62: Hoare triple {3371#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3179#true} is VALID [2022-04-27 14:37:04,068 INFO L290 TraceCheckUtils]: 63: Hoare triple {3179#true} ~cond := #in~cond; {3179#true} is VALID [2022-04-27 14:37:04,068 INFO L290 TraceCheckUtils]: 64: Hoare triple {3179#true} assume !(0 == ~cond); {3179#true} is VALID [2022-04-27 14:37:04,068 INFO L290 TraceCheckUtils]: 65: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-27 14:37:04,069 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3179#true} {3371#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} #54#return; {3371#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 14:37:04,069 INFO L290 TraceCheckUtils]: 67: Hoare triple {3371#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3393#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 14:37:04,070 INFO L272 TraceCheckUtils]: 68: Hoare triple {3393#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3397#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:04,070 INFO L290 TraceCheckUtils]: 69: Hoare triple {3397#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3401#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:04,071 INFO L290 TraceCheckUtils]: 70: Hoare triple {3401#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3180#false} is VALID [2022-04-27 14:37:04,071 INFO L290 TraceCheckUtils]: 71: Hoare triple {3180#false} assume !false; {3180#false} is VALID [2022-04-27 14:37:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 14:37:04,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:04,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:04,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893319377] [2022-04-27 14:37:04,382 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:04,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127166849] [2022-04-27 14:37:04,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127166849] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:04,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:04,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:37:04,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174668480] [2022-04-27 14:37:04,383 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:04,383 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 72 [2022-04-27 14:37:04,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:04,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:37:04,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:04,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:37:04,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:04,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:37:04,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:37:04,416 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:37:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:05,054 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-27 14:37:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:37:05,055 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 72 [2022-04-27 14:37:05,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:37:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-27 14:37:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:37:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-27 14:37:05,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-27 14:37:05,105 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-27 14:37:05,105 INFO L225 Difference]: With dead ends: 57 [2022-04-27 14:37:05,105 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 14:37:05,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:37:05,106 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:05,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 313 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:37:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 14:37:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 14:37:05,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:05,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:37:05,129 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:37:05,129 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:37:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:05,130 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:37:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:37:05,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:05,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:05,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-27 14:37:05,131 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-27 14:37:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:05,132 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 14:37:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:37:05,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:05,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:05,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:05,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:37:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-27 14:37:05,133 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 72 [2022-04-27 14:37:05,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:05,134 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-27 14:37:05,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:37:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 14:37:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-27 14:37:05,134 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:05,134 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:05,139 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-27 14:37:05,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 14:37:05,339 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:05,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 8 times [2022-04-27 14:37:05,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:05,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080408216] [2022-04-27 14:37:05,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:05,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:05,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:05,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [673481251] [2022-04-27 14:37:05,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:37:05,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:05,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:05,351 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-27 14:37:05,359 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-27 14:37:05,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:37:05,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:05,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 14:37:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:05,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:06,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {3724#true} call ULTIMATE.init(); {3724#true} is VALID [2022-04-27 14:37:06,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {3724#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(9, 2);call #Ultimate.allocInit(12, 3); {3724#true} is VALID [2022-04-27 14:37:06,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:37:06,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3724#true} {3724#true} #60#return; {3724#true} is VALID [2022-04-27 14:37:06,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {3724#true} call #t~ret5 := main(); {3724#true} is VALID [2022-04-27 14:37:06,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {3724#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3724#true} is VALID [2022-04-27 14:37:06,394 INFO L272 TraceCheckUtils]: 6: Hoare triple {3724#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {3724#true} is VALID [2022-04-27 14:37:06,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:37:06,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:37:06,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:37:06,394 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3724#true} {3724#true} #52#return; {3724#true} is VALID [2022-04-27 14:37:06,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {3724#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3762#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:06,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {3762#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3762#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:06,402 INFO L272 TraceCheckUtils]: 13: Hoare triple {3762#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3724#true} is VALID [2022-04-27 14:37:06,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:37:06,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:37:06,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:37:06,403 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3724#true} {3762#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3762#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:06,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {3762#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3784#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:06,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {3784#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3784#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:06,404 INFO L272 TraceCheckUtils]: 20: Hoare triple {3784#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3724#true} is VALID [2022-04-27 14:37:06,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:37:06,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:37:06,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:37:06,404 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3724#true} {3784#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {3784#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:06,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {3784#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3806#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:37:06,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {3806#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {3806#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:37:06,405 INFO L272 TraceCheckUtils]: 27: Hoare triple {3806#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3724#true} is VALID [2022-04-27 14:37:06,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:37:06,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:37:06,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:37:06,406 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3724#true} {3806#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {3806#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:37:06,406 INFO L290 TraceCheckUtils]: 32: Hoare triple {3806#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3828#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:37:06,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {3828#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {3828#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:37:06,407 INFO L272 TraceCheckUtils]: 34: Hoare triple {3828#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3724#true} is VALID [2022-04-27 14:37:06,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:37:06,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:37:06,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:37:06,407 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3724#true} {3828#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {3828#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:37:06,408 INFO L290 TraceCheckUtils]: 39: Hoare triple {3828#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3850#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:06,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {3850#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {3850#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:06,408 INFO L272 TraceCheckUtils]: 41: Hoare triple {3850#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3724#true} is VALID [2022-04-27 14:37:06,408 INFO L290 TraceCheckUtils]: 42: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:37:06,408 INFO L290 TraceCheckUtils]: 43: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:37:06,408 INFO L290 TraceCheckUtils]: 44: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:37:06,409 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3724#true} {3850#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {3850#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:06,409 INFO L290 TraceCheckUtils]: 46: Hoare triple {3850#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3872#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:06,409 INFO L290 TraceCheckUtils]: 47: Hoare triple {3872#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3872#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:06,409 INFO L272 TraceCheckUtils]: 48: Hoare triple {3872#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3724#true} is VALID [2022-04-27 14:37:06,410 INFO L290 TraceCheckUtils]: 49: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:37:06,410 INFO L290 TraceCheckUtils]: 50: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:37:06,410 INFO L290 TraceCheckUtils]: 51: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:37:06,416 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3724#true} {3872#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {3872#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:06,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {3872#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3894#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:37:06,417 INFO L290 TraceCheckUtils]: 54: Hoare triple {3894#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {3894#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:37:06,417 INFO L272 TraceCheckUtils]: 55: Hoare triple {3894#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3724#true} is VALID [2022-04-27 14:37:06,417 INFO L290 TraceCheckUtils]: 56: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:37:06,417 INFO L290 TraceCheckUtils]: 57: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:37:06,417 INFO L290 TraceCheckUtils]: 58: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:37:06,418 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3724#true} {3894#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {3894#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:37:06,418 INFO L290 TraceCheckUtils]: 60: Hoare triple {3894#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3916#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:06,418 INFO L290 TraceCheckUtils]: 61: Hoare triple {3916#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {3916#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:06,419 INFO L272 TraceCheckUtils]: 62: Hoare triple {3916#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3724#true} is VALID [2022-04-27 14:37:06,419 INFO L290 TraceCheckUtils]: 63: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:37:06,419 INFO L290 TraceCheckUtils]: 64: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:37:06,419 INFO L290 TraceCheckUtils]: 65: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:37:06,419 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3724#true} {3916#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #54#return; {3916#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:06,420 INFO L290 TraceCheckUtils]: 67: Hoare triple {3916#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3938#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:37:06,420 INFO L290 TraceCheckUtils]: 68: Hoare triple {3938#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {3938#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:37:06,420 INFO L272 TraceCheckUtils]: 69: Hoare triple {3938#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3724#true} is VALID [2022-04-27 14:37:06,420 INFO L290 TraceCheckUtils]: 70: Hoare triple {3724#true} ~cond := #in~cond; {3724#true} is VALID [2022-04-27 14:37:06,420 INFO L290 TraceCheckUtils]: 71: Hoare triple {3724#true} assume !(0 == ~cond); {3724#true} is VALID [2022-04-27 14:37:06,420 INFO L290 TraceCheckUtils]: 72: Hoare triple {3724#true} assume true; {3724#true} is VALID [2022-04-27 14:37:06,421 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3724#true} {3938#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #54#return; {3938#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:37:06,421 INFO L290 TraceCheckUtils]: 74: Hoare triple {3938#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {3960#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:37:06,422 INFO L272 TraceCheckUtils]: 75: Hoare triple {3960#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3964#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:06,422 INFO L290 TraceCheckUtils]: 76: Hoare triple {3964#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3968#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:06,422 INFO L290 TraceCheckUtils]: 77: Hoare triple {3968#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3725#false} is VALID [2022-04-27 14:37:06,422 INFO L290 TraceCheckUtils]: 78: Hoare triple {3725#false} assume !false; {3725#false} is VALID [2022-04-27 14:37:06,423 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-27 14:37:06,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:06,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:06,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080408216] [2022-04-27 14:37:06,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:06,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673481251] [2022-04-27 14:37:06,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673481251] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:06,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:06,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:37:06,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184842994] [2022-04-27 14:37:06,659 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:06,659 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 79 [2022-04-27 14:37:06,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:06,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:37:06,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:06,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:37:06,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:06,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:37:06,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:37:06,698 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:37:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:07,511 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-27 14:37:07,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 14:37:07,511 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 79 [2022-04-27 14:37:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:37:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-27 14:37:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:37:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-27 14:37:07,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-27 14:37:07,563 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-27 14:37:07,564 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:37:07,564 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 14:37:07,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:37:07,566 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:07,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 353 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:37:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 14:37:07,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 14:37:07,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:07,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 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-27 14:37:07,592 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 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-27 14:37:07,593 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 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-27 14:37:07,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:07,594 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-27 14:37:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 14:37:07,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:07,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:07,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 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 55 states. [2022-04-27 14:37:07,594 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 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 55 states. [2022-04-27 14:37:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:07,595 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-27 14:37:07,595 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 14:37:07,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:07,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:07,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:07,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 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-27 14:37:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-04-27 14:37:07,597 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 79 [2022-04-27 14:37:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:07,597 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-04-27 14:37:07,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:37:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 14:37:07,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-27 14:37:07,598 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:07,598 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:07,604 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-27 14:37:07,804 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,SelfDestructingSolverStorable10 [2022-04-27 14:37:07,805 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:07,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:07,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 9 times [2022-04-27 14:37:07,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:07,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370386759] [2022-04-27 14:37:07,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:07,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:07,815 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:07,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1896444366] [2022-04-27 14:37:07,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:37:07,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:07,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:07,816 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-27 14:37:07,817 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-27 14:37:08,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-27 14:37:08,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:08,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-27 14:37:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:08,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:08,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {4307#true} call ULTIMATE.init(); {4307#true} is VALID [2022-04-27 14:37:08,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {4307#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(9, 2);call #Ultimate.allocInit(12, 3); {4307#true} is VALID [2022-04-27 14:37:08,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:37:08,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4307#true} {4307#true} #60#return; {4307#true} is VALID [2022-04-27 14:37:08,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {4307#true} call #t~ret5 := main(); {4307#true} is VALID [2022-04-27 14:37:08,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {4307#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4307#true} is VALID [2022-04-27 14:37:08,698 INFO L272 TraceCheckUtils]: 6: Hoare triple {4307#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {4307#true} is VALID [2022-04-27 14:37:08,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:37:08,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:37:08,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:37:08,699 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4307#true} {4307#true} #52#return; {4307#true} is VALID [2022-04-27 14:37:08,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {4307#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4345#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:08,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {4345#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4345#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:08,699 INFO L272 TraceCheckUtils]: 13: Hoare triple {4345#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4307#true} is VALID [2022-04-27 14:37:08,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:37:08,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:37:08,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:37:08,700 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4307#true} {4345#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4345#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:08,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {4345#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4367#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:08,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {4367#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {4367#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:08,701 INFO L272 TraceCheckUtils]: 20: Hoare triple {4367#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4307#true} is VALID [2022-04-27 14:37:08,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:37:08,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:37:08,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:37:08,701 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4307#true} {4367#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {4367#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:08,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {4367#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4389#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:08,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {4389#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {4389#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:08,702 INFO L272 TraceCheckUtils]: 27: Hoare triple {4389#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4307#true} is VALID [2022-04-27 14:37:08,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:37:08,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:37:08,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:37:08,703 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4307#true} {4389#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {4389#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:08,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {4389#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4411#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:37:08,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {4411#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {4411#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:37:08,704 INFO L272 TraceCheckUtils]: 34: Hoare triple {4411#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4307#true} is VALID [2022-04-27 14:37:08,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:37:08,704 INFO L290 TraceCheckUtils]: 36: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:37:08,704 INFO L290 TraceCheckUtils]: 37: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:37:08,704 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4307#true} {4411#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {4411#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:37:08,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {4411#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4433#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:37:08,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {4433#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {4433#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:37:08,705 INFO L272 TraceCheckUtils]: 41: Hoare triple {4433#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4307#true} is VALID [2022-04-27 14:37:08,705 INFO L290 TraceCheckUtils]: 42: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:37:08,705 INFO L290 TraceCheckUtils]: 43: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:37:08,706 INFO L290 TraceCheckUtils]: 44: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:37:08,706 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4307#true} {4433#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #54#return; {4433#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:37:08,706 INFO L290 TraceCheckUtils]: 46: Hoare triple {4433#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4455#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:08,707 INFO L290 TraceCheckUtils]: 47: Hoare triple {4455#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {4455#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:08,707 INFO L272 TraceCheckUtils]: 48: Hoare triple {4455#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4307#true} is VALID [2022-04-27 14:37:08,707 INFO L290 TraceCheckUtils]: 49: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:37:08,707 INFO L290 TraceCheckUtils]: 50: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:37:08,707 INFO L290 TraceCheckUtils]: 51: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:37:08,708 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4307#true} {4455#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {4455#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:08,708 INFO L290 TraceCheckUtils]: 53: Hoare triple {4455#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4477#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:37:08,708 INFO L290 TraceCheckUtils]: 54: Hoare triple {4477#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {4477#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:37:08,708 INFO L272 TraceCheckUtils]: 55: Hoare triple {4477#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4307#true} is VALID [2022-04-27 14:37:08,709 INFO L290 TraceCheckUtils]: 56: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:37:08,709 INFO L290 TraceCheckUtils]: 57: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:37:08,709 INFO L290 TraceCheckUtils]: 58: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:37:08,709 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4307#true} {4477#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {4477#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:37:08,710 INFO L290 TraceCheckUtils]: 60: Hoare triple {4477#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4499#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:37:08,710 INFO L290 TraceCheckUtils]: 61: Hoare triple {4499#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {4499#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:37:08,710 INFO L272 TraceCheckUtils]: 62: Hoare triple {4499#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4307#true} is VALID [2022-04-27 14:37:08,710 INFO L290 TraceCheckUtils]: 63: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:37:08,710 INFO L290 TraceCheckUtils]: 64: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:37:08,710 INFO L290 TraceCheckUtils]: 65: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:37:08,711 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4307#true} {4499#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {4499#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:37:08,711 INFO L290 TraceCheckUtils]: 67: Hoare triple {4499#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4521#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 14:37:08,712 INFO L290 TraceCheckUtils]: 68: Hoare triple {4521#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} assume !false; {4521#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 14:37:08,712 INFO L272 TraceCheckUtils]: 69: Hoare triple {4521#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4307#true} is VALID [2022-04-27 14:37:08,712 INFO L290 TraceCheckUtils]: 70: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:37:08,712 INFO L290 TraceCheckUtils]: 71: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:37:08,712 INFO L290 TraceCheckUtils]: 72: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:37:08,712 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4307#true} {4521#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} #54#return; {4521#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 14:37:08,713 INFO L290 TraceCheckUtils]: 74: Hoare triple {4521#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 2)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4543#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:37:08,714 INFO L290 TraceCheckUtils]: 75: Hoare triple {4543#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {4543#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:37:08,714 INFO L272 TraceCheckUtils]: 76: Hoare triple {4543#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4307#true} is VALID [2022-04-27 14:37:08,714 INFO L290 TraceCheckUtils]: 77: Hoare triple {4307#true} ~cond := #in~cond; {4307#true} is VALID [2022-04-27 14:37:08,714 INFO L290 TraceCheckUtils]: 78: Hoare triple {4307#true} assume !(0 == ~cond); {4307#true} is VALID [2022-04-27 14:37:08,714 INFO L290 TraceCheckUtils]: 79: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-27 14:37:08,714 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {4307#true} {4543#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #54#return; {4543#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:37:08,715 INFO L290 TraceCheckUtils]: 81: Hoare triple {4543#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {4565#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 14:37:08,716 INFO L272 TraceCheckUtils]: 82: Hoare triple {4565#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:08,716 INFO L290 TraceCheckUtils]: 83: Hoare triple {4569#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:08,716 INFO L290 TraceCheckUtils]: 84: Hoare triple {4573#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4308#false} is VALID [2022-04-27 14:37:08,716 INFO L290 TraceCheckUtils]: 85: Hoare triple {4308#false} assume !false; {4308#false} is VALID [2022-04-27 14:37:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 14:37:08,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:09,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:09,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370386759] [2022-04-27 14:37:09,169 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:09,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896444366] [2022-04-27 14:37:09,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896444366] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:09,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:09,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-27 14:37:09,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370650913] [2022-04-27 14:37:09,169 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:09,174 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 86 [2022-04-27 14:37:09,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:09,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:37:09,214 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-27 14:37:09,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 14:37:09,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:09,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 14:37:09,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:37:09,215 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:37:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:10,117 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-27 14:37:10,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 14:37:10,118 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 86 [2022-04-27 14:37:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:37:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-27 14:37:10,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:37:10,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-27 14:37:10,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 68 transitions. [2022-04-27 14:37:10,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:10,169 INFO L225 Difference]: With dead ends: 63 [2022-04-27 14:37:10,169 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 14:37:10,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:37:10,170 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:10,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 393 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:37:10,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 14:37:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 14:37:10,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:10,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:37:10,193 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:37:10,193 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:37:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:10,194 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-27 14:37:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 14:37:10,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:10,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:10,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-27 14:37:10,195 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-27 14:37:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:10,197 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-27 14:37:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 14:37:10,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:10,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:10,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:10,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:37:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-27 14:37:10,199 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 86 [2022-04-27 14:37:10,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:10,199 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-27 14:37:10,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:37:10,199 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 14:37:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-27 14:37:10,200 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:10,200 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:10,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 14:37:10,404 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,SelfDestructingSolverStorable11 [2022-04-27 14:37:10,405 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:10,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:10,405 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 10 times [2022-04-27 14:37:10,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:10,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329115093] [2022-04-27 14:37:10,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:10,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:10,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:10,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1749585832] [2022-04-27 14:37:10,421 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:37:10,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:10,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:10,422 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-27 14:37:10,423 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-27 14:37:10,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:37:10,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:10,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 14:37:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:10,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:11,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {4972#true} call ULTIMATE.init(); {4972#true} is VALID [2022-04-27 14:37:11,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {4972#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(9, 2);call #Ultimate.allocInit(12, 3); {4972#true} is VALID [2022-04-27 14:37:11,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:37:11,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4972#true} {4972#true} #60#return; {4972#true} is VALID [2022-04-27 14:37:11,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {4972#true} call #t~ret5 := main(); {4972#true} is VALID [2022-04-27 14:37:11,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {4972#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4972#true} is VALID [2022-04-27 14:37:11,393 INFO L272 TraceCheckUtils]: 6: Hoare triple {4972#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:37:11,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:37:11,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:37:11,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:37:11,393 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4972#true} {4972#true} #52#return; {4972#true} is VALID [2022-04-27 14:37:11,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {4972#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5010#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:11,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {5010#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5010#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:11,394 INFO L272 TraceCheckUtils]: 13: Hoare triple {5010#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:37:11,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:37:11,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:37:11,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:37:11,395 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4972#true} {5010#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {5010#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:11,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {5010#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5032#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:37:11,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {5032#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {5032#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:37:11,396 INFO L272 TraceCheckUtils]: 20: Hoare triple {5032#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:37:11,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:37:11,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:37:11,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:37:11,396 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4972#true} {5032#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {5032#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:37:11,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {5032#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5054#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:11,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {5054#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {5054#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:11,397 INFO L272 TraceCheckUtils]: 27: Hoare triple {5054#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:37:11,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:37:11,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:37:11,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:37:11,398 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4972#true} {5054#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {5054#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:11,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {5054#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5076#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:11,399 INFO L290 TraceCheckUtils]: 33: Hoare triple {5076#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {5076#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:11,399 INFO L272 TraceCheckUtils]: 34: Hoare triple {5076#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:37:11,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:37:11,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:37:11,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:37:11,399 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4972#true} {5076#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {5076#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:11,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {5076#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5098#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:37:11,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {5098#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {5098#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:37:11,400 INFO L272 TraceCheckUtils]: 41: Hoare triple {5098#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:37:11,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:37:11,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:37:11,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:37:11,401 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4972#true} {5098#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {5098#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:37:11,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {5098#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5120#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:37:11,402 INFO L290 TraceCheckUtils]: 47: Hoare triple {5120#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {5120#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:37:11,402 INFO L272 TraceCheckUtils]: 48: Hoare triple {5120#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:37:11,402 INFO L290 TraceCheckUtils]: 49: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:37:11,402 INFO L290 TraceCheckUtils]: 50: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:37:11,402 INFO L290 TraceCheckUtils]: 51: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:37:11,403 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4972#true} {5120#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {5120#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:37:11,403 INFO L290 TraceCheckUtils]: 53: Hoare triple {5120#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5142#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:37:11,403 INFO L290 TraceCheckUtils]: 54: Hoare triple {5142#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {5142#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:37:11,403 INFO L272 TraceCheckUtils]: 55: Hoare triple {5142#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:37:11,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:37:11,404 INFO L290 TraceCheckUtils]: 57: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:37:11,404 INFO L290 TraceCheckUtils]: 58: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:37:11,404 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4972#true} {5142#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {5142#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:37:11,405 INFO L290 TraceCheckUtils]: 60: Hoare triple {5142#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5164#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:37:11,405 INFO L290 TraceCheckUtils]: 61: Hoare triple {5164#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {5164#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:37:11,405 INFO L272 TraceCheckUtils]: 62: Hoare triple {5164#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:37:11,405 INFO L290 TraceCheckUtils]: 63: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:37:11,405 INFO L290 TraceCheckUtils]: 64: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:37:11,405 INFO L290 TraceCheckUtils]: 65: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:37:11,406 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4972#true} {5164#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {5164#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:37:11,406 INFO L290 TraceCheckUtils]: 67: Hoare triple {5164#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5186#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:37:11,406 INFO L290 TraceCheckUtils]: 68: Hoare triple {5186#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {5186#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:37:11,407 INFO L272 TraceCheckUtils]: 69: Hoare triple {5186#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:37:11,407 INFO L290 TraceCheckUtils]: 70: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:37:11,407 INFO L290 TraceCheckUtils]: 71: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:37:11,407 INFO L290 TraceCheckUtils]: 72: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:37:11,407 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4972#true} {5186#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #54#return; {5186#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:37:11,408 INFO L290 TraceCheckUtils]: 74: Hoare triple {5186#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5208#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:11,408 INFO L290 TraceCheckUtils]: 75: Hoare triple {5208#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {5208#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:11,408 INFO L272 TraceCheckUtils]: 76: Hoare triple {5208#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:37:11,408 INFO L290 TraceCheckUtils]: 77: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:37:11,408 INFO L290 TraceCheckUtils]: 78: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:37:11,408 INFO L290 TraceCheckUtils]: 79: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:37:11,409 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {4972#true} {5208#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #54#return; {5208#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:37:11,409 INFO L290 TraceCheckUtils]: 81: Hoare triple {5208#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5230#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:37:11,409 INFO L290 TraceCheckUtils]: 82: Hoare triple {5230#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {5230#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:37:11,409 INFO L272 TraceCheckUtils]: 83: Hoare triple {5230#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4972#true} is VALID [2022-04-27 14:37:11,410 INFO L290 TraceCheckUtils]: 84: Hoare triple {4972#true} ~cond := #in~cond; {4972#true} is VALID [2022-04-27 14:37:11,410 INFO L290 TraceCheckUtils]: 85: Hoare triple {4972#true} assume !(0 == ~cond); {4972#true} is VALID [2022-04-27 14:37:11,410 INFO L290 TraceCheckUtils]: 86: Hoare triple {4972#true} assume true; {4972#true} is VALID [2022-04-27 14:37:11,410 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {4972#true} {5230#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #54#return; {5230#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:37:11,411 INFO L290 TraceCheckUtils]: 88: Hoare triple {5230#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {5252#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:37:11,411 INFO L272 TraceCheckUtils]: 89: Hoare triple {5252#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5256#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:11,412 INFO L290 TraceCheckUtils]: 90: Hoare triple {5256#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5260#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:11,412 INFO L290 TraceCheckUtils]: 91: Hoare triple {5260#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4973#false} is VALID [2022-04-27 14:37:11,412 INFO L290 TraceCheckUtils]: 92: Hoare triple {4973#false} assume !false; {4973#false} is VALID [2022-04-27 14:37:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 22 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 14:37:11,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:11,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:11,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329115093] [2022-04-27 14:37:11,673 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:11,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749585832] [2022-04-27 14:37:11,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749585832] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:11,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:11,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-27 14:37:11,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647215827] [2022-04-27 14:37:11,673 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:11,673 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-27 14:37:11,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:11,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:37:11,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:11,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 14:37:11,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:11,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 14:37:11,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:37:11,731 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:37:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:12,770 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-27 14:37:12,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 14:37:12,771 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-27 14:37:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:37:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-27 14:37:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:37:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-27 14:37:12,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 72 transitions. [2022-04-27 14:37:12,830 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-27 14:37:12,831 INFO L225 Difference]: With dead ends: 66 [2022-04-27 14:37:12,831 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 14:37:12,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-27 14:37:12,832 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:12,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 14:37:12,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 14:37:12,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 14:37:12,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:12,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:37:12,866 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:37:12,866 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:37:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:12,867 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-27 14:37:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 14:37:12,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:12,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:12,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 61 states. [2022-04-27 14:37:12,868 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 61 states. [2022-04-27 14:37:12,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:12,869 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-27 14:37:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 14:37:12,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:12,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:12,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:12,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:37:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-04-27 14:37:12,871 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 93 [2022-04-27 14:37:12,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:12,871 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-04-27 14:37:12,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:37:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 14:37:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 14:37:12,872 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:12,872 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:12,878 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-27 14:37:13,078 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,SelfDestructingSolverStorable12 [2022-04-27 14:37:13,078 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:13,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 11 times [2022-04-27 14:37:13,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:13,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686773613] [2022-04-27 14:37:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:13,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:13,089 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:13,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1125050028] [2022-04-27 14:37:13,089 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:37:13,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:13,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:13,090 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-27 14:37:13,091 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-27 14:37:13,675 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-27 14:37:13,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:13,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-27 14:37:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:13,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:14,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {5631#true} call ULTIMATE.init(); {5631#true} is VALID [2022-04-27 14:37:14,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {5631#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(9, 2);call #Ultimate.allocInit(12, 3); {5631#true} is VALID [2022-04-27 14:37:14,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:37:14,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5631#true} {5631#true} #60#return; {5631#true} is VALID [2022-04-27 14:37:14,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {5631#true} call #t~ret5 := main(); {5631#true} is VALID [2022-04-27 14:37:14,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {5631#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {5631#true} is VALID [2022-04-27 14:37:14,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {5631#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:37:14,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:37:14,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:37:14,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:37:14,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5631#true} {5631#true} #52#return; {5631#true} is VALID [2022-04-27 14:37:14,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {5631#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5669#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:14,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {5669#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5669#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:14,350 INFO L272 TraceCheckUtils]: 13: Hoare triple {5669#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:37:14,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:37:14,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:37:14,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:37:14,350 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5631#true} {5669#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {5669#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:14,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {5669#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5691#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:14,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {5691#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {5691#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:14,351 INFO L272 TraceCheckUtils]: 20: Hoare triple {5691#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:37:14,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:37:14,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:37:14,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:37:14,352 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5631#true} {5691#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {5691#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:37:14,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {5691#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5713#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {5713#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !false; {5713#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,353 INFO L272 TraceCheckUtils]: 27: Hoare triple {5713#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:37:14,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:37:14,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:37:14,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:37:14,353 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5631#true} {5713#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} #54#return; {5713#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {5713#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5735#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {5735#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< 0 main_~k~0))} assume !false; {5735#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,354 INFO L272 TraceCheckUtils]: 34: Hoare triple {5735#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:37:14,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:37:14,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:37:14,354 INFO L290 TraceCheckUtils]: 37: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:37:14,355 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5631#true} {5735#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< 0 main_~k~0))} #54#return; {5735#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,355 INFO L290 TraceCheckUtils]: 39: Hoare triple {5735#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5757#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,355 INFO L290 TraceCheckUtils]: 40: Hoare triple {5757#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} assume !false; {5757#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,355 INFO L272 TraceCheckUtils]: 41: Hoare triple {5757#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:37:14,355 INFO L290 TraceCheckUtils]: 42: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:37:14,356 INFO L290 TraceCheckUtils]: 43: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:37:14,356 INFO L290 TraceCheckUtils]: 44: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:37:14,356 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5631#true} {5757#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} #54#return; {5757#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,356 INFO L290 TraceCheckUtils]: 46: Hoare triple {5757#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5779#(and (= (+ main_~c~0 (- 4)) 1) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,357 INFO L290 TraceCheckUtils]: 47: Hoare triple {5779#(and (= (+ main_~c~0 (- 4)) 1) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {5779#(and (= (+ main_~c~0 (- 4)) 1) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,357 INFO L272 TraceCheckUtils]: 48: Hoare triple {5779#(and (= (+ main_~c~0 (- 4)) 1) (= 5 main_~y~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:37:14,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:37:14,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:37:14,357 INFO L290 TraceCheckUtils]: 51: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:37:14,357 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5631#true} {5779#(and (= (+ main_~c~0 (- 4)) 1) (= 5 main_~y~0) (< 0 main_~k~0))} #54#return; {5779#(and (= (+ main_~c~0 (- 4)) 1) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {5779#(and (= (+ main_~c~0 (- 4)) 1) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5801#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {5801#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !false; {5801#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,358 INFO L272 TraceCheckUtils]: 55: Hoare triple {5801#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:37:14,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:37:14,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:37:14,358 INFO L290 TraceCheckUtils]: 58: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:37:14,367 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5631#true} {5801#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} #54#return; {5801#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,368 INFO L290 TraceCheckUtils]: 60: Hoare triple {5801#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5823#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,368 INFO L290 TraceCheckUtils]: 61: Hoare triple {5823#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} assume !false; {5823#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,368 INFO L272 TraceCheckUtils]: 62: Hoare triple {5823#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:37:14,368 INFO L290 TraceCheckUtils]: 63: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:37:14,368 INFO L290 TraceCheckUtils]: 64: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:37:14,368 INFO L290 TraceCheckUtils]: 65: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:37:14,369 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5631#true} {5823#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} #54#return; {5823#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,369 INFO L290 TraceCheckUtils]: 67: Hoare triple {5823#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5845#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,369 INFO L290 TraceCheckUtils]: 68: Hoare triple {5845#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {5845#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,369 INFO L272 TraceCheckUtils]: 69: Hoare triple {5845#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:37:14,370 INFO L290 TraceCheckUtils]: 70: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:37:14,370 INFO L290 TraceCheckUtils]: 71: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:37:14,370 INFO L290 TraceCheckUtils]: 72: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:37:14,370 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5631#true} {5845#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} #54#return; {5845#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,371 INFO L290 TraceCheckUtils]: 74: Hoare triple {5845#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5867#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,371 INFO L290 TraceCheckUtils]: 75: Hoare triple {5867#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {5867#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,371 INFO L272 TraceCheckUtils]: 76: Hoare triple {5867#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:37:14,371 INFO L290 TraceCheckUtils]: 77: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:37:14,371 INFO L290 TraceCheckUtils]: 78: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:37:14,371 INFO L290 TraceCheckUtils]: 79: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:37:14,372 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5631#true} {5867#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} #54#return; {5867#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,372 INFO L290 TraceCheckUtils]: 81: Hoare triple {5867#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5889#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,372 INFO L290 TraceCheckUtils]: 82: Hoare triple {5889#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !false; {5889#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,372 INFO L272 TraceCheckUtils]: 83: Hoare triple {5889#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:37:14,372 INFO L290 TraceCheckUtils]: 84: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:37:14,373 INFO L290 TraceCheckUtils]: 85: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:37:14,373 INFO L290 TraceCheckUtils]: 86: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:37:14,373 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {5631#true} {5889#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} #54#return; {5889#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:37:14,373 INFO L290 TraceCheckUtils]: 88: Hoare triple {5889#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5911#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:37:14,374 INFO L290 TraceCheckUtils]: 89: Hoare triple {5911#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !false; {5911#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:37:14,374 INFO L272 TraceCheckUtils]: 90: Hoare triple {5911#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5631#true} is VALID [2022-04-27 14:37:14,374 INFO L290 TraceCheckUtils]: 91: Hoare triple {5631#true} ~cond := #in~cond; {5631#true} is VALID [2022-04-27 14:37:14,374 INFO L290 TraceCheckUtils]: 92: Hoare triple {5631#true} assume !(0 == ~cond); {5631#true} is VALID [2022-04-27 14:37:14,374 INFO L290 TraceCheckUtils]: 93: Hoare triple {5631#true} assume true; {5631#true} is VALID [2022-04-27 14:37:14,375 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {5631#true} {5911#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} #54#return; {5911#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:37:14,375 INFO L290 TraceCheckUtils]: 95: Hoare triple {5911#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !(~c~0 < ~k~0); {5933#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} is VALID [2022-04-27 14:37:14,376 INFO L272 TraceCheckUtils]: 96: Hoare triple {5933#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:14,376 INFO L290 TraceCheckUtils]: 97: Hoare triple {5937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:14,376 INFO L290 TraceCheckUtils]: 98: Hoare triple {5941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5632#false} is VALID [2022-04-27 14:37:14,376 INFO L290 TraceCheckUtils]: 99: Hoare triple {5632#false} assume !false; {5632#false} is VALID [2022-04-27 14:37:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-27 14:37:14,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:15,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:15,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686773613] [2022-04-27 14:37:15,408 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:15,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125050028] [2022-04-27 14:37:15,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125050028] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:37:15,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:37:15,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-27 14:37:15,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189033956] [2022-04-27 14:37:15,409 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:37:15,409 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-27 14:37:15,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:15,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:37:15,454 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-27 14:37:15,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 14:37:15,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:15,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 14:37:15,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2022-04-27 14:37:15,454 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:37:16,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:16,773 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-27 14:37:16,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:37:16,773 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-27 14:37:16,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:37:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-27 14:37:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:37:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-27 14:37:16,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 76 transitions. [2022-04-27 14:37:16,838 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-27 14:37:16,839 INFO L225 Difference]: With dead ends: 69 [2022-04-27 14:37:16,839 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 14:37:16,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2022-04-27 14:37:16,839 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:16,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 475 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 14:37:16,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 14:37:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-27 14:37:16,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:16,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:37:16,870 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:37:16,871 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:37:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:16,872 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-27 14:37:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-27 14:37:16,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:16,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:16,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 64 states. [2022-04-27 14:37:16,872 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 64 states. [2022-04-27 14:37:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:16,874 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-27 14:37:16,874 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-27 14:37:16,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:16,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:16,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:16,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:37:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-04-27 14:37:16,875 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 100 [2022-04-27 14:37:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:16,875 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-04-27 14:37:16,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:37:16,876 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-27 14:37:16,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-27 14:37:16,876 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:16,876 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:16,883 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-27 14:37:17,081 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,SelfDestructingSolverStorable13 [2022-04-27 14:37:17,081 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:17,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:17,081 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 12 times [2022-04-27 14:37:17,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:17,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208801831] [2022-04-27 14:37:17,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:17,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:17,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:17,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152306878] [2022-04-27 14:37:17,093 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:37:17,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:17,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:17,094 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-27 14:37:17,095 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-27 14:37:17,351 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-27 14:37:17,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:17,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-27 14:37:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:17,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:18,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {6548#true} call ULTIMATE.init(); {6548#true} is VALID [2022-04-27 14:37:18,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {6548#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(9, 2);call #Ultimate.allocInit(12, 3); {6548#true} is VALID [2022-04-27 14:37:18,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:37:18,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6548#true} {6548#true} #60#return; {6548#true} is VALID [2022-04-27 14:37:18,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {6548#true} call #t~ret5 := main(); {6548#true} is VALID [2022-04-27 14:37:18,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {6548#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {6548#true} is VALID [2022-04-27 14:37:18,169 INFO L272 TraceCheckUtils]: 6: Hoare triple {6548#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:37:18,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:37:18,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:37:18,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:37:18,169 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6548#true} {6548#true} #52#return; {6548#true} is VALID [2022-04-27 14:37:18,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {6548#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6586#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:18,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {6586#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6586#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:18,170 INFO L272 TraceCheckUtils]: 13: Hoare triple {6586#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:37:18,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:37:18,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:37:18,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:37:18,170 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6548#true} {6586#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {6586#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:37:18,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {6586#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6608#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:18,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {6608#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {6608#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:18,171 INFO L272 TraceCheckUtils]: 20: Hoare triple {6608#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:37:18,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:37:18,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:37:18,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:37:18,172 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6548#true} {6608#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {6608#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:37:18,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {6608#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6630#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:18,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {6630#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {6630#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:18,172 INFO L272 TraceCheckUtils]: 27: Hoare triple {6630#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:37:18,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:37:18,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:37:18,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:37:18,173 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6548#true} {6630#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {6630#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:37:18,173 INFO L290 TraceCheckUtils]: 32: Hoare triple {6630#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6652#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:18,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {6652#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {6652#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:18,174 INFO L272 TraceCheckUtils]: 34: Hoare triple {6652#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:37:18,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:37:18,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:37:18,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:37:18,174 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6548#true} {6652#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {6652#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:37:18,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {6652#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6674#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:18,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {6674#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {6674#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:18,175 INFO L272 TraceCheckUtils]: 41: Hoare triple {6674#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:37:18,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:37:18,175 INFO L290 TraceCheckUtils]: 43: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:37:18,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:37:18,176 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6548#true} {6674#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #54#return; {6674#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:18,176 INFO L290 TraceCheckUtils]: 46: Hoare triple {6674#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6696#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:18,177 INFO L290 TraceCheckUtils]: 47: Hoare triple {6696#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {6696#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:18,177 INFO L272 TraceCheckUtils]: 48: Hoare triple {6696#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:37:18,177 INFO L290 TraceCheckUtils]: 49: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:37:18,177 INFO L290 TraceCheckUtils]: 50: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:37:18,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:37:18,177 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6548#true} {6696#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #54#return; {6696#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:37:18,178 INFO L290 TraceCheckUtils]: 53: Hoare triple {6696#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6718#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:18,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {6718#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !false; {6718#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:18,178 INFO L272 TraceCheckUtils]: 55: Hoare triple {6718#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:37:18,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:37:18,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:37:18,178 INFO L290 TraceCheckUtils]: 58: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:37:18,179 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6548#true} {6718#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} #54#return; {6718#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:37:18,180 INFO L290 TraceCheckUtils]: 60: Hoare triple {6718#(and (= main_~c~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6740#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:37:18,180 INFO L290 TraceCheckUtils]: 61: Hoare triple {6740#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} assume !false; {6740#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:37:18,180 INFO L272 TraceCheckUtils]: 62: Hoare triple {6740#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:37:18,180 INFO L290 TraceCheckUtils]: 63: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:37:18,180 INFO L290 TraceCheckUtils]: 64: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:37:18,180 INFO L290 TraceCheckUtils]: 65: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:37:18,181 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6548#true} {6740#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} #54#return; {6740#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:37:18,181 INFO L290 TraceCheckUtils]: 67: Hoare triple {6740#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6) (< 5 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6762#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)) (< 5 main_~k~0))} is VALID [2022-04-27 14:37:18,182 INFO L290 TraceCheckUtils]: 68: Hoare triple {6762#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)) (< 5 main_~k~0))} assume !false; {6762#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)) (< 5 main_~k~0))} is VALID [2022-04-27 14:37:18,182 INFO L272 TraceCheckUtils]: 69: Hoare triple {6762#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:37:18,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:37:18,182 INFO L290 TraceCheckUtils]: 71: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:37:18,182 INFO L290 TraceCheckUtils]: 72: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:37:18,183 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6548#true} {6762#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)) (< 5 main_~k~0))} #54#return; {6762#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)) (< 5 main_~k~0))} is VALID [2022-04-27 14:37:18,183 INFO L290 TraceCheckUtils]: 74: Hoare triple {6762#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)) (< 5 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6784#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-27 14:37:18,184 INFO L290 TraceCheckUtils]: 75: Hoare triple {6784#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} assume !false; {6784#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-27 14:37:18,184 INFO L272 TraceCheckUtils]: 76: Hoare triple {6784#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:37:18,184 INFO L290 TraceCheckUtils]: 77: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:37:18,184 INFO L290 TraceCheckUtils]: 78: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:37:18,184 INFO L290 TraceCheckUtils]: 79: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:37:18,184 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6548#true} {6784#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} #54#return; {6784#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-27 14:37:18,185 INFO L290 TraceCheckUtils]: 81: Hoare triple {6784#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6806#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-27 14:37:18,185 INFO L290 TraceCheckUtils]: 82: Hoare triple {6806#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} assume !false; {6806#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-27 14:37:18,185 INFO L272 TraceCheckUtils]: 83: Hoare triple {6806#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:37:18,185 INFO L290 TraceCheckUtils]: 84: Hoare triple {6548#true} ~cond := #in~cond; {6548#true} is VALID [2022-04-27 14:37:18,185 INFO L290 TraceCheckUtils]: 85: Hoare triple {6548#true} assume !(0 == ~cond); {6548#true} is VALID [2022-04-27 14:37:18,185 INFO L290 TraceCheckUtils]: 86: Hoare triple {6548#true} assume true; {6548#true} is VALID [2022-04-27 14:37:18,186 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {6548#true} {6806#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} #54#return; {6806#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-27 14:37:18,186 INFO L290 TraceCheckUtils]: 88: Hoare triple {6806#(and (= 9 (+ (- 1) main_~y~0)) (< 5 main_~k~0) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6828#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:37:18,187 INFO L290 TraceCheckUtils]: 89: Hoare triple {6828#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11))} assume !false; {6828#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:37:18,187 INFO L272 TraceCheckUtils]: 90: Hoare triple {6828#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:37:18,187 INFO L290 TraceCheckUtils]: 91: Hoare triple {6548#true} ~cond := #in~cond; {6838#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:18,188 INFO L290 TraceCheckUtils]: 92: Hoare triple {6838#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:37:18,188 INFO L290 TraceCheckUtils]: 93: Hoare triple {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:37:18,189 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} {6828#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11))} #54#return; {6849#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} is VALID [2022-04-27 14:37:18,189 INFO L290 TraceCheckUtils]: 95: Hoare triple {6849#(and (= (+ (- 1) main_~c~0) 10) (< 5 main_~k~0) (= main_~y~0 11) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6853#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0) (< 11 main_~k~0))} is VALID [2022-04-27 14:37:18,190 INFO L290 TraceCheckUtils]: 96: Hoare triple {6853#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0) (< 11 main_~k~0))} assume !false; {6853#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0) (< 11 main_~k~0))} is VALID [2022-04-27 14:37:18,190 INFO L272 TraceCheckUtils]: 97: Hoare triple {6853#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0) (< 11 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6548#true} is VALID [2022-04-27 14:37:18,190 INFO L290 TraceCheckUtils]: 98: Hoare triple {6548#true} ~cond := #in~cond; {6838#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:18,190 INFO L290 TraceCheckUtils]: 99: Hoare triple {6838#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:37:18,191 INFO L290 TraceCheckUtils]: 100: Hoare triple {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:37:18,192 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {6842#(not (= |__VERIFIER_assert_#in~cond| 0))} {6853#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4)) main_~x~0) (< 11 main_~k~0))} #54#return; {6872#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-27 14:37:18,192 INFO L290 TraceCheckUtils]: 102: Hoare triple {6872#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {6876#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-27 14:37:18,193 INFO L272 TraceCheckUtils]: 103: Hoare triple {6876#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6880#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:37:18,193 INFO L290 TraceCheckUtils]: 104: Hoare triple {6880#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6884#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:37:18,193 INFO L290 TraceCheckUtils]: 105: Hoare triple {6884#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6549#false} is VALID [2022-04-27 14:37:18,194 INFO L290 TraceCheckUtils]: 106: Hoare triple {6549#false} assume !false; {6549#false} is VALID [2022-04-27 14:37:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 90 proven. 236 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-04-27 14:37:18,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:37:36,621 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse2 (* (- 13) c_main_~y~0 c_main_~y~0)) (.cse3 (* (- 1) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (or (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 c_main_~k~0) (* .cse0 .cse0))) (not (<= (+ (* c_main_~y~0 c_main_~y~0 c_main_~y~0) c_main_~x~0 1 (* 3 (* c_main_~y~0 c_main_~y~0))) (div (+ .cse1 .cse2 .cse3 (- 4)) (- 4)))) (not (= (mod (+ .cse1 .cse2 .cse3) 4) 0)) (< (+ c_main_~c~0 1) c_main_~k~0) (not (< c_main_~c~0 c_main_~k~0)))) is different from false [2022-04-27 14:37:40,768 WARN L833 $PredicateComparison]: unable to prove that (or (= (+ (* c_main_~y~0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) (* c_main_~y~0 c_main_~y~0) 1)) (<= c_main_~k~0 c_main_~c~0) (not (= (mod (+ (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 13) c_main_~y~0 c_main_~y~0) (* (- 1) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)) (< (+ c_main_~c~0 1) c_main_~k~0)) is different from false [2022-04-27 14:38:23,058 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 c_main_~y~0))) (or (= (+ (* 2 c_main_~y~0) 7 (* .cse0 .cse0)) (+ (* .cse0 c_main_~k~0) c_main_~k~0)) (< (+ c_main_~c~0 4) c_main_~k~0) (<= c_main_~k~0 (+ 3 c_main_~c~0)) (not (= (mod (+ (* (- 1) .cse0 .cse0 .cse0 .cse0) (* (- 13) .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6))) 4) 0)))) is different from false [2022-04-27 14:40:29,202 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (<= main_~k~0 (+ 6 c_main_~c~0)) (< (+ 7 c_main_~c~0) main_~k~0) (= (+ (* 7 main_~k~0) (* main_~k~0 c_main_~y~0)) (+ (* 14 c_main_~y~0) 49 (* c_main_~y~0 c_main_~y~0))))) (not (= (mod (let ((.cse0 (+ 6 c_main_~y~0))) (+ (* (- 1) .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 (- 6)) (* (- 13) .cse0 .cse0))) 4) 0))) is different from false [2022-04-27 14:40:31,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:40:31,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208801831] [2022-04-27 14:40:31,265 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:40:31,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152306878] [2022-04-27 14:40:31,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152306878] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:40:31,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:40:31,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-27 14:40:31,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059014539] [2022-04-27 14:40:31,265 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:40:31,265 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-27 14:40:31,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:40:31,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:40:31,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:40:31,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 14:40:31,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:40:31,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 14:40:31,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=735, Unknown=13, NotChecked=236, Total=1122 [2022-04-27 14:40:31,325 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:40:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:40:33,132 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-27 14:40:33,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 14:40:33,132 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-27 14:40:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:40:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:40:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-27 14:40:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:40:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-27 14:40:33,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 80 transitions. [2022-04-27 14:40:33,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:40:33,207 INFO L225 Difference]: With dead ends: 72 [2022-04-27 14:40:33,207 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 14:40:33,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 138.3s TimeCoverageRelationStatistics Valid=159, Invalid=900, Unknown=13, NotChecked=260, Total=1332 [2022-04-27 14:40:33,208 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 14:40:33,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 489 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 14:40:33,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 14:40:33,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-27 14:40:33,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:40:33,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:40:33,252 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:40:33,252 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:40:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:40:33,254 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-27 14:40:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 14:40:33,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:40:33,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:40:33,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-27 14:40:33,254 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-27 14:40:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:40:33,256 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-27 14:40:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 14:40:33,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:40:33,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:40:33,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:40:33,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:40:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:40:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-04-27 14:40:33,257 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 107 [2022-04-27 14:40:33,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:40:33,258 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-04-27 14:40:33,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:40:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 14:40:33,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-27 14:40:33,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:40:33,259 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:40:33,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-27 14:40:33,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:40:33,463 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:40:33,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:40:33,463 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 13 times [2022-04-27 14:40:33,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:40:33,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751968196] [2022-04-27 14:40:33,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:40:33,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:40:33,473 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:40:33,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417187818] [2022-04-27 14:40:33,473 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:40:33,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:40:33,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:40:33,474 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-27 14:40:33,475 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-27 14:40:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:40:34,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-27 14:40:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:40:34,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:40:34,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {7424#true} call ULTIMATE.init(); {7424#true} is VALID [2022-04-27 14:40:34,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {7424#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(9, 2);call #Ultimate.allocInit(12, 3); {7424#true} is VALID [2022-04-27 14:40:34,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:40:34,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7424#true} {7424#true} #60#return; {7424#true} is VALID [2022-04-27 14:40:34,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {7424#true} call #t~ret5 := main(); {7424#true} is VALID [2022-04-27 14:40:34,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {7424#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7424#true} is VALID [2022-04-27 14:40:34,975 INFO L272 TraceCheckUtils]: 6: Hoare triple {7424#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:40:34,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:40:34,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:40:34,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:40:34,976 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7424#true} {7424#true} #52#return; {7424#true} is VALID [2022-04-27 14:40:34,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {7424#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7462#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:40:34,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {7462#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7462#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:40:34,979 INFO L272 TraceCheckUtils]: 13: Hoare triple {7462#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:40:34,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:40:34,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:40:34,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:40:34,979 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7424#true} {7462#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {7462#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:40:34,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {7462#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:40:34,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:40:34,980 INFO L272 TraceCheckUtils]: 20: Hoare triple {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:40:34,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:40:34,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:40:34,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:40:34,981 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7424#true} {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:40:34,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {7484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:40:34,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:40:34,981 INFO L272 TraceCheckUtils]: 27: Hoare triple {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:40:34,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:40:34,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:40:34,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:40:34,991 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7424#true} {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:40:34,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {7506#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:40:34,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:40:34,992 INFO L272 TraceCheckUtils]: 34: Hoare triple {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:40:34,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:40:34,992 INFO L290 TraceCheckUtils]: 36: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:40:34,992 INFO L290 TraceCheckUtils]: 37: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:40:34,992 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7424#true} {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:40:34,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {7528#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:40:34,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:40:34,993 INFO L272 TraceCheckUtils]: 41: Hoare triple {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:40:34,993 INFO L290 TraceCheckUtils]: 42: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:40:34,993 INFO L290 TraceCheckUtils]: 43: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:40:34,993 INFO L290 TraceCheckUtils]: 44: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:40:34,994 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7424#true} {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:40:34,994 INFO L290 TraceCheckUtils]: 46: Hoare triple {7550#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:40:34,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:40:34,995 INFO L272 TraceCheckUtils]: 48: Hoare triple {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:40:34,995 INFO L290 TraceCheckUtils]: 49: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:40:34,995 INFO L290 TraceCheckUtils]: 50: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:40:34,995 INFO L290 TraceCheckUtils]: 51: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:40:34,995 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7424#true} {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #54#return; {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:40:34,996 INFO L290 TraceCheckUtils]: 53: Hoare triple {7572#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:40:34,996 INFO L290 TraceCheckUtils]: 54: Hoare triple {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !false; {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:40:34,996 INFO L272 TraceCheckUtils]: 55: Hoare triple {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:40:34,996 INFO L290 TraceCheckUtils]: 56: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:40:34,996 INFO L290 TraceCheckUtils]: 57: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:40:34,996 INFO L290 TraceCheckUtils]: 58: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:40:34,997 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7424#true} {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #54#return; {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 14:40:34,997 INFO L290 TraceCheckUtils]: 60: Hoare triple {7594#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:40:34,997 INFO L290 TraceCheckUtils]: 61: Hoare triple {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:40:34,997 INFO L272 TraceCheckUtils]: 62: Hoare triple {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:40:34,997 INFO L290 TraceCheckUtils]: 63: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:40:34,997 INFO L290 TraceCheckUtils]: 64: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:40:34,998 INFO L290 TraceCheckUtils]: 65: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:40:34,998 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7424#true} {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:40:34,998 INFO L290 TraceCheckUtils]: 67: Hoare triple {7616#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:40:34,999 INFO L290 TraceCheckUtils]: 68: Hoare triple {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:40:34,999 INFO L272 TraceCheckUtils]: 69: Hoare triple {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:40:34,999 INFO L290 TraceCheckUtils]: 70: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:40:34,999 INFO L290 TraceCheckUtils]: 71: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:40:34,999 INFO L290 TraceCheckUtils]: 72: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:40:34,999 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7424#true} {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:40:35,000 INFO L290 TraceCheckUtils]: 74: Hoare triple {7638#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:40:35,000 INFO L290 TraceCheckUtils]: 75: Hoare triple {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:40:35,000 INFO L272 TraceCheckUtils]: 76: Hoare triple {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:40:35,000 INFO L290 TraceCheckUtils]: 77: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:40:35,000 INFO L290 TraceCheckUtils]: 78: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:40:35,000 INFO L290 TraceCheckUtils]: 79: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:40:35,001 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7424#true} {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #54#return; {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:40:35,001 INFO L290 TraceCheckUtils]: 81: Hoare triple {7660#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7682#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:40:35,001 INFO L290 TraceCheckUtils]: 82: Hoare triple {7682#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {7682#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:40:35,001 INFO L272 TraceCheckUtils]: 83: Hoare triple {7682#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:40:35,001 INFO L290 TraceCheckUtils]: 84: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:40:35,001 INFO L290 TraceCheckUtils]: 85: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:40:35,001 INFO L290 TraceCheckUtils]: 86: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:40:35,002 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {7424#true} {7682#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {7682#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:40:35,002 INFO L290 TraceCheckUtils]: 88: Hoare triple {7682#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7704#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:40:35,003 INFO L290 TraceCheckUtils]: 89: Hoare triple {7704#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {7704#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:40:35,003 INFO L272 TraceCheckUtils]: 90: Hoare triple {7704#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:40:35,003 INFO L290 TraceCheckUtils]: 91: Hoare triple {7424#true} ~cond := #in~cond; {7424#true} is VALID [2022-04-27 14:40:35,003 INFO L290 TraceCheckUtils]: 92: Hoare triple {7424#true} assume !(0 == ~cond); {7424#true} is VALID [2022-04-27 14:40:35,003 INFO L290 TraceCheckUtils]: 93: Hoare triple {7424#true} assume true; {7424#true} is VALID [2022-04-27 14:40:35,003 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7424#true} {7704#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {7704#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:40:35,004 INFO L290 TraceCheckUtils]: 95: Hoare triple {7704#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7726#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:40:35,004 INFO L290 TraceCheckUtils]: 96: Hoare triple {7726#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {7726#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:40:35,004 INFO L272 TraceCheckUtils]: 97: Hoare triple {7726#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:40:35,004 INFO L290 TraceCheckUtils]: 98: Hoare triple {7424#true} ~cond := #in~cond; {7736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:40:35,005 INFO L290 TraceCheckUtils]: 99: Hoare triple {7736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:40:35,005 INFO L290 TraceCheckUtils]: 100: Hoare triple {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:40:35,006 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} {7726#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {7747#(and (= main_~y~0 12) (= main_~c~0 12) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} is VALID [2022-04-27 14:40:35,007 INFO L290 TraceCheckUtils]: 102: Hoare triple {7747#(and (= main_~y~0 12) (= main_~c~0 12) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7751#(and (< 12 main_~k~0) (<= main_~c~0 13) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (= main_~y~0 13))} is VALID [2022-04-27 14:40:35,007 INFO L290 TraceCheckUtils]: 103: Hoare triple {7751#(and (< 12 main_~k~0) (<= main_~c~0 13) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (= main_~y~0 13))} assume !false; {7751#(and (< 12 main_~k~0) (<= main_~c~0 13) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (= main_~y~0 13))} is VALID [2022-04-27 14:40:35,008 INFO L272 TraceCheckUtils]: 104: Hoare triple {7751#(and (< 12 main_~k~0) (<= main_~c~0 13) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7424#true} is VALID [2022-04-27 14:40:35,008 INFO L290 TraceCheckUtils]: 105: Hoare triple {7424#true} ~cond := #in~cond; {7736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:40:35,008 INFO L290 TraceCheckUtils]: 106: Hoare triple {7736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:40:35,008 INFO L290 TraceCheckUtils]: 107: Hoare triple {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:40:35,009 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {7740#(not (= |__VERIFIER_assert_#in~cond| 0))} {7751#(and (< 12 main_~k~0) (<= main_~c~0 13) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (= main_~y~0 13))} #54#return; {7770#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:40:35,010 INFO L290 TraceCheckUtils]: 109: Hoare triple {7770#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {7774#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:40:35,010 INFO L272 TraceCheckUtils]: 110: Hoare triple {7774#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:40:35,011 INFO L290 TraceCheckUtils]: 111: Hoare triple {7778#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7782#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:40:35,011 INFO L290 TraceCheckUtils]: 112: Hoare triple {7782#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7425#false} is VALID [2022-04-27 14:40:35,011 INFO L290 TraceCheckUtils]: 113: Hoare triple {7425#false} assume !false; {7425#false} is VALID [2022-04-27 14:40:35,012 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 98 proven. 275 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2022-04-27 14:40:35,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:05,211 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= (mod (+ (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 13) c_main_~y~0 c_main_~y~0) (* (- 1) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) is different from false [2022-04-27 14:42:05,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:05,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751968196] [2022-04-27 14:42:05,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:05,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417187818] [2022-04-27 14:42:05,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417187818] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:05,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:05,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-27 14:42:05,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004536752] [2022-04-27 14:42:05,214 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:05,215 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 16 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 114 [2022-04-27 14:42:05,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:05,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 16 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 14:42:05,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:05,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 14:42:05,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:05,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 14:42:05,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=666, Unknown=6, NotChecked=52, Total=812 [2022-04-27 14:42:05,269 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 16 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 14:42:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:07,784 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-04-27 14:42:07,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:42:07,784 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 16 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 114 [2022-04-27 14:42:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 16 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 14:42:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 84 transitions. [2022-04-27 14:42:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 16 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 14:42:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 84 transitions. [2022-04-27 14:42:07,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 84 transitions. [2022-04-27 14:42:07,848 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-27 14:42:07,848 INFO L225 Difference]: With dead ends: 75 [2022-04-27 14:42:07,849 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 14:42:07,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 71.9s TimeCoverageRelationStatistics Valid=109, Invalid=819, Unknown=6, NotChecked=58, Total=992 [2022-04-27 14:42:07,849 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:07,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 594 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 14:42:07,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 14:42:07,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-27 14:42:07,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:07,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:42:07,905 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:42:07,905 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:42:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:07,906 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-27 14:42:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 14:42:07,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:07,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:07,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 70 states. [2022-04-27 14:42:07,907 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 70 states. [2022-04-27 14:42:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:07,908 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-27 14:42:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 14:42:07,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:07,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:07,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:07,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:07,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:42:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-04-27 14:42:07,910 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 114 [2022-04-27 14:42:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:07,910 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-04-27 14:42:07,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 16 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 14:42:07,910 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 14:42:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-27 14:42:07,911 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:07,911 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:07,916 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-27 14:42:08,115 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,SelfDestructingSolverStorable15 [2022-04-27 14:42:08,116 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:08,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:08,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 14 times [2022-04-27 14:42:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:08,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408549647] [2022-04-27 14:42:08,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:08,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:08,128 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:08,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [884231634] [2022-04-27 14:42:08,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:42:08,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:08,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:08,132 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-27 14:42:08,132 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-27 14:42:08,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:42:08,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:08,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-27 14:42:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:08,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:09,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {8206#true} call ULTIMATE.init(); {8206#true} is VALID [2022-04-27 14:42:09,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {8206#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(9, 2);call #Ultimate.allocInit(12, 3); {8206#true} is VALID [2022-04-27 14:42:09,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8206#true} {8206#true} #60#return; {8206#true} is VALID [2022-04-27 14:42:09,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {8206#true} call #t~ret5 := main(); {8206#true} is VALID [2022-04-27 14:42:09,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {8206#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {8206#true} is VALID [2022-04-27 14:42:09,230 INFO L272 TraceCheckUtils]: 6: Hoare triple {8206#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8206#true} {8206#true} #52#return; {8206#true} is VALID [2022-04-27 14:42:09,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {8206#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8244#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:09,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {8244#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8244#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:09,231 INFO L272 TraceCheckUtils]: 13: Hoare triple {8244#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,231 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8206#true} {8244#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {8244#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:09,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {8244#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8266#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:42:09,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {8266#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {8266#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:42:09,232 INFO L272 TraceCheckUtils]: 20: Hoare triple {8266#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,233 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8206#true} {8266#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {8266#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:42:09,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {8266#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8288#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:42:09,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {8288#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {8288#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:42:09,233 INFO L272 TraceCheckUtils]: 27: Hoare triple {8288#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,234 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8206#true} {8288#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {8288#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:42:09,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {8288#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:42:09,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:42:09,235 INFO L272 TraceCheckUtils]: 34: Hoare triple {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,235 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8206#true} {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:42:09,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {8310#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:42:09,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:42:09,236 INFO L272 TraceCheckUtils]: 41: Hoare triple {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,237 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8206#true} {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:42:09,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {8332#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:09,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:09,237 INFO L272 TraceCheckUtils]: 48: Hoare triple {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,237 INFO L290 TraceCheckUtils]: 50: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,237 INFO L290 TraceCheckUtils]: 51: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,238 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8206#true} {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:09,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {8354#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:09,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:09,239 INFO L272 TraceCheckUtils]: 55: Hoare triple {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,239 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8206#true} {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #54#return; {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:09,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {8376#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-27 14:42:09,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-27 14:42:09,240 INFO L272 TraceCheckUtils]: 62: Hoare triple {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,240 INFO L290 TraceCheckUtils]: 63: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,240 INFO L290 TraceCheckUtils]: 64: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,240 INFO L290 TraceCheckUtils]: 65: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,240 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8206#true} {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #54#return; {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-27 14:42:09,241 INFO L290 TraceCheckUtils]: 67: Hoare triple {8398#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:42:09,241 INFO L290 TraceCheckUtils]: 68: Hoare triple {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !false; {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:42:09,241 INFO L272 TraceCheckUtils]: 69: Hoare triple {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,241 INFO L290 TraceCheckUtils]: 70: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,241 INFO L290 TraceCheckUtils]: 71: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,241 INFO L290 TraceCheckUtils]: 72: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,243 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8206#true} {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} #54#return; {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:42:09,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {8420#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:09,244 INFO L290 TraceCheckUtils]: 75: Hoare triple {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:09,244 INFO L272 TraceCheckUtils]: 76: Hoare triple {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,244 INFO L290 TraceCheckUtils]: 77: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,244 INFO L290 TraceCheckUtils]: 78: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,244 INFO L290 TraceCheckUtils]: 79: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,245 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {8206#true} {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #54#return; {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:09,245 INFO L290 TraceCheckUtils]: 81: Hoare triple {8442#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:42:09,245 INFO L290 TraceCheckUtils]: 82: Hoare triple {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:42:09,246 INFO L272 TraceCheckUtils]: 83: Hoare triple {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,246 INFO L290 TraceCheckUtils]: 84: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,246 INFO L290 TraceCheckUtils]: 85: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,246 INFO L290 TraceCheckUtils]: 86: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,246 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8206#true} {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:42:09,246 INFO L290 TraceCheckUtils]: 88: Hoare triple {8464#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8486#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:42:09,247 INFO L290 TraceCheckUtils]: 89: Hoare triple {8486#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {8486#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:42:09,247 INFO L272 TraceCheckUtils]: 90: Hoare triple {8486#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,247 INFO L290 TraceCheckUtils]: 91: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,247 INFO L290 TraceCheckUtils]: 92: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,247 INFO L290 TraceCheckUtils]: 93: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,249 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8206#true} {8486#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {8486#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:42:09,249 INFO L290 TraceCheckUtils]: 95: Hoare triple {8486#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8508#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:42:09,249 INFO L290 TraceCheckUtils]: 96: Hoare triple {8508#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {8508#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:42:09,249 INFO L272 TraceCheckUtils]: 97: Hoare triple {8508#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,249 INFO L290 TraceCheckUtils]: 98: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,250 INFO L290 TraceCheckUtils]: 99: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,250 INFO L290 TraceCheckUtils]: 100: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,250 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {8206#true} {8508#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {8508#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:42:09,250 INFO L290 TraceCheckUtils]: 102: Hoare triple {8508#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:09,251 INFO L290 TraceCheckUtils]: 103: Hoare triple {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !false; {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:09,251 INFO L272 TraceCheckUtils]: 104: Hoare triple {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,251 INFO L290 TraceCheckUtils]: 105: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,251 INFO L290 TraceCheckUtils]: 106: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,251 INFO L290 TraceCheckUtils]: 107: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,251 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {8206#true} {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} #54#return; {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:09,252 INFO L290 TraceCheckUtils]: 109: Hoare triple {8530#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 14:42:09,252 INFO L290 TraceCheckUtils]: 110: Hoare triple {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !false; {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 14:42:09,252 INFO L272 TraceCheckUtils]: 111: Hoare triple {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8206#true} is VALID [2022-04-27 14:42:09,252 INFO L290 TraceCheckUtils]: 112: Hoare triple {8206#true} ~cond := #in~cond; {8206#true} is VALID [2022-04-27 14:42:09,252 INFO L290 TraceCheckUtils]: 113: Hoare triple {8206#true} assume !(0 == ~cond); {8206#true} is VALID [2022-04-27 14:42:09,252 INFO L290 TraceCheckUtils]: 114: Hoare triple {8206#true} assume true; {8206#true} is VALID [2022-04-27 14:42:09,253 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {8206#true} {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} #54#return; {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 14:42:09,253 INFO L290 TraceCheckUtils]: 116: Hoare triple {8552#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {8574#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-27 14:42:09,254 INFO L272 TraceCheckUtils]: 117: Hoare triple {8574#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:09,254 INFO L290 TraceCheckUtils]: 118: Hoare triple {8578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:09,255 INFO L290 TraceCheckUtils]: 119: Hoare triple {8582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8207#false} is VALID [2022-04-27 14:42:09,255 INFO L290 TraceCheckUtils]: 120: Hoare triple {8207#false} assume !false; {8207#false} is VALID [2022-04-27 14:42:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 30 proven. 315 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-27 14:42:09,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:09,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:09,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408549647] [2022-04-27 14:42:09,552 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:09,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884231634] [2022-04-27 14:42:09,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884231634] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:09,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:09,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-27 14:42:09,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3230130] [2022-04-27 14:42:09,552 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:09,552 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) Word has length 121 [2022-04-27 14:42:09,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:09,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-27 14:42:09,620 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-27 14:42:09,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 14:42:09,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:09,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 14:42:09,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:42:09,621 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-27 14:42:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:11,489 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2022-04-27 14:42:11,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 14:42:11,489 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) Word has length 121 [2022-04-27 14:42:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-27 14:42:11,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-27 14:42:11,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-27 14:42:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-27 14:42:11,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 88 transitions. [2022-04-27 14:42:11,568 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-27 14:42:11,569 INFO L225 Difference]: With dead ends: 78 [2022-04-27 14:42:11,569 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 14:42:11,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-27 14:42:11,570 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:11,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 635 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 14:42:11,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 14:42:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-27 14:42:11,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:11,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:42:11,618 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:42:11,618 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:42:11,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:11,623 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-27 14:42:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-27 14:42:11,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:11,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:11,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-27 14:42:11,624 INFO L87 Difference]: Start difference. First operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-27 14:42:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:11,628 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-27 14:42:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-27 14:42:11,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:11,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:11,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:11,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:42:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2022-04-27 14:42:11,630 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 121 [2022-04-27 14:42:11,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:11,630 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2022-04-27 14:42:11,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-27 14:42:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-27 14:42:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-27 14:42:11,631 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:11,631 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:11,635 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-27 14:42:11,835 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,SelfDestructingSolverStorable16 [2022-04-27 14:42:11,836 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:11,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:11,836 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 15 times [2022-04-27 14:42:11,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:11,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436083896] [2022-04-27 14:42:11,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:11,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:11,847 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:11,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1069649701] [2022-04-27 14:42:11,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:42:11,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:11,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:11,848 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-27 14:42:11,849 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-27 14:42:12,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-04-27 14:42:12,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:12,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-27 14:42:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:12,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:13,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {9017#true} call ULTIMATE.init(); {9017#true} is VALID [2022-04-27 14:42:13,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {9017#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(9, 2);call #Ultimate.allocInit(12, 3); {9017#true} is VALID [2022-04-27 14:42:13,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9017#true} {9017#true} #60#return; {9017#true} is VALID [2022-04-27 14:42:13,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {9017#true} call #t~ret5 := main(); {9017#true} is VALID [2022-04-27 14:42:13,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {9017#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9017#true} is VALID [2022-04-27 14:42:13,209 INFO L272 TraceCheckUtils]: 6: Hoare triple {9017#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,209 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9017#true} {9017#true} #52#return; {9017#true} is VALID [2022-04-27 14:42:13,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {9017#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9055#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:13,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {9055#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {9055#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:13,210 INFO L272 TraceCheckUtils]: 13: Hoare triple {9055#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,210 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9017#true} {9055#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {9055#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:13,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {9055#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:42:13,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:42:13,211 INFO L272 TraceCheckUtils]: 20: Hoare triple {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,212 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9017#true} {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:42:13,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {9077#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !false; {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,214 INFO L272 TraceCheckUtils]: 27: Hoare triple {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,214 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9017#true} {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} #54#return; {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {9099#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:42:13,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:42:13,215 INFO L272 TraceCheckUtils]: 34: Hoare triple {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,215 INFO L290 TraceCheckUtils]: 37: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,216 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9017#true} {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #54#return; {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:42:13,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {9121#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,216 INFO L272 TraceCheckUtils]: 41: Hoare triple {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,217 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9017#true} {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {9143#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,218 INFO L290 TraceCheckUtils]: 47: Hoare triple {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} assume !false; {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,218 INFO L272 TraceCheckUtils]: 48: Hoare triple {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,218 INFO L290 TraceCheckUtils]: 49: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,218 INFO L290 TraceCheckUtils]: 51: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,219 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9017#true} {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} #54#return; {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,219 INFO L290 TraceCheckUtils]: 53: Hoare triple {9165#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,219 INFO L290 TraceCheckUtils]: 54: Hoare triple {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !false; {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,219 INFO L272 TraceCheckUtils]: 55: Hoare triple {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,219 INFO L290 TraceCheckUtils]: 56: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,220 INFO L290 TraceCheckUtils]: 57: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,220 INFO L290 TraceCheckUtils]: 58: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,220 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9017#true} {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #54#return; {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,220 INFO L290 TraceCheckUtils]: 60: Hoare triple {9187#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,221 INFO L290 TraceCheckUtils]: 61: Hoare triple {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,221 INFO L272 TraceCheckUtils]: 62: Hoare triple {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,221 INFO L290 TraceCheckUtils]: 63: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,221 INFO L290 TraceCheckUtils]: 64: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,221 INFO L290 TraceCheckUtils]: 65: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,222 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9017#true} {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #54#return; {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,222 INFO L290 TraceCheckUtils]: 67: Hoare triple {9209#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:42:13,222 INFO L290 TraceCheckUtils]: 68: Hoare triple {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} assume !false; {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:42:13,222 INFO L272 TraceCheckUtils]: 69: Hoare triple {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,222 INFO L290 TraceCheckUtils]: 70: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,223 INFO L290 TraceCheckUtils]: 71: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,223 INFO L290 TraceCheckUtils]: 72: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,223 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9017#true} {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} #54#return; {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:42:13,223 INFO L290 TraceCheckUtils]: 74: Hoare triple {9231#(and (= 7 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:42:13,224 INFO L290 TraceCheckUtils]: 75: Hoare triple {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} assume !false; {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:42:13,224 INFO L272 TraceCheckUtils]: 76: Hoare triple {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,224 INFO L290 TraceCheckUtils]: 77: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,224 INFO L290 TraceCheckUtils]: 78: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,224 INFO L290 TraceCheckUtils]: 79: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,225 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9017#true} {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} #54#return; {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:42:13,225 INFO L290 TraceCheckUtils]: 81: Hoare triple {9253#(and (= 7 (+ (- 2) main_~y~0)) (< 0 main_~k~0) (= 5 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,225 INFO L290 TraceCheckUtils]: 82: Hoare triple {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} assume !false; {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,225 INFO L272 TraceCheckUtils]: 83: Hoare triple {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,225 INFO L290 TraceCheckUtils]: 84: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,226 INFO L290 TraceCheckUtils]: 85: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,226 INFO L290 TraceCheckUtils]: 86: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,226 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {9017#true} {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} #54#return; {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,226 INFO L290 TraceCheckUtils]: 88: Hoare triple {9275#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,227 INFO L290 TraceCheckUtils]: 89: Hoare triple {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !false; {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,227 INFO L272 TraceCheckUtils]: 90: Hoare triple {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,227 INFO L290 TraceCheckUtils]: 91: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,227 INFO L290 TraceCheckUtils]: 92: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,227 INFO L290 TraceCheckUtils]: 93: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,228 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {9017#true} {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} #54#return; {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:42:13,228 INFO L290 TraceCheckUtils]: 95: Hoare triple {9297#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-27 14:42:13,228 INFO L290 TraceCheckUtils]: 96: Hoare triple {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} assume !false; {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-27 14:42:13,228 INFO L272 TraceCheckUtils]: 97: Hoare triple {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,229 INFO L290 TraceCheckUtils]: 98: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,229 INFO L290 TraceCheckUtils]: 99: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,229 INFO L290 TraceCheckUtils]: 100: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,229 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9017#true} {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} #54#return; {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-27 14:42:13,229 INFO L290 TraceCheckUtils]: 102: Hoare triple {9319#(and (= (+ (- 2) main_~y~0) 10) (< 0 main_~k~0) (= (+ main_~c~0 (- 7)) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:42:13,230 INFO L290 TraceCheckUtils]: 103: Hoare triple {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:42:13,230 INFO L272 TraceCheckUtils]: 104: Hoare triple {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,230 INFO L290 TraceCheckUtils]: 105: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,230 INFO L290 TraceCheckUtils]: 106: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,230 INFO L290 TraceCheckUtils]: 107: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,231 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9017#true} {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} #54#return; {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:42:13,231 INFO L290 TraceCheckUtils]: 109: Hoare triple {9341#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:42:13,231 INFO L290 TraceCheckUtils]: 110: Hoare triple {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !false; {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:42:13,231 INFO L272 TraceCheckUtils]: 111: Hoare triple {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,231 INFO L290 TraceCheckUtils]: 112: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,231 INFO L290 TraceCheckUtils]: 113: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,232 INFO L290 TraceCheckUtils]: 114: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,232 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {9017#true} {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} #54#return; {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:42:13,232 INFO L290 TraceCheckUtils]: 116: Hoare triple {9363#(and (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:42:13,233 INFO L290 TraceCheckUtils]: 117: Hoare triple {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !false; {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:42:13,233 INFO L272 TraceCheckUtils]: 118: Hoare triple {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9017#true} is VALID [2022-04-27 14:42:13,233 INFO L290 TraceCheckUtils]: 119: Hoare triple {9017#true} ~cond := #in~cond; {9017#true} is VALID [2022-04-27 14:42:13,233 INFO L290 TraceCheckUtils]: 120: Hoare triple {9017#true} assume !(0 == ~cond); {9017#true} is VALID [2022-04-27 14:42:13,233 INFO L290 TraceCheckUtils]: 121: Hoare triple {9017#true} assume true; {9017#true} is VALID [2022-04-27 14:42:13,233 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9017#true} {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} #54#return; {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 14:42:13,234 INFO L290 TraceCheckUtils]: 123: Hoare triple {9385#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {9407#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-27 14:42:13,235 INFO L272 TraceCheckUtils]: 124: Hoare triple {9407#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:13,235 INFO L290 TraceCheckUtils]: 125: Hoare triple {9411#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:13,235 INFO L290 TraceCheckUtils]: 126: Hoare triple {9415#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9018#false} is VALID [2022-04-27 14:42:13,235 INFO L290 TraceCheckUtils]: 127: Hoare triple {9018#false} assume !false; {9018#false} is VALID [2022-04-27 14:42:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 32 proven. 360 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-27 14:42:13,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:14,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:14,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436083896] [2022-04-27 14:42:14,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:14,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069649701] [2022-04-27 14:42:14,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069649701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:14,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:14,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-27 14:42:14,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399921323] [2022-04-27 14:42:14,706 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:14,706 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) Word has length 128 [2022-04-27 14:42:14,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:14,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-27 14:42:14,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:14,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 14:42:14,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:14,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 14:42:14,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1101, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 14:42:14,769 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-27 14:42:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:17,051 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2022-04-27 14:42:17,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 14:42:17,051 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) Word has length 128 [2022-04-27 14:42:17,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:17,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-27 14:42:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-27 14:42:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-27 14:42:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-27 14:42:17,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 92 transitions. [2022-04-27 14:42:17,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:17,143 INFO L225 Difference]: With dead ends: 81 [2022-04-27 14:42:17,143 INFO L226 Difference]: Without dead ends: 76 [2022-04-27 14:42:17,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=1245, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 14:42:17,144 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:17,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 675 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 14:42:17,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-27 14:42:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-27 14:42:17,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:17,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 14:42:17,198 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 14:42:17,198 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 14:42:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:17,200 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-27 14:42:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-27 14:42:17,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:17,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:17,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 76 states. [2022-04-27 14:42:17,200 INFO L87 Difference]: Start difference. First operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 76 states. [2022-04-27 14:42:17,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:17,202 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-27 14:42:17,202 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-27 14:42:17,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:17,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:17,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:17,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 14:42:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2022-04-27 14:42:17,204 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 128 [2022-04-27 14:42:17,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:17,204 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2022-04-27 14:42:17,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-27 14:42:17,204 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-27 14:42:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-27 14:42:17,205 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:17,205 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:17,213 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-27 14:42:17,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 14:42:17,411 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 16 times [2022-04-27 14:42:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:17,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749138639] [2022-04-27 14:42:17,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:17,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:17,423 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:17,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499907059] [2022-04-27 14:42:17,423 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:42:17,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:17,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:17,424 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-27 14:42:17,424 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-27 14:42:17,761 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:42:17,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:17,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 83 conjunts are in the unsatisfiable core [2022-04-27 14:42:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:17,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:18,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {10174#true} call ULTIMATE.init(); {10174#true} is VALID [2022-04-27 14:42:18,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {10174#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(9, 2);call #Ultimate.allocInit(12, 3); {10174#true} is VALID [2022-04-27 14:42:18,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10174#true} {10174#true} #60#return; {10174#true} is VALID [2022-04-27 14:42:18,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {10174#true} call #t~ret5 := main(); {10174#true} is VALID [2022-04-27 14:42:18,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {10174#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {10174#true} is VALID [2022-04-27 14:42:18,539 INFO L272 TraceCheckUtils]: 6: Hoare triple {10174#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10174#true} {10174#true} #52#return; {10174#true} is VALID [2022-04-27 14:42:18,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {10174#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10212#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:18,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {10212#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {10212#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:18,540 INFO L272 TraceCheckUtils]: 13: Hoare triple {10212#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,540 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10174#true} {10212#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {10212#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:18,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {10212#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:42:18,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:42:18,541 INFO L272 TraceCheckUtils]: 20: Hoare triple {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,541 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10174#true} {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:42:18,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {10234#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:18,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:18,542 INFO L272 TraceCheckUtils]: 27: Hoare triple {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,542 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10174#true} {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:18,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {10256#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10278#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:18,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {10278#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {10278#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:18,543 INFO L272 TraceCheckUtils]: 34: Hoare triple {10278#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,544 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10174#true} {10278#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {10278#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:18,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {10278#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:18,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:18,544 INFO L272 TraceCheckUtils]: 41: Hoare triple {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,544 INFO L290 TraceCheckUtils]: 43: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,544 INFO L290 TraceCheckUtils]: 44: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,545 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10174#true} {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:18,545 INFO L290 TraceCheckUtils]: 46: Hoare triple {10300#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:42:18,545 INFO L290 TraceCheckUtils]: 47: Hoare triple {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:42:18,545 INFO L272 TraceCheckUtils]: 48: Hoare triple {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,545 INFO L290 TraceCheckUtils]: 49: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,545 INFO L290 TraceCheckUtils]: 50: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,546 INFO L290 TraceCheckUtils]: 51: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,546 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10174#true} {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #54#return; {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:42:18,546 INFO L290 TraceCheckUtils]: 53: Hoare triple {10322#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:42:18,546 INFO L290 TraceCheckUtils]: 54: Hoare triple {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} assume !false; {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:42:18,546 INFO L272 TraceCheckUtils]: 55: Hoare triple {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,547 INFO L290 TraceCheckUtils]: 56: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,547 INFO L290 TraceCheckUtils]: 57: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,547 INFO L290 TraceCheckUtils]: 58: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,547 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10174#true} {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} #54#return; {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:42:18,547 INFO L290 TraceCheckUtils]: 60: Hoare triple {10344#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:42:18,548 INFO L290 TraceCheckUtils]: 61: Hoare triple {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !false; {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:42:18,548 INFO L272 TraceCheckUtils]: 62: Hoare triple {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,548 INFO L290 TraceCheckUtils]: 63: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,548 INFO L290 TraceCheckUtils]: 64: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,548 INFO L290 TraceCheckUtils]: 65: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,548 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10174#true} {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} #54#return; {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:42:18,548 INFO L290 TraceCheckUtils]: 67: Hoare triple {10366#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10388#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:42:18,549 INFO L290 TraceCheckUtils]: 68: Hoare triple {10388#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {10388#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:42:18,549 INFO L272 TraceCheckUtils]: 69: Hoare triple {10388#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,549 INFO L290 TraceCheckUtils]: 70: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,549 INFO L290 TraceCheckUtils]: 71: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,549 INFO L290 TraceCheckUtils]: 72: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,549 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10174#true} {10388#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {10388#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:42:18,550 INFO L290 TraceCheckUtils]: 74: Hoare triple {10388#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:42:18,550 INFO L290 TraceCheckUtils]: 75: Hoare triple {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:42:18,550 INFO L272 TraceCheckUtils]: 76: Hoare triple {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,550 INFO L290 TraceCheckUtils]: 77: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,550 INFO L290 TraceCheckUtils]: 78: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,550 INFO L290 TraceCheckUtils]: 79: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,550 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10174#true} {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #54#return; {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:42:18,551 INFO L290 TraceCheckUtils]: 81: Hoare triple {10410#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:42:18,551 INFO L290 TraceCheckUtils]: 82: Hoare triple {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !false; {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:42:18,551 INFO L272 TraceCheckUtils]: 83: Hoare triple {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,551 INFO L290 TraceCheckUtils]: 84: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,551 INFO L290 TraceCheckUtils]: 85: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,551 INFO L290 TraceCheckUtils]: 86: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,551 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {10174#true} {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} #54#return; {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:42:18,552 INFO L290 TraceCheckUtils]: 88: Hoare triple {10432#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10454#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:42:18,552 INFO L290 TraceCheckUtils]: 89: Hoare triple {10454#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {10454#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:42:18,552 INFO L272 TraceCheckUtils]: 90: Hoare triple {10454#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,552 INFO L290 TraceCheckUtils]: 91: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,552 INFO L290 TraceCheckUtils]: 92: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,552 INFO L290 TraceCheckUtils]: 93: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,553 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {10174#true} {10454#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {10454#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:42:18,553 INFO L290 TraceCheckUtils]: 95: Hoare triple {10454#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:42:18,553 INFO L290 TraceCheckUtils]: 96: Hoare triple {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:42:18,553 INFO L272 TraceCheckUtils]: 97: Hoare triple {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,553 INFO L290 TraceCheckUtils]: 98: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,553 INFO L290 TraceCheckUtils]: 99: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,553 INFO L290 TraceCheckUtils]: 100: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,554 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10174#true} {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #54#return; {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:42:18,554 INFO L290 TraceCheckUtils]: 102: Hoare triple {10476#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10498#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:42:18,554 INFO L290 TraceCheckUtils]: 103: Hoare triple {10498#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {10498#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:42:18,554 INFO L272 TraceCheckUtils]: 104: Hoare triple {10498#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,554 INFO L290 TraceCheckUtils]: 105: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,554 INFO L290 TraceCheckUtils]: 106: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,555 INFO L290 TraceCheckUtils]: 107: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,555 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {10174#true} {10498#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {10498#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:42:18,555 INFO L290 TraceCheckUtils]: 109: Hoare triple {10498#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10520#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:42:18,555 INFO L290 TraceCheckUtils]: 110: Hoare triple {10520#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {10520#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:42:18,555 INFO L272 TraceCheckUtils]: 111: Hoare triple {10520#(and (= main_~y~0 14) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,556 INFO L290 TraceCheckUtils]: 112: Hoare triple {10174#true} ~cond := #in~cond; {10174#true} is VALID [2022-04-27 14:42:18,556 INFO L290 TraceCheckUtils]: 113: Hoare triple {10174#true} assume !(0 == ~cond); {10174#true} is VALID [2022-04-27 14:42:18,556 INFO L290 TraceCheckUtils]: 114: Hoare triple {10174#true} assume true; {10174#true} is VALID [2022-04-27 14:42:18,556 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {10174#true} {10520#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {10520#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:42:18,556 INFO L290 TraceCheckUtils]: 116: Hoare triple {10520#(and (= main_~y~0 14) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10542#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:18,557 INFO L290 TraceCheckUtils]: 117: Hoare triple {10542#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !false; {10542#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:18,557 INFO L272 TraceCheckUtils]: 118: Hoare triple {10542#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,557 INFO L290 TraceCheckUtils]: 119: Hoare triple {10174#true} ~cond := #in~cond; {10552#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:18,557 INFO L290 TraceCheckUtils]: 120: Hoare triple {10552#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:42:18,557 INFO L290 TraceCheckUtils]: 121: Hoare triple {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:42:18,558 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} {10542#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} #54#return; {10563#(and (= (+ (- 1) main_~c~0) 14) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:18,558 INFO L290 TraceCheckUtils]: 123: Hoare triple {10563#(and (= (+ (- 1) main_~c~0) 14) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10567#(and (= main_~y~0 16) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:42:18,559 INFO L290 TraceCheckUtils]: 124: Hoare triple {10567#(and (= main_~y~0 16) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (< 15 main_~k~0) (<= main_~c~0 16))} assume !false; {10567#(and (= main_~y~0 16) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:42:18,559 INFO L272 TraceCheckUtils]: 125: Hoare triple {10567#(and (= main_~y~0 16) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (< 15 main_~k~0) (<= main_~c~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10174#true} is VALID [2022-04-27 14:42:18,559 INFO L290 TraceCheckUtils]: 126: Hoare triple {10174#true} ~cond := #in~cond; {10552#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:18,559 INFO L290 TraceCheckUtils]: 127: Hoare triple {10552#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:42:18,559 INFO L290 TraceCheckUtils]: 128: Hoare triple {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:42:18,560 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {10556#(not (= |__VERIFIER_assert_#in~cond| 0))} {10567#(and (= main_~y~0 16) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (< 15 main_~k~0) (<= main_~c~0 16))} #54#return; {10586#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 14:42:18,561 INFO L290 TraceCheckUtils]: 130: Hoare triple {10586#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {10590#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} is VALID [2022-04-27 14:42:18,562 INFO L272 TraceCheckUtils]: 131: Hoare triple {10590#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:18,562 INFO L290 TraceCheckUtils]: 132: Hoare triple {10594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:18,562 INFO L290 TraceCheckUtils]: 133: Hoare triple {10598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10175#false} is VALID [2022-04-27 14:42:18,562 INFO L290 TraceCheckUtils]: 134: Hoare triple {10175#false} assume !false; {10175#false} is VALID [2022-04-27 14:42:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 122 proven. 410 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-04-27 14:42:18,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:37,722 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse2 (* (- 13) c_main_~y~0 c_main_~y~0)) (.cse3 (* (- 1) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= (mod (+ .cse1 .cse2 .cse3) 4) 0)) (not (<= (div (+ .cse1 .cse2 .cse3 (- 4)) (- 4)) (+ (* c_main_~y~0 c_main_~y~0 c_main_~y~0) c_main_~x~0 1 (* 3 (* c_main_~y~0 c_main_~y~0))))))) is different from false [2022-04-27 14:42:41,881 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= (mod (+ (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 13) c_main_~y~0 c_main_~y~0) (* (- 1) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) is different from false [2022-04-27 14:42:41,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:41,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749138639] [2022-04-27 14:42:41,884 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:41,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499907059] [2022-04-27 14:42:41,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499907059] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:41,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:41,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-27 14:42:41,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112981117] [2022-04-27 14:42:41,884 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:41,884 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 19 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) Word has length 135 [2022-04-27 14:42:41,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:41,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 19 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-27 14:42:41,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:41,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 14:42:41,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:41,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 14:42:41,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=796, Unknown=2, NotChecked=114, Total=992 [2022-04-27 14:42:41,955 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 26 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 19 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-27 14:42:44,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:44,865 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-04-27 14:42:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 14:42:44,866 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 19 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) Word has length 135 [2022-04-27 14:42:44,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 19 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-27 14:42:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 96 transitions. [2022-04-27 14:42:44,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 19 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-27 14:42:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 96 transitions. [2022-04-27 14:42:44,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 96 transitions. [2022-04-27 14:42:44,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:44,961 INFO L225 Difference]: With dead ends: 84 [2022-04-27 14:42:44,961 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 14:42:44,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=101, Invalid=961, Unknown=2, NotChecked=126, Total=1190 [2022-04-27 14:42:44,962 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 9 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:44,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 692 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-27 14:42:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 14:42:45,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-27 14:42:45,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:45,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 14:42:45,029 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 14:42:45,029 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 14:42:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:45,031 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-27 14:42:45,031 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 14:42:45,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:45,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:45,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-27 14:42:45,031 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-27 14:42:45,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:45,032 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-27 14:42:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 14:42:45,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:45,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:45,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:45,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 14:42:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-27 14:42:45,034 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 135 [2022-04-27 14:42:45,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:45,035 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-27 14:42:45,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 19 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-27 14:42:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 14:42:45,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-04-27 14:42:45,035 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:45,036 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:45,042 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-27 14:42:45,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:45,240 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:45,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:45,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 17 times [2022-04-27 14:42:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:45,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445511060] [2022-04-27 14:42:45,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:45,272 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:45,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596692244] [2022-04-27 14:42:45,272 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:42:45,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:45,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:45,275 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-27 14:42:45,283 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-27 14:42:46,400 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-04-27 14:42:46,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:46,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-27 14:42:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:46,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:47,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {11070#true} call ULTIMATE.init(); {11070#true} is VALID [2022-04-27 14:42:47,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {11070#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(9, 2);call #Ultimate.allocInit(12, 3); {11070#true} is VALID [2022-04-27 14:42:47,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11070#true} {11070#true} #60#return; {11070#true} is VALID [2022-04-27 14:42:47,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {11070#true} call #t~ret5 := main(); {11070#true} is VALID [2022-04-27 14:42:47,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {11070#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11070#true} is VALID [2022-04-27 14:42:47,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {11070#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,102 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11070#true} {11070#true} #52#return; {11070#true} is VALID [2022-04-27 14:42:47,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {11070#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:47,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {11108#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {11108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:47,102 INFO L272 TraceCheckUtils]: 13: Hoare triple {11108#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,103 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11070#true} {11108#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {11108#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:47,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {11108#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:42:47,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:42:47,104 INFO L272 TraceCheckUtils]: 20: Hoare triple {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,104 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11070#true} {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:42:47,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {11130#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11152#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:42:47,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {11152#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {11152#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:42:47,105 INFO L272 TraceCheckUtils]: 27: Hoare triple {11152#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,106 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11070#true} {11152#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {11152#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:42:47,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {11152#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:42:47,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:42:47,107 INFO L272 TraceCheckUtils]: 34: Hoare triple {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,107 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11070#true} {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:42:47,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {11174#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:42:47,108 INFO L290 TraceCheckUtils]: 40: Hoare triple {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:42:47,108 INFO L272 TraceCheckUtils]: 41: Hoare triple {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,108 INFO L290 TraceCheckUtils]: 42: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,108 INFO L290 TraceCheckUtils]: 44: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,109 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11070#true} {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #54#return; {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:42:47,109 INFO L290 TraceCheckUtils]: 46: Hoare triple {11196#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:47,110 INFO L290 TraceCheckUtils]: 47: Hoare triple {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:47,110 INFO L272 TraceCheckUtils]: 48: Hoare triple {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,110 INFO L290 TraceCheckUtils]: 49: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,110 INFO L290 TraceCheckUtils]: 50: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,110 INFO L290 TraceCheckUtils]: 51: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,110 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11070#true} {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:47,111 INFO L290 TraceCheckUtils]: 53: Hoare triple {11218#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11240#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:42:47,111 INFO L290 TraceCheckUtils]: 54: Hoare triple {11240#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {11240#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:42:47,111 INFO L272 TraceCheckUtils]: 55: Hoare triple {11240#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,111 INFO L290 TraceCheckUtils]: 56: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,111 INFO L290 TraceCheckUtils]: 57: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,111 INFO L290 TraceCheckUtils]: 58: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,112 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11070#true} {11240#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {11240#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:42:47,112 INFO L290 TraceCheckUtils]: 60: Hoare triple {11240#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:47,113 INFO L290 TraceCheckUtils]: 61: Hoare triple {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:47,113 INFO L272 TraceCheckUtils]: 62: Hoare triple {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,113 INFO L290 TraceCheckUtils]: 63: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,113 INFO L290 TraceCheckUtils]: 64: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,113 INFO L290 TraceCheckUtils]: 65: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,113 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11070#true} {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:47,114 INFO L290 TraceCheckUtils]: 67: Hoare triple {11262#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:42:47,114 INFO L290 TraceCheckUtils]: 68: Hoare triple {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:42:47,114 INFO L272 TraceCheckUtils]: 69: Hoare triple {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,114 INFO L290 TraceCheckUtils]: 70: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,114 INFO L290 TraceCheckUtils]: 71: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,114 INFO L290 TraceCheckUtils]: 72: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,115 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11070#true} {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #54#return; {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:42:47,115 INFO L290 TraceCheckUtils]: 74: Hoare triple {11284#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:47,115 INFO L290 TraceCheckUtils]: 75: Hoare triple {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} assume !false; {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:47,116 INFO L272 TraceCheckUtils]: 76: Hoare triple {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,116 INFO L290 TraceCheckUtils]: 77: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,116 INFO L290 TraceCheckUtils]: 78: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,116 INFO L290 TraceCheckUtils]: 79: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,116 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {11070#true} {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} #54#return; {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:42:47,116 INFO L290 TraceCheckUtils]: 81: Hoare triple {11306#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:42:47,117 INFO L290 TraceCheckUtils]: 82: Hoare triple {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} assume !false; {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:42:47,117 INFO L272 TraceCheckUtils]: 83: Hoare triple {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,117 INFO L290 TraceCheckUtils]: 84: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,117 INFO L290 TraceCheckUtils]: 85: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,117 INFO L290 TraceCheckUtils]: 86: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,117 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11070#true} {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} #54#return; {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:42:47,118 INFO L290 TraceCheckUtils]: 88: Hoare triple {11328#(and (= (+ main_~y~0 (- 4)) 6) (= 7 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:42:47,118 INFO L290 TraceCheckUtils]: 89: Hoare triple {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} assume !false; {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:42:47,118 INFO L272 TraceCheckUtils]: 90: Hoare triple {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,118 INFO L290 TraceCheckUtils]: 91: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,119 INFO L290 TraceCheckUtils]: 92: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,119 INFO L290 TraceCheckUtils]: 93: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,119 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11070#true} {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} #54#return; {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:42:47,119 INFO L290 TraceCheckUtils]: 95: Hoare triple {11350#(and (= 6 (+ main_~y~0 (- 5))) (= 7 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} is VALID [2022-04-27 14:42:47,120 INFO L290 TraceCheckUtils]: 96: Hoare triple {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} assume !false; {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} is VALID [2022-04-27 14:42:47,120 INFO L272 TraceCheckUtils]: 97: Hoare triple {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,120 INFO L290 TraceCheckUtils]: 98: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,120 INFO L290 TraceCheckUtils]: 99: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,120 INFO L290 TraceCheckUtils]: 100: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,121 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11070#true} {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} #54#return; {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} is VALID [2022-04-27 14:42:47,121 INFO L290 TraceCheckUtils]: 102: Hoare triple {11372#(and (= 7 (+ main_~c~0 (- 5))) (= (+ main_~y~0 (- 6)) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:42:47,121 INFO L290 TraceCheckUtils]: 103: Hoare triple {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} assume !false; {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:42:47,121 INFO L272 TraceCheckUtils]: 104: Hoare triple {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,121 INFO L290 TraceCheckUtils]: 105: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,122 INFO L290 TraceCheckUtils]: 106: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,122 INFO L290 TraceCheckUtils]: 107: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,122 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {11070#true} {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} #54#return; {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:42:47,122 INFO L290 TraceCheckUtils]: 109: Hoare triple {11394#(and (= 6 (+ main_~y~0 (- 7))) (= 7 (+ main_~c~0 (- 6))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} is VALID [2022-04-27 14:42:47,123 INFO L290 TraceCheckUtils]: 110: Hoare triple {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} assume !false; {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} is VALID [2022-04-27 14:42:47,123 INFO L272 TraceCheckUtils]: 111: Hoare triple {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,123 INFO L290 TraceCheckUtils]: 112: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,123 INFO L290 TraceCheckUtils]: 113: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,123 INFO L290 TraceCheckUtils]: 114: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,123 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {11070#true} {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} #54#return; {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} is VALID [2022-04-27 14:42:47,124 INFO L290 TraceCheckUtils]: 116: Hoare triple {11416#(and (= 7 (+ main_~c~0 (- 7))) (= 6 (+ main_~y~0 (- 8))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} is VALID [2022-04-27 14:42:47,124 INFO L290 TraceCheckUtils]: 117: Hoare triple {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} assume !false; {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} is VALID [2022-04-27 14:42:47,124 INFO L272 TraceCheckUtils]: 118: Hoare triple {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,124 INFO L290 TraceCheckUtils]: 119: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,124 INFO L290 TraceCheckUtils]: 120: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,124 INFO L290 TraceCheckUtils]: 121: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,125 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {11070#true} {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} #54#return; {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} is VALID [2022-04-27 14:42:47,125 INFO L290 TraceCheckUtils]: 123: Hoare triple {11438#(and (= (+ (- 9) main_~y~0) 6) (= 7 (+ main_~c~0 (- 8))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} is VALID [2022-04-27 14:42:47,126 INFO L290 TraceCheckUtils]: 124: Hoare triple {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} assume !false; {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} is VALID [2022-04-27 14:42:47,126 INFO L272 TraceCheckUtils]: 125: Hoare triple {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,126 INFO L290 TraceCheckUtils]: 126: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,126 INFO L290 TraceCheckUtils]: 127: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,126 INFO L290 TraceCheckUtils]: 128: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,126 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {11070#true} {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} #54#return; {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} is VALID [2022-04-27 14:42:47,127 INFO L290 TraceCheckUtils]: 130: Hoare triple {11460#(and (= 6 (+ main_~y~0 (- 10))) (= 7 (+ (- 9) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:42:47,130 INFO L290 TraceCheckUtils]: 131: Hoare triple {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} assume !false; {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:42:47,131 INFO L272 TraceCheckUtils]: 132: Hoare triple {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11070#true} is VALID [2022-04-27 14:42:47,131 INFO L290 TraceCheckUtils]: 133: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-04-27 14:42:47,131 INFO L290 TraceCheckUtils]: 134: Hoare triple {11070#true} assume !(0 == ~cond); {11070#true} is VALID [2022-04-27 14:42:47,131 INFO L290 TraceCheckUtils]: 135: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-27 14:42:47,131 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {11070#true} {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} #54#return; {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:42:47,132 INFO L290 TraceCheckUtils]: 137: Hoare triple {11482#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} assume !(~c~0 < ~k~0); {11504#(and (<= main_~k~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:42:47,133 INFO L272 TraceCheckUtils]: 138: Hoare triple {11504#(and (<= main_~k~0 17) (< 16 main_~k~0) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11508#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:47,133 INFO L290 TraceCheckUtils]: 139: Hoare triple {11508#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11512#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:47,134 INFO L290 TraceCheckUtils]: 140: Hoare triple {11512#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11071#false} is VALID [2022-04-27 14:42:47,134 INFO L290 TraceCheckUtils]: 141: Hoare triple {11071#false} assume !false; {11071#false} is VALID [2022-04-27 14:42:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 36 proven. 459 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-04-27 14:42:47,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:42:47,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:42:47,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445511060] [2022-04-27 14:42:47,387 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:42:47,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596692244] [2022-04-27 14:42:47,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596692244] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:42:47,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:42:47,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-27 14:42:47,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460159021] [2022-04-27 14:42:47,387 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:42:47,388 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 142 [2022-04-27 14:42:47,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:42:47,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-27 14:42:47,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:42:47,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 14:42:47,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:42:47,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 14:42:47,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-27 14:42:47,460 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-27 14:42:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:50,303 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-27 14:42:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-27 14:42:50,304 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 142 [2022-04-27 14:42:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:42:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-27 14:42:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-27 14:42:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-27 14:42:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-27 14:42:50,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 100 transitions. [2022-04-27 14:42:50,389 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-27 14:42:50,390 INFO L225 Difference]: With dead ends: 87 [2022-04-27 14:42:50,390 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 14:42:50,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2022-04-27 14:42:50,390 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:42:50,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 803 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-27 14:42:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 14:42:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-27 14:42:50,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:42:50,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:42:50,445 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:42:50,445 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:42:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:50,447 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-27 14:42:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-27 14:42:50,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:50,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:50,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-27 14:42:50,447 INFO L87 Difference]: Start difference. First operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-27 14:42:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:42:50,449 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-27 14:42:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-27 14:42:50,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:42:50,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:42:50,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:42:50,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:42:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 14:42:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-04-27 14:42:50,450 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 142 [2022-04-27 14:42:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:42:50,451 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-04-27 14:42:50,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-27 14:42:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-27 14:42:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-27 14:42:50,452 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:42:50,452 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:42:50,465 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-27 14:42:50,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:50,658 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:42:50,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:42:50,658 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 18 times [2022-04-27 14:42:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:42:50,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596770225] [2022-04-27 14:42:50,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:42:50,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:42:50,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:42:50,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1837172191] [2022-04-27 14:42:50,670 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:42:50,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:42:50,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:42:50,671 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-27 14:42:50,672 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-27 14:42:59,209 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-27 14:42:59,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:42:59,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-27 14:42:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:42:59,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:42:59,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {11995#true} call ULTIMATE.init(); {11995#true} is VALID [2022-04-27 14:42:59,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {11995#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(9, 2);call #Ultimate.allocInit(12, 3); {11995#true} is VALID [2022-04-27 14:42:59,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11995#true} {11995#true} #60#return; {11995#true} is VALID [2022-04-27 14:42:59,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {11995#true} call #t~ret5 := main(); {11995#true} is VALID [2022-04-27 14:42:59,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {11995#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11995#true} is VALID [2022-04-27 14:42:59,934 INFO L272 TraceCheckUtils]: 6: Hoare triple {11995#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,935 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11995#true} {11995#true} #52#return; {11995#true} is VALID [2022-04-27 14:42:59,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {11995#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12033#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:59,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {12033#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {12033#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:59,935 INFO L272 TraceCheckUtils]: 13: Hoare triple {12033#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,936 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11995#true} {12033#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {12033#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:42:59,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {12033#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:59,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:59,937 INFO L272 TraceCheckUtils]: 20: Hoare triple {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,937 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11995#true} {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:42:59,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {12055#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:42:59,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:42:59,938 INFO L272 TraceCheckUtils]: 27: Hoare triple {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,938 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11995#true} {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 14:42:59,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {12077#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12099#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:59,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {12099#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {12099#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:59,939 INFO L272 TraceCheckUtils]: 34: Hoare triple {12099#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,939 INFO L290 TraceCheckUtils]: 36: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,940 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11995#true} {12099#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {12099#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:42:59,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {12099#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12121#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:42:59,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {12121#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {12121#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:42:59,940 INFO L272 TraceCheckUtils]: 41: Hoare triple {12121#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,954 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11995#true} {12121#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {12121#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:42:59,954 INFO L290 TraceCheckUtils]: 46: Hoare triple {12121#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:59,955 INFO L290 TraceCheckUtils]: 47: Hoare triple {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:59,955 INFO L272 TraceCheckUtils]: 48: Hoare triple {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,955 INFO L290 TraceCheckUtils]: 49: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,955 INFO L290 TraceCheckUtils]: 50: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,955 INFO L290 TraceCheckUtils]: 51: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,955 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11995#true} {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 14:42:59,956 INFO L290 TraceCheckUtils]: 53: Hoare triple {12143#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:59,956 INFO L290 TraceCheckUtils]: 54: Hoare triple {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:59,956 INFO L272 TraceCheckUtils]: 55: Hoare triple {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,956 INFO L290 TraceCheckUtils]: 56: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,956 INFO L290 TraceCheckUtils]: 57: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,956 INFO L290 TraceCheckUtils]: 58: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,957 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11995#true} {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:59,957 INFO L290 TraceCheckUtils]: 60: Hoare triple {12165#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:42:59,957 INFO L290 TraceCheckUtils]: 61: Hoare triple {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:42:59,957 INFO L272 TraceCheckUtils]: 62: Hoare triple {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,957 INFO L290 TraceCheckUtils]: 63: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,958 INFO L290 TraceCheckUtils]: 64: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,958 INFO L290 TraceCheckUtils]: 65: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,958 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11995#true} {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:42:59,958 INFO L290 TraceCheckUtils]: 67: Hoare triple {12187#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:59,959 INFO L290 TraceCheckUtils]: 68: Hoare triple {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !false; {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:59,959 INFO L272 TraceCheckUtils]: 69: Hoare triple {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,959 INFO L290 TraceCheckUtils]: 70: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,959 INFO L290 TraceCheckUtils]: 71: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,959 INFO L290 TraceCheckUtils]: 72: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,959 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11995#true} {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #54#return; {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:59,960 INFO L290 TraceCheckUtils]: 74: Hoare triple {12209#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 14:42:59,960 INFO L290 TraceCheckUtils]: 75: Hoare triple {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} assume !false; {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 14:42:59,960 INFO L272 TraceCheckUtils]: 76: Hoare triple {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,960 INFO L290 TraceCheckUtils]: 77: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,960 INFO L290 TraceCheckUtils]: 78: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,960 INFO L290 TraceCheckUtils]: 79: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,961 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {11995#true} {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} #54#return; {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 14:42:59,961 INFO L290 TraceCheckUtils]: 81: Hoare triple {12231#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} is VALID [2022-04-27 14:42:59,961 INFO L290 TraceCheckUtils]: 82: Hoare triple {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} assume !false; {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} is VALID [2022-04-27 14:42:59,961 INFO L272 TraceCheckUtils]: 83: Hoare triple {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,961 INFO L290 TraceCheckUtils]: 84: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,961 INFO L290 TraceCheckUtils]: 85: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,961 INFO L290 TraceCheckUtils]: 86: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,962 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11995#true} {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} #54#return; {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} is VALID [2022-04-27 14:42:59,962 INFO L290 TraceCheckUtils]: 88: Hoare triple {12253#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12275#(and (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-27 14:42:59,962 INFO L290 TraceCheckUtils]: 89: Hoare triple {12275#(and (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} assume !false; {12275#(and (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-27 14:42:59,963 INFO L272 TraceCheckUtils]: 90: Hoare triple {12275#(and (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,963 INFO L290 TraceCheckUtils]: 91: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,963 INFO L290 TraceCheckUtils]: 92: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,963 INFO L290 TraceCheckUtils]: 93: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,963 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11995#true} {12275#(and (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} #54#return; {12275#(and (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-27 14:42:59,963 INFO L290 TraceCheckUtils]: 95: Hoare triple {12275#(and (= (+ (- 1) main_~y~0) 10) (= 6 (+ main_~c~0 (- 5))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:42:59,964 INFO L290 TraceCheckUtils]: 96: Hoare triple {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))))} assume !false; {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:42:59,964 INFO L272 TraceCheckUtils]: 97: Hoare triple {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,964 INFO L290 TraceCheckUtils]: 98: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,964 INFO L290 TraceCheckUtils]: 99: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,964 INFO L290 TraceCheckUtils]: 100: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,964 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11995#true} {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))))} #54#return; {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:42:59,965 INFO L290 TraceCheckUtils]: 102: Hoare triple {12297#(and (= main_~y~0 12) (= 6 (+ main_~c~0 (- 6))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12319#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:59,965 INFO L290 TraceCheckUtils]: 103: Hoare triple {12319#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {12319#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:59,965 INFO L272 TraceCheckUtils]: 104: Hoare triple {12319#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,965 INFO L290 TraceCheckUtils]: 105: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,965 INFO L290 TraceCheckUtils]: 106: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,965 INFO L290 TraceCheckUtils]: 107: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,966 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {11995#true} {12319#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {12319#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:59,966 INFO L290 TraceCheckUtils]: 109: Hoare triple {12319#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12341#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:42:59,966 INFO L290 TraceCheckUtils]: 110: Hoare triple {12341#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {12341#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:42:59,966 INFO L272 TraceCheckUtils]: 111: Hoare triple {12341#(and (= main_~y~0 14) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,966 INFO L290 TraceCheckUtils]: 112: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,966 INFO L290 TraceCheckUtils]: 113: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,967 INFO L290 TraceCheckUtils]: 114: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,967 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {11995#true} {12341#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {12341#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:42:59,967 INFO L290 TraceCheckUtils]: 116: Hoare triple {12341#(and (= main_~y~0 14) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12363#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 14:42:59,968 INFO L290 TraceCheckUtils]: 117: Hoare triple {12363#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {12363#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 14:42:59,968 INFO L272 TraceCheckUtils]: 118: Hoare triple {12363#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,968 INFO L290 TraceCheckUtils]: 119: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,971 INFO L290 TraceCheckUtils]: 120: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,971 INFO L290 TraceCheckUtils]: 121: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,972 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {11995#true} {12363#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #54#return; {12363#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 14:42:59,973 INFO L290 TraceCheckUtils]: 123: Hoare triple {12363#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12385#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:59,973 INFO L290 TraceCheckUtils]: 124: Hoare triple {12385#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {12385#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:59,973 INFO L272 TraceCheckUtils]: 125: Hoare triple {12385#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,973 INFO L290 TraceCheckUtils]: 126: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,973 INFO L290 TraceCheckUtils]: 127: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,973 INFO L290 TraceCheckUtils]: 128: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,974 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {11995#true} {12385#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #54#return; {12385#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:42:59,974 INFO L290 TraceCheckUtils]: 130: Hoare triple {12385#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12407#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:42:59,974 INFO L290 TraceCheckUtils]: 131: Hoare triple {12407#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {12407#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:42:59,975 INFO L272 TraceCheckUtils]: 132: Hoare triple {12407#(and (= main_~c~0 17) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,975 INFO L290 TraceCheckUtils]: 133: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,975 INFO L290 TraceCheckUtils]: 134: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,975 INFO L290 TraceCheckUtils]: 135: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,975 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {11995#true} {12407#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {12407#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:42:59,975 INFO L290 TraceCheckUtils]: 137: Hoare triple {12407#(and (= main_~c~0 17) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:42:59,976 INFO L290 TraceCheckUtils]: 138: Hoare triple {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !false; {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:42:59,976 INFO L272 TraceCheckUtils]: 139: Hoare triple {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11995#true} is VALID [2022-04-27 14:42:59,976 INFO L290 TraceCheckUtils]: 140: Hoare triple {11995#true} ~cond := #in~cond; {11995#true} is VALID [2022-04-27 14:42:59,976 INFO L290 TraceCheckUtils]: 141: Hoare triple {11995#true} assume !(0 == ~cond); {11995#true} is VALID [2022-04-27 14:42:59,976 INFO L290 TraceCheckUtils]: 142: Hoare triple {11995#true} assume true; {11995#true} is VALID [2022-04-27 14:42:59,976 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {11995#true} {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} #54#return; {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:42:59,978 INFO L290 TraceCheckUtils]: 144: Hoare triple {12429#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !(~c~0 < ~k~0); {12451#(and (< 17 main_~k~0) (<= main_~k~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:42:59,978 INFO L272 TraceCheckUtils]: 145: Hoare triple {12451#(and (< 17 main_~k~0) (<= main_~k~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12455#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:42:59,979 INFO L290 TraceCheckUtils]: 146: Hoare triple {12455#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12459#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:42:59,979 INFO L290 TraceCheckUtils]: 147: Hoare triple {12459#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11996#false} is VALID [2022-04-27 14:42:59,979 INFO L290 TraceCheckUtils]: 148: Hoare triple {11996#false} assume !false; {11996#false} is VALID [2022-04-27 14:42:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 38 proven. 513 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2022-04-27 14:42:59,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:43:00,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:43:00,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596770225] [2022-04-27 14:43:00,266 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:43:00,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837172191] [2022-04-27 14:43:00,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837172191] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:43:00,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:43:00,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-04-27 14:43:00,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379075529] [2022-04-27 14:43:00,266 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:43:00,266 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) Word has length 149 [2022-04-27 14:43:00,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:43:00,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-27 14:43:00,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:00,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 14:43:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:43:00,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 14:43:00,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-04-27 14:43:00,346 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-27 14:43:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:03,448 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2022-04-27 14:43:03,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 14:43:03,448 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) Word has length 149 [2022-04-27 14:43:03,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:43:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-27 14:43:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-27 14:43:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-27 14:43:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-27 14:43:03,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 104 transitions. [2022-04-27 14:43:03,555 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-27 14:43:03,556 INFO L225 Difference]: With dead ends: 90 [2022-04-27 14:43:03,556 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 14:43:03,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2022-04-27 14:43:03,557 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 14:43:03,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 863 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 14:43:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 14:43:03,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-27 14:43:03,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:43:03,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 14:43:03,612 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 14:43:03,612 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 14:43:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:03,614 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-27 14:43:03,614 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-27 14:43:03,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:03,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:03,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 85 states. [2022-04-27 14:43:03,629 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 85 states. [2022-04-27 14:43:03,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:03,631 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-27 14:43:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-27 14:43:03,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:03,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:03,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:43:03,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:43:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 14:43:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-04-27 14:43:03,633 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 149 [2022-04-27 14:43:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:43:03,633 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-04-27 14:43:03,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-27 14:43:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-27 14:43:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-27 14:43:03,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:43:03,634 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:43:03,642 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-27 14:43:03,842 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,SelfDestructingSolverStorable20 [2022-04-27 14:43:03,843 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:43:03,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:43:03,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 19 times [2022-04-27 14:43:03,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:43:03,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325595663] [2022-04-27 14:43:03,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:43:03,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:43:03,856 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:43:03,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2022269101] [2022-04-27 14:43:03,856 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:43:03,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:43:03,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:43:03,857 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-27 14:43:03,858 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-27 14:43:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:43:04,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-27 14:43:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:43:04,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:43:05,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {12958#true} call ULTIMATE.init(); {12958#true} is VALID [2022-04-27 14:43:05,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {12958#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(9, 2);call #Ultimate.allocInit(12, 3); {12958#true} is VALID [2022-04-27 14:43:05,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12958#true} {12958#true} #60#return; {12958#true} is VALID [2022-04-27 14:43:05,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {12958#true} call #t~ret5 := main(); {12958#true} is VALID [2022-04-27 14:43:05,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {12958#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {12958#true} is VALID [2022-04-27 14:43:05,218 INFO L272 TraceCheckUtils]: 6: Hoare triple {12958#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,219 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12958#true} {12958#true} #52#return; {12958#true} is VALID [2022-04-27 14:43:05,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {12958#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12996#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:05,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {12996#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {12996#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:05,219 INFO L272 TraceCheckUtils]: 13: Hoare triple {12996#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,220 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12958#true} {12996#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {12996#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:05,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {12996#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13018#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:43:05,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {13018#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {13018#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:43:05,221 INFO L272 TraceCheckUtils]: 20: Hoare triple {13018#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,221 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {12958#true} {13018#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {13018#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:43:05,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {13018#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13040#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:43:05,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {13040#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {13040#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:43:05,222 INFO L272 TraceCheckUtils]: 27: Hoare triple {13040#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,222 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12958#true} {13040#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {13040#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:43:05,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {13040#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13062#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:43:05,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {13062#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {13062#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:43:05,230 INFO L272 TraceCheckUtils]: 34: Hoare triple {13062#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,230 INFO L290 TraceCheckUtils]: 36: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,230 INFO L290 TraceCheckUtils]: 37: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,230 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12958#true} {13062#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {13062#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:43:05,230 INFO L290 TraceCheckUtils]: 39: Hoare triple {13062#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13084#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:05,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {13084#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {13084#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:05,231 INFO L272 TraceCheckUtils]: 41: Hoare triple {13084#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,231 INFO L290 TraceCheckUtils]: 42: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,231 INFO L290 TraceCheckUtils]: 43: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,231 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12958#true} {13084#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #54#return; {13084#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:05,232 INFO L290 TraceCheckUtils]: 46: Hoare triple {13084#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13106#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:43:05,232 INFO L290 TraceCheckUtils]: 47: Hoare triple {13106#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {13106#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:43:05,232 INFO L272 TraceCheckUtils]: 48: Hoare triple {13106#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,232 INFO L290 TraceCheckUtils]: 49: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,232 INFO L290 TraceCheckUtils]: 50: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,232 INFO L290 TraceCheckUtils]: 51: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,233 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12958#true} {13106#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #54#return; {13106#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 14:43:05,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {13106#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13128#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:05,233 INFO L290 TraceCheckUtils]: 54: Hoare triple {13128#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} assume !false; {13128#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:05,233 INFO L272 TraceCheckUtils]: 55: Hoare triple {13128#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,234 INFO L290 TraceCheckUtils]: 56: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,234 INFO L290 TraceCheckUtils]: 57: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,234 INFO L290 TraceCheckUtils]: 58: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,234 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12958#true} {13128#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} #54#return; {13128#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:05,234 INFO L290 TraceCheckUtils]: 60: Hoare triple {13128#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13150#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-27 14:43:05,235 INFO L290 TraceCheckUtils]: 61: Hoare triple {13150#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {13150#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-27 14:43:05,235 INFO L272 TraceCheckUtils]: 62: Hoare triple {13150#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,235 INFO L290 TraceCheckUtils]: 63: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,235 INFO L290 TraceCheckUtils]: 64: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,235 INFO L290 TraceCheckUtils]: 65: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,235 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12958#true} {13150#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #54#return; {13150#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-27 14:43:05,236 INFO L290 TraceCheckUtils]: 67: Hoare triple {13150#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13172#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:43:05,236 INFO L290 TraceCheckUtils]: 68: Hoare triple {13172#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !false; {13172#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:43:05,236 INFO L272 TraceCheckUtils]: 69: Hoare triple {13172#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,236 INFO L290 TraceCheckUtils]: 70: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,236 INFO L290 TraceCheckUtils]: 71: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,237 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12958#true} {13172#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} #54#return; {13172#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:43:05,237 INFO L290 TraceCheckUtils]: 74: Hoare triple {13172#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13194#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:05,237 INFO L290 TraceCheckUtils]: 75: Hoare triple {13194#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {13194#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:05,237 INFO L272 TraceCheckUtils]: 76: Hoare triple {13194#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,237 INFO L290 TraceCheckUtils]: 77: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,237 INFO L290 TraceCheckUtils]: 78: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,238 INFO L290 TraceCheckUtils]: 79: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,238 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12958#true} {13194#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #54#return; {13194#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:05,238 INFO L290 TraceCheckUtils]: 81: Hoare triple {13194#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13216#(and (= 9 (+ (- 1) main_~y~0)) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:43:05,239 INFO L290 TraceCheckUtils]: 82: Hoare triple {13216#(and (= 9 (+ (- 1) main_~y~0)) (= 7 (+ main_~c~0 (- 3))))} assume !false; {13216#(and (= 9 (+ (- 1) main_~y~0)) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:43:05,239 INFO L272 TraceCheckUtils]: 83: Hoare triple {13216#(and (= 9 (+ (- 1) main_~y~0)) (= 7 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,239 INFO L290 TraceCheckUtils]: 84: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,239 INFO L290 TraceCheckUtils]: 85: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,239 INFO L290 TraceCheckUtils]: 86: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,239 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {12958#true} {13216#(and (= 9 (+ (- 1) main_~y~0)) (= 7 (+ main_~c~0 (- 3))))} #54#return; {13216#(and (= 9 (+ (- 1) main_~y~0)) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:43:05,240 INFO L290 TraceCheckUtils]: 88: Hoare triple {13216#(and (= 9 (+ (- 1) main_~y~0)) (= 7 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13238#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:43:05,240 INFO L290 TraceCheckUtils]: 89: Hoare triple {13238#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {13238#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:43:05,240 INFO L272 TraceCheckUtils]: 90: Hoare triple {13238#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,240 INFO L290 TraceCheckUtils]: 91: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,240 INFO L290 TraceCheckUtils]: 92: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,240 INFO L290 TraceCheckUtils]: 93: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,240 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {12958#true} {13238#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {13238#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:43:05,241 INFO L290 TraceCheckUtils]: 95: Hoare triple {13238#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13260#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:43:05,241 INFO L290 TraceCheckUtils]: 96: Hoare triple {13260#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {13260#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:43:05,241 INFO L272 TraceCheckUtils]: 97: Hoare triple {13260#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,241 INFO L290 TraceCheckUtils]: 98: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,241 INFO L290 TraceCheckUtils]: 99: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,241 INFO L290 TraceCheckUtils]: 100: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,242 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {12958#true} {13260#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {13260#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:43:05,242 INFO L290 TraceCheckUtils]: 102: Hoare triple {13260#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13282#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:43:05,242 INFO L290 TraceCheckUtils]: 103: Hoare triple {13282#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {13282#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:43:05,242 INFO L272 TraceCheckUtils]: 104: Hoare triple {13282#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,243 INFO L290 TraceCheckUtils]: 105: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,243 INFO L290 TraceCheckUtils]: 106: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,243 INFO L290 TraceCheckUtils]: 107: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,243 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {12958#true} {13282#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #54#return; {13282#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:43:05,243 INFO L290 TraceCheckUtils]: 109: Hoare triple {13282#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13304#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:43:05,244 INFO L290 TraceCheckUtils]: 110: Hoare triple {13304#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} assume !false; {13304#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:43:05,244 INFO L272 TraceCheckUtils]: 111: Hoare triple {13304#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,244 INFO L290 TraceCheckUtils]: 112: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,244 INFO L290 TraceCheckUtils]: 113: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,244 INFO L290 TraceCheckUtils]: 114: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,244 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {12958#true} {13304#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} #54#return; {13304#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:43:05,245 INFO L290 TraceCheckUtils]: 116: Hoare triple {13304#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13326#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 14:43:05,245 INFO L290 TraceCheckUtils]: 117: Hoare triple {13326#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} assume !false; {13326#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 14:43:05,245 INFO L272 TraceCheckUtils]: 118: Hoare triple {13326#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,245 INFO L290 TraceCheckUtils]: 119: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,245 INFO L290 TraceCheckUtils]: 120: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,245 INFO L290 TraceCheckUtils]: 121: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,246 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12958#true} {13326#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} #54#return; {13326#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 14:43:05,246 INFO L290 TraceCheckUtils]: 123: Hoare triple {13326#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13348#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 14:43:05,246 INFO L290 TraceCheckUtils]: 124: Hoare triple {13348#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} assume !false; {13348#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 14:43:05,246 INFO L272 TraceCheckUtils]: 125: Hoare triple {13348#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,246 INFO L290 TraceCheckUtils]: 126: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,246 INFO L290 TraceCheckUtils]: 127: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,247 INFO L290 TraceCheckUtils]: 128: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,247 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {12958#true} {13348#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} #54#return; {13348#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 14:43:05,248 INFO L290 TraceCheckUtils]: 130: Hoare triple {13348#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13370#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-27 14:43:05,248 INFO L290 TraceCheckUtils]: 131: Hoare triple {13370#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {13370#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-27 14:43:05,248 INFO L272 TraceCheckUtils]: 132: Hoare triple {13370#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,248 INFO L290 TraceCheckUtils]: 133: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,248 INFO L290 TraceCheckUtils]: 134: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,248 INFO L290 TraceCheckUtils]: 135: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,249 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {12958#true} {13370#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #54#return; {13370#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-27 14:43:05,249 INFO L290 TraceCheckUtils]: 137: Hoare triple {13370#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13392#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 14:43:05,249 INFO L290 TraceCheckUtils]: 138: Hoare triple {13392#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {13392#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 14:43:05,249 INFO L272 TraceCheckUtils]: 139: Hoare triple {13392#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,250 INFO L290 TraceCheckUtils]: 140: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,250 INFO L290 TraceCheckUtils]: 141: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,250 INFO L290 TraceCheckUtils]: 142: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,250 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {12958#true} {13392#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #54#return; {13392#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 14:43:05,250 INFO L290 TraceCheckUtils]: 144: Hoare triple {13392#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13414#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~c~0 19))} is VALID [2022-04-27 14:43:05,251 INFO L290 TraceCheckUtils]: 145: Hoare triple {13414#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~c~0 19))} assume !false; {13414#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~c~0 19))} is VALID [2022-04-27 14:43:05,251 INFO L272 TraceCheckUtils]: 146: Hoare triple {13414#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~c~0 19))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12958#true} is VALID [2022-04-27 14:43:05,251 INFO L290 TraceCheckUtils]: 147: Hoare triple {12958#true} ~cond := #in~cond; {12958#true} is VALID [2022-04-27 14:43:05,251 INFO L290 TraceCheckUtils]: 148: Hoare triple {12958#true} assume !(0 == ~cond); {12958#true} is VALID [2022-04-27 14:43:05,251 INFO L290 TraceCheckUtils]: 149: Hoare triple {12958#true} assume true; {12958#true} is VALID [2022-04-27 14:43:05,251 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {12958#true} {13414#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~c~0 19))} #54#return; {13414#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~c~0 19))} is VALID [2022-04-27 14:43:05,252 INFO L290 TraceCheckUtils]: 151: Hoare triple {13414#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~c~0 19))} assume !(~c~0 < ~k~0); {13436#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~k~0 19))} is VALID [2022-04-27 14:43:05,252 INFO L272 TraceCheckUtils]: 152: Hoare triple {13436#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~k~0 19))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13440#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:43:05,253 INFO L290 TraceCheckUtils]: 153: Hoare triple {13440#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13444#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:43:05,253 INFO L290 TraceCheckUtils]: 154: Hoare triple {13444#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12959#false} is VALID [2022-04-27 14:43:05,253 INFO L290 TraceCheckUtils]: 155: Hoare triple {12959#false} assume !false; {12959#false} is VALID [2022-04-27 14:43:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 40 proven. 570 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-04-27 14:43:05,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:43:05,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:43:05,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325595663] [2022-04-27 14:43:05,526 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:43:05,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022269101] [2022-04-27 14:43:05,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022269101] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:43:05,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:43:05,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-04-27 14:43:05,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328456071] [2022-04-27 14:43:05,526 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:43:05,527 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) Word has length 156 [2022-04-27 14:43:05,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:43:05,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-27 14:43:05,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:05,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 14:43:05,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:43:05,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 14:43:05,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-04-27 14:43:05,614 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-27 14:43:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:09,144 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-04-27 14:43:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 14:43:09,144 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) Word has length 156 [2022-04-27 14:43:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:43:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-27 14:43:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-27 14:43:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-27 14:43:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-27 14:43:09,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 108 transitions. [2022-04-27 14:43:09,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:09,256 INFO L225 Difference]: With dead ends: 93 [2022-04-27 14:43:09,256 INFO L226 Difference]: Without dead ends: 88 [2022-04-27 14:43:09,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2022-04-27 14:43:09,257 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-27 14:43:09,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 925 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-27 14:43:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-27 14:43:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-27 14:43:09,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:43:09,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:43:09,319 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:43:09,319 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:43:09,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:09,321 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-27 14:43:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-27 14:43:09,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:09,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:09,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 88 states. [2022-04-27 14:43:09,321 INFO L87 Difference]: Start difference. First operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 88 states. [2022-04-27 14:43:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:09,323 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-27 14:43:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-27 14:43:09,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:09,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:09,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:43:09,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:43:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:43:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-04-27 14:43:09,325 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 156 [2022-04-27 14:43:09,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:43:09,325 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-04-27 14:43:09,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-27 14:43:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-27 14:43:09,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-27 14:43:09,326 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:43:09,326 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:43:09,331 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-27 14:43:09,531 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,SelfDestructingSolverStorable21 [2022-04-27 14:43:09,531 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:43:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:43:09,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 20 times [2022-04-27 14:43:09,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:43:09,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191737788] [2022-04-27 14:43:09,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:43:09,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:43:09,543 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:43:09,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611493160] [2022-04-27 14:43:09,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:43:09,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:43:09,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:43:09,544 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-27 14:43:09,545 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-27 14:43:10,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:43:10,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:43:10,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-27 14:43:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:43:10,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:43:10,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {13959#true} call ULTIMATE.init(); {13959#true} is VALID [2022-04-27 14:43:10,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {13959#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(9, 2);call #Ultimate.allocInit(12, 3); {13959#true} is VALID [2022-04-27 14:43:10,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13959#true} {13959#true} #60#return; {13959#true} is VALID [2022-04-27 14:43:10,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {13959#true} call #t~ret5 := main(); {13959#true} is VALID [2022-04-27 14:43:10,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {13959#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {13959#true} is VALID [2022-04-27 14:43:10,864 INFO L272 TraceCheckUtils]: 6: Hoare triple {13959#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,864 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13959#true} {13959#true} #52#return; {13959#true} is VALID [2022-04-27 14:43:10,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {13959#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13997#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:10,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {13997#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {13997#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:10,865 INFO L272 TraceCheckUtils]: 13: Hoare triple {13997#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,866 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13959#true} {13997#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {13997#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:10,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {13997#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14019#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:43:10,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {14019#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {14019#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:43:10,866 INFO L272 TraceCheckUtils]: 20: Hoare triple {14019#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,867 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {13959#true} {14019#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {14019#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:43:10,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {14019#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14041#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:10,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {14041#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {14041#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:10,868 INFO L272 TraceCheckUtils]: 27: Hoare triple {14041#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,868 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13959#true} {14041#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {14041#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:10,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {14041#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14063#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:43:10,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {14063#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {14063#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:43:10,869 INFO L272 TraceCheckUtils]: 34: Hoare triple {14063#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,870 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13959#true} {14063#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {14063#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:43:10,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {14063#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14085#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:43:10,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {14085#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {14085#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:43:10,870 INFO L272 TraceCheckUtils]: 41: Hoare triple {14085#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,871 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13959#true} {14085#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {14085#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:43:10,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {14085#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14107#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:43:10,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {14107#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {14107#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:43:10,872 INFO L272 TraceCheckUtils]: 48: Hoare triple {14107#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,872 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13959#true} {14107#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {14107#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:43:10,873 INFO L290 TraceCheckUtils]: 53: Hoare triple {14107#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14129#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:10,873 INFO L290 TraceCheckUtils]: 54: Hoare triple {14129#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {14129#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:10,873 INFO L272 TraceCheckUtils]: 55: Hoare triple {14129#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,873 INFO L290 TraceCheckUtils]: 57: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,873 INFO L290 TraceCheckUtils]: 58: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,874 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13959#true} {14129#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #54#return; {14129#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:10,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {14129#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14151#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:43:10,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {14151#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {14151#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:43:10,874 INFO L272 TraceCheckUtils]: 62: Hoare triple {14151#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,874 INFO L290 TraceCheckUtils]: 63: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,875 INFO L290 TraceCheckUtils]: 64: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,875 INFO L290 TraceCheckUtils]: 65: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,875 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13959#true} {14151#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {14151#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:43:10,875 INFO L290 TraceCheckUtils]: 67: Hoare triple {14151#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14173#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:43:10,876 INFO L290 TraceCheckUtils]: 68: Hoare triple {14173#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {14173#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:43:10,876 INFO L272 TraceCheckUtils]: 69: Hoare triple {14173#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,876 INFO L290 TraceCheckUtils]: 70: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,876 INFO L290 TraceCheckUtils]: 71: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,876 INFO L290 TraceCheckUtils]: 72: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,876 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13959#true} {14173#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {14173#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:43:10,877 INFO L290 TraceCheckUtils]: 74: Hoare triple {14173#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14195#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:43:10,877 INFO L290 TraceCheckUtils]: 75: Hoare triple {14195#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {14195#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:43:10,877 INFO L272 TraceCheckUtils]: 76: Hoare triple {14195#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,877 INFO L290 TraceCheckUtils]: 77: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,877 INFO L290 TraceCheckUtils]: 78: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,877 INFO L290 TraceCheckUtils]: 79: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,878 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13959#true} {14195#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {14195#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:43:10,878 INFO L290 TraceCheckUtils]: 81: Hoare triple {14195#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14217#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:43:10,878 INFO L290 TraceCheckUtils]: 82: Hoare triple {14217#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {14217#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:43:10,878 INFO L272 TraceCheckUtils]: 83: Hoare triple {14217#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,878 INFO L290 TraceCheckUtils]: 84: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,878 INFO L290 TraceCheckUtils]: 85: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,879 INFO L290 TraceCheckUtils]: 86: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,879 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13959#true} {14217#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {14217#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:43:10,879 INFO L290 TraceCheckUtils]: 88: Hoare triple {14217#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14239#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:43:10,880 INFO L290 TraceCheckUtils]: 89: Hoare triple {14239#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {14239#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:43:10,880 INFO L272 TraceCheckUtils]: 90: Hoare triple {14239#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,880 INFO L290 TraceCheckUtils]: 91: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,880 INFO L290 TraceCheckUtils]: 92: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,880 INFO L290 TraceCheckUtils]: 93: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,880 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13959#true} {14239#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {14239#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:43:10,881 INFO L290 TraceCheckUtils]: 95: Hoare triple {14239#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14261#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:43:10,881 INFO L290 TraceCheckUtils]: 96: Hoare triple {14261#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {14261#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:43:10,881 INFO L272 TraceCheckUtils]: 97: Hoare triple {14261#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,881 INFO L290 TraceCheckUtils]: 98: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,881 INFO L290 TraceCheckUtils]: 99: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,881 INFO L290 TraceCheckUtils]: 100: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,881 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13959#true} {14261#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {14261#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:43:10,882 INFO L290 TraceCheckUtils]: 102: Hoare triple {14261#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14283#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:43:10,882 INFO L290 TraceCheckUtils]: 103: Hoare triple {14283#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {14283#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:43:10,882 INFO L272 TraceCheckUtils]: 104: Hoare triple {14283#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,882 INFO L290 TraceCheckUtils]: 105: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,882 INFO L290 TraceCheckUtils]: 106: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,882 INFO L290 TraceCheckUtils]: 107: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,883 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {13959#true} {14283#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #54#return; {14283#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:43:10,883 INFO L290 TraceCheckUtils]: 109: Hoare triple {14283#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14305#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:43:10,883 INFO L290 TraceCheckUtils]: 110: Hoare triple {14305#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} assume !false; {14305#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:43:10,883 INFO L272 TraceCheckUtils]: 111: Hoare triple {14305#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,883 INFO L290 TraceCheckUtils]: 112: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,884 INFO L290 TraceCheckUtils]: 113: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,884 INFO L290 TraceCheckUtils]: 114: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,884 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {13959#true} {14305#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} #54#return; {14305#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:43:10,884 INFO L290 TraceCheckUtils]: 116: Hoare triple {14305#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14327#(and (= (+ (- 2) main_~y~0) 13) (= (+ main_~c~0 (- 3)) 12))} is VALID [2022-04-27 14:43:10,885 INFO L290 TraceCheckUtils]: 117: Hoare triple {14327#(and (= (+ (- 2) main_~y~0) 13) (= (+ main_~c~0 (- 3)) 12))} assume !false; {14327#(and (= (+ (- 2) main_~y~0) 13) (= (+ main_~c~0 (- 3)) 12))} is VALID [2022-04-27 14:43:10,885 INFO L272 TraceCheckUtils]: 118: Hoare triple {14327#(and (= (+ (- 2) main_~y~0) 13) (= (+ main_~c~0 (- 3)) 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,885 INFO L290 TraceCheckUtils]: 119: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,885 INFO L290 TraceCheckUtils]: 120: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,885 INFO L290 TraceCheckUtils]: 121: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,885 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13959#true} {14327#(and (= (+ (- 2) main_~y~0) 13) (= (+ main_~c~0 (- 3)) 12))} #54#return; {14327#(and (= (+ (- 2) main_~y~0) 13) (= (+ main_~c~0 (- 3)) 12))} is VALID [2022-04-27 14:43:10,885 INFO L290 TraceCheckUtils]: 123: Hoare triple {14327#(and (= (+ (- 2) main_~y~0) 13) (= (+ main_~c~0 (- 3)) 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14349#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:43:10,886 INFO L290 TraceCheckUtils]: 124: Hoare triple {14349#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {14349#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:43:10,886 INFO L272 TraceCheckUtils]: 125: Hoare triple {14349#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,886 INFO L290 TraceCheckUtils]: 126: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,886 INFO L290 TraceCheckUtils]: 127: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,886 INFO L290 TraceCheckUtils]: 128: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,886 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {13959#true} {14349#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {14349#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:43:10,887 INFO L290 TraceCheckUtils]: 130: Hoare triple {14349#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14371#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:10,887 INFO L290 TraceCheckUtils]: 131: Hoare triple {14371#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {14371#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:10,887 INFO L272 TraceCheckUtils]: 132: Hoare triple {14371#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,887 INFO L290 TraceCheckUtils]: 133: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,887 INFO L290 TraceCheckUtils]: 134: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,887 INFO L290 TraceCheckUtils]: 135: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,888 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {13959#true} {14371#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #54#return; {14371#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:10,888 INFO L290 TraceCheckUtils]: 137: Hoare triple {14371#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14393#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:43:10,888 INFO L290 TraceCheckUtils]: 138: Hoare triple {14393#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !false; {14393#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:43:10,888 INFO L272 TraceCheckUtils]: 139: Hoare triple {14393#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,888 INFO L290 TraceCheckUtils]: 140: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,888 INFO L290 TraceCheckUtils]: 141: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,888 INFO L290 TraceCheckUtils]: 142: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,889 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {13959#true} {14393#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} #54#return; {14393#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:43:10,889 INFO L290 TraceCheckUtils]: 144: Hoare triple {14393#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14415#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-27 14:43:10,889 INFO L290 TraceCheckUtils]: 145: Hoare triple {14415#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !false; {14415#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-27 14:43:10,890 INFO L272 TraceCheckUtils]: 146: Hoare triple {14415#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,890 INFO L290 TraceCheckUtils]: 147: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,890 INFO L290 TraceCheckUtils]: 148: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,890 INFO L290 TraceCheckUtils]: 149: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,890 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {13959#true} {14415#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} #54#return; {14415#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-27 14:43:10,890 INFO L290 TraceCheckUtils]: 151: Hoare triple {14415#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14437#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-27 14:43:10,891 INFO L290 TraceCheckUtils]: 152: Hoare triple {14437#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} assume !false; {14437#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-27 14:43:10,891 INFO L272 TraceCheckUtils]: 153: Hoare triple {14437#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13959#true} is VALID [2022-04-27 14:43:10,891 INFO L290 TraceCheckUtils]: 154: Hoare triple {13959#true} ~cond := #in~cond; {13959#true} is VALID [2022-04-27 14:43:10,891 INFO L290 TraceCheckUtils]: 155: Hoare triple {13959#true} assume !(0 == ~cond); {13959#true} is VALID [2022-04-27 14:43:10,891 INFO L290 TraceCheckUtils]: 156: Hoare triple {13959#true} assume true; {13959#true} is VALID [2022-04-27 14:43:10,891 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {13959#true} {14437#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} #54#return; {14437#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-27 14:43:10,892 INFO L290 TraceCheckUtils]: 158: Hoare triple {14437#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} assume !(~c~0 < ~k~0); {14459#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-27 14:43:10,892 INFO L272 TraceCheckUtils]: 159: Hoare triple {14459#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14463#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:43:10,893 INFO L290 TraceCheckUtils]: 160: Hoare triple {14463#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14467#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:43:10,893 INFO L290 TraceCheckUtils]: 161: Hoare triple {14467#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13960#false} is VALID [2022-04-27 14:43:10,893 INFO L290 TraceCheckUtils]: 162: Hoare triple {13960#false} assume !false; {13960#false} is VALID [2022-04-27 14:43:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 630 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-27 14:43:10,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:43:11,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:43:11,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191737788] [2022-04-27 14:43:11,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:43:11,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611493160] [2022-04-27 14:43:11,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611493160] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:43:11,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:43:11,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-27 14:43:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164001415] [2022-04-27 14:43:11,239 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:43:11,240 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Word has length 163 [2022-04-27 14:43:11,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:43:11,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-27 14:43:11,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:11,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 14:43:11,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:43:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 14:43:11,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-27 14:43:11,332 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-27 14:43:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:15,387 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-04-27 14:43:15,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 14:43:15,388 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Word has length 163 [2022-04-27 14:43:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:43:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-27 14:43:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-27 14:43:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-27 14:43:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-27 14:43:15,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 112 transitions. [2022-04-27 14:43:15,494 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-27 14:43:15,496 INFO L225 Difference]: With dead ends: 96 [2022-04-27 14:43:15,496 INFO L226 Difference]: Without dead ends: 91 [2022-04-27 14:43:15,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2022-04-27 14:43:15,496 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:43:15,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 989 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 14:43:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-27 14:43:15,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-27 14:43:15,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:43:15,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 14:43:15,555 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 14:43:15,555 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 14:43:15,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:15,557 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-27 14:43:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-27 14:43:15,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:15,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:15,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 91 states. [2022-04-27 14:43:15,557 INFO L87 Difference]: Start difference. First operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 91 states. [2022-04-27 14:43:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:15,559 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-27 14:43:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-27 14:43:15,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:15,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:15,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:43:15,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:43:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 14:43:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-04-27 14:43:15,561 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 163 [2022-04-27 14:43:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:43:15,561 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-04-27 14:43:15,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-27 14:43:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-27 14:43:15,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-04-27 14:43:15,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:43:15,562 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:43:15,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-27 14:43:15,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:43:15,767 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:43:15,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:43:15,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1329797496, now seen corresponding path program 21 times [2022-04-27 14:43:15,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:43:15,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885639781] [2022-04-27 14:43:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:43:15,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:43:15,792 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:43:15,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1639031413] [2022-04-27 14:43:15,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:43:15,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:43:15,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:43:15,795 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:43:15,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-27 14:43:17,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2022-04-27 14:43:17,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:43:17,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-27 14:43:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:43:17,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:43:18,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {14998#true} call ULTIMATE.init(); {14998#true} is VALID [2022-04-27 14:43:18,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {14998#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(9, 2);call #Ultimate.allocInit(12, 3); {14998#true} is VALID [2022-04-27 14:43:18,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14998#true} {14998#true} #60#return; {14998#true} is VALID [2022-04-27 14:43:18,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {14998#true} call #t~ret5 := main(); {14998#true} is VALID [2022-04-27 14:43:18,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {14998#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {14998#true} is VALID [2022-04-27 14:43:18,503 INFO L272 TraceCheckUtils]: 6: Hoare triple {14998#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14998#true} {14998#true} #52#return; {14998#true} is VALID [2022-04-27 14:43:18,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {14998#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:18,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {15036#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {15036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:18,504 INFO L272 TraceCheckUtils]: 13: Hoare triple {15036#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,504 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14998#true} {15036#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {15036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:18,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {15036#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:43:18,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {15058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {15058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:43:18,505 INFO L272 TraceCheckUtils]: 20: Hoare triple {15058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,506 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {14998#true} {15058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {15058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:43:18,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {15058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15080#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:43:18,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {15080#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {15080#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:43:18,506 INFO L272 TraceCheckUtils]: 27: Hoare triple {15080#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,517 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14998#true} {15080#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {15080#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:43:18,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {15080#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15102#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:43:18,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {15102#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {15102#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:43:18,518 INFO L272 TraceCheckUtils]: 34: Hoare triple {15102#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,518 INFO L290 TraceCheckUtils]: 37: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,518 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14998#true} {15102#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {15102#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:43:18,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {15102#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15124#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:18,519 INFO L290 TraceCheckUtils]: 40: Hoare triple {15124#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {15124#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:18,519 INFO L272 TraceCheckUtils]: 41: Hoare triple {15124#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,519 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14998#true} {15124#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {15124#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:18,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {15124#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15146#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:43:18,520 INFO L290 TraceCheckUtils]: 47: Hoare triple {15146#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {15146#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:43:18,520 INFO L272 TraceCheckUtils]: 48: Hoare triple {15146#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,520 INFO L290 TraceCheckUtils]: 49: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,520 INFO L290 TraceCheckUtils]: 51: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,521 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14998#true} {15146#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {15146#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:43:18,521 INFO L290 TraceCheckUtils]: 53: Hoare triple {15146#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15168#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:43:18,521 INFO L290 TraceCheckUtils]: 54: Hoare triple {15168#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {15168#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:43:18,522 INFO L272 TraceCheckUtils]: 55: Hoare triple {15168#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,522 INFO L290 TraceCheckUtils]: 56: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,522 INFO L290 TraceCheckUtils]: 57: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,522 INFO L290 TraceCheckUtils]: 58: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,522 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14998#true} {15168#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {15168#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:43:18,522 INFO L290 TraceCheckUtils]: 60: Hoare triple {15168#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15190#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:18,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {15190#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {15190#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:18,523 INFO L272 TraceCheckUtils]: 62: Hoare triple {15190#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,523 INFO L290 TraceCheckUtils]: 63: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,523 INFO L290 TraceCheckUtils]: 64: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,523 INFO L290 TraceCheckUtils]: 65: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,523 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14998#true} {15190#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #54#return; {15190#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:18,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {15190#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15212#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:43:18,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {15212#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {15212#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:43:18,524 INFO L272 TraceCheckUtils]: 69: Hoare triple {15212#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,524 INFO L290 TraceCheckUtils]: 71: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,524 INFO L290 TraceCheckUtils]: 72: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,525 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {14998#true} {15212#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #54#return; {15212#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:43:18,525 INFO L290 TraceCheckUtils]: 74: Hoare triple {15212#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15234#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-27 14:43:18,525 INFO L290 TraceCheckUtils]: 75: Hoare triple {15234#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !false; {15234#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-27 14:43:18,525 INFO L272 TraceCheckUtils]: 76: Hoare triple {15234#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,526 INFO L290 TraceCheckUtils]: 77: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,526 INFO L290 TraceCheckUtils]: 78: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,526 INFO L290 TraceCheckUtils]: 79: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,526 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {14998#true} {15234#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} #54#return; {15234#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-27 14:43:18,526 INFO L290 TraceCheckUtils]: 81: Hoare triple {15234#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15256#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:43:18,527 INFO L290 TraceCheckUtils]: 82: Hoare triple {15256#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {15256#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:43:18,527 INFO L272 TraceCheckUtils]: 83: Hoare triple {15256#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,527 INFO L290 TraceCheckUtils]: 84: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,527 INFO L290 TraceCheckUtils]: 85: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,527 INFO L290 TraceCheckUtils]: 86: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,527 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14998#true} {15256#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #54#return; {15256#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:43:18,528 INFO L290 TraceCheckUtils]: 88: Hoare triple {15256#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15278#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-27 14:43:18,528 INFO L290 TraceCheckUtils]: 89: Hoare triple {15278#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {15278#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-27 14:43:18,528 INFO L272 TraceCheckUtils]: 90: Hoare triple {15278#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,528 INFO L290 TraceCheckUtils]: 91: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,528 INFO L290 TraceCheckUtils]: 92: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,528 INFO L290 TraceCheckUtils]: 93: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,529 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {14998#true} {15278#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #54#return; {15278#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-27 14:43:18,529 INFO L290 TraceCheckUtils]: 95: Hoare triple {15278#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15300#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:43:18,529 INFO L290 TraceCheckUtils]: 96: Hoare triple {15300#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !false; {15300#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:43:18,529 INFO L272 TraceCheckUtils]: 97: Hoare triple {15300#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,530 INFO L290 TraceCheckUtils]: 98: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,530 INFO L290 TraceCheckUtils]: 99: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,530 INFO L290 TraceCheckUtils]: 100: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,530 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {14998#true} {15300#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} #54#return; {15300#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:43:18,530 INFO L290 TraceCheckUtils]: 102: Hoare triple {15300#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15322#(and (= 9 (+ main_~c~0 (- 4))) (= main_~y~0 13))} is VALID [2022-04-27 14:43:18,531 INFO L290 TraceCheckUtils]: 103: Hoare triple {15322#(and (= 9 (+ main_~c~0 (- 4))) (= main_~y~0 13))} assume !false; {15322#(and (= 9 (+ main_~c~0 (- 4))) (= main_~y~0 13))} is VALID [2022-04-27 14:43:18,531 INFO L272 TraceCheckUtils]: 104: Hoare triple {15322#(and (= 9 (+ main_~c~0 (- 4))) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,531 INFO L290 TraceCheckUtils]: 105: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,531 INFO L290 TraceCheckUtils]: 106: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,531 INFO L290 TraceCheckUtils]: 107: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,531 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {14998#true} {15322#(and (= 9 (+ main_~c~0 (- 4))) (= main_~y~0 13))} #54#return; {15322#(and (= 9 (+ main_~c~0 (- 4))) (= main_~y~0 13))} is VALID [2022-04-27 14:43:18,532 INFO L290 TraceCheckUtils]: 109: Hoare triple {15322#(and (= 9 (+ main_~c~0 (- 4))) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15344#(and (= 9 (+ main_~c~0 (- 5))) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:43:18,532 INFO L290 TraceCheckUtils]: 110: Hoare triple {15344#(and (= 9 (+ main_~c~0 (- 5))) (= (+ (- 1) main_~y~0) 13))} assume !false; {15344#(and (= 9 (+ main_~c~0 (- 5))) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:43:18,532 INFO L272 TraceCheckUtils]: 111: Hoare triple {15344#(and (= 9 (+ main_~c~0 (- 5))) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,532 INFO L290 TraceCheckUtils]: 112: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,532 INFO L290 TraceCheckUtils]: 113: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,532 INFO L290 TraceCheckUtils]: 114: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,533 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {14998#true} {15344#(and (= 9 (+ main_~c~0 (- 5))) (= (+ (- 1) main_~y~0) 13))} #54#return; {15344#(and (= 9 (+ main_~c~0 (- 5))) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:43:18,533 INFO L290 TraceCheckUtils]: 116: Hoare triple {15344#(and (= 9 (+ main_~c~0 (- 5))) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15366#(and (= main_~y~0 15) (= 9 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:43:18,533 INFO L290 TraceCheckUtils]: 117: Hoare triple {15366#(and (= main_~y~0 15) (= 9 (+ main_~c~0 (- 6))))} assume !false; {15366#(and (= main_~y~0 15) (= 9 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:43:18,533 INFO L272 TraceCheckUtils]: 118: Hoare triple {15366#(and (= main_~y~0 15) (= 9 (+ main_~c~0 (- 6))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,533 INFO L290 TraceCheckUtils]: 119: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,534 INFO L290 TraceCheckUtils]: 120: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,534 INFO L290 TraceCheckUtils]: 121: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,534 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {14998#true} {15366#(and (= main_~y~0 15) (= 9 (+ main_~c~0 (- 6))))} #54#return; {15366#(and (= main_~y~0 15) (= 9 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 14:43:18,534 INFO L290 TraceCheckUtils]: 123: Hoare triple {15366#(and (= main_~y~0 15) (= 9 (+ main_~c~0 (- 6))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15388#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:43:18,535 INFO L290 TraceCheckUtils]: 124: Hoare triple {15388#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {15388#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:43:18,535 INFO L272 TraceCheckUtils]: 125: Hoare triple {15388#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,535 INFO L290 TraceCheckUtils]: 126: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,535 INFO L290 TraceCheckUtils]: 127: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,535 INFO L290 TraceCheckUtils]: 128: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,535 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {14998#true} {15388#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {15388#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:43:18,536 INFO L290 TraceCheckUtils]: 130: Hoare triple {15388#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15410#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 14:43:18,536 INFO L290 TraceCheckUtils]: 131: Hoare triple {15410#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !false; {15410#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 14:43:18,536 INFO L272 TraceCheckUtils]: 132: Hoare triple {15410#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,536 INFO L290 TraceCheckUtils]: 133: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,536 INFO L290 TraceCheckUtils]: 134: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,536 INFO L290 TraceCheckUtils]: 135: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,537 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {14998#true} {15410#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} #54#return; {15410#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 14:43:18,537 INFO L290 TraceCheckUtils]: 137: Hoare triple {15410#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15432#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-27 14:43:18,537 INFO L290 TraceCheckUtils]: 138: Hoare triple {15432#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} assume !false; {15432#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-27 14:43:18,537 INFO L272 TraceCheckUtils]: 139: Hoare triple {15432#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,537 INFO L290 TraceCheckUtils]: 140: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,537 INFO L290 TraceCheckUtils]: 141: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,537 INFO L290 TraceCheckUtils]: 142: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,538 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {14998#true} {15432#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} #54#return; {15432#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-27 14:43:18,538 INFO L290 TraceCheckUtils]: 144: Hoare triple {15432#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15454#(and (= (+ main_~y~0 (- 3)) 16) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 14:43:18,538 INFO L290 TraceCheckUtils]: 145: Hoare triple {15454#(and (= (+ main_~y~0 (- 3)) 16) (= (+ (- 1) main_~c~0) 18))} assume !false; {15454#(and (= (+ main_~y~0 (- 3)) 16) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 14:43:18,538 INFO L272 TraceCheckUtils]: 146: Hoare triple {15454#(and (= (+ main_~y~0 (- 3)) 16) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,539 INFO L290 TraceCheckUtils]: 147: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,539 INFO L290 TraceCheckUtils]: 148: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,539 INFO L290 TraceCheckUtils]: 149: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,539 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {14998#true} {15454#(and (= (+ main_~y~0 (- 3)) 16) (= (+ (- 1) main_~c~0) 18))} #54#return; {15454#(and (= (+ main_~y~0 (- 3)) 16) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 14:43:18,539 INFO L290 TraceCheckUtils]: 151: Hoare triple {15454#(and (= (+ main_~y~0 (- 3)) 16) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15476#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-27 14:43:18,540 INFO L290 TraceCheckUtils]: 152: Hoare triple {15476#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} assume !false; {15476#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-27 14:43:18,540 INFO L272 TraceCheckUtils]: 153: Hoare triple {15476#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,540 INFO L290 TraceCheckUtils]: 154: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,540 INFO L290 TraceCheckUtils]: 155: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,540 INFO L290 TraceCheckUtils]: 156: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,540 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {14998#true} {15476#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} #54#return; {15476#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-27 14:43:18,541 INFO L290 TraceCheckUtils]: 158: Hoare triple {15476#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15498#(and (<= main_~c~0 21) (< 20 main_~k~0) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 14:43:18,541 INFO L290 TraceCheckUtils]: 159: Hoare triple {15498#(and (<= main_~c~0 21) (< 20 main_~k~0) (= 16 (+ main_~y~0 (- 5))))} assume !false; {15498#(and (<= main_~c~0 21) (< 20 main_~k~0) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 14:43:18,541 INFO L272 TraceCheckUtils]: 160: Hoare triple {15498#(and (<= main_~c~0 21) (< 20 main_~k~0) (= 16 (+ main_~y~0 (- 5))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14998#true} is VALID [2022-04-27 14:43:18,541 INFO L290 TraceCheckUtils]: 161: Hoare triple {14998#true} ~cond := #in~cond; {14998#true} is VALID [2022-04-27 14:43:18,541 INFO L290 TraceCheckUtils]: 162: Hoare triple {14998#true} assume !(0 == ~cond); {14998#true} is VALID [2022-04-27 14:43:18,541 INFO L290 TraceCheckUtils]: 163: Hoare triple {14998#true} assume true; {14998#true} is VALID [2022-04-27 14:43:18,541 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {14998#true} {15498#(and (<= main_~c~0 21) (< 20 main_~k~0) (= 16 (+ main_~y~0 (- 5))))} #54#return; {15498#(and (<= main_~c~0 21) (< 20 main_~k~0) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 14:43:18,542 INFO L290 TraceCheckUtils]: 165: Hoare triple {15498#(and (<= main_~c~0 21) (< 20 main_~k~0) (= 16 (+ main_~y~0 (- 5))))} assume !(~c~0 < ~k~0); {15520#(and (< 20 main_~k~0) (<= main_~k~0 21) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 14:43:18,542 INFO L272 TraceCheckUtils]: 166: Hoare triple {15520#(and (< 20 main_~k~0) (<= main_~k~0 21) (= 16 (+ main_~y~0 (- 5))))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15524#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:43:18,543 INFO L290 TraceCheckUtils]: 167: Hoare triple {15524#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15528#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:43:18,543 INFO L290 TraceCheckUtils]: 168: Hoare triple {15528#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14999#false} is VALID [2022-04-27 14:43:18,543 INFO L290 TraceCheckUtils]: 169: Hoare triple {14999#false} assume !false; {14999#false} is VALID [2022-04-27 14:43:18,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 44 proven. 693 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-27 14:43:18,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:43:18,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:43:18,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885639781] [2022-04-27 14:43:18,839 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:43:18,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639031413] [2022-04-27 14:43:18,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639031413] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:43:18,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:43:18,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-04-27 14:43:18,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739392399] [2022-04-27 14:43:18,840 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:43:18,840 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-27 14:43:18,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:43:18,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-27 14:43:18,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:18,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-27 14:43:18,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:43:18,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-27 14:43:18,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-04-27 14:43:18,953 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-27 14:43:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:23,515 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2022-04-27 14:43:23,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 14:43:23,515 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-27 14:43:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:43:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-27 14:43:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 116 transitions. [2022-04-27 14:43:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-27 14:43:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 116 transitions. [2022-04-27 14:43:23,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 116 transitions. [2022-04-27 14:43:23,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:23,684 INFO L225 Difference]: With dead ends: 99 [2022-04-27 14:43:23,684 INFO L226 Difference]: Without dead ends: 94 [2022-04-27 14:43:23,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2022-04-27 14:43:23,685 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 2 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:43:23,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1055 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 14:43:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-27 14:43:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-27 14:43:23,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:43:23,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 14:43:23,747 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 14:43:23,747 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 14:43:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:23,748 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-27 14:43:23,748 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-27 14:43:23,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:23,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:23,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 94 states. [2022-04-27 14:43:23,749 INFO L87 Difference]: Start difference. First operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 94 states. [2022-04-27 14:43:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:23,751 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-27 14:43:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-27 14:43:23,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:23,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:23,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:43:23,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:43:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 14:43:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2022-04-27 14:43:23,753 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 170 [2022-04-27 14:43:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:43:23,753 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2022-04-27 14:43:23,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-27 14:43:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-27 14:43:23,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-04-27 14:43:23,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:43:23,754 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:43:23,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-27 14:43:23,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:43:23,960 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:43:23,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:43:23,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1612717687, now seen corresponding path program 22 times [2022-04-27 14:43:23,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:43:23,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128505267] [2022-04-27 14:43:23,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:43:23,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:43:23,977 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:43:23,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [700803041] [2022-04-27 14:43:23,977 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:43:23,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:43:23,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:43:23,978 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:43:23,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-27 14:43:24,510 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:43:24,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:43:24,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-27 14:43:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:43:24,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:43:25,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {16075#true} call ULTIMATE.init(); {16075#true} is VALID [2022-04-27 14:43:25,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {16075#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(9, 2);call #Ultimate.allocInit(12, 3); {16075#true} is VALID [2022-04-27 14:43:25,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16075#true} {16075#true} #60#return; {16075#true} is VALID [2022-04-27 14:43:25,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {16075#true} call #t~ret5 := main(); {16075#true} is VALID [2022-04-27 14:43:25,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {16075#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {16075#true} is VALID [2022-04-27 14:43:25,415 INFO L272 TraceCheckUtils]: 6: Hoare triple {16075#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,416 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16075#true} {16075#true} #52#return; {16075#true} is VALID [2022-04-27 14:43:25,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {16075#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {16113#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:25,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {16113#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {16113#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:25,416 INFO L272 TraceCheckUtils]: 13: Hoare triple {16113#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,417 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16075#true} {16113#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {16113#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:25,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {16113#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16135#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:43:25,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {16135#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {16135#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:43:25,418 INFO L272 TraceCheckUtils]: 20: Hoare triple {16135#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,418 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {16075#true} {16135#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {16135#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:43:25,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {16135#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16157#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:25,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {16157#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {16157#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:25,419 INFO L272 TraceCheckUtils]: 27: Hoare triple {16157#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,420 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16075#true} {16157#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {16157#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:25,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {16157#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16179#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:43:25,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {16179#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {16179#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:43:25,420 INFO L272 TraceCheckUtils]: 34: Hoare triple {16179#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,421 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16075#true} {16179#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {16179#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 14:43:25,421 INFO L290 TraceCheckUtils]: 39: Hoare triple {16179#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16201#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:43:25,422 INFO L290 TraceCheckUtils]: 40: Hoare triple {16201#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {16201#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:43:25,422 INFO L272 TraceCheckUtils]: 41: Hoare triple {16201#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,422 INFO L290 TraceCheckUtils]: 42: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,422 INFO L290 TraceCheckUtils]: 43: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,422 INFO L290 TraceCheckUtils]: 44: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,422 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16075#true} {16201#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #54#return; {16201#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 14:43:25,423 INFO L290 TraceCheckUtils]: 46: Hoare triple {16201#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16223#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:43:25,423 INFO L290 TraceCheckUtils]: 47: Hoare triple {16223#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !false; {16223#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:43:25,423 INFO L272 TraceCheckUtils]: 48: Hoare triple {16223#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,423 INFO L290 TraceCheckUtils]: 49: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,423 INFO L290 TraceCheckUtils]: 50: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,423 INFO L290 TraceCheckUtils]: 51: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,424 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16075#true} {16223#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} #54#return; {16223#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-27 14:43:25,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {16223#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16245#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:43:25,424 INFO L290 TraceCheckUtils]: 54: Hoare triple {16245#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} assume !false; {16245#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:43:25,424 INFO L272 TraceCheckUtils]: 55: Hoare triple {16245#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,424 INFO L290 TraceCheckUtils]: 56: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,425 INFO L290 TraceCheckUtils]: 57: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,425 INFO L290 TraceCheckUtils]: 58: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,425 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16075#true} {16245#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} #54#return; {16245#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:43:25,425 INFO L290 TraceCheckUtils]: 60: Hoare triple {16245#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16267#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 14:43:25,426 INFO L290 TraceCheckUtils]: 61: Hoare triple {16267#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} assume !false; {16267#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 14:43:25,426 INFO L272 TraceCheckUtils]: 62: Hoare triple {16267#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,426 INFO L290 TraceCheckUtils]: 64: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,426 INFO L290 TraceCheckUtils]: 65: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,426 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16075#true} {16267#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} #54#return; {16267#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 14:43:25,427 INFO L290 TraceCheckUtils]: 67: Hoare triple {16267#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16289#(and (= (+ main_~y~0 (- 6)) 2) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:43:25,427 INFO L290 TraceCheckUtils]: 68: Hoare triple {16289#(and (= (+ main_~y~0 (- 6)) 2) (= 5 (+ main_~c~0 (- 3))))} assume !false; {16289#(and (= (+ main_~y~0 (- 6)) 2) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:43:25,427 INFO L272 TraceCheckUtils]: 69: Hoare triple {16289#(and (= (+ main_~y~0 (- 6)) 2) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,427 INFO L290 TraceCheckUtils]: 70: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,427 INFO L290 TraceCheckUtils]: 71: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,427 INFO L290 TraceCheckUtils]: 72: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,428 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16075#true} {16289#(and (= (+ main_~y~0 (- 6)) 2) (= 5 (+ main_~c~0 (- 3))))} #54#return; {16289#(and (= (+ main_~y~0 (- 6)) 2) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:43:25,428 INFO L290 TraceCheckUtils]: 74: Hoare triple {16289#(and (= (+ main_~y~0 (- 6)) 2) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16311#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:43:25,428 INFO L290 TraceCheckUtils]: 75: Hoare triple {16311#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} assume !false; {16311#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:43:25,428 INFO L272 TraceCheckUtils]: 76: Hoare triple {16311#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,429 INFO L290 TraceCheckUtils]: 77: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,429 INFO L290 TraceCheckUtils]: 78: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,429 INFO L290 TraceCheckUtils]: 79: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,429 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16075#true} {16311#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} #54#return; {16311#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:43:25,429 INFO L290 TraceCheckUtils]: 81: Hoare triple {16311#(and (= main_~y~0 9) (= 5 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16333#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:43:25,430 INFO L290 TraceCheckUtils]: 82: Hoare triple {16333#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {16333#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:43:25,430 INFO L272 TraceCheckUtils]: 83: Hoare triple {16333#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,430 INFO L290 TraceCheckUtils]: 84: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,430 INFO L290 TraceCheckUtils]: 85: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,430 INFO L290 TraceCheckUtils]: 86: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,430 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {16075#true} {16333#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {16333#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:43:25,431 INFO L290 TraceCheckUtils]: 88: Hoare triple {16333#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16355#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:43:25,431 INFO L290 TraceCheckUtils]: 89: Hoare triple {16355#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {16355#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:43:25,431 INFO L272 TraceCheckUtils]: 90: Hoare triple {16355#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,431 INFO L290 TraceCheckUtils]: 91: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,431 INFO L290 TraceCheckUtils]: 92: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,431 INFO L290 TraceCheckUtils]: 93: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,432 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {16075#true} {16355#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {16355#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:43:25,432 INFO L290 TraceCheckUtils]: 95: Hoare triple {16355#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16377#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:43:25,432 INFO L290 TraceCheckUtils]: 96: Hoare triple {16377#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {16377#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:43:25,432 INFO L272 TraceCheckUtils]: 97: Hoare triple {16377#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,433 INFO L290 TraceCheckUtils]: 98: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,433 INFO L290 TraceCheckUtils]: 99: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,433 INFO L290 TraceCheckUtils]: 100: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,433 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {16075#true} {16377#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {16377#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:43:25,433 INFO L290 TraceCheckUtils]: 102: Hoare triple {16377#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16399#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:43:25,434 INFO L290 TraceCheckUtils]: 103: Hoare triple {16399#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {16399#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:43:25,434 INFO L272 TraceCheckUtils]: 104: Hoare triple {16399#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,434 INFO L290 TraceCheckUtils]: 105: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,434 INFO L290 TraceCheckUtils]: 106: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,434 INFO L290 TraceCheckUtils]: 107: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,434 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16075#true} {16399#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #54#return; {16399#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 14:43:25,435 INFO L290 TraceCheckUtils]: 109: Hoare triple {16399#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16421#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:43:25,435 INFO L290 TraceCheckUtils]: 110: Hoare triple {16421#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} assume !false; {16421#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:43:25,435 INFO L272 TraceCheckUtils]: 111: Hoare triple {16421#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,435 INFO L290 TraceCheckUtils]: 112: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,435 INFO L290 TraceCheckUtils]: 113: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,435 INFO L290 TraceCheckUtils]: 114: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,436 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {16075#true} {16421#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} #54#return; {16421#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:43:25,436 INFO L290 TraceCheckUtils]: 116: Hoare triple {16421#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16443#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 14:43:25,436 INFO L290 TraceCheckUtils]: 117: Hoare triple {16443#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} assume !false; {16443#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 14:43:25,437 INFO L272 TraceCheckUtils]: 118: Hoare triple {16443#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,437 INFO L290 TraceCheckUtils]: 119: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,437 INFO L290 TraceCheckUtils]: 120: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,437 INFO L290 TraceCheckUtils]: 121: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,437 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {16075#true} {16443#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} #54#return; {16443#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 14:43:25,437 INFO L290 TraceCheckUtils]: 123: Hoare triple {16443#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16465#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 14:43:25,438 INFO L290 TraceCheckUtils]: 124: Hoare triple {16465#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} assume !false; {16465#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 14:43:25,438 INFO L272 TraceCheckUtils]: 125: Hoare triple {16465#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,438 INFO L290 TraceCheckUtils]: 126: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,438 INFO L290 TraceCheckUtils]: 127: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,438 INFO L290 TraceCheckUtils]: 128: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,438 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {16075#true} {16465#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} #54#return; {16465#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 14:43:25,439 INFO L290 TraceCheckUtils]: 130: Hoare triple {16465#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16487#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-27 14:43:25,439 INFO L290 TraceCheckUtils]: 131: Hoare triple {16487#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {16487#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-27 14:43:25,439 INFO L272 TraceCheckUtils]: 132: Hoare triple {16487#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,439 INFO L290 TraceCheckUtils]: 133: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,439 INFO L290 TraceCheckUtils]: 134: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,439 INFO L290 TraceCheckUtils]: 135: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,440 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {16075#true} {16487#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #54#return; {16487#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-27 14:43:25,440 INFO L290 TraceCheckUtils]: 137: Hoare triple {16487#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16509#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:43:25,440 INFO L290 TraceCheckUtils]: 138: Hoare triple {16509#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {16509#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:43:25,441 INFO L272 TraceCheckUtils]: 139: Hoare triple {16509#(and (= main_~c~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,441 INFO L290 TraceCheckUtils]: 140: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,441 INFO L290 TraceCheckUtils]: 141: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,441 INFO L290 TraceCheckUtils]: 142: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,441 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {16075#true} {16509#(and (= main_~c~0 18) (= main_~y~0 18))} #54#return; {16509#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:43:25,441 INFO L290 TraceCheckUtils]: 144: Hoare triple {16509#(and (= main_~c~0 18) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16531#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 14:43:25,442 INFO L290 TraceCheckUtils]: 145: Hoare triple {16531#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {16531#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 14:43:25,442 INFO L272 TraceCheckUtils]: 146: Hoare triple {16531#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,442 INFO L290 TraceCheckUtils]: 147: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,442 INFO L290 TraceCheckUtils]: 148: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,442 INFO L290 TraceCheckUtils]: 149: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,442 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {16075#true} {16531#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #54#return; {16531#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 14:43:25,443 INFO L290 TraceCheckUtils]: 151: Hoare triple {16531#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16553#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:25,443 INFO L290 TraceCheckUtils]: 152: Hoare triple {16553#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} assume !false; {16553#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:25,443 INFO L272 TraceCheckUtils]: 153: Hoare triple {16553#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,443 INFO L290 TraceCheckUtils]: 154: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,443 INFO L290 TraceCheckUtils]: 155: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,443 INFO L290 TraceCheckUtils]: 156: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,444 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {16075#true} {16553#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} #54#return; {16553#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:25,444 INFO L290 TraceCheckUtils]: 158: Hoare triple {16553#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16575#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-27 14:43:25,445 INFO L290 TraceCheckUtils]: 159: Hoare triple {16575#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} assume !false; {16575#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-27 14:43:25,445 INFO L272 TraceCheckUtils]: 160: Hoare triple {16575#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,445 INFO L290 TraceCheckUtils]: 161: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,445 INFO L290 TraceCheckUtils]: 162: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,445 INFO L290 TraceCheckUtils]: 163: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,445 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {16075#true} {16575#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} #54#return; {16575#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-27 14:43:25,446 INFO L290 TraceCheckUtils]: 165: Hoare triple {16575#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16597#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-27 14:43:25,446 INFO L290 TraceCheckUtils]: 166: Hoare triple {16597#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} assume !false; {16597#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-27 14:43:25,446 INFO L272 TraceCheckUtils]: 167: Hoare triple {16597#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16075#true} is VALID [2022-04-27 14:43:25,446 INFO L290 TraceCheckUtils]: 168: Hoare triple {16075#true} ~cond := #in~cond; {16075#true} is VALID [2022-04-27 14:43:25,446 INFO L290 TraceCheckUtils]: 169: Hoare triple {16075#true} assume !(0 == ~cond); {16075#true} is VALID [2022-04-27 14:43:25,446 INFO L290 TraceCheckUtils]: 170: Hoare triple {16075#true} assume true; {16075#true} is VALID [2022-04-27 14:43:25,447 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {16075#true} {16597#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} #54#return; {16597#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-27 14:43:25,448 INFO L290 TraceCheckUtils]: 172: Hoare triple {16597#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} assume !(~c~0 < ~k~0); {16619#(and (<= main_~k~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-27 14:43:25,448 INFO L272 TraceCheckUtils]: 173: Hoare triple {16619#(and (<= main_~k~0 22) (= main_~y~0 22) (< 21 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16623#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:43:25,448 INFO L290 TraceCheckUtils]: 174: Hoare triple {16623#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16627#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:43:25,449 INFO L290 TraceCheckUtils]: 175: Hoare triple {16627#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16076#false} is VALID [2022-04-27 14:43:25,449 INFO L290 TraceCheckUtils]: 176: Hoare triple {16076#false} assume !false; {16076#false} is VALID [2022-04-27 14:43:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1817 backedges. 46 proven. 759 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2022-04-27 14:43:25,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:43:25,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:43:25,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128505267] [2022-04-27 14:43:25,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:43:25,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700803041] [2022-04-27 14:43:25,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700803041] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:43:25,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:43:25,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-04-27 14:43:25,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255049847] [2022-04-27 14:43:25,764 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:43:25,765 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) Word has length 177 [2022-04-27 14:43:25,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:43:25,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-27 14:43:25,876 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-27 14:43:25,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 14:43:25,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:43:25,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 14:43:25,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-04-27 14:43:25,878 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-27 14:43:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:31,337 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-04-27 14:43:31,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-27 14:43:31,337 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) Word has length 177 [2022-04-27 14:43:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:43:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-27 14:43:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-27 14:43:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-27 14:43:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-27 14:43:31,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 120 transitions. [2022-04-27 14:43:31,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:31,467 INFO L225 Difference]: With dead ends: 102 [2022-04-27 14:43:31,467 INFO L226 Difference]: Without dead ends: 97 [2022-04-27 14:43:31,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 14:43:31,468 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-27 14:43:31,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1123 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-27 14:43:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-27 14:43:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-04-27 14:43:31,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:43:31,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 14:43:31,551 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 14:43:31,551 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 14:43:31,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:31,553 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-27 14:43:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-27 14:43:31,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:31,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:31,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 97 states. [2022-04-27 14:43:31,554 INFO L87 Difference]: Start difference. First operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 97 states. [2022-04-27 14:43:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:31,555 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-27 14:43:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-27 14:43:31,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:31,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:31,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:43:31,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:43:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 14:43:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2022-04-27 14:43:31,558 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 177 [2022-04-27 14:43:31,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:43:31,558 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2022-04-27 14:43:31,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-27 14:43:31,558 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-27 14:43:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-04-27 14:43:31,559 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:43:31,559 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:43:31,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-27 14:43:31,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-27 14:43:31,764 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:43:31,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:43:31,764 INFO L85 PathProgramCache]: Analyzing trace with hash -178408600, now seen corresponding path program 23 times [2022-04-27 14:43:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:43:31,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415238744] [2022-04-27 14:43:31,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:43:31,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:43:31,777 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:43:31,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [699761077] [2022-04-27 14:43:31,777 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:43:31,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:43:31,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:43:31,778 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:43:31,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-27 14:43:51,928 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-04-27 14:43:51,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:43:51,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-27 14:43:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:43:51,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:43:52,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {17190#true} call ULTIMATE.init(); {17190#true} is VALID [2022-04-27 14:43:52,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {17190#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(9, 2);call #Ultimate.allocInit(12, 3); {17190#true} is VALID [2022-04-27 14:43:52,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17190#true} {17190#true} #60#return; {17190#true} is VALID [2022-04-27 14:43:52,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {17190#true} call #t~ret5 := main(); {17190#true} is VALID [2022-04-27 14:43:52,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {17190#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {17190#true} is VALID [2022-04-27 14:43:52,925 INFO L272 TraceCheckUtils]: 6: Hoare triple {17190#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,925 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17190#true} {17190#true} #52#return; {17190#true} is VALID [2022-04-27 14:43:52,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {17190#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17228#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:52,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {17228#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {17228#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:52,926 INFO L272 TraceCheckUtils]: 13: Hoare triple {17228#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,927 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17190#true} {17228#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {17228#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:43:52,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {17228#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17250#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:43:52,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {17250#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {17250#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:43:52,928 INFO L272 TraceCheckUtils]: 20: Hoare triple {17250#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,928 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {17190#true} {17250#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {17250#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:43:52,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {17250#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17272#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:43:52,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {17272#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {17272#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:43:52,929 INFO L272 TraceCheckUtils]: 27: Hoare triple {17272#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,929 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17190#true} {17272#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {17272#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:43:52,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {17272#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17294#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:43:52,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {17294#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {17294#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:43:52,930 INFO L272 TraceCheckUtils]: 34: Hoare triple {17294#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,931 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17190#true} {17294#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {17294#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:43:52,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {17294#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17316#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:52,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {17316#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {17316#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:52,932 INFO L272 TraceCheckUtils]: 41: Hoare triple {17316#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,932 INFO L290 TraceCheckUtils]: 44: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,932 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17190#true} {17316#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {17316#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:52,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {17316#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17338#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:43:52,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {17338#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {17338#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:43:52,933 INFO L272 TraceCheckUtils]: 48: Hoare triple {17338#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,933 INFO L290 TraceCheckUtils]: 50: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,934 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17190#true} {17338#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #54#return; {17338#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:43:52,934 INFO L290 TraceCheckUtils]: 53: Hoare triple {17338#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17360#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:43:52,935 INFO L290 TraceCheckUtils]: 54: Hoare triple {17360#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {17360#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:43:52,935 INFO L272 TraceCheckUtils]: 55: Hoare triple {17360#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,935 INFO L290 TraceCheckUtils]: 56: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,935 INFO L290 TraceCheckUtils]: 57: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,935 INFO L290 TraceCheckUtils]: 58: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,935 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17190#true} {17360#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {17360#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:43:52,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {17360#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17382#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:43:52,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {17382#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {17382#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:43:52,936 INFO L272 TraceCheckUtils]: 62: Hoare triple {17382#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,936 INFO L290 TraceCheckUtils]: 63: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,936 INFO L290 TraceCheckUtils]: 64: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,936 INFO L290 TraceCheckUtils]: 65: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,937 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17190#true} {17382#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {17382#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:43:52,937 INFO L290 TraceCheckUtils]: 67: Hoare triple {17382#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17404#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:43:52,938 INFO L290 TraceCheckUtils]: 68: Hoare triple {17404#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {17404#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:43:52,938 INFO L272 TraceCheckUtils]: 69: Hoare triple {17404#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,938 INFO L290 TraceCheckUtils]: 70: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,938 INFO L290 TraceCheckUtils]: 71: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,938 INFO L290 TraceCheckUtils]: 72: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,938 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17190#true} {17404#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #54#return; {17404#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:43:52,939 INFO L290 TraceCheckUtils]: 74: Hoare triple {17404#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17426#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:43:52,939 INFO L290 TraceCheckUtils]: 75: Hoare triple {17426#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {17426#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:43:52,939 INFO L272 TraceCheckUtils]: 76: Hoare triple {17426#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,939 INFO L290 TraceCheckUtils]: 77: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,939 INFO L290 TraceCheckUtils]: 78: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,939 INFO L290 TraceCheckUtils]: 79: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,940 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {17190#true} {17426#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {17426#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:43:52,940 INFO L290 TraceCheckUtils]: 81: Hoare triple {17426#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17448#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:43:52,940 INFO L290 TraceCheckUtils]: 82: Hoare triple {17448#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {17448#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:43:52,940 INFO L272 TraceCheckUtils]: 83: Hoare triple {17448#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,940 INFO L290 TraceCheckUtils]: 84: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,941 INFO L290 TraceCheckUtils]: 85: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,941 INFO L290 TraceCheckUtils]: 86: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,941 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {17190#true} {17448#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #54#return; {17448#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:43:52,941 INFO L290 TraceCheckUtils]: 88: Hoare triple {17448#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17470#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:43:52,942 INFO L290 TraceCheckUtils]: 89: Hoare triple {17470#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {17470#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:43:52,942 INFO L272 TraceCheckUtils]: 90: Hoare triple {17470#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,942 INFO L290 TraceCheckUtils]: 91: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,942 INFO L290 TraceCheckUtils]: 92: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,942 INFO L290 TraceCheckUtils]: 93: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,942 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {17190#true} {17470#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {17470#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:43:52,943 INFO L290 TraceCheckUtils]: 95: Hoare triple {17470#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17492#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:43:52,943 INFO L290 TraceCheckUtils]: 96: Hoare triple {17492#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {17492#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:43:52,943 INFO L272 TraceCheckUtils]: 97: Hoare triple {17492#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,943 INFO L290 TraceCheckUtils]: 98: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,943 INFO L290 TraceCheckUtils]: 99: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,943 INFO L290 TraceCheckUtils]: 100: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,944 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17190#true} {17492#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {17492#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:43:52,944 INFO L290 TraceCheckUtils]: 102: Hoare triple {17492#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17514#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:52,945 INFO L290 TraceCheckUtils]: 103: Hoare triple {17514#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {17514#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:52,945 INFO L272 TraceCheckUtils]: 104: Hoare triple {17514#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,945 INFO L290 TraceCheckUtils]: 105: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,945 INFO L290 TraceCheckUtils]: 106: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,945 INFO L290 TraceCheckUtils]: 107: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,945 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17190#true} {17514#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {17514#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:43:52,946 INFO L290 TraceCheckUtils]: 109: Hoare triple {17514#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17536#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-27 14:43:52,946 INFO L290 TraceCheckUtils]: 110: Hoare triple {17536#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} assume !false; {17536#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-27 14:43:52,946 INFO L272 TraceCheckUtils]: 111: Hoare triple {17536#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,946 INFO L290 TraceCheckUtils]: 112: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,946 INFO L290 TraceCheckUtils]: 113: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,946 INFO L290 TraceCheckUtils]: 114: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,947 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {17190#true} {17536#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} #54#return; {17536#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-27 14:43:52,947 INFO L290 TraceCheckUtils]: 116: Hoare triple {17536#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17558#(and (= (+ main_~y~0 (- 3)) 12) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 14:43:52,947 INFO L290 TraceCheckUtils]: 117: Hoare triple {17558#(and (= (+ main_~y~0 (- 3)) 12) (= (+ (- 1) main_~c~0) 14))} assume !false; {17558#(and (= (+ main_~y~0 (- 3)) 12) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 14:43:52,947 INFO L272 TraceCheckUtils]: 118: Hoare triple {17558#(and (= (+ main_~y~0 (- 3)) 12) (= (+ (- 1) main_~c~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,948 INFO L290 TraceCheckUtils]: 119: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,948 INFO L290 TraceCheckUtils]: 120: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,948 INFO L290 TraceCheckUtils]: 121: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,948 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {17190#true} {17558#(and (= (+ main_~y~0 (- 3)) 12) (= (+ (- 1) main_~c~0) 14))} #54#return; {17558#(and (= (+ main_~y~0 (- 3)) 12) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 14:43:52,948 INFO L290 TraceCheckUtils]: 123: Hoare triple {17558#(and (= (+ main_~y~0 (- 3)) 12) (= (+ (- 1) main_~c~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17580#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-27 14:43:52,949 INFO L290 TraceCheckUtils]: 124: Hoare triple {17580#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 12))} assume !false; {17580#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-27 14:43:52,949 INFO L272 TraceCheckUtils]: 125: Hoare triple {17580#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,949 INFO L290 TraceCheckUtils]: 126: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,949 INFO L290 TraceCheckUtils]: 127: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,949 INFO L290 TraceCheckUtils]: 128: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,949 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17190#true} {17580#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 12))} #54#return; {17580#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-27 14:43:52,950 INFO L290 TraceCheckUtils]: 130: Hoare triple {17580#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17602#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-27 14:43:52,950 INFO L290 TraceCheckUtils]: 131: Hoare triple {17602#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} assume !false; {17602#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-27 14:43:52,950 INFO L272 TraceCheckUtils]: 132: Hoare triple {17602#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,950 INFO L290 TraceCheckUtils]: 133: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,950 INFO L290 TraceCheckUtils]: 134: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,950 INFO L290 TraceCheckUtils]: 135: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,951 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {17190#true} {17602#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} #54#return; {17602#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-27 14:43:52,951 INFO L290 TraceCheckUtils]: 137: Hoare triple {17602#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17624#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:43:52,952 INFO L290 TraceCheckUtils]: 138: Hoare triple {17624#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {17624#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:43:52,952 INFO L272 TraceCheckUtils]: 139: Hoare triple {17624#(and (= main_~c~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,952 INFO L290 TraceCheckUtils]: 140: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,952 INFO L290 TraceCheckUtils]: 141: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,952 INFO L290 TraceCheckUtils]: 142: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,952 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {17190#true} {17624#(and (= main_~c~0 18) (= main_~y~0 18))} #54#return; {17624#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:43:52,953 INFO L290 TraceCheckUtils]: 144: Hoare triple {17624#(and (= main_~c~0 18) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17646#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 14:43:52,953 INFO L290 TraceCheckUtils]: 145: Hoare triple {17646#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {17646#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 14:43:52,953 INFO L272 TraceCheckUtils]: 146: Hoare triple {17646#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,953 INFO L290 TraceCheckUtils]: 147: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,953 INFO L290 TraceCheckUtils]: 148: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,953 INFO L290 TraceCheckUtils]: 149: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,954 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {17190#true} {17646#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #54#return; {17646#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 14:43:52,954 INFO L290 TraceCheckUtils]: 151: Hoare triple {17646#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17668#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:52,954 INFO L290 TraceCheckUtils]: 152: Hoare triple {17668#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} assume !false; {17668#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:52,955 INFO L272 TraceCheckUtils]: 153: Hoare triple {17668#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,955 INFO L290 TraceCheckUtils]: 154: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,955 INFO L290 TraceCheckUtils]: 155: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,955 INFO L290 TraceCheckUtils]: 156: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,955 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {17190#true} {17668#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} #54#return; {17668#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:43:52,956 INFO L290 TraceCheckUtils]: 158: Hoare triple {17668#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17690#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 14:43:52,956 INFO L290 TraceCheckUtils]: 159: Hoare triple {17690#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !false; {17690#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 14:43:52,956 INFO L272 TraceCheckUtils]: 160: Hoare triple {17690#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,956 INFO L290 TraceCheckUtils]: 161: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,956 INFO L290 TraceCheckUtils]: 162: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,956 INFO L290 TraceCheckUtils]: 163: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,957 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {17190#true} {17690#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} #54#return; {17690#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 14:43:52,957 INFO L290 TraceCheckUtils]: 165: Hoare triple {17690#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17712#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:43:52,957 INFO L290 TraceCheckUtils]: 166: Hoare triple {17712#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {17712#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:43:52,957 INFO L272 TraceCheckUtils]: 167: Hoare triple {17712#(and (= main_~y~0 22) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,957 INFO L290 TraceCheckUtils]: 168: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,957 INFO L290 TraceCheckUtils]: 169: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,958 INFO L290 TraceCheckUtils]: 170: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,958 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {17190#true} {17712#(and (= main_~y~0 22) (= main_~c~0 22))} #54#return; {17712#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:43:52,958 INFO L290 TraceCheckUtils]: 172: Hoare triple {17712#(and (= main_~y~0 22) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17734#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-27 14:43:52,959 INFO L290 TraceCheckUtils]: 173: Hoare triple {17734#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} assume !false; {17734#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-27 14:43:52,959 INFO L272 TraceCheckUtils]: 174: Hoare triple {17734#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17190#true} is VALID [2022-04-27 14:43:52,959 INFO L290 TraceCheckUtils]: 175: Hoare triple {17190#true} ~cond := #in~cond; {17190#true} is VALID [2022-04-27 14:43:52,959 INFO L290 TraceCheckUtils]: 176: Hoare triple {17190#true} assume !(0 == ~cond); {17190#true} is VALID [2022-04-27 14:43:52,959 INFO L290 TraceCheckUtils]: 177: Hoare triple {17190#true} assume true; {17190#true} is VALID [2022-04-27 14:43:52,959 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {17190#true} {17734#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} #54#return; {17734#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-27 14:43:52,961 INFO L290 TraceCheckUtils]: 179: Hoare triple {17734#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} assume !(~c~0 < ~k~0); {17756#(and (< 22 main_~k~0) (<= main_~k~0 23) (= 23 main_~y~0))} is VALID [2022-04-27 14:43:52,962 INFO L272 TraceCheckUtils]: 180: Hoare triple {17756#(and (< 22 main_~k~0) (<= main_~k~0 23) (= 23 main_~y~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17760#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:43:52,962 INFO L290 TraceCheckUtils]: 181: Hoare triple {17760#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17764#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:43:52,963 INFO L290 TraceCheckUtils]: 182: Hoare triple {17764#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17191#false} is VALID [2022-04-27 14:43:52,963 INFO L290 TraceCheckUtils]: 183: Hoare triple {17191#false} assume !false; {17191#false} is VALID [2022-04-27 14:43:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 48 proven. 828 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2022-04-27 14:43:52,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:43:53,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:43:53,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415238744] [2022-04-27 14:43:53,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:43:53,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699761077] [2022-04-27 14:43:53,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699761077] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:43:53,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:43:53,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2022-04-27 14:43:53,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022079156] [2022-04-27 14:43:53,258 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:43:53,259 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) Word has length 184 [2022-04-27 14:43:53,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:43:53,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-27 14:43:53,398 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-27 14:43:53,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-27 14:43:53,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:43:53,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-27 14:43:53,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-04-27 14:43:53,399 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-27 14:43:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:59,233 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2022-04-27 14:43:59,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 14:43:59,234 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) Word has length 184 [2022-04-27 14:43:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:43:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-27 14:43:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-27 14:43:59,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-27 14:43:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-27 14:43:59,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 124 transitions. [2022-04-27 14:43:59,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:43:59,462 INFO L225 Difference]: With dead ends: 105 [2022-04-27 14:43:59,462 INFO L226 Difference]: Without dead ends: 100 [2022-04-27 14:43:59,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 14:43:59,462 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:43:59,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1193 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-27 14:43:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-27 14:43:59,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-27 14:43:59,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:43:59,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 14:43:59,526 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 14:43:59,527 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 14:43:59,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:59,529 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-27 14:43:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-27 14:43:59,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:59,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:59,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 100 states. [2022-04-27 14:43:59,529 INFO L87 Difference]: Start difference. First operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 100 states. [2022-04-27 14:43:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:43:59,531 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-27 14:43:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-27 14:43:59,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:43:59,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:43:59,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:43:59,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:43:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 14:43:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2022-04-27 14:43:59,534 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 184 [2022-04-27 14:43:59,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:43:59,534 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2022-04-27 14:43:59,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-27 14:43:59,534 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-27 14:43:59,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-04-27 14:43:59,535 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:43:59,535 INFO L195 NwaCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:43:59,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-27 14:43:59,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-27 14:43:59,740 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:43:59,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:43:59,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1007212713, now seen corresponding path program 24 times [2022-04-27 14:43:59,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:43:59,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646778069] [2022-04-27 14:43:59,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:43:59,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:43:59,754 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:43:59,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [153586927] [2022-04-27 14:43:59,754 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:43:59,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:43:59,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:43:59,755 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:43:59,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-27 14:44:01,259 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-27 14:44:01,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:44:01,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-27 14:44:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:44:01,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:44:02,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {18343#true} call ULTIMATE.init(); {18343#true} is VALID [2022-04-27 14:44:02,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {18343#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(9, 2);call #Ultimate.allocInit(12, 3); {18343#true} is VALID [2022-04-27 14:44:02,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18343#true} {18343#true} #60#return; {18343#true} is VALID [2022-04-27 14:44:02,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {18343#true} call #t~ret5 := main(); {18343#true} is VALID [2022-04-27 14:44:02,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {18343#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {18343#true} is VALID [2022-04-27 14:44:02,238 INFO L272 TraceCheckUtils]: 6: Hoare triple {18343#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,238 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18343#true} {18343#true} #52#return; {18343#true} is VALID [2022-04-27 14:44:02,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {18343#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {18381#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:02,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {18381#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {18381#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:02,239 INFO L272 TraceCheckUtils]: 13: Hoare triple {18381#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,239 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18343#true} {18381#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {18381#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:02,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {18381#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18403#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:44:02,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {18403#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {18403#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:44:02,240 INFO L272 TraceCheckUtils]: 20: Hoare triple {18403#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,249 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {18343#true} {18403#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {18403#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:44:02,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {18403#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18425#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:44:02,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {18425#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {18425#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:44:02,250 INFO L272 TraceCheckUtils]: 27: Hoare triple {18425#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,250 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18343#true} {18425#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {18425#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:44:02,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {18425#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18447#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:44:02,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {18447#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {18447#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:44:02,251 INFO L272 TraceCheckUtils]: 34: Hoare triple {18447#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,252 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {18343#true} {18447#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {18447#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:44:02,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {18447#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18469#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:02,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {18469#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {18469#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:02,253 INFO L272 TraceCheckUtils]: 41: Hoare triple {18469#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,253 INFO L290 TraceCheckUtils]: 42: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,253 INFO L290 TraceCheckUtils]: 44: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,253 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {18343#true} {18469#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {18469#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:02,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {18469#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18491#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:02,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {18491#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} assume !false; {18491#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:02,254 INFO L272 TraceCheckUtils]: 48: Hoare triple {18491#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,254 INFO L290 TraceCheckUtils]: 49: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,254 INFO L290 TraceCheckUtils]: 50: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,254 INFO L290 TraceCheckUtils]: 51: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,255 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18343#true} {18491#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} #54#return; {18491#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:02,255 INFO L290 TraceCheckUtils]: 53: Hoare triple {18491#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18513#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:44:02,256 INFO L290 TraceCheckUtils]: 54: Hoare triple {18513#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} assume !false; {18513#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:44:02,256 INFO L272 TraceCheckUtils]: 55: Hoare triple {18513#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,256 INFO L290 TraceCheckUtils]: 56: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,256 INFO L290 TraceCheckUtils]: 57: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,256 INFO L290 TraceCheckUtils]: 58: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,256 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18343#true} {18513#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} #54#return; {18513#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:44:02,257 INFO L290 TraceCheckUtils]: 60: Hoare triple {18513#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18535#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:44:02,257 INFO L290 TraceCheckUtils]: 61: Hoare triple {18535#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 4)) 3))} assume !false; {18535#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:44:02,257 INFO L272 TraceCheckUtils]: 62: Hoare triple {18535#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 4)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,257 INFO L290 TraceCheckUtils]: 63: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,257 INFO L290 TraceCheckUtils]: 64: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,257 INFO L290 TraceCheckUtils]: 65: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,258 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18343#true} {18535#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 4)) 3))} #54#return; {18535#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 14:44:02,258 INFO L290 TraceCheckUtils]: 67: Hoare triple {18535#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 4)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18557#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-27 14:44:02,259 INFO L290 TraceCheckUtils]: 68: Hoare triple {18557#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {18557#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-27 14:44:02,259 INFO L272 TraceCheckUtils]: 69: Hoare triple {18557#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,259 INFO L290 TraceCheckUtils]: 70: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,259 INFO L290 TraceCheckUtils]: 71: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,259 INFO L290 TraceCheckUtils]: 72: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,259 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {18343#true} {18557#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #54#return; {18557#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-27 14:44:02,260 INFO L290 TraceCheckUtils]: 74: Hoare triple {18557#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18579#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:44:02,260 INFO L290 TraceCheckUtils]: 75: Hoare triple {18579#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {18579#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:44:02,260 INFO L272 TraceCheckUtils]: 76: Hoare triple {18579#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,260 INFO L290 TraceCheckUtils]: 77: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,260 INFO L290 TraceCheckUtils]: 78: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,260 INFO L290 TraceCheckUtils]: 79: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,261 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18343#true} {18579#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {18579#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:44:02,261 INFO L290 TraceCheckUtils]: 81: Hoare triple {18579#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18601#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:44:02,261 INFO L290 TraceCheckUtils]: 82: Hoare triple {18601#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {18601#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:44:02,262 INFO L272 TraceCheckUtils]: 83: Hoare triple {18601#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,262 INFO L290 TraceCheckUtils]: 84: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,262 INFO L290 TraceCheckUtils]: 85: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,262 INFO L290 TraceCheckUtils]: 86: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,262 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {18343#true} {18601#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #54#return; {18601#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:44:02,263 INFO L290 TraceCheckUtils]: 88: Hoare triple {18601#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18623#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-27 14:44:02,263 INFO L290 TraceCheckUtils]: 89: Hoare triple {18623#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {18623#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-27 14:44:02,263 INFO L272 TraceCheckUtils]: 90: Hoare triple {18623#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,263 INFO L290 TraceCheckUtils]: 91: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,263 INFO L290 TraceCheckUtils]: 92: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,263 INFO L290 TraceCheckUtils]: 93: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,264 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {18343#true} {18623#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #54#return; {18623#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-27 14:44:02,264 INFO L290 TraceCheckUtils]: 95: Hoare triple {18623#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18645#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:44:02,264 INFO L290 TraceCheckUtils]: 96: Hoare triple {18645#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {18645#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:44:02,264 INFO L272 TraceCheckUtils]: 97: Hoare triple {18645#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,264 INFO L290 TraceCheckUtils]: 98: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,264 INFO L290 TraceCheckUtils]: 99: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,265 INFO L290 TraceCheckUtils]: 100: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,265 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {18343#true} {18645#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {18645#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:44:02,265 INFO L290 TraceCheckUtils]: 102: Hoare triple {18645#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18667#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:44:02,266 INFO L290 TraceCheckUtils]: 103: Hoare triple {18667#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {18667#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:44:02,266 INFO L272 TraceCheckUtils]: 104: Hoare triple {18667#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,266 INFO L290 TraceCheckUtils]: 105: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,266 INFO L290 TraceCheckUtils]: 106: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,266 INFO L290 TraceCheckUtils]: 107: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,266 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18343#true} {18667#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {18667#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:44:02,267 INFO L290 TraceCheckUtils]: 109: Hoare triple {18667#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18689#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:44:02,267 INFO L290 TraceCheckUtils]: 110: Hoare triple {18689#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {18689#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:44:02,267 INFO L272 TraceCheckUtils]: 111: Hoare triple {18689#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,267 INFO L290 TraceCheckUtils]: 112: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,267 INFO L290 TraceCheckUtils]: 113: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,267 INFO L290 TraceCheckUtils]: 114: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,268 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {18343#true} {18689#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #54#return; {18689#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:44:02,268 INFO L290 TraceCheckUtils]: 116: Hoare triple {18689#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18711#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:44:02,268 INFO L290 TraceCheckUtils]: 117: Hoare triple {18711#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {18711#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:44:02,268 INFO L272 TraceCheckUtils]: 118: Hoare triple {18711#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,268 INFO L290 TraceCheckUtils]: 119: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,269 INFO L290 TraceCheckUtils]: 120: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,269 INFO L290 TraceCheckUtils]: 121: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,269 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {18343#true} {18711#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {18711#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-27 14:44:02,269 INFO L290 TraceCheckUtils]: 123: Hoare triple {18711#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18733#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:44:02,270 INFO L290 TraceCheckUtils]: 124: Hoare triple {18733#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {18733#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:44:02,270 INFO L272 TraceCheckUtils]: 125: Hoare triple {18733#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,270 INFO L290 TraceCheckUtils]: 126: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,270 INFO L290 TraceCheckUtils]: 127: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,270 INFO L290 TraceCheckUtils]: 128: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,270 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {18343#true} {18733#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {18733#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:44:02,271 INFO L290 TraceCheckUtils]: 130: Hoare triple {18733#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18755#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:02,271 INFO L290 TraceCheckUtils]: 131: Hoare triple {18755#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {18755#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:02,271 INFO L272 TraceCheckUtils]: 132: Hoare triple {18755#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,271 INFO L290 TraceCheckUtils]: 133: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,271 INFO L290 TraceCheckUtils]: 134: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,271 INFO L290 TraceCheckUtils]: 135: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,271 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {18343#true} {18755#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #54#return; {18755#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:02,272 INFO L290 TraceCheckUtils]: 137: Hoare triple {18755#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18777#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:44:02,272 INFO L290 TraceCheckUtils]: 138: Hoare triple {18777#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !false; {18777#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:44:02,272 INFO L272 TraceCheckUtils]: 139: Hoare triple {18777#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,272 INFO L290 TraceCheckUtils]: 140: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,272 INFO L290 TraceCheckUtils]: 141: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,272 INFO L290 TraceCheckUtils]: 142: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,273 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {18343#true} {18777#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} #54#return; {18777#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:44:02,273 INFO L290 TraceCheckUtils]: 144: Hoare triple {18777#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18799#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-27 14:44:02,273 INFO L290 TraceCheckUtils]: 145: Hoare triple {18799#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} assume !false; {18799#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-27 14:44:02,273 INFO L272 TraceCheckUtils]: 146: Hoare triple {18799#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,273 INFO L290 TraceCheckUtils]: 147: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,274 INFO L290 TraceCheckUtils]: 148: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,274 INFO L290 TraceCheckUtils]: 149: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,274 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {18343#true} {18799#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} #54#return; {18799#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-27 14:44:02,274 INFO L290 TraceCheckUtils]: 151: Hoare triple {18799#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18821#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-27 14:44:02,275 INFO L290 TraceCheckUtils]: 152: Hoare triple {18821#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {18821#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-27 14:44:02,275 INFO L272 TraceCheckUtils]: 153: Hoare triple {18821#(and (= main_~c~0 20) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,275 INFO L290 TraceCheckUtils]: 154: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,275 INFO L290 TraceCheckUtils]: 155: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,275 INFO L290 TraceCheckUtils]: 156: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,275 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {18343#true} {18821#(and (= main_~c~0 20) (= main_~y~0 20))} #54#return; {18821#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-27 14:44:02,275 INFO L290 TraceCheckUtils]: 158: Hoare triple {18821#(and (= main_~c~0 20) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18843#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:02,276 INFO L290 TraceCheckUtils]: 159: Hoare triple {18843#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !false; {18843#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:02,276 INFO L272 TraceCheckUtils]: 160: Hoare triple {18843#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,276 INFO L290 TraceCheckUtils]: 161: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,276 INFO L290 TraceCheckUtils]: 162: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,276 INFO L290 TraceCheckUtils]: 163: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,276 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {18343#true} {18843#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} #54#return; {18843#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:02,277 INFO L290 TraceCheckUtils]: 165: Hoare triple {18843#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18865#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-27 14:44:02,277 INFO L290 TraceCheckUtils]: 166: Hoare triple {18865#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {18865#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-27 14:44:02,277 INFO L272 TraceCheckUtils]: 167: Hoare triple {18865#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,277 INFO L290 TraceCheckUtils]: 168: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,277 INFO L290 TraceCheckUtils]: 169: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,277 INFO L290 TraceCheckUtils]: 170: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,278 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {18343#true} {18865#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #54#return; {18865#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-27 14:44:02,278 INFO L290 TraceCheckUtils]: 172: Hoare triple {18865#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18887#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:02,278 INFO L290 TraceCheckUtils]: 173: Hoare triple {18887#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {18887#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:02,278 INFO L272 TraceCheckUtils]: 174: Hoare triple {18887#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,278 INFO L290 TraceCheckUtils]: 175: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,279 INFO L290 TraceCheckUtils]: 176: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,279 INFO L290 TraceCheckUtils]: 177: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,279 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {18343#true} {18887#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} #54#return; {18887#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:02,279 INFO L290 TraceCheckUtils]: 179: Hoare triple {18887#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18909#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-27 14:44:02,280 INFO L290 TraceCheckUtils]: 180: Hoare triple {18909#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !false; {18909#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-27 14:44:02,280 INFO L272 TraceCheckUtils]: 181: Hoare triple {18909#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18343#true} is VALID [2022-04-27 14:44:02,280 INFO L290 TraceCheckUtils]: 182: Hoare triple {18343#true} ~cond := #in~cond; {18343#true} is VALID [2022-04-27 14:44:02,280 INFO L290 TraceCheckUtils]: 183: Hoare triple {18343#true} assume !(0 == ~cond); {18343#true} is VALID [2022-04-27 14:44:02,280 INFO L290 TraceCheckUtils]: 184: Hoare triple {18343#true} assume true; {18343#true} is VALID [2022-04-27 14:44:02,280 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {18343#true} {18909#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} #54#return; {18909#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-27 14:44:02,281 INFO L290 TraceCheckUtils]: 186: Hoare triple {18909#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !(~c~0 < ~k~0); {18931#(and (<= main_~k~0 24) (< 23 main_~k~0) (= main_~y~0 24))} is VALID [2022-04-27 14:44:02,282 INFO L272 TraceCheckUtils]: 187: Hoare triple {18931#(and (<= main_~k~0 24) (< 23 main_~k~0) (= main_~y~0 24))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18935#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:44:02,282 INFO L290 TraceCheckUtils]: 188: Hoare triple {18935#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18939#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:44:02,283 INFO L290 TraceCheckUtils]: 189: Hoare triple {18939#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18344#false} is VALID [2022-04-27 14:44:02,283 INFO L290 TraceCheckUtils]: 190: Hoare triple {18344#false} assume !false; {18344#false} is VALID [2022-04-27 14:44:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 50 proven. 900 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2022-04-27 14:44:02,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:44:02,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:44:02,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646778069] [2022-04-27 14:44:02,606 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:44:02,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153586927] [2022-04-27 14:44:02,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153586927] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:44:02,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:44:02,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2022-04-27 14:44:02,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316316744] [2022-04-27 14:44:02,606 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:44:02,607 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) Word has length 191 [2022-04-27 14:44:02,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:44:02,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-27 14:44:02,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:44:02,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 14:44:02,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:44:02,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 14:44:02,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 14:44:02,770 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-27 14:44:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:09,958 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2022-04-27 14:44:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-27 14:44:09,959 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) Word has length 191 [2022-04-27 14:44:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:44:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-27 14:44:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 128 transitions. [2022-04-27 14:44:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-27 14:44:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 128 transitions. [2022-04-27 14:44:09,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 128 transitions. [2022-04-27 14:44:10,213 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-27 14:44:10,215 INFO L225 Difference]: With dead ends: 108 [2022-04-27 14:44:10,215 INFO L226 Difference]: Without dead ends: 103 [2022-04-27 14:44:10,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 14:44:10,216 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-27 14:44:10,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1265 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2167 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-27 14:44:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-27 14:44:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-27 14:44:10,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:44:10,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 14:44:10,292 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 14:44:10,292 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 14:44:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:10,295 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-27 14:44:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-27 14:44:10,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:44:10,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:44:10,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 103 states. [2022-04-27 14:44:10,296 INFO L87 Difference]: Start difference. First operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 103 states. [2022-04-27 14:44:10,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:10,297 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-27 14:44:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-27 14:44:10,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:44:10,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:44:10,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:44:10,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:44:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 14:44:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2022-04-27 14:44:10,300 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 191 [2022-04-27 14:44:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:44:10,300 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2022-04-27 14:44:10,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-27 14:44:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-27 14:44:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-04-27 14:44:10,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:44:10,301 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:44:10,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-27 14:44:10,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-27 14:44:10,507 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:44:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:44:10,508 INFO L85 PathProgramCache]: Analyzing trace with hash 447117384, now seen corresponding path program 25 times [2022-04-27 14:44:10,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:44:10,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859049751] [2022-04-27 14:44:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:44:10,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:44:10,524 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:44:10,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1491180] [2022-04-27 14:44:10,524 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:44:10,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:44:10,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:44:10,525 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:44:10,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-27 14:44:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:44:11,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-27 14:44:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:44:11,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:44:12,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {19534#true} call ULTIMATE.init(); {19534#true} is VALID [2022-04-27 14:44:12,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {19534#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(9, 2);call #Ultimate.allocInit(12, 3); {19534#true} is VALID [2022-04-27 14:44:12,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19534#true} {19534#true} #60#return; {19534#true} is VALID [2022-04-27 14:44:12,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {19534#true} call #t~ret5 := main(); {19534#true} is VALID [2022-04-27 14:44:12,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {19534#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {19534#true} is VALID [2022-04-27 14:44:12,469 INFO L272 TraceCheckUtils]: 6: Hoare triple {19534#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,469 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19534#true} {19534#true} #52#return; {19534#true} is VALID [2022-04-27 14:44:12,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {19534#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {19572#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:12,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {19572#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {19572#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:12,479 INFO L272 TraceCheckUtils]: 13: Hoare triple {19572#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,480 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19534#true} {19572#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {19572#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:12,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {19572#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:44:12,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {19594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {19594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:44:12,481 INFO L272 TraceCheckUtils]: 20: Hoare triple {19594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,481 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {19534#true} {19594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {19594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:44:12,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {19594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19616#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:44:12,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {19616#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {19616#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:44:12,482 INFO L272 TraceCheckUtils]: 27: Hoare triple {19616#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,483 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {19534#true} {19616#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {19616#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:44:12,483 INFO L290 TraceCheckUtils]: 32: Hoare triple {19616#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19638#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:44:12,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {19638#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {19638#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:44:12,484 INFO L272 TraceCheckUtils]: 34: Hoare triple {19638#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,484 INFO L290 TraceCheckUtils]: 37: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,484 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {19534#true} {19638#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {19638#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:44:12,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {19638#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19660#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:44:12,485 INFO L290 TraceCheckUtils]: 40: Hoare triple {19660#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {19660#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:44:12,485 INFO L272 TraceCheckUtils]: 41: Hoare triple {19660#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,486 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19534#true} {19660#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {19660#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:44:12,486 INFO L290 TraceCheckUtils]: 46: Hoare triple {19660#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19682#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:44:12,487 INFO L290 TraceCheckUtils]: 47: Hoare triple {19682#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {19682#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:44:12,487 INFO L272 TraceCheckUtils]: 48: Hoare triple {19682#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,487 INFO L290 TraceCheckUtils]: 49: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,487 INFO L290 TraceCheckUtils]: 50: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,487 INFO L290 TraceCheckUtils]: 51: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,487 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19534#true} {19682#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {19682#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:44:12,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {19682#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19704#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:44:12,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {19704#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {19704#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:44:12,488 INFO L272 TraceCheckUtils]: 55: Hoare triple {19704#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,488 INFO L290 TraceCheckUtils]: 56: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,488 INFO L290 TraceCheckUtils]: 57: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,489 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19534#true} {19704#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {19704#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:44:12,489 INFO L290 TraceCheckUtils]: 60: Hoare triple {19704#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19726#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:12,490 INFO L290 TraceCheckUtils]: 61: Hoare triple {19726#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {19726#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:12,490 INFO L272 TraceCheckUtils]: 62: Hoare triple {19726#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,490 INFO L290 TraceCheckUtils]: 63: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,490 INFO L290 TraceCheckUtils]: 64: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,490 INFO L290 TraceCheckUtils]: 65: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,490 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {19534#true} {19726#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {19726#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:12,491 INFO L290 TraceCheckUtils]: 67: Hoare triple {19726#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19748#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:44:12,491 INFO L290 TraceCheckUtils]: 68: Hoare triple {19748#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {19748#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:44:12,491 INFO L272 TraceCheckUtils]: 69: Hoare triple {19748#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,491 INFO L290 TraceCheckUtils]: 70: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,491 INFO L290 TraceCheckUtils]: 71: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,491 INFO L290 TraceCheckUtils]: 72: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,492 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {19534#true} {19748#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #54#return; {19748#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 14:44:12,492 INFO L290 TraceCheckUtils]: 74: Hoare triple {19748#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19770#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:12,492 INFO L290 TraceCheckUtils]: 75: Hoare triple {19770#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {19770#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:12,493 INFO L272 TraceCheckUtils]: 76: Hoare triple {19770#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,493 INFO L290 TraceCheckUtils]: 77: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,493 INFO L290 TraceCheckUtils]: 78: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,493 INFO L290 TraceCheckUtils]: 79: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,493 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {19534#true} {19770#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #54#return; {19770#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:12,494 INFO L290 TraceCheckUtils]: 81: Hoare triple {19770#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19792#(and (= 9 (+ (- 1) main_~y~0)) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:44:12,494 INFO L290 TraceCheckUtils]: 82: Hoare triple {19792#(and (= 9 (+ (- 1) main_~y~0)) (= 7 (+ main_~c~0 (- 3))))} assume !false; {19792#(and (= 9 (+ (- 1) main_~y~0)) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:44:12,494 INFO L272 TraceCheckUtils]: 83: Hoare triple {19792#(and (= 9 (+ (- 1) main_~y~0)) (= 7 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,494 INFO L290 TraceCheckUtils]: 84: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,494 INFO L290 TraceCheckUtils]: 85: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,494 INFO L290 TraceCheckUtils]: 86: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,495 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {19534#true} {19792#(and (= 9 (+ (- 1) main_~y~0)) (= 7 (+ main_~c~0 (- 3))))} #54#return; {19792#(and (= 9 (+ (- 1) main_~y~0)) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:44:12,495 INFO L290 TraceCheckUtils]: 88: Hoare triple {19792#(and (= 9 (+ (- 1) main_~y~0)) (= 7 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19814#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-27 14:44:12,495 INFO L290 TraceCheckUtils]: 89: Hoare triple {19814#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} assume !false; {19814#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-27 14:44:12,495 INFO L272 TraceCheckUtils]: 90: Hoare triple {19814#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,495 INFO L290 TraceCheckUtils]: 91: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,496 INFO L290 TraceCheckUtils]: 92: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,496 INFO L290 TraceCheckUtils]: 93: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,496 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {19534#true} {19814#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} #54#return; {19814#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-27 14:44:12,496 INFO L290 TraceCheckUtils]: 95: Hoare triple {19814#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19836#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-27 14:44:12,497 INFO L290 TraceCheckUtils]: 96: Hoare triple {19836#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9))} assume !false; {19836#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-27 14:44:12,497 INFO L272 TraceCheckUtils]: 97: Hoare triple {19836#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,497 INFO L290 TraceCheckUtils]: 98: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,497 INFO L290 TraceCheckUtils]: 99: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,497 INFO L290 TraceCheckUtils]: 100: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,497 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {19534#true} {19836#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9))} #54#return; {19836#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-27 14:44:12,498 INFO L290 TraceCheckUtils]: 102: Hoare triple {19836#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19858#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:44:12,498 INFO L290 TraceCheckUtils]: 103: Hoare triple {19858#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {19858#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:44:12,498 INFO L272 TraceCheckUtils]: 104: Hoare triple {19858#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,498 INFO L290 TraceCheckUtils]: 105: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,498 INFO L290 TraceCheckUtils]: 106: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,498 INFO L290 TraceCheckUtils]: 107: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,499 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19534#true} {19858#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {19858#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:44:12,499 INFO L290 TraceCheckUtils]: 109: Hoare triple {19858#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19880#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:44:12,500 INFO L290 TraceCheckUtils]: 110: Hoare triple {19880#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !false; {19880#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:44:12,500 INFO L272 TraceCheckUtils]: 111: Hoare triple {19880#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,500 INFO L290 TraceCheckUtils]: 112: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,500 INFO L290 TraceCheckUtils]: 113: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,500 INFO L290 TraceCheckUtils]: 114: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,500 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {19534#true} {19880#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} #54#return; {19880#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:44:12,501 INFO L290 TraceCheckUtils]: 116: Hoare triple {19880#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19902#(and (= (+ (- 2) main_~y~0) 13) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:12,501 INFO L290 TraceCheckUtils]: 117: Hoare triple {19902#(and (= (+ (- 2) main_~y~0) 13) (= 13 (+ (- 2) main_~c~0)))} assume !false; {19902#(and (= (+ (- 2) main_~y~0) 13) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:12,501 INFO L272 TraceCheckUtils]: 118: Hoare triple {19902#(and (= (+ (- 2) main_~y~0) 13) (= 13 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,501 INFO L290 TraceCheckUtils]: 119: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,501 INFO L290 TraceCheckUtils]: 120: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,501 INFO L290 TraceCheckUtils]: 121: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,502 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {19534#true} {19902#(and (= (+ (- 2) main_~y~0) 13) (= 13 (+ (- 2) main_~c~0)))} #54#return; {19902#(and (= (+ (- 2) main_~y~0) 13) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:12,502 INFO L290 TraceCheckUtils]: 123: Hoare triple {19902#(and (= (+ (- 2) main_~y~0) 13) (= 13 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19924#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:44:12,502 INFO L290 TraceCheckUtils]: 124: Hoare triple {19924#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {19924#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:44:12,502 INFO L272 TraceCheckUtils]: 125: Hoare triple {19924#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,502 INFO L290 TraceCheckUtils]: 126: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,502 INFO L290 TraceCheckUtils]: 127: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,503 INFO L290 TraceCheckUtils]: 128: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,503 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {19534#true} {19924#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {19924#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:44:12,503 INFO L290 TraceCheckUtils]: 130: Hoare triple {19924#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19946#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:12,504 INFO L290 TraceCheckUtils]: 131: Hoare triple {19946#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {19946#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:12,504 INFO L272 TraceCheckUtils]: 132: Hoare triple {19946#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,504 INFO L290 TraceCheckUtils]: 133: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,504 INFO L290 TraceCheckUtils]: 134: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,504 INFO L290 TraceCheckUtils]: 135: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,504 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {19534#true} {19946#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #54#return; {19946#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:12,505 INFO L290 TraceCheckUtils]: 137: Hoare triple {19946#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19968#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:44:12,505 INFO L290 TraceCheckUtils]: 138: Hoare triple {19968#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !false; {19968#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:44:12,505 INFO L272 TraceCheckUtils]: 139: Hoare triple {19968#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,505 INFO L290 TraceCheckUtils]: 140: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,505 INFO L290 TraceCheckUtils]: 141: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,505 INFO L290 TraceCheckUtils]: 142: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,506 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {19534#true} {19968#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} #54#return; {19968#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:44:12,506 INFO L290 TraceCheckUtils]: 144: Hoare triple {19968#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19990#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:44:12,506 INFO L290 TraceCheckUtils]: 145: Hoare triple {19990#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {19990#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:44:12,506 INFO L272 TraceCheckUtils]: 146: Hoare triple {19990#(and (= 19 main_~y~0) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,506 INFO L290 TraceCheckUtils]: 147: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,507 INFO L290 TraceCheckUtils]: 148: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,507 INFO L290 TraceCheckUtils]: 149: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,507 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {19534#true} {19990#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {19990#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:44:12,507 INFO L290 TraceCheckUtils]: 151: Hoare triple {19990#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20012#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:12,508 INFO L290 TraceCheckUtils]: 152: Hoare triple {20012#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {20012#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:12,508 INFO L272 TraceCheckUtils]: 153: Hoare triple {20012#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,508 INFO L290 TraceCheckUtils]: 154: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,508 INFO L290 TraceCheckUtils]: 155: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,508 INFO L290 TraceCheckUtils]: 156: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,508 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {19534#true} {20012#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #54#return; {20012#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:12,509 INFO L290 TraceCheckUtils]: 158: Hoare triple {20012#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20034#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:12,509 INFO L290 TraceCheckUtils]: 159: Hoare triple {20034#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} assume !false; {20034#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:12,509 INFO L272 TraceCheckUtils]: 160: Hoare triple {20034#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,509 INFO L290 TraceCheckUtils]: 161: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,509 INFO L290 TraceCheckUtils]: 162: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,509 INFO L290 TraceCheckUtils]: 163: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,510 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {19534#true} {20034#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} #54#return; {20034#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:12,510 INFO L290 TraceCheckUtils]: 165: Hoare triple {20034#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20056#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:12,510 INFO L290 TraceCheckUtils]: 166: Hoare triple {20056#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} assume !false; {20056#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:12,510 INFO L272 TraceCheckUtils]: 167: Hoare triple {20056#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,510 INFO L290 TraceCheckUtils]: 168: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,510 INFO L290 TraceCheckUtils]: 169: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,510 INFO L290 TraceCheckUtils]: 170: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,511 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {19534#true} {20056#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} #54#return; {20056#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:12,511 INFO L290 TraceCheckUtils]: 172: Hoare triple {20056#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20078#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0))} is VALID [2022-04-27 14:44:12,512 INFO L290 TraceCheckUtils]: 173: Hoare triple {20078#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0))} assume !false; {20078#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0))} is VALID [2022-04-27 14:44:12,512 INFO L272 TraceCheckUtils]: 174: Hoare triple {20078#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,512 INFO L290 TraceCheckUtils]: 175: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,512 INFO L290 TraceCheckUtils]: 176: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,512 INFO L290 TraceCheckUtils]: 177: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,512 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {19534#true} {20078#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0))} #54#return; {20078#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0))} is VALID [2022-04-27 14:44:12,513 INFO L290 TraceCheckUtils]: 179: Hoare triple {20078#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20100#(and (= (+ main_~y~0 (- 3)) 21) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:12,513 INFO L290 TraceCheckUtils]: 180: Hoare triple {20100#(and (= (+ main_~y~0 (- 3)) 21) (= 23 (+ (- 1) main_~c~0)))} assume !false; {20100#(and (= (+ main_~y~0 (- 3)) 21) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:12,513 INFO L272 TraceCheckUtils]: 181: Hoare triple {20100#(and (= (+ main_~y~0 (- 3)) 21) (= 23 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,514 INFO L290 TraceCheckUtils]: 182: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,514 INFO L290 TraceCheckUtils]: 183: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,514 INFO L290 TraceCheckUtils]: 184: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,514 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {19534#true} {20100#(and (= (+ main_~y~0 (- 3)) 21) (= 23 (+ (- 1) main_~c~0)))} #54#return; {20100#(and (= (+ main_~y~0 (- 3)) 21) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:12,515 INFO L290 TraceCheckUtils]: 186: Hoare triple {20100#(and (= (+ main_~y~0 (- 3)) 21) (= 23 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20122#(and (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0) (<= main_~c~0 25))} is VALID [2022-04-27 14:44:12,515 INFO L290 TraceCheckUtils]: 187: Hoare triple {20122#(and (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0) (<= main_~c~0 25))} assume !false; {20122#(and (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0) (<= main_~c~0 25))} is VALID [2022-04-27 14:44:12,515 INFO L272 TraceCheckUtils]: 188: Hoare triple {20122#(and (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0) (<= main_~c~0 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19534#true} is VALID [2022-04-27 14:44:12,515 INFO L290 TraceCheckUtils]: 189: Hoare triple {19534#true} ~cond := #in~cond; {19534#true} is VALID [2022-04-27 14:44:12,515 INFO L290 TraceCheckUtils]: 190: Hoare triple {19534#true} assume !(0 == ~cond); {19534#true} is VALID [2022-04-27 14:44:12,515 INFO L290 TraceCheckUtils]: 191: Hoare triple {19534#true} assume true; {19534#true} is VALID [2022-04-27 14:44:12,516 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {19534#true} {20122#(and (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0) (<= main_~c~0 25))} #54#return; {20122#(and (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0) (<= main_~c~0 25))} is VALID [2022-04-27 14:44:12,518 INFO L290 TraceCheckUtils]: 193: Hoare triple {20122#(and (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0) (<= main_~c~0 25))} assume !(~c~0 < ~k~0); {20144#(and (<= main_~k~0 25) (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0))} is VALID [2022-04-27 14:44:12,519 INFO L272 TraceCheckUtils]: 194: Hoare triple {20144#(and (<= main_~k~0 25) (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:44:12,519 INFO L290 TraceCheckUtils]: 195: Hoare triple {20148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:44:12,519 INFO L290 TraceCheckUtils]: 196: Hoare triple {20152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19535#false} is VALID [2022-04-27 14:44:12,519 INFO L290 TraceCheckUtils]: 197: Hoare triple {19535#false} assume !false; {19535#false} is VALID [2022-04-27 14:44:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 52 proven. 975 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2022-04-27 14:44:12,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:44:12,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:44:12,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859049751] [2022-04-27 14:44:12,834 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:44:12,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491180] [2022-04-27 14:44:12,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491180] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:44:12,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:44:12,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2022-04-27 14:44:12,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244111524] [2022-04-27 14:44:12,835 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:44:12,835 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) Word has length 198 [2022-04-27 14:44:12,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:44:12,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-27 14:44:12,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:44:12,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-27 14:44:12,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:44:12,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-27 14:44:12,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 14:44:12,998 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-27 14:44:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:20,952 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-04-27 14:44:20,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 14:44:20,952 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) Word has length 198 [2022-04-27 14:44:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:44:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-27 14:44:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 132 transitions. [2022-04-27 14:44:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-27 14:44:20,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 132 transitions. [2022-04-27 14:44:20,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 132 transitions. [2022-04-27 14:44:21,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:44:21,263 INFO L225 Difference]: With dead ends: 111 [2022-04-27 14:44:21,263 INFO L226 Difference]: Without dead ends: 106 [2022-04-27 14:44:21,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=1154, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 14:44:21,264 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:44:21,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1339 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-27 14:44:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-27 14:44:21,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-27 14:44:21,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:44:21,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 14:44:21,333 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 14:44:21,333 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 14:44:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:21,335 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-04-27 14:44:21,335 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-27 14:44:21,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:44:21,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:44:21,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 106 states. [2022-04-27 14:44:21,337 INFO L87 Difference]: Start difference. First operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 106 states. [2022-04-27 14:44:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:21,338 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-04-27 14:44:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-27 14:44:21,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:44:21,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:44:21,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:44:21,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:44:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 14:44:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-27 14:44:21,341 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 198 [2022-04-27 14:44:21,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:44:21,341 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-27 14:44:21,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-27 14:44:21,341 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-27 14:44:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-04-27 14:44:21,342 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:44:21,342 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:44:21,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-27 14:44:21,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-27 14:44:21,548 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:44:21,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:44:21,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1629673417, now seen corresponding path program 26 times [2022-04-27 14:44:21,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:44:21,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299448050] [2022-04-27 14:44:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:44:21,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:44:21,563 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:44:21,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [881219487] [2022-04-27 14:44:21,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:44:21,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:44:21,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:44:21,564 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:44:21,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-27 14:44:22,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:44:22,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:44:22,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-27 14:44:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:44:22,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:44:23,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {20763#true} call ULTIMATE.init(); {20763#true} is VALID [2022-04-27 14:44:23,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {20763#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(9, 2);call #Ultimate.allocInit(12, 3); {20763#true} is VALID [2022-04-27 14:44:23,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20763#true} {20763#true} #60#return; {20763#true} is VALID [2022-04-27 14:44:23,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {20763#true} call #t~ret5 := main(); {20763#true} is VALID [2022-04-27 14:44:23,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {20763#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {20763#true} is VALID [2022-04-27 14:44:23,355 INFO L272 TraceCheckUtils]: 6: Hoare triple {20763#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,355 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20763#true} {20763#true} #52#return; {20763#true} is VALID [2022-04-27 14:44:23,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {20763#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {20801#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:23,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {20801#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {20801#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:23,356 INFO L272 TraceCheckUtils]: 13: Hoare triple {20801#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,356 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20763#true} {20801#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {20801#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:23,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {20801#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20823#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:44:23,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {20823#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {20823#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:44:23,357 INFO L272 TraceCheckUtils]: 20: Hoare triple {20823#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,358 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {20763#true} {20823#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {20823#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:44:23,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {20823#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20845#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:23,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {20845#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {20845#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:23,358 INFO L272 TraceCheckUtils]: 27: Hoare triple {20845#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,359 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20763#true} {20845#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {20845#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:23,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {20845#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20867#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:44:23,360 INFO L290 TraceCheckUtils]: 33: Hoare triple {20867#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {20867#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:44:23,360 INFO L272 TraceCheckUtils]: 34: Hoare triple {20867#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,360 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20763#true} {20867#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {20867#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:44:23,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {20867#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20889#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:44:23,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {20889#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} assume !false; {20889#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:44:23,361 INFO L272 TraceCheckUtils]: 41: Hoare triple {20889#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,361 INFO L290 TraceCheckUtils]: 43: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,362 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20763#true} {20889#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} #54#return; {20889#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:44:23,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {20889#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20911#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:44:23,363 INFO L290 TraceCheckUtils]: 47: Hoare triple {20911#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {20911#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:44:23,363 INFO L272 TraceCheckUtils]: 48: Hoare triple {20911#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,363 INFO L290 TraceCheckUtils]: 49: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,363 INFO L290 TraceCheckUtils]: 50: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,363 INFO L290 TraceCheckUtils]: 51: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,364 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20763#true} {20911#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {20911#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:44:23,364 INFO L290 TraceCheckUtils]: 53: Hoare triple {20911#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20933#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:44:23,364 INFO L290 TraceCheckUtils]: 54: Hoare triple {20933#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {20933#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:44:23,364 INFO L272 TraceCheckUtils]: 55: Hoare triple {20933#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,364 INFO L290 TraceCheckUtils]: 56: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,364 INFO L290 TraceCheckUtils]: 57: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,365 INFO L290 TraceCheckUtils]: 58: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,365 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20763#true} {20933#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {20933#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:44:23,365 INFO L290 TraceCheckUtils]: 60: Hoare triple {20933#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20955#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:23,366 INFO L290 TraceCheckUtils]: 61: Hoare triple {20955#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !false; {20955#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:23,366 INFO L272 TraceCheckUtils]: 62: Hoare triple {20955#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,366 INFO L290 TraceCheckUtils]: 63: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,366 INFO L290 TraceCheckUtils]: 64: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,366 INFO L290 TraceCheckUtils]: 65: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,366 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20763#true} {20955#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} #54#return; {20955#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:23,367 INFO L290 TraceCheckUtils]: 67: Hoare triple {20955#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20977#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:44:23,367 INFO L290 TraceCheckUtils]: 68: Hoare triple {20977#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} assume !false; {20977#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:44:23,367 INFO L272 TraceCheckUtils]: 69: Hoare triple {20977#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,367 INFO L290 TraceCheckUtils]: 70: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,367 INFO L290 TraceCheckUtils]: 71: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,367 INFO L290 TraceCheckUtils]: 72: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,367 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20763#true} {20977#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} #54#return; {20977#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:44:23,368 INFO L290 TraceCheckUtils]: 74: Hoare triple {20977#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20999#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-27 14:44:23,368 INFO L290 TraceCheckUtils]: 75: Hoare triple {20999#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !false; {20999#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-27 14:44:23,368 INFO L272 TraceCheckUtils]: 76: Hoare triple {20999#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,368 INFO L290 TraceCheckUtils]: 77: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,368 INFO L290 TraceCheckUtils]: 78: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,368 INFO L290 TraceCheckUtils]: 79: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,371 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {20763#true} {20999#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} #54#return; {20999#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-27 14:44:23,372 INFO L290 TraceCheckUtils]: 81: Hoare triple {20999#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21021#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:44:23,372 INFO L290 TraceCheckUtils]: 82: Hoare triple {21021#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} assume !false; {21021#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:44:23,372 INFO L272 TraceCheckUtils]: 83: Hoare triple {21021#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,372 INFO L290 TraceCheckUtils]: 84: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,372 INFO L290 TraceCheckUtils]: 85: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,372 INFO L290 TraceCheckUtils]: 86: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,373 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {20763#true} {21021#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} #54#return; {21021#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:44:23,373 INFO L290 TraceCheckUtils]: 88: Hoare triple {21021#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21043#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-27 14:44:23,374 INFO L290 TraceCheckUtils]: 89: Hoare triple {21043#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {21043#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-27 14:44:23,374 INFO L272 TraceCheckUtils]: 90: Hoare triple {21043#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,374 INFO L290 TraceCheckUtils]: 91: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,374 INFO L290 TraceCheckUtils]: 92: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,374 INFO L290 TraceCheckUtils]: 93: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,374 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {20763#true} {21043#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #54#return; {21043#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-27 14:44:23,375 INFO L290 TraceCheckUtils]: 95: Hoare triple {21043#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21065#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:44:23,375 INFO L290 TraceCheckUtils]: 96: Hoare triple {21065#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {21065#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:44:23,375 INFO L272 TraceCheckUtils]: 97: Hoare triple {21065#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,375 INFO L290 TraceCheckUtils]: 98: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,375 INFO L290 TraceCheckUtils]: 99: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,375 INFO L290 TraceCheckUtils]: 100: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,376 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {20763#true} {21065#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {21065#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:44:23,376 INFO L290 TraceCheckUtils]: 102: Hoare triple {21065#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21087#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:23,377 INFO L290 TraceCheckUtils]: 103: Hoare triple {21087#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {21087#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:23,377 INFO L272 TraceCheckUtils]: 104: Hoare triple {21087#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,377 INFO L290 TraceCheckUtils]: 105: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,377 INFO L290 TraceCheckUtils]: 106: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,377 INFO L290 TraceCheckUtils]: 107: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,377 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {20763#true} {21087#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {21087#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:23,378 INFO L290 TraceCheckUtils]: 109: Hoare triple {21087#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21109#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:44:23,378 INFO L290 TraceCheckUtils]: 110: Hoare triple {21109#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} assume !false; {21109#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:44:23,378 INFO L272 TraceCheckUtils]: 111: Hoare triple {21109#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,378 INFO L290 TraceCheckUtils]: 112: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,378 INFO L290 TraceCheckUtils]: 113: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,378 INFO L290 TraceCheckUtils]: 114: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,379 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {20763#true} {21109#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} #54#return; {21109#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 14:44:23,379 INFO L290 TraceCheckUtils]: 116: Hoare triple {21109#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21131#(and (= (+ main_~y~0 (- 3)) 12) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:23,380 INFO L290 TraceCheckUtils]: 117: Hoare triple {21131#(and (= (+ main_~y~0 (- 3)) 12) (= 13 (+ (- 2) main_~c~0)))} assume !false; {21131#(and (= (+ main_~y~0 (- 3)) 12) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:23,380 INFO L272 TraceCheckUtils]: 118: Hoare triple {21131#(and (= (+ main_~y~0 (- 3)) 12) (= 13 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,380 INFO L290 TraceCheckUtils]: 119: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,380 INFO L290 TraceCheckUtils]: 120: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,380 INFO L290 TraceCheckUtils]: 121: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,380 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {20763#true} {21131#(and (= (+ main_~y~0 (- 3)) 12) (= 13 (+ (- 2) main_~c~0)))} #54#return; {21131#(and (= (+ main_~y~0 (- 3)) 12) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:23,381 INFO L290 TraceCheckUtils]: 123: Hoare triple {21131#(and (= (+ main_~y~0 (- 3)) 12) (= 13 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21153#(and (= (+ main_~c~0 (- 3)) 13) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-27 14:44:23,381 INFO L290 TraceCheckUtils]: 124: Hoare triple {21153#(and (= (+ main_~c~0 (- 3)) 13) (= (+ main_~y~0 (- 4)) 12))} assume !false; {21153#(and (= (+ main_~c~0 (- 3)) 13) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-27 14:44:23,381 INFO L272 TraceCheckUtils]: 125: Hoare triple {21153#(and (= (+ main_~c~0 (- 3)) 13) (= (+ main_~y~0 (- 4)) 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,381 INFO L290 TraceCheckUtils]: 126: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,381 INFO L290 TraceCheckUtils]: 127: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,381 INFO L290 TraceCheckUtils]: 128: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,382 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {20763#true} {21153#(and (= (+ main_~c~0 (- 3)) 13) (= (+ main_~y~0 (- 4)) 12))} #54#return; {21153#(and (= (+ main_~c~0 (- 3)) 13) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-27 14:44:23,382 INFO L290 TraceCheckUtils]: 130: Hoare triple {21153#(and (= (+ main_~c~0 (- 3)) 13) (= (+ main_~y~0 (- 4)) 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21175#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:44:23,383 INFO L290 TraceCheckUtils]: 131: Hoare triple {21175#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {21175#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:44:23,383 INFO L272 TraceCheckUtils]: 132: Hoare triple {21175#(and (= main_~c~0 17) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,383 INFO L290 TraceCheckUtils]: 133: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,383 INFO L290 TraceCheckUtils]: 134: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,383 INFO L290 TraceCheckUtils]: 135: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,383 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {20763#true} {21175#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {21175#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:44:23,384 INFO L290 TraceCheckUtils]: 137: Hoare triple {21175#(and (= main_~c~0 17) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21197#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-27 14:44:23,384 INFO L290 TraceCheckUtils]: 138: Hoare triple {21197#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !false; {21197#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-27 14:44:23,384 INFO L272 TraceCheckUtils]: 139: Hoare triple {21197#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,384 INFO L290 TraceCheckUtils]: 140: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,384 INFO L290 TraceCheckUtils]: 141: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,384 INFO L290 TraceCheckUtils]: 142: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,385 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {20763#true} {21197#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} #54#return; {21197#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-27 14:44:23,385 INFO L290 TraceCheckUtils]: 144: Hoare triple {21197#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21219#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:23,386 INFO L290 TraceCheckUtils]: 145: Hoare triple {21219#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} assume !false; {21219#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:23,386 INFO L272 TraceCheckUtils]: 146: Hoare triple {21219#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,386 INFO L290 TraceCheckUtils]: 147: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,386 INFO L290 TraceCheckUtils]: 148: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,386 INFO L290 TraceCheckUtils]: 149: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,386 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {20763#true} {21219#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} #54#return; {21219#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:23,387 INFO L290 TraceCheckUtils]: 151: Hoare triple {21219#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21241#(and (= (+ main_~c~0 (- 3)) 17) (= (+ (- 2) main_~y~0) 18))} is VALID [2022-04-27 14:44:23,387 INFO L290 TraceCheckUtils]: 152: Hoare triple {21241#(and (= (+ main_~c~0 (- 3)) 17) (= (+ (- 2) main_~y~0) 18))} assume !false; {21241#(and (= (+ main_~c~0 (- 3)) 17) (= (+ (- 2) main_~y~0) 18))} is VALID [2022-04-27 14:44:23,387 INFO L272 TraceCheckUtils]: 153: Hoare triple {21241#(and (= (+ main_~c~0 (- 3)) 17) (= (+ (- 2) main_~y~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,387 INFO L290 TraceCheckUtils]: 154: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,387 INFO L290 TraceCheckUtils]: 155: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,387 INFO L290 TraceCheckUtils]: 156: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,388 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {20763#true} {21241#(and (= (+ main_~c~0 (- 3)) 17) (= (+ (- 2) main_~y~0) 18))} #54#return; {21241#(and (= (+ main_~c~0 (- 3)) 17) (= (+ (- 2) main_~y~0) 18))} is VALID [2022-04-27 14:44:23,388 INFO L290 TraceCheckUtils]: 158: Hoare triple {21241#(and (= (+ main_~c~0 (- 3)) 17) (= (+ (- 2) main_~y~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21263#(and (= 17 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-27 14:44:23,388 INFO L290 TraceCheckUtils]: 159: Hoare triple {21263#(and (= 17 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 18))} assume !false; {21263#(and (= 17 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-27 14:44:23,388 INFO L272 TraceCheckUtils]: 160: Hoare triple {21263#(and (= 17 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,389 INFO L290 TraceCheckUtils]: 161: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,389 INFO L290 TraceCheckUtils]: 162: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,389 INFO L290 TraceCheckUtils]: 163: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,389 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {20763#true} {21263#(and (= 17 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 18))} #54#return; {21263#(and (= 17 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-27 14:44:23,389 INFO L290 TraceCheckUtils]: 165: Hoare triple {21263#(and (= 17 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21285#(and (= (+ main_~c~0 (- 5)) 17) (= main_~y~0 22))} is VALID [2022-04-27 14:44:23,390 INFO L290 TraceCheckUtils]: 166: Hoare triple {21285#(and (= (+ main_~c~0 (- 5)) 17) (= main_~y~0 22))} assume !false; {21285#(and (= (+ main_~c~0 (- 5)) 17) (= main_~y~0 22))} is VALID [2022-04-27 14:44:23,390 INFO L272 TraceCheckUtils]: 167: Hoare triple {21285#(and (= (+ main_~c~0 (- 5)) 17) (= main_~y~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,390 INFO L290 TraceCheckUtils]: 168: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,390 INFO L290 TraceCheckUtils]: 169: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,390 INFO L290 TraceCheckUtils]: 170: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,390 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {20763#true} {21285#(and (= (+ main_~c~0 (- 5)) 17) (= main_~y~0 22))} #54#return; {21285#(and (= (+ main_~c~0 (- 5)) 17) (= main_~y~0 22))} is VALID [2022-04-27 14:44:23,391 INFO L290 TraceCheckUtils]: 172: Hoare triple {21285#(and (= (+ main_~c~0 (- 5)) 17) (= main_~y~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21307#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:23,391 INFO L290 TraceCheckUtils]: 173: Hoare triple {21307#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {21307#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:23,391 INFO L272 TraceCheckUtils]: 174: Hoare triple {21307#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,391 INFO L290 TraceCheckUtils]: 175: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,391 INFO L290 TraceCheckUtils]: 176: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,391 INFO L290 TraceCheckUtils]: 177: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,392 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {20763#true} {21307#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} #54#return; {21307#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:23,392 INFO L290 TraceCheckUtils]: 179: Hoare triple {21307#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21329#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:23,393 INFO L290 TraceCheckUtils]: 180: Hoare triple {21329#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !false; {21329#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:23,393 INFO L272 TraceCheckUtils]: 181: Hoare triple {21329#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,393 INFO L290 TraceCheckUtils]: 182: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,393 INFO L290 TraceCheckUtils]: 183: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,393 INFO L290 TraceCheckUtils]: 184: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,393 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {20763#true} {21329#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} #54#return; {21329#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:23,394 INFO L290 TraceCheckUtils]: 186: Hoare triple {21329#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21351#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-27 14:44:23,394 INFO L290 TraceCheckUtils]: 187: Hoare triple {21351#(and (= main_~y~0 25) (= main_~c~0 25))} assume !false; {21351#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-27 14:44:23,394 INFO L272 TraceCheckUtils]: 188: Hoare triple {21351#(and (= main_~y~0 25) (= main_~c~0 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,394 INFO L290 TraceCheckUtils]: 189: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,394 INFO L290 TraceCheckUtils]: 190: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,394 INFO L290 TraceCheckUtils]: 191: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,395 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {20763#true} {21351#(and (= main_~y~0 25) (= main_~c~0 25))} #54#return; {21351#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-27 14:44:23,395 INFO L290 TraceCheckUtils]: 193: Hoare triple {21351#(and (= main_~y~0 25) (= main_~c~0 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21373#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-27 14:44:23,395 INFO L290 TraceCheckUtils]: 194: Hoare triple {21373#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} assume !false; {21373#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-27 14:44:23,396 INFO L272 TraceCheckUtils]: 195: Hoare triple {21373#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20763#true} is VALID [2022-04-27 14:44:23,396 INFO L290 TraceCheckUtils]: 196: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-27 14:44:23,396 INFO L290 TraceCheckUtils]: 197: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-27 14:44:23,396 INFO L290 TraceCheckUtils]: 198: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-27 14:44:23,396 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {20763#true} {21373#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} #54#return; {21373#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-27 14:44:23,397 INFO L290 TraceCheckUtils]: 200: Hoare triple {21373#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} assume !(~c~0 < ~k~0); {21395#(and (<= main_~k~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-27 14:44:23,398 INFO L272 TraceCheckUtils]: 201: Hoare triple {21395#(and (<= main_~k~0 26) (< 25 main_~k~0) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21399#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:44:23,398 INFO L290 TraceCheckUtils]: 202: Hoare triple {21399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:44:23,399 INFO L290 TraceCheckUtils]: 203: Hoare triple {21403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20764#false} is VALID [2022-04-27 14:44:23,399 INFO L290 TraceCheckUtils]: 204: Hoare triple {20764#false} assume !false; {20764#false} is VALID [2022-04-27 14:44:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2511 backedges. 54 proven. 1053 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-04-27 14:44:23,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:44:23,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:44:23,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299448050] [2022-04-27 14:44:23,752 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:44:23,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881219487] [2022-04-27 14:44:23,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881219487] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:44:23,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:44:23,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2022-04-27 14:44:23,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725360491] [2022-04-27 14:44:23,753 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:44:23,773 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) Word has length 205 [2022-04-27 14:44:23,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:44:23,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-27 14:44:23,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:44:23,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-27 14:44:23,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:44:23,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-27 14:44:23,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 14:44:24,006 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-27 14:44:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:33,563 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-27 14:44:33,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-27 14:44:33,563 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) Word has length 205 [2022-04-27 14:44:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:44:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-27 14:44:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 136 transitions. [2022-04-27 14:44:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-27 14:44:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 136 transitions. [2022-04-27 14:44:33,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 136 transitions. [2022-04-27 14:44:33,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:44:33,819 INFO L225 Difference]: With dead ends: 114 [2022-04-27 14:44:33,819 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 14:44:33,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=1223, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 14:44:33,820 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:44:33,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1415 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-27 14:44:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 14:44:33,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-27 14:44:33,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:44:33,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 14:44:33,894 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 14:44:33,894 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 14:44:33,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:33,896 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-27 14:44:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-27 14:44:33,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:44:33,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:44:33,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 109 states. [2022-04-27 14:44:33,897 INFO L87 Difference]: Start difference. First operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 109 states. [2022-04-27 14:44:33,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:33,899 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-27 14:44:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-27 14:44:33,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:44:33,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:44:33,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:44:33,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:44:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 14:44:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-27 14:44:33,901 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 205 [2022-04-27 14:44:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:44:33,901 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-27 14:44:33,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-27 14:44:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-27 14:44:33,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-04-27 14:44:33,902 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:44:33,902 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:44:33,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-27 14:44:34,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-27 14:44:34,108 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:44:34,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:44:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash -12241624, now seen corresponding path program 27 times [2022-04-27 14:44:34,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:44:34,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666118788] [2022-04-27 14:44:34,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:44:34,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:44:34,123 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:44:34,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1208858523] [2022-04-27 14:44:34,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:44:34,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:44:34,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:44:34,124 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:44:34,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-27 14:44:35,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2022-04-27 14:44:35,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:44:35,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 116 conjunts are in the unsatisfiable core [2022-04-27 14:44:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:44:35,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:44:36,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {22030#true} call ULTIMATE.init(); {22030#true} is VALID [2022-04-27 14:44:36,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {22030#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(9, 2);call #Ultimate.allocInit(12, 3); {22030#true} is VALID [2022-04-27 14:44:36,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22030#true} {22030#true} #60#return; {22030#true} is VALID [2022-04-27 14:44:36,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {22030#true} call #t~ret5 := main(); {22030#true} is VALID [2022-04-27 14:44:36,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {22030#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {22030#true} is VALID [2022-04-27 14:44:36,720 INFO L272 TraceCheckUtils]: 6: Hoare triple {22030#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,720 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22030#true} {22030#true} #52#return; {22030#true} is VALID [2022-04-27 14:44:36,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {22030#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {22068#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:36,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {22068#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {22068#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:36,721 INFO L272 TraceCheckUtils]: 13: Hoare triple {22068#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,722 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22030#true} {22068#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {22068#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:36,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {22068#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22090#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:44:36,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {22090#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {22090#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:44:36,722 INFO L272 TraceCheckUtils]: 20: Hoare triple {22090#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,723 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {22030#true} {22090#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {22090#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:44:36,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {22090#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22112#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:36,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {22112#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {22112#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:36,724 INFO L272 TraceCheckUtils]: 27: Hoare triple {22112#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,724 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22030#true} {22112#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {22112#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:44:36,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {22112#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22134#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:44:36,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {22134#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {22134#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:44:36,725 INFO L272 TraceCheckUtils]: 34: Hoare triple {22134#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,725 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22030#true} {22134#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #54#return; {22134#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 14:44:36,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {22134#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22156#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:44:36,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {22156#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {22156#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:44:36,726 INFO L272 TraceCheckUtils]: 41: Hoare triple {22156#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,727 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {22030#true} {22156#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {22156#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:44:36,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {22156#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22178#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:44:36,727 INFO L290 TraceCheckUtils]: 47: Hoare triple {22178#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {22178#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:44:36,727 INFO L272 TraceCheckUtils]: 48: Hoare triple {22178#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,728 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22030#true} {22178#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #54#return; {22178#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 14:44:36,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {22178#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22200#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:44:36,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {22200#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} assume !false; {22200#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:44:36,729 INFO L272 TraceCheckUtils]: 55: Hoare triple {22200#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,729 INFO L290 TraceCheckUtils]: 58: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,729 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22030#true} {22200#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} #54#return; {22200#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 14:44:36,729 INFO L290 TraceCheckUtils]: 60: Hoare triple {22200#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22222#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:44:36,730 INFO L290 TraceCheckUtils]: 61: Hoare triple {22222#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {22222#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:44:36,730 INFO L272 TraceCheckUtils]: 62: Hoare triple {22222#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,730 INFO L290 TraceCheckUtils]: 63: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,730 INFO L290 TraceCheckUtils]: 64: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,730 INFO L290 TraceCheckUtils]: 65: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,730 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22030#true} {22222#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {22222#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:44:36,731 INFO L290 TraceCheckUtils]: 67: Hoare triple {22222#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22244#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:36,731 INFO L290 TraceCheckUtils]: 68: Hoare triple {22244#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {22244#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:36,731 INFO L272 TraceCheckUtils]: 69: Hoare triple {22244#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,731 INFO L290 TraceCheckUtils]: 70: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,731 INFO L290 TraceCheckUtils]: 71: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,731 INFO L290 TraceCheckUtils]: 72: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,732 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {22030#true} {22244#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {22244#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:36,732 INFO L290 TraceCheckUtils]: 74: Hoare triple {22244#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22266#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:44:36,732 INFO L290 TraceCheckUtils]: 75: Hoare triple {22266#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {22266#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:44:36,732 INFO L272 TraceCheckUtils]: 76: Hoare triple {22266#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,732 INFO L290 TraceCheckUtils]: 77: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,732 INFO L290 TraceCheckUtils]: 78: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,732 INFO L290 TraceCheckUtils]: 79: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,733 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22030#true} {22266#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #54#return; {22266#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:44:36,733 INFO L290 TraceCheckUtils]: 81: Hoare triple {22266#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22288#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 14:44:36,734 INFO L290 TraceCheckUtils]: 82: Hoare triple {22288#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} assume !false; {22288#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 14:44:36,734 INFO L272 TraceCheckUtils]: 83: Hoare triple {22288#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,734 INFO L290 TraceCheckUtils]: 84: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,734 INFO L290 TraceCheckUtils]: 85: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,734 INFO L290 TraceCheckUtils]: 86: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,734 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {22030#true} {22288#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} #54#return; {22288#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 14:44:36,734 INFO L290 TraceCheckUtils]: 88: Hoare triple {22288#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22310#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-27 14:44:36,735 INFO L290 TraceCheckUtils]: 89: Hoare triple {22310#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} assume !false; {22310#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-27 14:44:36,735 INFO L272 TraceCheckUtils]: 90: Hoare triple {22310#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,735 INFO L290 TraceCheckUtils]: 91: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,735 INFO L290 TraceCheckUtils]: 92: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,735 INFO L290 TraceCheckUtils]: 93: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,735 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22030#true} {22310#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} #54#return; {22310#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-27 14:44:36,736 INFO L290 TraceCheckUtils]: 95: Hoare triple {22310#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22332#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-27 14:44:36,736 INFO L290 TraceCheckUtils]: 96: Hoare triple {22332#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 4)) 8))} assume !false; {22332#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-27 14:44:36,736 INFO L272 TraceCheckUtils]: 97: Hoare triple {22332#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 4)) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,736 INFO L290 TraceCheckUtils]: 98: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,736 INFO L290 TraceCheckUtils]: 99: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,736 INFO L290 TraceCheckUtils]: 100: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,737 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {22030#true} {22332#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 4)) 8))} #54#return; {22332#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-27 14:44:36,737 INFO L290 TraceCheckUtils]: 102: Hoare triple {22332#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 4)) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22354#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-27 14:44:36,737 INFO L290 TraceCheckUtils]: 103: Hoare triple {22354#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !false; {22354#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-27 14:44:36,737 INFO L272 TraceCheckUtils]: 104: Hoare triple {22354#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,737 INFO L290 TraceCheckUtils]: 105: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,737 INFO L290 TraceCheckUtils]: 106: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,738 INFO L290 TraceCheckUtils]: 107: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,738 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {22030#true} {22354#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} #54#return; {22354#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-27 14:44:36,738 INFO L290 TraceCheckUtils]: 109: Hoare triple {22354#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22376#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:44:36,739 INFO L290 TraceCheckUtils]: 110: Hoare triple {22376#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {22376#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:44:36,739 INFO L272 TraceCheckUtils]: 111: Hoare triple {22376#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,739 INFO L290 TraceCheckUtils]: 112: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,739 INFO L290 TraceCheckUtils]: 113: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,739 INFO L290 TraceCheckUtils]: 114: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,741 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {22030#true} {22376#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #54#return; {22376#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:44:36,741 INFO L290 TraceCheckUtils]: 116: Hoare triple {22376#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22398#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 14:44:36,741 INFO L290 TraceCheckUtils]: 117: Hoare triple {22398#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} assume !false; {22398#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 14:44:36,741 INFO L272 TraceCheckUtils]: 118: Hoare triple {22398#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,741 INFO L290 TraceCheckUtils]: 119: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,742 INFO L290 TraceCheckUtils]: 120: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,742 INFO L290 TraceCheckUtils]: 121: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,751 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {22030#true} {22398#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} #54#return; {22398#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 14:44:36,752 INFO L290 TraceCheckUtils]: 123: Hoare triple {22398#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22420#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-27 14:44:36,752 INFO L290 TraceCheckUtils]: 124: Hoare triple {22420#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !false; {22420#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-27 14:44:36,752 INFO L272 TraceCheckUtils]: 125: Hoare triple {22420#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,752 INFO L290 TraceCheckUtils]: 126: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,752 INFO L290 TraceCheckUtils]: 127: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,752 INFO L290 TraceCheckUtils]: 128: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,753 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {22030#true} {22420#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} #54#return; {22420#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-27 14:44:36,753 INFO L290 TraceCheckUtils]: 130: Hoare triple {22420#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22442#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:44:36,754 INFO L290 TraceCheckUtils]: 131: Hoare triple {22442#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {22442#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:44:36,754 INFO L272 TraceCheckUtils]: 132: Hoare triple {22442#(and (= main_~c~0 17) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,754 INFO L290 TraceCheckUtils]: 133: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,754 INFO L290 TraceCheckUtils]: 134: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,754 INFO L290 TraceCheckUtils]: 135: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,754 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {22030#true} {22442#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {22442#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:44:36,755 INFO L290 TraceCheckUtils]: 137: Hoare triple {22442#(and (= main_~c~0 17) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22464#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 14:44:36,755 INFO L290 TraceCheckUtils]: 138: Hoare triple {22464#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} assume !false; {22464#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 14:44:36,755 INFO L272 TraceCheckUtils]: 139: Hoare triple {22464#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,755 INFO L290 TraceCheckUtils]: 140: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,755 INFO L290 TraceCheckUtils]: 141: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,755 INFO L290 TraceCheckUtils]: 142: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,756 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {22030#true} {22464#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} #54#return; {22464#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 14:44:36,756 INFO L290 TraceCheckUtils]: 144: Hoare triple {22464#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22486#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-27 14:44:36,756 INFO L290 TraceCheckUtils]: 145: Hoare triple {22486#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !false; {22486#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-27 14:44:36,757 INFO L272 TraceCheckUtils]: 146: Hoare triple {22486#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,757 INFO L290 TraceCheckUtils]: 147: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,757 INFO L290 TraceCheckUtils]: 148: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,757 INFO L290 TraceCheckUtils]: 149: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,757 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {22030#true} {22486#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} #54#return; {22486#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-27 14:44:36,758 INFO L290 TraceCheckUtils]: 151: Hoare triple {22486#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22508#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-27 14:44:36,758 INFO L290 TraceCheckUtils]: 152: Hoare triple {22508#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} assume !false; {22508#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-27 14:44:36,758 INFO L272 TraceCheckUtils]: 153: Hoare triple {22508#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,758 INFO L290 TraceCheckUtils]: 154: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,758 INFO L290 TraceCheckUtils]: 155: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,758 INFO L290 TraceCheckUtils]: 156: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,759 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {22030#true} {22508#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} #54#return; {22508#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-27 14:44:36,759 INFO L290 TraceCheckUtils]: 158: Hoare triple {22508#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22530#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} is VALID [2022-04-27 14:44:36,759 INFO L290 TraceCheckUtils]: 159: Hoare triple {22530#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} assume !false; {22530#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} is VALID [2022-04-27 14:44:36,760 INFO L272 TraceCheckUtils]: 160: Hoare triple {22530#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,760 INFO L290 TraceCheckUtils]: 161: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,760 INFO L290 TraceCheckUtils]: 162: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,760 INFO L290 TraceCheckUtils]: 163: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,760 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {22030#true} {22530#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} #54#return; {22530#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} is VALID [2022-04-27 14:44:36,761 INFO L290 TraceCheckUtils]: 165: Hoare triple {22530#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22552#(and (= (+ main_~c~0 (- 5)) 17) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:36,761 INFO L290 TraceCheckUtils]: 166: Hoare triple {22552#(and (= (+ main_~c~0 (- 5)) 17) (= 21 (+ (- 1) main_~y~0)))} assume !false; {22552#(and (= (+ main_~c~0 (- 5)) 17) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:36,761 INFO L272 TraceCheckUtils]: 167: Hoare triple {22552#(and (= (+ main_~c~0 (- 5)) 17) (= 21 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,761 INFO L290 TraceCheckUtils]: 168: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,761 INFO L290 TraceCheckUtils]: 169: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,761 INFO L290 TraceCheckUtils]: 170: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,762 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {22030#true} {22552#(and (= (+ main_~c~0 (- 5)) 17) (= 21 (+ (- 1) main_~y~0)))} #54#return; {22552#(and (= (+ main_~c~0 (- 5)) 17) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:36,762 INFO L290 TraceCheckUtils]: 172: Hoare triple {22552#(and (= (+ main_~c~0 (- 5)) 17) (= 21 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22574#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-27 14:44:36,762 INFO L290 TraceCheckUtils]: 173: Hoare triple {22574#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {22574#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-27 14:44:36,763 INFO L272 TraceCheckUtils]: 174: Hoare triple {22574#(and (= 23 main_~y~0) (= 23 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,763 INFO L290 TraceCheckUtils]: 175: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,763 INFO L290 TraceCheckUtils]: 176: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,763 INFO L290 TraceCheckUtils]: 177: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,763 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {22030#true} {22574#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {22574#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-27 14:44:36,764 INFO L290 TraceCheckUtils]: 179: Hoare triple {22574#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22596#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-27 14:44:36,764 INFO L290 TraceCheckUtils]: 180: Hoare triple {22596#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} assume !false; {22596#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-27 14:44:36,764 INFO L272 TraceCheckUtils]: 181: Hoare triple {22596#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,764 INFO L290 TraceCheckUtils]: 182: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,764 INFO L290 TraceCheckUtils]: 183: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,764 INFO L290 TraceCheckUtils]: 184: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,765 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {22030#true} {22596#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} #54#return; {22596#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-27 14:44:36,765 INFO L290 TraceCheckUtils]: 186: Hoare triple {22596#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22618#(and (= 23 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-27 14:44:36,765 INFO L290 TraceCheckUtils]: 187: Hoare triple {22618#(and (= 23 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 24))} assume !false; {22618#(and (= 23 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-27 14:44:36,765 INFO L272 TraceCheckUtils]: 188: Hoare triple {22618#(and (= 23 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,765 INFO L290 TraceCheckUtils]: 189: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,765 INFO L290 TraceCheckUtils]: 190: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,766 INFO L290 TraceCheckUtils]: 191: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,766 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {22030#true} {22618#(and (= 23 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 24))} #54#return; {22618#(and (= 23 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-27 14:44:36,766 INFO L290 TraceCheckUtils]: 193: Hoare triple {22618#(and (= 23 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22640#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} is VALID [2022-04-27 14:44:36,767 INFO L290 TraceCheckUtils]: 194: Hoare triple {22640#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} assume !false; {22640#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} is VALID [2022-04-27 14:44:36,767 INFO L272 TraceCheckUtils]: 195: Hoare triple {22640#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,767 INFO L290 TraceCheckUtils]: 196: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,767 INFO L290 TraceCheckUtils]: 197: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,767 INFO L290 TraceCheckUtils]: 198: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,767 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {22030#true} {22640#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} #54#return; {22640#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} is VALID [2022-04-27 14:44:36,768 INFO L290 TraceCheckUtils]: 200: Hoare triple {22640#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22662#(and (<= main_~c~0 27) (< 26 main_~k~0) (= 23 (+ main_~y~0 (- 4))))} is VALID [2022-04-27 14:44:36,768 INFO L290 TraceCheckUtils]: 201: Hoare triple {22662#(and (<= main_~c~0 27) (< 26 main_~k~0) (= 23 (+ main_~y~0 (- 4))))} assume !false; {22662#(and (<= main_~c~0 27) (< 26 main_~k~0) (= 23 (+ main_~y~0 (- 4))))} is VALID [2022-04-27 14:44:36,768 INFO L272 TraceCheckUtils]: 202: Hoare triple {22662#(and (<= main_~c~0 27) (< 26 main_~k~0) (= 23 (+ main_~y~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22030#true} is VALID [2022-04-27 14:44:36,768 INFO L290 TraceCheckUtils]: 203: Hoare triple {22030#true} ~cond := #in~cond; {22030#true} is VALID [2022-04-27 14:44:36,768 INFO L290 TraceCheckUtils]: 204: Hoare triple {22030#true} assume !(0 == ~cond); {22030#true} is VALID [2022-04-27 14:44:36,768 INFO L290 TraceCheckUtils]: 205: Hoare triple {22030#true} assume true; {22030#true} is VALID [2022-04-27 14:44:36,769 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {22030#true} {22662#(and (<= main_~c~0 27) (< 26 main_~k~0) (= 23 (+ main_~y~0 (- 4))))} #54#return; {22662#(and (<= main_~c~0 27) (< 26 main_~k~0) (= 23 (+ main_~y~0 (- 4))))} is VALID [2022-04-27 14:44:36,769 INFO L290 TraceCheckUtils]: 207: Hoare triple {22662#(and (<= main_~c~0 27) (< 26 main_~k~0) (= 23 (+ main_~y~0 (- 4))))} assume !(~c~0 < ~k~0); {22684#(and (< 26 main_~k~0) (<= main_~k~0 27) (= 23 (+ main_~y~0 (- 4))))} is VALID [2022-04-27 14:44:36,770 INFO L272 TraceCheckUtils]: 208: Hoare triple {22684#(and (< 26 main_~k~0) (<= main_~k~0 27) (= 23 (+ main_~y~0 (- 4))))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22688#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:44:36,770 INFO L290 TraceCheckUtils]: 209: Hoare triple {22688#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22692#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:44:36,770 INFO L290 TraceCheckUtils]: 210: Hoare triple {22692#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22031#false} is VALID [2022-04-27 14:44:36,771 INFO L290 TraceCheckUtils]: 211: Hoare triple {22031#false} assume !false; {22031#false} is VALID [2022-04-27 14:44:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2702 backedges. 56 proven. 1134 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2022-04-27 14:44:36,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:44:37,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:44:37,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666118788] [2022-04-27 14:44:37,124 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:44:37,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208858523] [2022-04-27 14:44:37,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208858523] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:44:37,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:44:37,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2022-04-27 14:44:37,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107998144] [2022-04-27 14:44:37,124 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:44:37,125 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) Word has length 212 [2022-04-27 14:44:37,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:44:37,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-27 14:44:37,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:44:37,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-27 14:44:37,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:44:37,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-27 14:44:37,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 14:44:37,352 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-27 14:44:48,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:48,097 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2022-04-27 14:44:48,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-27 14:44:48,097 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) Word has length 212 [2022-04-27 14:44:48,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:44:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-27 14:44:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 140 transitions. [2022-04-27 14:44:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-27 14:44:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 140 transitions. [2022-04-27 14:44:48,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 140 transitions. [2022-04-27 14:44:48,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:44:48,419 INFO L225 Difference]: With dead ends: 117 [2022-04-27 14:44:48,419 INFO L226 Difference]: Without dead ends: 112 [2022-04-27 14:44:48,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=1294, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 14:44:48,420 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 2677 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:44:48,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1493 Invalid, 2677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2677 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-04-27 14:44:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-27 14:44:48,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-04-27 14:44:48,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:44:48,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 14:44:48,500 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 14:44:48,500 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 14:44:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:48,502 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2022-04-27 14:44:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-04-27 14:44:48,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:44:48,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:44:48,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 112 states. [2022-04-27 14:44:48,503 INFO L87 Difference]: Start difference. First operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 112 states. [2022-04-27 14:44:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:44:48,505 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2022-04-27 14:44:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-04-27 14:44:48,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:44:48,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:44:48,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:44:48,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:44:48,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 14:44:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2022-04-27 14:44:48,507 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 212 [2022-04-27 14:44:48,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:44:48,507 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2022-04-27 14:44:48,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-27 14:44:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-04-27 14:44:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-04-27 14:44:48,509 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:44:48,509 INFO L195 NwaCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:44:48,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-27 14:44:48,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:44:48,715 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:44:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:44:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash -255861015, now seen corresponding path program 28 times [2022-04-27 14:44:48,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:44:48,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874503650] [2022-04-27 14:44:48,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:44:48,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:44:48,730 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:44:48,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1289424971] [2022-04-27 14:44:48,730 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:44:48,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:44:48,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:44:48,731 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:44:48,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-27 14:44:49,527 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:44:49,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:44:49,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 120 conjunts are in the unsatisfiable core [2022-04-27 14:44:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:44:49,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:44:50,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {23335#true} call ULTIMATE.init(); {23335#true} is VALID [2022-04-27 14:44:50,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {23335#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(9, 2);call #Ultimate.allocInit(12, 3); {23335#true} is VALID [2022-04-27 14:44:50,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23335#true} {23335#true} #60#return; {23335#true} is VALID [2022-04-27 14:44:50,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {23335#true} call #t~ret5 := main(); {23335#true} is VALID [2022-04-27 14:44:50,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {23335#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {23335#true} is VALID [2022-04-27 14:44:50,694 INFO L272 TraceCheckUtils]: 6: Hoare triple {23335#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,694 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23335#true} {23335#true} #52#return; {23335#true} is VALID [2022-04-27 14:44:50,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {23335#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {23373#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:50,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {23373#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {23373#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:50,694 INFO L272 TraceCheckUtils]: 13: Hoare triple {23373#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,695 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23335#true} {23373#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {23373#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:44:50,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {23373#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23395#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:44:50,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {23395#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {23395#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:44:50,696 INFO L272 TraceCheckUtils]: 20: Hoare triple {23395#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,696 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {23335#true} {23395#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {23395#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:44:50,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {23395#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23417#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:44:50,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {23417#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {23417#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:44:50,697 INFO L272 TraceCheckUtils]: 27: Hoare triple {23417#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,697 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23335#true} {23417#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {23417#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 14:44:50,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {23417#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23439#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:44:50,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {23439#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {23439#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:44:50,698 INFO L272 TraceCheckUtils]: 34: Hoare triple {23439#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,698 INFO L290 TraceCheckUtils]: 36: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,698 INFO L290 TraceCheckUtils]: 37: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,699 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {23335#true} {23439#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {23439#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:44:50,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {23439#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23461#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 14:44:50,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {23461#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !false; {23461#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 14:44:50,699 INFO L272 TraceCheckUtils]: 41: Hoare triple {23461#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,700 INFO L290 TraceCheckUtils]: 42: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,700 INFO L290 TraceCheckUtils]: 43: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,700 INFO L290 TraceCheckUtils]: 44: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,700 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {23335#true} {23461#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} #54#return; {23461#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 14:44:50,701 INFO L290 TraceCheckUtils]: 46: Hoare triple {23461#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23483#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:44:50,701 INFO L290 TraceCheckUtils]: 47: Hoare triple {23483#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {23483#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:44:50,701 INFO L272 TraceCheckUtils]: 48: Hoare triple {23483#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,701 INFO L290 TraceCheckUtils]: 49: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,701 INFO L290 TraceCheckUtils]: 50: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,701 INFO L290 TraceCheckUtils]: 51: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,702 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {23335#true} {23483#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {23483#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:44:50,702 INFO L290 TraceCheckUtils]: 53: Hoare triple {23483#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23505#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:50,702 INFO L290 TraceCheckUtils]: 54: Hoare triple {23505#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {23505#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:50,702 INFO L272 TraceCheckUtils]: 55: Hoare triple {23505#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,702 INFO L290 TraceCheckUtils]: 56: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,702 INFO L290 TraceCheckUtils]: 57: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,702 INFO L290 TraceCheckUtils]: 58: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,703 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23335#true} {23505#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {23505#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:50,703 INFO L290 TraceCheckUtils]: 60: Hoare triple {23505#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23527#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-27 14:44:50,704 INFO L290 TraceCheckUtils]: 61: Hoare triple {23527#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {23527#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-27 14:44:50,704 INFO L272 TraceCheckUtils]: 62: Hoare triple {23527#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,704 INFO L290 TraceCheckUtils]: 63: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,704 INFO L290 TraceCheckUtils]: 64: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,704 INFO L290 TraceCheckUtils]: 65: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,704 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {23335#true} {23527#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #54#return; {23527#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-27 14:44:50,704 INFO L290 TraceCheckUtils]: 67: Hoare triple {23527#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23549#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:50,705 INFO L290 TraceCheckUtils]: 68: Hoare triple {23549#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !false; {23549#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:50,705 INFO L272 TraceCheckUtils]: 69: Hoare triple {23549#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,705 INFO L290 TraceCheckUtils]: 70: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,705 INFO L290 TraceCheckUtils]: 71: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,705 INFO L290 TraceCheckUtils]: 72: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,705 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {23335#true} {23549#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} #54#return; {23549#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:50,706 INFO L290 TraceCheckUtils]: 74: Hoare triple {23549#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23571#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:44:50,706 INFO L290 TraceCheckUtils]: 75: Hoare triple {23571#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {23571#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:44:50,706 INFO L272 TraceCheckUtils]: 76: Hoare triple {23571#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,706 INFO L290 TraceCheckUtils]: 77: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,706 INFO L290 TraceCheckUtils]: 78: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,706 INFO L290 TraceCheckUtils]: 79: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,707 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {23335#true} {23571#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {23571#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:44:50,707 INFO L290 TraceCheckUtils]: 81: Hoare triple {23571#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23593#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:44:50,707 INFO L290 TraceCheckUtils]: 82: Hoare triple {23593#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {23593#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:44:50,707 INFO L272 TraceCheckUtils]: 83: Hoare triple {23593#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,707 INFO L290 TraceCheckUtils]: 84: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,707 INFO L290 TraceCheckUtils]: 85: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,708 INFO L290 TraceCheckUtils]: 86: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,708 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {23335#true} {23593#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {23593#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 14:44:50,708 INFO L290 TraceCheckUtils]: 88: Hoare triple {23593#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23615#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:44:50,709 INFO L290 TraceCheckUtils]: 89: Hoare triple {23615#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {23615#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:44:50,709 INFO L272 TraceCheckUtils]: 90: Hoare triple {23615#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,709 INFO L290 TraceCheckUtils]: 91: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,709 INFO L290 TraceCheckUtils]: 92: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,709 INFO L290 TraceCheckUtils]: 93: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,709 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {23335#true} {23615#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {23615#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:44:50,709 INFO L290 TraceCheckUtils]: 95: Hoare triple {23615#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23637#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:44:50,710 INFO L290 TraceCheckUtils]: 96: Hoare triple {23637#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {23637#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:44:50,710 INFO L272 TraceCheckUtils]: 97: Hoare triple {23637#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,710 INFO L290 TraceCheckUtils]: 98: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,710 INFO L290 TraceCheckUtils]: 99: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,710 INFO L290 TraceCheckUtils]: 100: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,710 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {23335#true} {23637#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #54#return; {23637#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:44:50,711 INFO L290 TraceCheckUtils]: 102: Hoare triple {23637#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23659#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-27 14:44:50,711 INFO L290 TraceCheckUtils]: 103: Hoare triple {23659#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !false; {23659#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-27 14:44:50,711 INFO L272 TraceCheckUtils]: 104: Hoare triple {23659#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,711 INFO L290 TraceCheckUtils]: 105: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,711 INFO L290 TraceCheckUtils]: 106: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,711 INFO L290 TraceCheckUtils]: 107: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,712 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {23335#true} {23659#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} #54#return; {23659#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-27 14:44:50,712 INFO L290 TraceCheckUtils]: 109: Hoare triple {23659#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23681#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-27 14:44:50,712 INFO L290 TraceCheckUtils]: 110: Hoare triple {23681#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} assume !false; {23681#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-27 14:44:50,712 INFO L272 TraceCheckUtils]: 111: Hoare triple {23681#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,712 INFO L290 TraceCheckUtils]: 112: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,713 INFO L290 TraceCheckUtils]: 113: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,713 INFO L290 TraceCheckUtils]: 114: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,713 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {23335#true} {23681#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} #54#return; {23681#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-27 14:44:50,713 INFO L290 TraceCheckUtils]: 116: Hoare triple {23681#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23703#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:44:50,714 INFO L290 TraceCheckUtils]: 117: Hoare triple {23703#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} assume !false; {23703#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:44:50,714 INFO L272 TraceCheckUtils]: 118: Hoare triple {23703#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,714 INFO L290 TraceCheckUtils]: 119: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,714 INFO L290 TraceCheckUtils]: 120: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,714 INFO L290 TraceCheckUtils]: 121: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,714 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23335#true} {23703#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} #54#return; {23703#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:44:50,715 INFO L290 TraceCheckUtils]: 123: Hoare triple {23703#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23725#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 5)) 11))} is VALID [2022-04-27 14:44:50,715 INFO L290 TraceCheckUtils]: 124: Hoare triple {23725#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 5)) 11))} assume !false; {23725#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 5)) 11))} is VALID [2022-04-27 14:44:50,715 INFO L272 TraceCheckUtils]: 125: Hoare triple {23725#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 5)) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,715 INFO L290 TraceCheckUtils]: 126: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,715 INFO L290 TraceCheckUtils]: 127: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,715 INFO L290 TraceCheckUtils]: 128: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,737 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {23335#true} {23725#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 5)) 11))} #54#return; {23725#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 5)) 11))} is VALID [2022-04-27 14:44:50,737 INFO L290 TraceCheckUtils]: 130: Hoare triple {23725#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 5)) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23747#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:44:50,737 INFO L290 TraceCheckUtils]: 131: Hoare triple {23747#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {23747#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:44:50,737 INFO L272 TraceCheckUtils]: 132: Hoare triple {23747#(and (= main_~c~0 17) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,737 INFO L290 TraceCheckUtils]: 133: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,737 INFO L290 TraceCheckUtils]: 134: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,738 INFO L290 TraceCheckUtils]: 135: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,738 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {23335#true} {23747#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {23747#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:44:50,738 INFO L290 TraceCheckUtils]: 137: Hoare triple {23747#(and (= main_~c~0 17) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23769#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 14:44:50,739 INFO L290 TraceCheckUtils]: 138: Hoare triple {23769#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} assume !false; {23769#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 14:44:50,739 INFO L272 TraceCheckUtils]: 139: Hoare triple {23769#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,739 INFO L290 TraceCheckUtils]: 140: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,739 INFO L290 TraceCheckUtils]: 141: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,739 INFO L290 TraceCheckUtils]: 142: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,739 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {23335#true} {23769#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} #54#return; {23769#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 14:44:50,740 INFO L290 TraceCheckUtils]: 144: Hoare triple {23769#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23791#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-27 14:44:50,740 INFO L290 TraceCheckUtils]: 145: Hoare triple {23791#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !false; {23791#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-27 14:44:50,740 INFO L272 TraceCheckUtils]: 146: Hoare triple {23791#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,740 INFO L290 TraceCheckUtils]: 147: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,740 INFO L290 TraceCheckUtils]: 148: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,740 INFO L290 TraceCheckUtils]: 149: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,741 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {23335#true} {23791#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} #54#return; {23791#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-27 14:44:50,741 INFO L290 TraceCheckUtils]: 151: Hoare triple {23791#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23813#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-27 14:44:50,741 INFO L290 TraceCheckUtils]: 152: Hoare triple {23813#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {23813#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-27 14:44:50,741 INFO L272 TraceCheckUtils]: 153: Hoare triple {23813#(and (= main_~c~0 20) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,741 INFO L290 TraceCheckUtils]: 154: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,741 INFO L290 TraceCheckUtils]: 155: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,741 INFO L290 TraceCheckUtils]: 156: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,742 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {23335#true} {23813#(and (= main_~c~0 20) (= main_~y~0 20))} #54#return; {23813#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-27 14:44:50,742 INFO L290 TraceCheckUtils]: 158: Hoare triple {23813#(and (= main_~c~0 20) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23835#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:50,743 INFO L290 TraceCheckUtils]: 159: Hoare triple {23835#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !false; {23835#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:50,743 INFO L272 TraceCheckUtils]: 160: Hoare triple {23835#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,743 INFO L290 TraceCheckUtils]: 161: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,743 INFO L290 TraceCheckUtils]: 162: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,743 INFO L290 TraceCheckUtils]: 163: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,743 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {23335#true} {23835#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} #54#return; {23835#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:44:50,744 INFO L290 TraceCheckUtils]: 165: Hoare triple {23835#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23857#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-27 14:44:50,744 INFO L290 TraceCheckUtils]: 166: Hoare triple {23857#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} assume !false; {23857#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-27 14:44:50,744 INFO L272 TraceCheckUtils]: 167: Hoare triple {23857#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,744 INFO L290 TraceCheckUtils]: 168: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,744 INFO L290 TraceCheckUtils]: 169: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,744 INFO L290 TraceCheckUtils]: 170: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,745 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {23335#true} {23857#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} #54#return; {23857#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-27 14:44:50,745 INFO L290 TraceCheckUtils]: 172: Hoare triple {23857#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23879#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} is VALID [2022-04-27 14:44:50,745 INFO L290 TraceCheckUtils]: 173: Hoare triple {23879#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} assume !false; {23879#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} is VALID [2022-04-27 14:44:50,745 INFO L272 TraceCheckUtils]: 174: Hoare triple {23879#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,745 INFO L290 TraceCheckUtils]: 175: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,745 INFO L290 TraceCheckUtils]: 176: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,745 INFO L290 TraceCheckUtils]: 177: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,746 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {23335#true} {23879#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} #54#return; {23879#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} is VALID [2022-04-27 14:44:50,746 INFO L290 TraceCheckUtils]: 179: Hoare triple {23879#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23901#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:50,746 INFO L290 TraceCheckUtils]: 180: Hoare triple {23901#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !false; {23901#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:50,747 INFO L272 TraceCheckUtils]: 181: Hoare triple {23901#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,747 INFO L290 TraceCheckUtils]: 182: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,747 INFO L290 TraceCheckUtils]: 183: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,747 INFO L290 TraceCheckUtils]: 184: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,747 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {23335#true} {23901#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} #54#return; {23901#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:44:50,747 INFO L290 TraceCheckUtils]: 186: Hoare triple {23901#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23923#(and (= 23 (+ (- 2) main_~c~0)) (= main_~y~0 25))} is VALID [2022-04-27 14:44:50,748 INFO L290 TraceCheckUtils]: 187: Hoare triple {23923#(and (= 23 (+ (- 2) main_~c~0)) (= main_~y~0 25))} assume !false; {23923#(and (= 23 (+ (- 2) main_~c~0)) (= main_~y~0 25))} is VALID [2022-04-27 14:44:50,748 INFO L272 TraceCheckUtils]: 188: Hoare triple {23923#(and (= 23 (+ (- 2) main_~c~0)) (= main_~y~0 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,748 INFO L290 TraceCheckUtils]: 189: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,748 INFO L290 TraceCheckUtils]: 190: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,748 INFO L290 TraceCheckUtils]: 191: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,748 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {23335#true} {23923#(and (= 23 (+ (- 2) main_~c~0)) (= main_~y~0 25))} #54#return; {23923#(and (= 23 (+ (- 2) main_~c~0)) (= main_~y~0 25))} is VALID [2022-04-27 14:44:50,749 INFO L290 TraceCheckUtils]: 193: Hoare triple {23923#(and (= 23 (+ (- 2) main_~c~0)) (= main_~y~0 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23945#(and (= 23 (+ main_~c~0 (- 3))) (= main_~y~0 26))} is VALID [2022-04-27 14:44:50,749 INFO L290 TraceCheckUtils]: 194: Hoare triple {23945#(and (= 23 (+ main_~c~0 (- 3))) (= main_~y~0 26))} assume !false; {23945#(and (= 23 (+ main_~c~0 (- 3))) (= main_~y~0 26))} is VALID [2022-04-27 14:44:50,749 INFO L272 TraceCheckUtils]: 195: Hoare triple {23945#(and (= 23 (+ main_~c~0 (- 3))) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,749 INFO L290 TraceCheckUtils]: 196: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,749 INFO L290 TraceCheckUtils]: 197: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,749 INFO L290 TraceCheckUtils]: 198: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,750 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {23335#true} {23945#(and (= 23 (+ main_~c~0 (- 3))) (= main_~y~0 26))} #54#return; {23945#(and (= 23 (+ main_~c~0 (- 3))) (= main_~y~0 26))} is VALID [2022-04-27 14:44:50,750 INFO L290 TraceCheckUtils]: 200: Hoare triple {23945#(and (= 23 (+ main_~c~0 (- 3))) (= main_~y~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23967#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-27 14:44:50,750 INFO L290 TraceCheckUtils]: 201: Hoare triple {23967#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} assume !false; {23967#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-27 14:44:50,750 INFO L272 TraceCheckUtils]: 202: Hoare triple {23967#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,750 INFO L290 TraceCheckUtils]: 203: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,750 INFO L290 TraceCheckUtils]: 204: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,751 INFO L290 TraceCheckUtils]: 205: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,751 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {23335#true} {23967#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} #54#return; {23967#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-27 14:44:50,751 INFO L290 TraceCheckUtils]: 207: Hoare triple {23967#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23989#(and (= (+ (- 2) main_~y~0) 26) (<= main_~c~0 28) (< 27 main_~k~0))} is VALID [2022-04-27 14:44:50,752 INFO L290 TraceCheckUtils]: 208: Hoare triple {23989#(and (= (+ (- 2) main_~y~0) 26) (<= main_~c~0 28) (< 27 main_~k~0))} assume !false; {23989#(and (= (+ (- 2) main_~y~0) 26) (<= main_~c~0 28) (< 27 main_~k~0))} is VALID [2022-04-27 14:44:50,752 INFO L272 TraceCheckUtils]: 209: Hoare triple {23989#(and (= (+ (- 2) main_~y~0) 26) (<= main_~c~0 28) (< 27 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23335#true} is VALID [2022-04-27 14:44:50,752 INFO L290 TraceCheckUtils]: 210: Hoare triple {23335#true} ~cond := #in~cond; {23335#true} is VALID [2022-04-27 14:44:50,752 INFO L290 TraceCheckUtils]: 211: Hoare triple {23335#true} assume !(0 == ~cond); {23335#true} is VALID [2022-04-27 14:44:50,752 INFO L290 TraceCheckUtils]: 212: Hoare triple {23335#true} assume true; {23335#true} is VALID [2022-04-27 14:44:50,752 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {23335#true} {23989#(and (= (+ (- 2) main_~y~0) 26) (<= main_~c~0 28) (< 27 main_~k~0))} #54#return; {23989#(and (= (+ (- 2) main_~y~0) 26) (<= main_~c~0 28) (< 27 main_~k~0))} is VALID [2022-04-27 14:44:50,753 INFO L290 TraceCheckUtils]: 214: Hoare triple {23989#(and (= (+ (- 2) main_~y~0) 26) (<= main_~c~0 28) (< 27 main_~k~0))} assume !(~c~0 < ~k~0); {24011#(and (<= main_~k~0 28) (= (+ (- 2) main_~y~0) 26) (< 27 main_~k~0))} is VALID [2022-04-27 14:44:50,753 INFO L272 TraceCheckUtils]: 215: Hoare triple {24011#(and (<= main_~k~0 28) (= (+ (- 2) main_~y~0) 26) (< 27 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:44:50,754 INFO L290 TraceCheckUtils]: 216: Hoare triple {24015#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:44:50,754 INFO L290 TraceCheckUtils]: 217: Hoare triple {24019#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23336#false} is VALID [2022-04-27 14:44:50,754 INFO L290 TraceCheckUtils]: 218: Hoare triple {23336#false} assume !false; {23336#false} is VALID [2022-04-27 14:44:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2900 backedges. 58 proven. 1218 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2022-04-27 14:44:50,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:44:51,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:44:51,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874503650] [2022-04-27 14:44:51,153 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:44:51,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289424971] [2022-04-27 14:44:51,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289424971] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:44:51,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:44:51,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2022-04-27 14:44:51,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72470080] [2022-04-27 14:44:51,153 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:44:51,153 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 31 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) Word has length 219 [2022-04-27 14:44:51,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:44:51,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 31 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-27 14:44:51,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:44:51,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-27 14:44:51,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:44:51,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-27 14:44:51,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 14:44:51,437 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 31 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-27 14:45:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:45:04,375 INFO L93 Difference]: Finished difference Result 120 states and 148 transitions. [2022-04-27 14:45:04,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-27 14:45:04,376 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 31 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) Word has length 219 [2022-04-27 14:45:04,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:45:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 31 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-27 14:45:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 144 transitions. [2022-04-27 14:45:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 31 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-27 14:45:04,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 144 transitions. [2022-04-27 14:45:04,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 144 transitions. [2022-04-27 14:45:04,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:45:04,706 INFO L225 Difference]: With dead ends: 120 [2022-04-27 14:45:04,707 INFO L226 Difference]: Without dead ends: 115 [2022-04-27 14:45:04,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2022-04-27 14:45:04,708 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 2859 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-27 14:45:04,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1573 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2859 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-04-27 14:45:04,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-27 14:45:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-27 14:45:04,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:45:04,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 14:45:04,786 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 14:45:04,786 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 14:45:04,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:45:04,788 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-04-27 14:45:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2022-04-27 14:45:04,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:45:04,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:45:04,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 115 states. [2022-04-27 14:45:04,789 INFO L87 Difference]: Start difference. First operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 115 states. [2022-04-27 14:45:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:45:04,790 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-04-27 14:45:04,790 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2022-04-27 14:45:04,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:45:04,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:45:04,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:45:04,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:45:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 14:45:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 143 transitions. [2022-04-27 14:45:04,793 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 143 transitions. Word has length 219 [2022-04-27 14:45:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:45:04,793 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 143 transitions. [2022-04-27 14:45:04,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 31 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-27 14:45:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2022-04-27 14:45:04,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-04-27 14:45:04,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:45:04,794 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:45:04,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-27 14:45:05,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-27 14:45:05,000 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:45:05,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:45:05,001 INFO L85 PathProgramCache]: Analyzing trace with hash 963111432, now seen corresponding path program 29 times [2022-04-27 14:45:05,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:45:05,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309856835] [2022-04-27 14:45:05,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:45:05,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:45:05,020 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:45:05,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [372228067] [2022-04-27 14:45:05,021 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:45:05,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:45:05,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:45:05,022 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:45:05,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-27 14:45:13,922 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2022-04-27 14:45:13,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:45:13,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 124 conjunts are in the unsatisfiable core [2022-04-27 14:45:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:45:13,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:45:15,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {24678#true} call ULTIMATE.init(); {24678#true} is VALID [2022-04-27 14:45:15,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {24678#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(9, 2);call #Ultimate.allocInit(12, 3); {24678#true} is VALID [2022-04-27 14:45:15,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24678#true} {24678#true} #60#return; {24678#true} is VALID [2022-04-27 14:45:15,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {24678#true} call #t~ret5 := main(); {24678#true} is VALID [2022-04-27 14:45:15,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {24678#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {24678#true} is VALID [2022-04-27 14:45:15,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {24678#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,126 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24678#true} {24678#true} #52#return; {24678#true} is VALID [2022-04-27 14:45:15,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {24678#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {24716#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:45:15,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {24716#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {24716#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:45:15,126 INFO L272 TraceCheckUtils]: 13: Hoare triple {24716#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,127 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24678#true} {24716#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {24716#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:45:15,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {24716#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24738#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:45:15,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {24738#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {24738#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:45:15,128 INFO L272 TraceCheckUtils]: 20: Hoare triple {24738#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,128 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {24678#true} {24738#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {24738#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:45:15,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {24738#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24760#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:45:15,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {24760#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {24760#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:45:15,129 INFO L272 TraceCheckUtils]: 27: Hoare triple {24760#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,130 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {24678#true} {24760#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {24760#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:45:15,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {24760#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24782#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:45:15,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {24782#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !false; {24782#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:45:15,131 INFO L272 TraceCheckUtils]: 34: Hoare triple {24782#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,131 INFO L290 TraceCheckUtils]: 35: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,131 INFO L290 TraceCheckUtils]: 36: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,131 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {24678#true} {24782#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #54#return; {24782#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:45:15,132 INFO L290 TraceCheckUtils]: 39: Hoare triple {24782#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24804#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:45:15,132 INFO L290 TraceCheckUtils]: 40: Hoare triple {24804#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !false; {24804#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:45:15,132 INFO L272 TraceCheckUtils]: 41: Hoare triple {24804#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,132 INFO L290 TraceCheckUtils]: 44: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,132 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {24678#true} {24804#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #54#return; {24804#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 14:45:15,133 INFO L290 TraceCheckUtils]: 46: Hoare triple {24804#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24826#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:45:15,133 INFO L290 TraceCheckUtils]: 47: Hoare triple {24826#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {24826#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:45:15,133 INFO L272 TraceCheckUtils]: 48: Hoare triple {24826#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,133 INFO L290 TraceCheckUtils]: 49: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,133 INFO L290 TraceCheckUtils]: 50: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,134 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {24678#true} {24826#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {24826#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:45:15,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {24826#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24848#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:45:15,135 INFO L290 TraceCheckUtils]: 54: Hoare triple {24848#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {24848#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:45:15,135 INFO L272 TraceCheckUtils]: 55: Hoare triple {24848#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,135 INFO L290 TraceCheckUtils]: 56: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,135 INFO L290 TraceCheckUtils]: 57: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,135 INFO L290 TraceCheckUtils]: 58: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,135 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24678#true} {24848#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {24848#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:45:15,136 INFO L290 TraceCheckUtils]: 60: Hoare triple {24848#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24870#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:45:15,136 INFO L290 TraceCheckUtils]: 61: Hoare triple {24870#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {24870#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:45:15,136 INFO L272 TraceCheckUtils]: 62: Hoare triple {24870#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,136 INFO L290 TraceCheckUtils]: 63: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,136 INFO L290 TraceCheckUtils]: 64: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,136 INFO L290 TraceCheckUtils]: 65: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,137 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24678#true} {24870#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {24870#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:45:15,137 INFO L290 TraceCheckUtils]: 67: Hoare triple {24870#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24892#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:45:15,137 INFO L290 TraceCheckUtils]: 68: Hoare triple {24892#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {24892#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:45:15,137 INFO L272 TraceCheckUtils]: 69: Hoare triple {24892#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,138 INFO L290 TraceCheckUtils]: 70: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,138 INFO L290 TraceCheckUtils]: 71: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,138 INFO L290 TraceCheckUtils]: 72: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,138 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {24678#true} {24892#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {24892#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:45:15,138 INFO L290 TraceCheckUtils]: 74: Hoare triple {24892#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24914#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:45:15,139 INFO L290 TraceCheckUtils]: 75: Hoare triple {24914#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {24914#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:45:15,139 INFO L272 TraceCheckUtils]: 76: Hoare triple {24914#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,139 INFO L290 TraceCheckUtils]: 77: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,139 INFO L290 TraceCheckUtils]: 78: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,139 INFO L290 TraceCheckUtils]: 79: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,139 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24678#true} {24914#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #54#return; {24914#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:45:15,140 INFO L290 TraceCheckUtils]: 81: Hoare triple {24914#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24936#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:45:15,140 INFO L290 TraceCheckUtils]: 82: Hoare triple {24936#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {24936#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:45:15,140 INFO L272 TraceCheckUtils]: 83: Hoare triple {24936#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,140 INFO L290 TraceCheckUtils]: 84: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,140 INFO L290 TraceCheckUtils]: 85: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,140 INFO L290 TraceCheckUtils]: 86: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,141 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {24678#true} {24936#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {24936#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 14:45:15,141 INFO L290 TraceCheckUtils]: 88: Hoare triple {24936#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24958#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:45:15,142 INFO L290 TraceCheckUtils]: 89: Hoare triple {24958#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {24958#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:45:15,142 INFO L272 TraceCheckUtils]: 90: Hoare triple {24958#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,142 INFO L290 TraceCheckUtils]: 91: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,142 INFO L290 TraceCheckUtils]: 92: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,142 INFO L290 TraceCheckUtils]: 93: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,142 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {24678#true} {24958#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #54#return; {24958#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 14:45:15,143 INFO L290 TraceCheckUtils]: 95: Hoare triple {24958#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24980#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:45:15,143 INFO L290 TraceCheckUtils]: 96: Hoare triple {24980#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} assume !false; {24980#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:45:15,143 INFO L272 TraceCheckUtils]: 97: Hoare triple {24980#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,143 INFO L290 TraceCheckUtils]: 98: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,143 INFO L290 TraceCheckUtils]: 99: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,143 INFO L290 TraceCheckUtils]: 100: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,144 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {24678#true} {24980#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} #54#return; {24980#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:45:15,144 INFO L290 TraceCheckUtils]: 102: Hoare triple {24980#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25002#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-27 14:45:15,144 INFO L290 TraceCheckUtils]: 103: Hoare triple {25002#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} assume !false; {25002#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-27 14:45:15,144 INFO L272 TraceCheckUtils]: 104: Hoare triple {25002#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,145 INFO L290 TraceCheckUtils]: 105: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,145 INFO L290 TraceCheckUtils]: 106: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,145 INFO L290 TraceCheckUtils]: 107: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,145 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {24678#true} {25002#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} #54#return; {25002#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-27 14:45:15,145 INFO L290 TraceCheckUtils]: 109: Hoare triple {25002#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25024#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:45:15,146 INFO L290 TraceCheckUtils]: 110: Hoare triple {25024#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {25024#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:45:15,146 INFO L272 TraceCheckUtils]: 111: Hoare triple {25024#(and (= main_~y~0 14) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,146 INFO L290 TraceCheckUtils]: 112: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,146 INFO L290 TraceCheckUtils]: 113: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,146 INFO L290 TraceCheckUtils]: 114: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,146 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {24678#true} {25024#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {25024#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:45:15,147 INFO L290 TraceCheckUtils]: 116: Hoare triple {25024#(and (= main_~y~0 14) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25046#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:45:15,147 INFO L290 TraceCheckUtils]: 117: Hoare triple {25046#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {25046#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:45:15,147 INFO L272 TraceCheckUtils]: 118: Hoare triple {25046#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,147 INFO L290 TraceCheckUtils]: 119: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,147 INFO L290 TraceCheckUtils]: 120: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,147 INFO L290 TraceCheckUtils]: 121: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,148 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {24678#true} {25046#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {25046#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:45:15,148 INFO L290 TraceCheckUtils]: 123: Hoare triple {25046#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25068#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-27 14:45:15,149 INFO L290 TraceCheckUtils]: 124: Hoare triple {25068#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} assume !false; {25068#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-27 14:45:15,149 INFO L272 TraceCheckUtils]: 125: Hoare triple {25068#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,149 INFO L290 TraceCheckUtils]: 126: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,149 INFO L290 TraceCheckUtils]: 127: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,149 INFO L290 TraceCheckUtils]: 128: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,149 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {24678#true} {25068#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} #54#return; {25068#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-27 14:45:15,150 INFO L290 TraceCheckUtils]: 130: Hoare triple {25068#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25090#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-27 14:45:15,150 INFO L290 TraceCheckUtils]: 131: Hoare triple {25090#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} assume !false; {25090#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-27 14:45:15,150 INFO L272 TraceCheckUtils]: 132: Hoare triple {25090#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,150 INFO L290 TraceCheckUtils]: 133: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,150 INFO L290 TraceCheckUtils]: 134: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,150 INFO L290 TraceCheckUtils]: 135: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,151 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {24678#true} {25090#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} #54#return; {25090#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-27 14:45:15,151 INFO L290 TraceCheckUtils]: 137: Hoare triple {25090#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25112#(and (= (+ main_~c~0 (- 3)) 15) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 14:45:15,151 INFO L290 TraceCheckUtils]: 138: Hoare triple {25112#(and (= (+ main_~c~0 (- 3)) 15) (= (+ (- 1) main_~y~0) 17))} assume !false; {25112#(and (= (+ main_~c~0 (- 3)) 15) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 14:45:15,151 INFO L272 TraceCheckUtils]: 139: Hoare triple {25112#(and (= (+ main_~c~0 (- 3)) 15) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,151 INFO L290 TraceCheckUtils]: 140: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,152 INFO L290 TraceCheckUtils]: 141: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,152 INFO L290 TraceCheckUtils]: 142: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,152 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {24678#true} {25112#(and (= (+ main_~c~0 (- 3)) 15) (= (+ (- 1) main_~y~0) 17))} #54#return; {25112#(and (= (+ main_~c~0 (- 3)) 15) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 14:45:15,152 INFO L290 TraceCheckUtils]: 144: Hoare triple {25112#(and (= (+ main_~c~0 (- 3)) 15) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25134#(and (= 19 main_~y~0) (= 15 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:45:15,153 INFO L290 TraceCheckUtils]: 145: Hoare triple {25134#(and (= 19 main_~y~0) (= 15 (+ main_~c~0 (- 4))))} assume !false; {25134#(and (= 19 main_~y~0) (= 15 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:45:15,153 INFO L272 TraceCheckUtils]: 146: Hoare triple {25134#(and (= 19 main_~y~0) (= 15 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,153 INFO L290 TraceCheckUtils]: 147: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,153 INFO L290 TraceCheckUtils]: 148: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,153 INFO L290 TraceCheckUtils]: 149: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,153 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {24678#true} {25134#(and (= 19 main_~y~0) (= 15 (+ main_~c~0 (- 4))))} #54#return; {25134#(and (= 19 main_~y~0) (= 15 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:45:15,154 INFO L290 TraceCheckUtils]: 151: Hoare triple {25134#(and (= 19 main_~y~0) (= 15 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25156#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-27 14:45:15,154 INFO L290 TraceCheckUtils]: 152: Hoare triple {25156#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {25156#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-27 14:45:15,154 INFO L272 TraceCheckUtils]: 153: Hoare triple {25156#(and (= main_~c~0 20) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,154 INFO L290 TraceCheckUtils]: 154: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,154 INFO L290 TraceCheckUtils]: 155: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,154 INFO L290 TraceCheckUtils]: 156: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,155 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {24678#true} {25156#(and (= main_~c~0 20) (= main_~y~0 20))} #54#return; {25156#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-27 14:45:15,155 INFO L290 TraceCheckUtils]: 158: Hoare triple {25156#(and (= main_~c~0 20) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25178#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 14:45:15,155 INFO L290 TraceCheckUtils]: 159: Hoare triple {25178#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {25178#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 14:45:15,155 INFO L272 TraceCheckUtils]: 160: Hoare triple {25178#(and (= main_~c~0 21) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,155 INFO L290 TraceCheckUtils]: 161: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,156 INFO L290 TraceCheckUtils]: 162: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,156 INFO L290 TraceCheckUtils]: 163: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,156 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {24678#true} {25178#(and (= main_~c~0 21) (= main_~y~0 21))} #54#return; {25178#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 14:45:15,156 INFO L290 TraceCheckUtils]: 165: Hoare triple {25178#(and (= main_~c~0 21) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25200#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-27 14:45:15,157 INFO L290 TraceCheckUtils]: 166: Hoare triple {25200#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} assume !false; {25200#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-27 14:45:15,157 INFO L272 TraceCheckUtils]: 167: Hoare triple {25200#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,157 INFO L290 TraceCheckUtils]: 168: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,157 INFO L290 TraceCheckUtils]: 169: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,157 INFO L290 TraceCheckUtils]: 170: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,157 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {24678#true} {25200#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} #54#return; {25200#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-27 14:45:15,158 INFO L290 TraceCheckUtils]: 172: Hoare triple {25200#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25222#(and (= (+ (- 2) main_~y~0) 21) (= (+ (- 1) main_~c~0) 22))} is VALID [2022-04-27 14:45:15,158 INFO L290 TraceCheckUtils]: 173: Hoare triple {25222#(and (= (+ (- 2) main_~y~0) 21) (= (+ (- 1) main_~c~0) 22))} assume !false; {25222#(and (= (+ (- 2) main_~y~0) 21) (= (+ (- 1) main_~c~0) 22))} is VALID [2022-04-27 14:45:15,158 INFO L272 TraceCheckUtils]: 174: Hoare triple {25222#(and (= (+ (- 2) main_~y~0) 21) (= (+ (- 1) main_~c~0) 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,158 INFO L290 TraceCheckUtils]: 175: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,158 INFO L290 TraceCheckUtils]: 176: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,158 INFO L290 TraceCheckUtils]: 177: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,159 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {24678#true} {25222#(and (= (+ (- 2) main_~y~0) 21) (= (+ (- 1) main_~c~0) 22))} #54#return; {25222#(and (= (+ (- 2) main_~y~0) 21) (= (+ (- 1) main_~c~0) 22))} is VALID [2022-04-27 14:45:15,159 INFO L290 TraceCheckUtils]: 179: Hoare triple {25222#(and (= (+ (- 2) main_~y~0) 21) (= (+ (- 1) main_~c~0) 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25244#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 14:45:15,159 INFO L290 TraceCheckUtils]: 180: Hoare triple {25244#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {25244#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 14:45:15,160 INFO L272 TraceCheckUtils]: 181: Hoare triple {25244#(and (= main_~c~0 24) (= main_~y~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,160 INFO L290 TraceCheckUtils]: 182: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,160 INFO L290 TraceCheckUtils]: 183: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,160 INFO L290 TraceCheckUtils]: 184: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,160 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {24678#true} {25244#(and (= main_~c~0 24) (= main_~y~0 24))} #54#return; {25244#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 14:45:15,161 INFO L290 TraceCheckUtils]: 186: Hoare triple {25244#(and (= main_~c~0 24) (= main_~y~0 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25266#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-27 14:45:15,161 INFO L290 TraceCheckUtils]: 187: Hoare triple {25266#(and (= main_~y~0 25) (= main_~c~0 25))} assume !false; {25266#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-27 14:45:15,161 INFO L272 TraceCheckUtils]: 188: Hoare triple {25266#(and (= main_~y~0 25) (= main_~c~0 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,161 INFO L290 TraceCheckUtils]: 189: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,161 INFO L290 TraceCheckUtils]: 190: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,161 INFO L290 TraceCheckUtils]: 191: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,161 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {24678#true} {25266#(and (= main_~y~0 25) (= main_~c~0 25))} #54#return; {25266#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-27 14:45:15,162 INFO L290 TraceCheckUtils]: 193: Hoare triple {25266#(and (= main_~y~0 25) (= main_~c~0 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25288#(and (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} is VALID [2022-04-27 14:45:15,162 INFO L290 TraceCheckUtils]: 194: Hoare triple {25288#(and (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} assume !false; {25288#(and (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} is VALID [2022-04-27 14:45:15,162 INFO L272 TraceCheckUtils]: 195: Hoare triple {25288#(and (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,162 INFO L290 TraceCheckUtils]: 196: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,162 INFO L290 TraceCheckUtils]: 197: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,162 INFO L290 TraceCheckUtils]: 198: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,163 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {24678#true} {25288#(and (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} #54#return; {25288#(and (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} is VALID [2022-04-27 14:45:15,163 INFO L290 TraceCheckUtils]: 200: Hoare triple {25288#(and (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25310#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-27 14:45:15,164 INFO L290 TraceCheckUtils]: 201: Hoare triple {25310#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {25310#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-27 14:45:15,164 INFO L272 TraceCheckUtils]: 202: Hoare triple {25310#(and (= main_~y~0 27) (= main_~c~0 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,164 INFO L290 TraceCheckUtils]: 203: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,164 INFO L290 TraceCheckUtils]: 204: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,164 INFO L290 TraceCheckUtils]: 205: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,171 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {24678#true} {25310#(and (= main_~y~0 27) (= main_~c~0 27))} #54#return; {25310#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-27 14:45:15,172 INFO L290 TraceCheckUtils]: 207: Hoare triple {25310#(and (= main_~y~0 27) (= main_~c~0 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25332#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-27 14:45:15,172 INFO L290 TraceCheckUtils]: 208: Hoare triple {25332#(and (= main_~c~0 28) (= main_~y~0 28))} assume !false; {25332#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-27 14:45:15,172 INFO L272 TraceCheckUtils]: 209: Hoare triple {25332#(and (= main_~c~0 28) (= main_~y~0 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,172 INFO L290 TraceCheckUtils]: 210: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,172 INFO L290 TraceCheckUtils]: 211: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,172 INFO L290 TraceCheckUtils]: 212: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,173 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {24678#true} {25332#(and (= main_~c~0 28) (= main_~y~0 28))} #54#return; {25332#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-27 14:45:15,173 INFO L290 TraceCheckUtils]: 214: Hoare triple {25332#(and (= main_~c~0 28) (= main_~y~0 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25354#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:45:15,174 INFO L290 TraceCheckUtils]: 215: Hoare triple {25354#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} assume !false; {25354#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:45:15,174 INFO L272 TraceCheckUtils]: 216: Hoare triple {25354#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 14:45:15,174 INFO L290 TraceCheckUtils]: 217: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 14:45:15,174 INFO L290 TraceCheckUtils]: 218: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 14:45:15,174 INFO L290 TraceCheckUtils]: 219: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 14:45:15,174 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {24678#true} {25354#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} #54#return; {25354#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:45:15,175 INFO L290 TraceCheckUtils]: 221: Hoare triple {25354#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} assume !(~c~0 < ~k~0); {25376#(and (< 28 main_~k~0) (= 28 (+ (- 1) main_~y~0)) (<= main_~k~0 29))} is VALID [2022-04-27 14:45:15,176 INFO L272 TraceCheckUtils]: 222: Hoare triple {25376#(and (< 28 main_~k~0) (= 28 (+ (- 1) main_~y~0)) (<= main_~k~0 29))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25380#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:45:15,176 INFO L290 TraceCheckUtils]: 223: Hoare triple {25380#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25384#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:45:15,176 INFO L290 TraceCheckUtils]: 224: Hoare triple {25384#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24679#false} is VALID [2022-04-27 14:45:15,176 INFO L290 TraceCheckUtils]: 225: Hoare triple {24679#false} assume !false; {24679#false} is VALID [2022-04-27 14:45:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 60 proven. 1305 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2022-04-27 14:45:15,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:45:15,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:45:15,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309856835] [2022-04-27 14:45:15,621 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:45:15,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372228067] [2022-04-27 14:45:15,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372228067] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:45:15,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:45:15,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2022-04-27 14:45:15,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120377224] [2022-04-27 14:45:15,622 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:45:15,622 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) Word has length 226 [2022-04-27 14:45:15,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:45:15,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-04-27 14:45:15,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:45:15,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-27 14:45:15,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:45:15,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-27 14:45:15,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 14:45:15,940 INFO L87 Difference]: Start difference. First operand 115 states and 143 transitions. Second operand has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-04-27 14:45:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:45:30,831 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2022-04-27 14:45:30,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-27 14:45:30,832 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) Word has length 226 [2022-04-27 14:45:30,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:45:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-04-27 14:45:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 148 transitions. [2022-04-27 14:45:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-04-27 14:45:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 148 transitions. [2022-04-27 14:45:30,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 148 transitions. [2022-04-27 14:45:31,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:45:31,242 INFO L225 Difference]: With dead ends: 123 [2022-04-27 14:45:31,242 INFO L226 Difference]: Without dead ends: 118 [2022-04-27 14:45:31,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 14:45:31,243 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 3047 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 3047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-27 14:45:31,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1655 Invalid, 3047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3047 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-04-27 14:45:31,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-27 14:45:31,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-27 14:45:31,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:45:31,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 14:45:31,318 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 14:45:31,318 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 14:45:31,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:45:31,320 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-27 14:45:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2022-04-27 14:45:31,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:45:31,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:45:31,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 118 states. [2022-04-27 14:45:31,321 INFO L87 Difference]: Start difference. First operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 118 states. [2022-04-27 14:45:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:45:31,323 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-27 14:45:31,323 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2022-04-27 14:45:31,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:45:31,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:45:31,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:45:31,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:45:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 14:45:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2022-04-27 14:45:31,325 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 226 [2022-04-27 14:45:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:45:31,325 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2022-04-27 14:45:31,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-04-27 14:45:31,326 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2022-04-27 14:45:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-04-27 14:45:31,326 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:45:31,326 INFO L195 NwaCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:45:31,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-27 14:45:31,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:45:31,534 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:45:31,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:45:31,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1527648759, now seen corresponding path program 30 times [2022-04-27 14:45:31,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:45:31,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091743277] [2022-04-27 14:45:31,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:45:31,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:45:31,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:45:31,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [110841588] [2022-04-27 14:45:31,549 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:45:31,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:45:31,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:45:31,550 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:45:31,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-27 14:45:41,703 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-27 14:45:41,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:45:41,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 129 conjunts are in the unsatisfiable core [2022-04-27 14:45:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:45:41,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:45:43,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {26059#true} call ULTIMATE.init(); {26059#true} is VALID [2022-04-27 14:45:43,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {26059#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(9, 2);call #Ultimate.allocInit(12, 3); {26059#true} is VALID [2022-04-27 14:45:43,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26059#true} {26059#true} #60#return; {26059#true} is VALID [2022-04-27 14:45:43,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {26059#true} call #t~ret5 := main(); {26059#true} is VALID [2022-04-27 14:45:43,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {26059#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {26059#true} is VALID [2022-04-27 14:45:43,351 INFO L272 TraceCheckUtils]: 6: Hoare triple {26059#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,351 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26059#true} {26059#true} #52#return; {26059#true} is VALID [2022-04-27 14:45:43,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {26059#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {26097#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:45:43,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {26097#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {26097#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:45:43,352 INFO L272 TraceCheckUtils]: 13: Hoare triple {26097#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,352 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {26059#true} {26097#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {26097#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:45:43,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {26097#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26119#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:45:43,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {26119#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {26119#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:45:43,353 INFO L272 TraceCheckUtils]: 20: Hoare triple {26119#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,354 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {26059#true} {26119#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {26119#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:45:43,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {26119#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26141#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {26141#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !false; {26141#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,355 INFO L272 TraceCheckUtils]: 27: Hoare triple {26141#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,356 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26059#true} {26141#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} #54#return; {26141#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {26141#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26163#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:45:43,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {26163#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {26163#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:45:43,357 INFO L272 TraceCheckUtils]: 34: Hoare triple {26163#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,357 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {26059#true} {26163#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #54#return; {26163#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:45:43,358 INFO L290 TraceCheckUtils]: 39: Hoare triple {26163#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26185#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {26185#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {26185#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,358 INFO L272 TraceCheckUtils]: 41: Hoare triple {26185#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,358 INFO L290 TraceCheckUtils]: 42: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,358 INFO L290 TraceCheckUtils]: 43: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,358 INFO L290 TraceCheckUtils]: 44: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,359 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {26059#true} {26185#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {26185#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,359 INFO L290 TraceCheckUtils]: 46: Hoare triple {26185#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26207#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,359 INFO L290 TraceCheckUtils]: 47: Hoare triple {26207#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} assume !false; {26207#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,359 INFO L272 TraceCheckUtils]: 48: Hoare triple {26207#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,360 INFO L290 TraceCheckUtils]: 49: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,360 INFO L290 TraceCheckUtils]: 50: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,360 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {26059#true} {26207#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} #54#return; {26207#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,360 INFO L290 TraceCheckUtils]: 53: Hoare triple {26207#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26229#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {26229#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !false; {26229#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,361 INFO L272 TraceCheckUtils]: 55: Hoare triple {26229#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,361 INFO L290 TraceCheckUtils]: 56: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,361 INFO L290 TraceCheckUtils]: 57: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,361 INFO L290 TraceCheckUtils]: 58: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,361 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {26059#true} {26229#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #54#return; {26229#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,362 INFO L290 TraceCheckUtils]: 60: Hoare triple {26229#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26251#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,362 INFO L290 TraceCheckUtils]: 61: Hoare triple {26251#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {26251#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,362 INFO L272 TraceCheckUtils]: 62: Hoare triple {26251#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,362 INFO L290 TraceCheckUtils]: 63: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,362 INFO L290 TraceCheckUtils]: 64: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,362 INFO L290 TraceCheckUtils]: 65: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,363 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {26059#true} {26251#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {26251#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,363 INFO L290 TraceCheckUtils]: 67: Hoare triple {26251#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26273#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,364 INFO L290 TraceCheckUtils]: 68: Hoare triple {26273#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} assume !false; {26273#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,364 INFO L272 TraceCheckUtils]: 69: Hoare triple {26273#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,364 INFO L290 TraceCheckUtils]: 70: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,364 INFO L290 TraceCheckUtils]: 71: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,364 INFO L290 TraceCheckUtils]: 72: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,364 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {26059#true} {26273#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} #54#return; {26273#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,365 INFO L290 TraceCheckUtils]: 74: Hoare triple {26273#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26295#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,365 INFO L290 TraceCheckUtils]: 75: Hoare triple {26295#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {26295#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,365 INFO L272 TraceCheckUtils]: 76: Hoare triple {26295#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,365 INFO L290 TraceCheckUtils]: 77: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,365 INFO L290 TraceCheckUtils]: 78: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,365 INFO L290 TraceCheckUtils]: 79: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,366 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {26059#true} {26295#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #54#return; {26295#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,366 INFO L290 TraceCheckUtils]: 81: Hoare triple {26295#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26317#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,366 INFO L290 TraceCheckUtils]: 82: Hoare triple {26317#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))) (< 0 main_~k~0))} assume !false; {26317#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,366 INFO L272 TraceCheckUtils]: 83: Hoare triple {26317#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,367 INFO L290 TraceCheckUtils]: 84: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,367 INFO L290 TraceCheckUtils]: 85: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,367 INFO L290 TraceCheckUtils]: 86: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,367 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {26059#true} {26317#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))) (< 0 main_~k~0))} #54#return; {26317#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,367 INFO L290 TraceCheckUtils]: 88: Hoare triple {26317#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26339#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,368 INFO L290 TraceCheckUtils]: 89: Hoare triple {26339#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !false; {26339#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,368 INFO L272 TraceCheckUtils]: 90: Hoare triple {26339#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,368 INFO L290 TraceCheckUtils]: 91: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,368 INFO L290 TraceCheckUtils]: 92: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,368 INFO L290 TraceCheckUtils]: 93: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,368 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {26059#true} {26339#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} #54#return; {26339#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,369 INFO L290 TraceCheckUtils]: 95: Hoare triple {26339#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26361#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,369 INFO L290 TraceCheckUtils]: 96: Hoare triple {26361#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} assume !false; {26361#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,369 INFO L272 TraceCheckUtils]: 97: Hoare triple {26361#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,369 INFO L290 TraceCheckUtils]: 98: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,370 INFO L290 TraceCheckUtils]: 99: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,370 INFO L290 TraceCheckUtils]: 100: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,370 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {26059#true} {26361#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} #54#return; {26361#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,371 INFO L290 TraceCheckUtils]: 102: Hoare triple {26361#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26383#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,371 INFO L290 TraceCheckUtils]: 103: Hoare triple {26383#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {26383#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,371 INFO L272 TraceCheckUtils]: 104: Hoare triple {26383#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,371 INFO L290 TraceCheckUtils]: 105: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,371 INFO L290 TraceCheckUtils]: 106: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,371 INFO L290 TraceCheckUtils]: 107: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,372 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {26059#true} {26383#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {26383#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,372 INFO L290 TraceCheckUtils]: 109: Hoare triple {26383#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26405#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,373 INFO L290 TraceCheckUtils]: 110: Hoare triple {26405#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14) (< 0 main_~k~0))} assume !false; {26405#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,373 INFO L272 TraceCheckUtils]: 111: Hoare triple {26405#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,373 INFO L290 TraceCheckUtils]: 112: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,373 INFO L290 TraceCheckUtils]: 113: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,373 INFO L290 TraceCheckUtils]: 114: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,373 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {26059#true} {26405#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14) (< 0 main_~k~0))} #54#return; {26405#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,374 INFO L290 TraceCheckUtils]: 116: Hoare triple {26405#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26427#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,374 INFO L290 TraceCheckUtils]: 117: Hoare triple {26427#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12) (< 0 main_~k~0))} assume !false; {26427#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,374 INFO L272 TraceCheckUtils]: 118: Hoare triple {26427#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,374 INFO L290 TraceCheckUtils]: 119: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,374 INFO L290 TraceCheckUtils]: 120: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,374 INFO L290 TraceCheckUtils]: 121: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,375 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {26059#true} {26427#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12) (< 0 main_~k~0))} #54#return; {26427#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,375 INFO L290 TraceCheckUtils]: 123: Hoare triple {26427#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26449#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,376 INFO L290 TraceCheckUtils]: 124: Hoare triple {26449#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} assume !false; {26449#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,376 INFO L272 TraceCheckUtils]: 125: Hoare triple {26449#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,376 INFO L290 TraceCheckUtils]: 126: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,376 INFO L290 TraceCheckUtils]: 127: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,376 INFO L290 TraceCheckUtils]: 128: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,376 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {26059#true} {26449#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} #54#return; {26449#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,377 INFO L290 TraceCheckUtils]: 130: Hoare triple {26449#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26471#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,377 INFO L290 TraceCheckUtils]: 131: Hoare triple {26471#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {26471#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,377 INFO L272 TraceCheckUtils]: 132: Hoare triple {26471#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,377 INFO L290 TraceCheckUtils]: 133: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,377 INFO L290 TraceCheckUtils]: 134: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,377 INFO L290 TraceCheckUtils]: 135: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,378 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {26059#true} {26471#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {26471#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,378 INFO L290 TraceCheckUtils]: 137: Hoare triple {26471#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26493#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-27 14:45:43,378 INFO L290 TraceCheckUtils]: 138: Hoare triple {26493#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !false; {26493#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-27 14:45:43,378 INFO L272 TraceCheckUtils]: 139: Hoare triple {26493#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,379 INFO L290 TraceCheckUtils]: 140: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,379 INFO L290 TraceCheckUtils]: 141: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,379 INFO L290 TraceCheckUtils]: 142: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,379 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {26059#true} {26493#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} #54#return; {26493#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-27 14:45:43,379 INFO L290 TraceCheckUtils]: 144: Hoare triple {26493#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26515#(and (= 19 main_~y~0) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 14:45:43,380 INFO L290 TraceCheckUtils]: 145: Hoare triple {26515#(and (= 19 main_~y~0) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {26515#(and (= 19 main_~y~0) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 14:45:43,380 INFO L272 TraceCheckUtils]: 146: Hoare triple {26515#(and (= 19 main_~y~0) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,380 INFO L290 TraceCheckUtils]: 147: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,380 INFO L290 TraceCheckUtils]: 148: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,380 INFO L290 TraceCheckUtils]: 149: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,381 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {26059#true} {26515#(and (= 19 main_~y~0) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} #54#return; {26515#(and (= 19 main_~y~0) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 14:45:43,381 INFO L290 TraceCheckUtils]: 151: Hoare triple {26515#(and (= 19 main_~y~0) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26537#(and (= 18 (+ (- 2) main_~c~0)) (= main_~y~0 20) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,381 INFO L290 TraceCheckUtils]: 152: Hoare triple {26537#(and (= 18 (+ (- 2) main_~c~0)) (= main_~y~0 20) (< 0 main_~k~0))} assume !false; {26537#(and (= 18 (+ (- 2) main_~c~0)) (= main_~y~0 20) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,381 INFO L272 TraceCheckUtils]: 153: Hoare triple {26537#(and (= 18 (+ (- 2) main_~c~0)) (= main_~y~0 20) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,381 INFO L290 TraceCheckUtils]: 154: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,382 INFO L290 TraceCheckUtils]: 155: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,382 INFO L290 TraceCheckUtils]: 156: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,382 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {26059#true} {26537#(and (= 18 (+ (- 2) main_~c~0)) (= main_~y~0 20) (< 0 main_~k~0))} #54#return; {26537#(and (= 18 (+ (- 2) main_~c~0)) (= main_~y~0 20) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,383 INFO L290 TraceCheckUtils]: 158: Hoare triple {26537#(and (= 18 (+ (- 2) main_~c~0)) (= main_~y~0 20) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26559#(and (= (+ main_~c~0 (- 3)) 18) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,383 INFO L290 TraceCheckUtils]: 159: Hoare triple {26559#(and (= (+ main_~c~0 (- 3)) 18) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {26559#(and (= (+ main_~c~0 (- 3)) 18) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,383 INFO L272 TraceCheckUtils]: 160: Hoare triple {26559#(and (= (+ main_~c~0 (- 3)) 18) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,383 INFO L290 TraceCheckUtils]: 161: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,383 INFO L290 TraceCheckUtils]: 162: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,383 INFO L290 TraceCheckUtils]: 163: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,387 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {26059#true} {26559#(and (= (+ main_~c~0 (- 3)) 18) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {26559#(and (= (+ main_~c~0 (- 3)) 18) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,388 INFO L290 TraceCheckUtils]: 165: Hoare triple {26559#(and (= (+ main_~c~0 (- 3)) 18) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26581#(and (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 20) (= 18 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:45:43,388 INFO L290 TraceCheckUtils]: 166: Hoare triple {26581#(and (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 20) (= 18 (+ main_~c~0 (- 4))))} assume !false; {26581#(and (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 20) (= 18 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:45:43,388 INFO L272 TraceCheckUtils]: 167: Hoare triple {26581#(and (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 20) (= 18 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,388 INFO L290 TraceCheckUtils]: 168: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,388 INFO L290 TraceCheckUtils]: 169: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,388 INFO L290 TraceCheckUtils]: 170: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,389 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {26059#true} {26581#(and (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 20) (= 18 (+ main_~c~0 (- 4))))} #54#return; {26581#(and (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 20) (= 18 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 14:45:43,389 INFO L290 TraceCheckUtils]: 172: Hoare triple {26581#(and (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 20) (= 18 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26603#(and (= (+ main_~c~0 (- 5)) 18) (= (+ main_~y~0 (- 3)) 20) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,390 INFO L290 TraceCheckUtils]: 173: Hoare triple {26603#(and (= (+ main_~c~0 (- 5)) 18) (= (+ main_~y~0 (- 3)) 20) (< 0 main_~k~0))} assume !false; {26603#(and (= (+ main_~c~0 (- 5)) 18) (= (+ main_~y~0 (- 3)) 20) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,390 INFO L272 TraceCheckUtils]: 174: Hoare triple {26603#(and (= (+ main_~c~0 (- 5)) 18) (= (+ main_~y~0 (- 3)) 20) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,390 INFO L290 TraceCheckUtils]: 175: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,390 INFO L290 TraceCheckUtils]: 176: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,390 INFO L290 TraceCheckUtils]: 177: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,391 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {26059#true} {26603#(and (= (+ main_~c~0 (- 5)) 18) (= (+ main_~y~0 (- 3)) 20) (< 0 main_~k~0))} #54#return; {26603#(and (= (+ main_~c~0 (- 5)) 18) (= (+ main_~y~0 (- 3)) 20) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,391 INFO L290 TraceCheckUtils]: 179: Hoare triple {26603#(and (= (+ main_~c~0 (- 5)) 18) (= (+ main_~y~0 (- 3)) 20) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26625#(and (= (+ main_~c~0 (- 6)) 18) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,391 INFO L290 TraceCheckUtils]: 180: Hoare triple {26625#(and (= (+ main_~c~0 (- 6)) 18) (= main_~y~0 24) (< 0 main_~k~0))} assume !false; {26625#(and (= (+ main_~c~0 (- 6)) 18) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,392 INFO L272 TraceCheckUtils]: 181: Hoare triple {26625#(and (= (+ main_~c~0 (- 6)) 18) (= main_~y~0 24) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,392 INFO L290 TraceCheckUtils]: 182: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,392 INFO L290 TraceCheckUtils]: 183: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,392 INFO L290 TraceCheckUtils]: 184: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,392 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {26059#true} {26625#(and (= (+ main_~c~0 (- 6)) 18) (= main_~y~0 24) (< 0 main_~k~0))} #54#return; {26625#(and (= (+ main_~c~0 (- 6)) 18) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,393 INFO L290 TraceCheckUtils]: 186: Hoare triple {26625#(and (= (+ main_~c~0 (- 6)) 18) (= main_~y~0 24) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26647#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,393 INFO L290 TraceCheckUtils]: 187: Hoare triple {26647#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} assume !false; {26647#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,394 INFO L272 TraceCheckUtils]: 188: Hoare triple {26647#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,394 INFO L290 TraceCheckUtils]: 189: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,394 INFO L290 TraceCheckUtils]: 190: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,394 INFO L290 TraceCheckUtils]: 191: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,394 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {26059#true} {26647#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} #54#return; {26647#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,395 INFO L290 TraceCheckUtils]: 193: Hoare triple {26647#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26669#(and (= main_~c~0 26) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-27 14:45:43,395 INFO L290 TraceCheckUtils]: 194: Hoare triple {26669#(and (= main_~c~0 26) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 25))} assume !false; {26669#(and (= main_~c~0 26) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-27 14:45:43,395 INFO L272 TraceCheckUtils]: 195: Hoare triple {26669#(and (= main_~c~0 26) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,396 INFO L290 TraceCheckUtils]: 196: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,396 INFO L290 TraceCheckUtils]: 197: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,396 INFO L290 TraceCheckUtils]: 198: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,396 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {26059#true} {26669#(and (= main_~c~0 26) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 25))} #54#return; {26669#(and (= main_~c~0 26) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-27 14:45:43,397 INFO L290 TraceCheckUtils]: 200: Hoare triple {26669#(and (= main_~c~0 26) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26691#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,397 INFO L290 TraceCheckUtils]: 201: Hoare triple {26691#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27) (< 0 main_~k~0))} assume !false; {26691#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,397 INFO L272 TraceCheckUtils]: 202: Hoare triple {26691#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,397 INFO L290 TraceCheckUtils]: 203: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,397 INFO L290 TraceCheckUtils]: 204: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,397 INFO L290 TraceCheckUtils]: 205: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,398 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {26059#true} {26691#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27) (< 0 main_~k~0))} #54#return; {26691#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,398 INFO L290 TraceCheckUtils]: 207: Hoare triple {26691#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26713#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,398 INFO L290 TraceCheckUtils]: 208: Hoare triple {26713#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} assume !false; {26713#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,399 INFO L272 TraceCheckUtils]: 209: Hoare triple {26713#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,399 INFO L290 TraceCheckUtils]: 210: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,399 INFO L290 TraceCheckUtils]: 211: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,399 INFO L290 TraceCheckUtils]: 212: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,399 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {26059#true} {26713#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} #54#return; {26713#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,400 INFO L290 TraceCheckUtils]: 214: Hoare triple {26713#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26735#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,400 INFO L290 TraceCheckUtils]: 215: Hoare triple {26735#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} assume !false; {26735#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,400 INFO L272 TraceCheckUtils]: 216: Hoare triple {26735#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,400 INFO L290 TraceCheckUtils]: 217: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,400 INFO L290 TraceCheckUtils]: 218: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,400 INFO L290 TraceCheckUtils]: 219: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,401 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {26059#true} {26735#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} #54#return; {26735#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:45:43,401 INFO L290 TraceCheckUtils]: 221: Hoare triple {26735#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26757#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-27 14:45:43,401 INFO L290 TraceCheckUtils]: 222: Hoare triple {26757#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} assume !false; {26757#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-27 14:45:43,401 INFO L272 TraceCheckUtils]: 223: Hoare triple {26757#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26059#true} is VALID [2022-04-27 14:45:43,402 INFO L290 TraceCheckUtils]: 224: Hoare triple {26059#true} ~cond := #in~cond; {26059#true} is VALID [2022-04-27 14:45:43,402 INFO L290 TraceCheckUtils]: 225: Hoare triple {26059#true} assume !(0 == ~cond); {26059#true} is VALID [2022-04-27 14:45:43,402 INFO L290 TraceCheckUtils]: 226: Hoare triple {26059#true} assume true; {26059#true} is VALID [2022-04-27 14:45:43,402 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {26059#true} {26757#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} #54#return; {26757#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-27 14:45:43,402 INFO L290 TraceCheckUtils]: 228: Hoare triple {26757#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} assume !(~c~0 < ~k~0); {26779#(and (<= main_~k~0 30) (= 30 main_~y~0) (< 29 main_~k~0))} is VALID [2022-04-27 14:45:43,403 INFO L272 TraceCheckUtils]: 229: Hoare triple {26779#(and (<= main_~k~0 30) (= 30 main_~y~0) (< 29 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26783#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:45:43,403 INFO L290 TraceCheckUtils]: 230: Hoare triple {26783#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26787#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:45:43,404 INFO L290 TraceCheckUtils]: 231: Hoare triple {26787#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26060#false} is VALID [2022-04-27 14:45:43,404 INFO L290 TraceCheckUtils]: 232: Hoare triple {26060#false} assume !false; {26060#false} is VALID [2022-04-27 14:45:43,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3317 backedges. 62 proven. 1395 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2022-04-27 14:45:43,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:45:47,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:45:47,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091743277] [2022-04-27 14:45:47,967 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:45:47,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110841588] [2022-04-27 14:45:47,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110841588] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:45:47,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:45:47,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2022-04-27 14:45:47,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030130407] [2022-04-27 14:45:47,967 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:45:47,968 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) Word has length 233 [2022-04-27 14:45:47,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:45:47,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-04-27 14:45:48,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:45:48,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-27 14:45:48,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:45:48,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-27 14:45:48,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=3516, Unknown=0, NotChecked=0, Total=4556 [2022-04-27 14:45:48,346 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-04-27 14:46:06,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:46:06,866 INFO L93 Difference]: Finished difference Result 126 states and 156 transitions. [2022-04-27 14:46:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-27 14:46:06,867 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) Word has length 233 [2022-04-27 14:46:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:46:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-04-27 14:46:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 152 transitions. [2022-04-27 14:46:06,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-04-27 14:46:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 152 transitions. [2022-04-27 14:46:06,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 152 transitions. [2022-04-27 14:46:07,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:46:07,302 INFO L225 Difference]: With dead ends: 126 [2022-04-27 14:46:07,302 INFO L226 Difference]: Without dead ends: 121 [2022-04-27 14:46:07,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1050, Invalid=3780, Unknown=0, NotChecked=0, Total=4830 [2022-04-27 14:46:07,303 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 3270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 3270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-04-27 14:46:07,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1710 Invalid, 3270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3270 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2022-04-27 14:46:07,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-27 14:46:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-04-27 14:46:07,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:46:07,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 14:46:07,408 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 14:46:07,408 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 14:46:07,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:46:07,410 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-27 14:46:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-27 14:46:07,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:46:07,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:46:07,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 121 states. [2022-04-27 14:46:07,411 INFO L87 Difference]: Start difference. First operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 121 states. [2022-04-27 14:46:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:46:07,413 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-27 14:46:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-27 14:46:07,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:46:07,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:46:07,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:46:07,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:46:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 14:46:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 151 transitions. [2022-04-27 14:46:07,416 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 151 transitions. Word has length 233 [2022-04-27 14:46:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:46:07,416 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 151 transitions. [2022-04-27 14:46:07,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-04-27 14:46:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-27 14:46:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-04-27 14:46:07,417 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:46:07,417 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:46:07,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-27 14:46:07,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:46:07,626 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:46:07,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:46:07,626 INFO L85 PathProgramCache]: Analyzing trace with hash -155412760, now seen corresponding path program 31 times [2022-04-27 14:46:07,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:46:07,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097218296] [2022-04-27 14:46:07,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:46:07,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:46:07,647 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:46:07,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2144552065] [2022-04-27 14:46:07,647 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:46:07,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:46:07,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:46:07,648 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:46:07,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-27 14:46:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:46:08,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 132 conjunts are in the unsatisfiable core [2022-04-27 14:46:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:46:08,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:46:09,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {28116#true} call ULTIMATE.init(); {28116#true} is VALID [2022-04-27 14:46:09,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {28116#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(9, 2);call #Ultimate.allocInit(12, 3); {28116#true} is VALID [2022-04-27 14:46:09,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28116#true} {28116#true} #60#return; {28116#true} is VALID [2022-04-27 14:46:09,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {28116#true} call #t~ret5 := main(); {28116#true} is VALID [2022-04-27 14:46:09,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {28116#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {28116#true} is VALID [2022-04-27 14:46:09,826 INFO L272 TraceCheckUtils]: 6: Hoare triple {28116#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,826 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28116#true} {28116#true} #52#return; {28116#true} is VALID [2022-04-27 14:46:09,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {28116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {28154#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:46:09,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {28154#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {28154#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:46:09,827 INFO L272 TraceCheckUtils]: 13: Hoare triple {28154#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,827 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {28116#true} {28154#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {28154#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:46:09,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {28154#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28176#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:46:09,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {28176#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {28176#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:46:09,828 INFO L272 TraceCheckUtils]: 20: Hoare triple {28176#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,828 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {28116#true} {28176#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {28176#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:46:09,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {28176#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28198#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:46:09,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {28198#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {28198#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:46:09,829 INFO L272 TraceCheckUtils]: 27: Hoare triple {28198#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,830 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28116#true} {28198#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {28198#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:46:09,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {28198#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28220#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:46:09,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {28220#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {28220#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:46:09,830 INFO L272 TraceCheckUtils]: 34: Hoare triple {28220#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,831 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {28116#true} {28220#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {28220#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:46:09,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {28220#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28242#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:46:09,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {28242#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {28242#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:46:09,832 INFO L272 TraceCheckUtils]: 41: Hoare triple {28242#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,832 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {28116#true} {28242#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {28242#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:46:09,833 INFO L290 TraceCheckUtils]: 46: Hoare triple {28242#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28264#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:46:09,833 INFO L290 TraceCheckUtils]: 47: Hoare triple {28264#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {28264#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:46:09,833 INFO L272 TraceCheckUtils]: 48: Hoare triple {28264#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,833 INFO L290 TraceCheckUtils]: 49: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,833 INFO L290 TraceCheckUtils]: 50: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,833 INFO L290 TraceCheckUtils]: 51: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,833 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {28116#true} {28264#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {28264#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:46:09,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {28264#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28286#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:46:09,834 INFO L290 TraceCheckUtils]: 54: Hoare triple {28286#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {28286#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:46:09,834 INFO L272 TraceCheckUtils]: 55: Hoare triple {28286#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,834 INFO L290 TraceCheckUtils]: 56: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,834 INFO L290 TraceCheckUtils]: 57: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,834 INFO L290 TraceCheckUtils]: 58: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,835 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {28116#true} {28286#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {28286#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:46:09,835 INFO L290 TraceCheckUtils]: 60: Hoare triple {28286#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28308#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:46:09,835 INFO L290 TraceCheckUtils]: 61: Hoare triple {28308#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !false; {28308#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:46:09,835 INFO L272 TraceCheckUtils]: 62: Hoare triple {28308#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,836 INFO L290 TraceCheckUtils]: 63: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,836 INFO L290 TraceCheckUtils]: 64: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,836 INFO L290 TraceCheckUtils]: 65: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,836 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {28116#true} {28308#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #54#return; {28308#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:46:09,836 INFO L290 TraceCheckUtils]: 67: Hoare triple {28308#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28330#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:46:09,837 INFO L290 TraceCheckUtils]: 68: Hoare triple {28330#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} assume !false; {28330#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:46:09,837 INFO L272 TraceCheckUtils]: 69: Hoare triple {28330#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,837 INFO L290 TraceCheckUtils]: 70: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,837 INFO L290 TraceCheckUtils]: 71: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,837 INFO L290 TraceCheckUtils]: 72: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,837 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {28116#true} {28330#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} #54#return; {28330#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:46:09,838 INFO L290 TraceCheckUtils]: 74: Hoare triple {28330#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28352#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} is VALID [2022-04-27 14:46:09,838 INFO L290 TraceCheckUtils]: 75: Hoare triple {28352#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} assume !false; {28352#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} is VALID [2022-04-27 14:46:09,838 INFO L272 TraceCheckUtils]: 76: Hoare triple {28352#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,838 INFO L290 TraceCheckUtils]: 77: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,838 INFO L290 TraceCheckUtils]: 78: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,838 INFO L290 TraceCheckUtils]: 79: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,839 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {28116#true} {28352#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} #54#return; {28352#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} is VALID [2022-04-27 14:46:09,839 INFO L290 TraceCheckUtils]: 81: Hoare triple {28352#(and (= 5 (+ main_~y~0 (- 4))) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28374#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:46:09,839 INFO L290 TraceCheckUtils]: 82: Hoare triple {28374#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {28374#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:46:09,840 INFO L272 TraceCheckUtils]: 83: Hoare triple {28374#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,840 INFO L290 TraceCheckUtils]: 84: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,840 INFO L290 TraceCheckUtils]: 85: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,840 INFO L290 TraceCheckUtils]: 86: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,840 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {28116#true} {28374#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #54#return; {28374#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:46:09,840 INFO L290 TraceCheckUtils]: 88: Hoare triple {28374#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28396#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-27 14:46:09,841 INFO L290 TraceCheckUtils]: 89: Hoare triple {28396#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {28396#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-27 14:46:09,841 INFO L272 TraceCheckUtils]: 90: Hoare triple {28396#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,841 INFO L290 TraceCheckUtils]: 91: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,841 INFO L290 TraceCheckUtils]: 92: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,841 INFO L290 TraceCheckUtils]: 93: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,841 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {28116#true} {28396#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #54#return; {28396#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-27 14:46:09,842 INFO L290 TraceCheckUtils]: 95: Hoare triple {28396#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28418#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:46:09,842 INFO L290 TraceCheckUtils]: 96: Hoare triple {28418#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !false; {28418#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:46:09,842 INFO L272 TraceCheckUtils]: 97: Hoare triple {28418#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,842 INFO L290 TraceCheckUtils]: 98: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,842 INFO L290 TraceCheckUtils]: 99: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,842 INFO L290 TraceCheckUtils]: 100: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,843 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {28116#true} {28418#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} #54#return; {28418#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:46:09,843 INFO L290 TraceCheckUtils]: 102: Hoare triple {28418#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28440#(and (= 9 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:46:09,843 INFO L290 TraceCheckUtils]: 103: Hoare triple {28440#(and (= 9 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 11))} assume !false; {28440#(and (= 9 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:46:09,843 INFO L272 TraceCheckUtils]: 104: Hoare triple {28440#(and (= 9 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,843 INFO L290 TraceCheckUtils]: 105: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,844 INFO L290 TraceCheckUtils]: 106: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,844 INFO L290 TraceCheckUtils]: 107: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,844 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {28116#true} {28440#(and (= 9 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 11))} #54#return; {28440#(and (= 9 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 14:46:09,844 INFO L290 TraceCheckUtils]: 109: Hoare triple {28440#(and (= 9 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28462#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} is VALID [2022-04-27 14:46:09,845 INFO L290 TraceCheckUtils]: 110: Hoare triple {28462#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} assume !false; {28462#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} is VALID [2022-04-27 14:46:09,845 INFO L272 TraceCheckUtils]: 111: Hoare triple {28462#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,845 INFO L290 TraceCheckUtils]: 112: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,845 INFO L290 TraceCheckUtils]: 113: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,845 INFO L290 TraceCheckUtils]: 114: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,845 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {28116#true} {28462#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} #54#return; {28462#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} is VALID [2022-04-27 14:46:09,846 INFO L290 TraceCheckUtils]: 116: Hoare triple {28462#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28484#(and (= main_~c~0 15) (= (+ main_~y~0 (- 4)) 11))} is VALID [2022-04-27 14:46:09,846 INFO L290 TraceCheckUtils]: 117: Hoare triple {28484#(and (= main_~c~0 15) (= (+ main_~y~0 (- 4)) 11))} assume !false; {28484#(and (= main_~c~0 15) (= (+ main_~y~0 (- 4)) 11))} is VALID [2022-04-27 14:46:09,846 INFO L272 TraceCheckUtils]: 118: Hoare triple {28484#(and (= main_~c~0 15) (= (+ main_~y~0 (- 4)) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,846 INFO L290 TraceCheckUtils]: 119: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,846 INFO L290 TraceCheckUtils]: 120: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,846 INFO L290 TraceCheckUtils]: 121: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,847 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {28116#true} {28484#(and (= main_~c~0 15) (= (+ main_~y~0 (- 4)) 11))} #54#return; {28484#(and (= main_~c~0 15) (= (+ main_~y~0 (- 4)) 11))} is VALID [2022-04-27 14:46:09,847 INFO L290 TraceCheckUtils]: 123: Hoare triple {28484#(and (= main_~c~0 15) (= (+ main_~y~0 (- 4)) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28506#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:46:09,847 INFO L290 TraceCheckUtils]: 124: Hoare triple {28506#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {28506#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:46:09,847 INFO L272 TraceCheckUtils]: 125: Hoare triple {28506#(and (= main_~c~0 16) (= main_~y~0 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,847 INFO L290 TraceCheckUtils]: 126: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,847 INFO L290 TraceCheckUtils]: 127: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,847 INFO L290 TraceCheckUtils]: 128: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,848 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {28116#true} {28506#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {28506#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 14:46:09,848 INFO L290 TraceCheckUtils]: 130: Hoare triple {28506#(and (= main_~c~0 16) (= main_~y~0 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28528#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:46:09,848 INFO L290 TraceCheckUtils]: 131: Hoare triple {28528#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {28528#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:46:09,849 INFO L272 TraceCheckUtils]: 132: Hoare triple {28528#(and (= main_~c~0 17) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,849 INFO L290 TraceCheckUtils]: 133: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,849 INFO L290 TraceCheckUtils]: 134: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,849 INFO L290 TraceCheckUtils]: 135: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,849 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {28116#true} {28528#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {28528#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 14:46:09,849 INFO L290 TraceCheckUtils]: 137: Hoare triple {28528#(and (= main_~c~0 17) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28550#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:46:09,850 INFO L290 TraceCheckUtils]: 138: Hoare triple {28550#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {28550#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:46:09,850 INFO L272 TraceCheckUtils]: 139: Hoare triple {28550#(and (= main_~c~0 18) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,850 INFO L290 TraceCheckUtils]: 140: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,850 INFO L290 TraceCheckUtils]: 141: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,850 INFO L290 TraceCheckUtils]: 142: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,850 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {28116#true} {28550#(and (= main_~c~0 18) (= main_~y~0 18))} #54#return; {28550#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 14:46:09,851 INFO L290 TraceCheckUtils]: 144: Hoare triple {28550#(and (= main_~c~0 18) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28572#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 14:46:09,851 INFO L290 TraceCheckUtils]: 145: Hoare triple {28572#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} assume !false; {28572#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 14:46:09,851 INFO L272 TraceCheckUtils]: 146: Hoare triple {28572#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,851 INFO L290 TraceCheckUtils]: 147: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,851 INFO L290 TraceCheckUtils]: 148: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,851 INFO L290 TraceCheckUtils]: 149: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,852 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {28116#true} {28572#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} #54#return; {28572#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 14:46:09,852 INFO L290 TraceCheckUtils]: 151: Hoare triple {28572#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28594#(and (= 18 (+ (- 2) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-27 14:46:09,852 INFO L290 TraceCheckUtils]: 152: Hoare triple {28594#(and (= 18 (+ (- 2) main_~c~0)) (= main_~y~0 20))} assume !false; {28594#(and (= 18 (+ (- 2) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-27 14:46:09,852 INFO L272 TraceCheckUtils]: 153: Hoare triple {28594#(and (= 18 (+ (- 2) main_~c~0)) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,852 INFO L290 TraceCheckUtils]: 154: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,853 INFO L290 TraceCheckUtils]: 155: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,853 INFO L290 TraceCheckUtils]: 156: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,853 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {28116#true} {28594#(and (= 18 (+ (- 2) main_~c~0)) (= main_~y~0 20))} #54#return; {28594#(and (= 18 (+ (- 2) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-27 14:46:09,853 INFO L290 TraceCheckUtils]: 158: Hoare triple {28594#(and (= 18 (+ (- 2) main_~c~0)) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28616#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-27 14:46:09,854 INFO L290 TraceCheckUtils]: 159: Hoare triple {28616#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} assume !false; {28616#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-27 14:46:09,854 INFO L272 TraceCheckUtils]: 160: Hoare triple {28616#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,854 INFO L290 TraceCheckUtils]: 161: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,854 INFO L290 TraceCheckUtils]: 162: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,854 INFO L290 TraceCheckUtils]: 163: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,854 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {28116#true} {28616#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} #54#return; {28616#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-27 14:46:09,855 INFO L290 TraceCheckUtils]: 165: Hoare triple {28616#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28638#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:46:09,855 INFO L290 TraceCheckUtils]: 166: Hoare triple {28638#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {28638#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:46:09,855 INFO L272 TraceCheckUtils]: 167: Hoare triple {28638#(and (= main_~y~0 22) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,855 INFO L290 TraceCheckUtils]: 168: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,855 INFO L290 TraceCheckUtils]: 169: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,855 INFO L290 TraceCheckUtils]: 170: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,855 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {28116#true} {28638#(and (= main_~y~0 22) (= main_~c~0 22))} #54#return; {28638#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:46:09,856 INFO L290 TraceCheckUtils]: 172: Hoare triple {28638#(and (= main_~y~0 22) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28660#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:46:09,856 INFO L290 TraceCheckUtils]: 173: Hoare triple {28660#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} assume !false; {28660#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:46:09,856 INFO L272 TraceCheckUtils]: 174: Hoare triple {28660#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,856 INFO L290 TraceCheckUtils]: 175: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,856 INFO L290 TraceCheckUtils]: 176: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,856 INFO L290 TraceCheckUtils]: 177: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,857 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {28116#true} {28660#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} #54#return; {28660#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:46:09,857 INFO L290 TraceCheckUtils]: 179: Hoare triple {28660#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28682#(and (= 22 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-27 14:46:09,857 INFO L290 TraceCheckUtils]: 180: Hoare triple {28682#(and (= 22 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 22))} assume !false; {28682#(and (= 22 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-27 14:46:09,858 INFO L272 TraceCheckUtils]: 181: Hoare triple {28682#(and (= 22 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,858 INFO L290 TraceCheckUtils]: 182: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,858 INFO L290 TraceCheckUtils]: 183: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,858 INFO L290 TraceCheckUtils]: 184: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,858 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {28116#true} {28682#(and (= 22 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 22))} #54#return; {28682#(and (= 22 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-27 14:46:09,858 INFO L290 TraceCheckUtils]: 186: Hoare triple {28682#(and (= 22 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28704#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} is VALID [2022-04-27 14:46:09,859 INFO L290 TraceCheckUtils]: 187: Hoare triple {28704#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} assume !false; {28704#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} is VALID [2022-04-27 14:46:09,859 INFO L272 TraceCheckUtils]: 188: Hoare triple {28704#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,859 INFO L290 TraceCheckUtils]: 189: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,859 INFO L290 TraceCheckUtils]: 190: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,859 INFO L290 TraceCheckUtils]: 191: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,859 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {28116#true} {28704#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} #54#return; {28704#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} is VALID [2022-04-27 14:46:09,860 INFO L290 TraceCheckUtils]: 193: Hoare triple {28704#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28726#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} is VALID [2022-04-27 14:46:09,860 INFO L290 TraceCheckUtils]: 194: Hoare triple {28726#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} assume !false; {28726#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} is VALID [2022-04-27 14:46:09,860 INFO L272 TraceCheckUtils]: 195: Hoare triple {28726#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,860 INFO L290 TraceCheckUtils]: 196: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,860 INFO L290 TraceCheckUtils]: 197: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,860 INFO L290 TraceCheckUtils]: 198: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,861 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {28116#true} {28726#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} #54#return; {28726#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} is VALID [2022-04-27 14:46:09,861 INFO L290 TraceCheckUtils]: 200: Hoare triple {28726#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28748#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27))} is VALID [2022-04-27 14:46:09,861 INFO L290 TraceCheckUtils]: 201: Hoare triple {28748#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27))} assume !false; {28748#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27))} is VALID [2022-04-27 14:46:09,861 INFO L272 TraceCheckUtils]: 202: Hoare triple {28748#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,861 INFO L290 TraceCheckUtils]: 203: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,862 INFO L290 TraceCheckUtils]: 204: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,862 INFO L290 TraceCheckUtils]: 205: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,862 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {28116#true} {28748#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27))} #54#return; {28748#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27))} is VALID [2022-04-27 14:46:09,862 INFO L290 TraceCheckUtils]: 207: Hoare triple {28748#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28770#(and (= main_~c~0 28) (= (+ main_~y~0 (- 6)) 22))} is VALID [2022-04-27 14:46:09,863 INFO L290 TraceCheckUtils]: 208: Hoare triple {28770#(and (= main_~c~0 28) (= (+ main_~y~0 (- 6)) 22))} assume !false; {28770#(and (= main_~c~0 28) (= (+ main_~y~0 (- 6)) 22))} is VALID [2022-04-27 14:46:09,863 INFO L272 TraceCheckUtils]: 209: Hoare triple {28770#(and (= main_~c~0 28) (= (+ main_~y~0 (- 6)) 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,863 INFO L290 TraceCheckUtils]: 210: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,863 INFO L290 TraceCheckUtils]: 211: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,863 INFO L290 TraceCheckUtils]: 212: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,863 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {28116#true} {28770#(and (= main_~c~0 28) (= (+ main_~y~0 (- 6)) 22))} #54#return; {28770#(and (= main_~c~0 28) (= (+ main_~y~0 (- 6)) 22))} is VALID [2022-04-27 14:46:09,864 INFO L290 TraceCheckUtils]: 214: Hoare triple {28770#(and (= main_~c~0 28) (= (+ main_~y~0 (- 6)) 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28792#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-27 14:46:09,864 INFO L290 TraceCheckUtils]: 215: Hoare triple {28792#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !false; {28792#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-27 14:46:09,864 INFO L272 TraceCheckUtils]: 216: Hoare triple {28792#(and (= 29 main_~y~0) (= 29 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,864 INFO L290 TraceCheckUtils]: 217: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,864 INFO L290 TraceCheckUtils]: 218: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,864 INFO L290 TraceCheckUtils]: 219: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,864 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {28116#true} {28792#(and (= 29 main_~y~0) (= 29 main_~c~0))} #54#return; {28792#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-27 14:46:09,865 INFO L290 TraceCheckUtils]: 221: Hoare triple {28792#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28814#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} is VALID [2022-04-27 14:46:09,865 INFO L290 TraceCheckUtils]: 222: Hoare triple {28814#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} assume !false; {28814#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} is VALID [2022-04-27 14:46:09,865 INFO L272 TraceCheckUtils]: 223: Hoare triple {28814#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,865 INFO L290 TraceCheckUtils]: 224: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,865 INFO L290 TraceCheckUtils]: 225: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,865 INFO L290 TraceCheckUtils]: 226: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,866 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {28116#true} {28814#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} #54#return; {28814#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} is VALID [2022-04-27 14:46:09,866 INFO L290 TraceCheckUtils]: 228: Hoare triple {28814#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28836#(and (<= main_~c~0 31) (= 30 (+ (- 1) main_~y~0)) (< 30 main_~k~0))} is VALID [2022-04-27 14:46:09,866 INFO L290 TraceCheckUtils]: 229: Hoare triple {28836#(and (<= main_~c~0 31) (= 30 (+ (- 1) main_~y~0)) (< 30 main_~k~0))} assume !false; {28836#(and (<= main_~c~0 31) (= 30 (+ (- 1) main_~y~0)) (< 30 main_~k~0))} is VALID [2022-04-27 14:46:09,867 INFO L272 TraceCheckUtils]: 230: Hoare triple {28836#(and (<= main_~c~0 31) (= 30 (+ (- 1) main_~y~0)) (< 30 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28116#true} is VALID [2022-04-27 14:46:09,867 INFO L290 TraceCheckUtils]: 231: Hoare triple {28116#true} ~cond := #in~cond; {28116#true} is VALID [2022-04-27 14:46:09,867 INFO L290 TraceCheckUtils]: 232: Hoare triple {28116#true} assume !(0 == ~cond); {28116#true} is VALID [2022-04-27 14:46:09,867 INFO L290 TraceCheckUtils]: 233: Hoare triple {28116#true} assume true; {28116#true} is VALID [2022-04-27 14:46:09,867 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {28116#true} {28836#(and (<= main_~c~0 31) (= 30 (+ (- 1) main_~y~0)) (< 30 main_~k~0))} #54#return; {28836#(and (<= main_~c~0 31) (= 30 (+ (- 1) main_~y~0)) (< 30 main_~k~0))} is VALID [2022-04-27 14:46:09,868 INFO L290 TraceCheckUtils]: 235: Hoare triple {28836#(and (<= main_~c~0 31) (= 30 (+ (- 1) main_~y~0)) (< 30 main_~k~0))} assume !(~c~0 < ~k~0); {28858#(and (= 30 (+ (- 1) main_~y~0)) (< 30 main_~k~0) (<= main_~k~0 31))} is VALID [2022-04-27 14:46:09,868 INFO L272 TraceCheckUtils]: 236: Hoare triple {28858#(and (= 30 (+ (- 1) main_~y~0)) (< 30 main_~k~0) (<= main_~k~0 31))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28862#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:46:09,868 INFO L290 TraceCheckUtils]: 237: Hoare triple {28862#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28866#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:46:09,869 INFO L290 TraceCheckUtils]: 238: Hoare triple {28866#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28117#false} is VALID [2022-04-27 14:46:09,869 INFO L290 TraceCheckUtils]: 239: Hoare triple {28117#false} assume !false; {28117#false} is VALID [2022-04-27 14:46:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3536 backedges. 64 proven. 1488 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2022-04-27 14:46:09,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:46:10,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:46:10,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097218296] [2022-04-27 14:46:10,276 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:46:10,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144552065] [2022-04-27 14:46:10,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144552065] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:46:10,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:46:10,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2022-04-27 14:46:10,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618008507] [2022-04-27 14:46:10,277 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:46:10,278 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 36 states have internal predecessors, (77), 34 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) Word has length 240 [2022-04-27 14:46:10,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:46:10,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 36 states have internal predecessors, (77), 34 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2022-04-27 14:46:10,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:46:10,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-27 14:46:10,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:46:10,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-27 14:46:10,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 14:46:10,786 INFO L87 Difference]: Start difference. First operand 121 states and 151 transitions. Second operand has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 36 states have internal predecessors, (77), 34 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2022-04-27 14:46:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:46:32,791 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2022-04-27 14:46:32,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-27 14:46:32,791 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 36 states have internal predecessors, (77), 34 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) Word has length 240 [2022-04-27 14:46:32,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:46:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 36 states have internal predecessors, (77), 34 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2022-04-27 14:46:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 156 transitions. [2022-04-27 14:46:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 36 states have internal predecessors, (77), 34 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2022-04-27 14:46:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 156 transitions. [2022-04-27 14:46:32,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 156 transitions. [2022-04-27 14:46:33,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:46:33,428 INFO L225 Difference]: With dead ends: 129 [2022-04-27 14:46:33,428 INFO L226 Difference]: Without dead ends: 124 [2022-04-27 14:46:33,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=1598, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 14:46:33,429 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 3441 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 3441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-04-27 14:46:33,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1825 Invalid, 3441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3441 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2022-04-27 14:46:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-27 14:46:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-04-27 14:46:33,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:46:33,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 37 states have call successors, (37), 6 states have call predecessors, (37), 4 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 14:46:33,529 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 37 states have call successors, (37), 6 states have call predecessors, (37), 4 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 14:46:33,529 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 37 states have call successors, (37), 6 states have call predecessors, (37), 4 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 14:46:33,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:46:33,531 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2022-04-27 14:46:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2022-04-27 14:46:33,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:46:33,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:46:33,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 37 states have call successors, (37), 6 states have call predecessors, (37), 4 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 124 states. [2022-04-27 14:46:33,532 INFO L87 Difference]: Start difference. First operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 37 states have call successors, (37), 6 states have call predecessors, (37), 4 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 124 states. [2022-04-27 14:46:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:46:33,534 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2022-04-27 14:46:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2022-04-27 14:46:33,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:46:33,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:46:33,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:46:33,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:46:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 37 states have call successors, (37), 6 states have call predecessors, (37), 4 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 14:46:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 155 transitions. [2022-04-27 14:46:33,537 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 155 transitions. Word has length 240 [2022-04-27 14:46:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:46:33,537 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 155 transitions. [2022-04-27 14:46:33,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 36 states have internal predecessors, (77), 34 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2022-04-27 14:46:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2022-04-27 14:46:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-04-27 14:46:33,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:46:33,538 INFO L195 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:46:33,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-27 14:46:33,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-27 14:46:33,747 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:46:33,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:46:33,748 INFO L85 PathProgramCache]: Analyzing trace with hash 810222889, now seen corresponding path program 32 times [2022-04-27 14:46:33,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:46:33,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246921899] [2022-04-27 14:46:33,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:46:33,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:46:33,763 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:46:33,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [19313873] [2022-04-27 14:46:33,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:46:33,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:46:33,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:46:33,764 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:46:33,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-27 14:46:34,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:46:34,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:46:34,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 137 conjunts are in the unsatisfiable core [2022-04-27 14:46:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:46:34,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:46:36,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {29573#true} call ULTIMATE.init(); {29573#true} is VALID [2022-04-27 14:46:36,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {29573#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(9, 2);call #Ultimate.allocInit(12, 3); {29573#true} is VALID [2022-04-27 14:46:36,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29573#true} {29573#true} #60#return; {29573#true} is VALID [2022-04-27 14:46:36,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {29573#true} call #t~ret5 := main(); {29573#true} is VALID [2022-04-27 14:46:36,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {29573#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {29573#true} is VALID [2022-04-27 14:46:36,518 INFO L272 TraceCheckUtils]: 6: Hoare triple {29573#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,519 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29573#true} {29573#true} #52#return; {29573#true} is VALID [2022-04-27 14:46:36,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {29573#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {29611#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:46:36,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {29611#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {29611#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:46:36,519 INFO L272 TraceCheckUtils]: 13: Hoare triple {29611#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,520 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29573#true} {29611#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {29611#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:46:36,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {29611#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29633#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:46:36,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {29633#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {29633#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:46:36,521 INFO L272 TraceCheckUtils]: 20: Hoare triple {29633#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,521 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {29573#true} {29633#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {29633#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:46:36,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {29633#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29655#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {29655#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !false; {29655#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,522 INFO L272 TraceCheckUtils]: 27: Hoare triple {29655#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,522 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {29573#true} {29655#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} #54#return; {29655#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {29655#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29677#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:46:36,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {29677#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {29677#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:46:36,523 INFO L272 TraceCheckUtils]: 34: Hoare triple {29677#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,523 INFO L290 TraceCheckUtils]: 36: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,523 INFO L290 TraceCheckUtils]: 37: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,524 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {29573#true} {29677#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #54#return; {29677#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:46:36,524 INFO L290 TraceCheckUtils]: 39: Hoare triple {29677#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29699#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {29699#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} assume !false; {29699#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,525 INFO L272 TraceCheckUtils]: 41: Hoare triple {29699#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,525 INFO L290 TraceCheckUtils]: 42: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,525 INFO L290 TraceCheckUtils]: 43: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,525 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {29573#true} {29699#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} #54#return; {29699#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {29699#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29721#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,526 INFO L290 TraceCheckUtils]: 47: Hoare triple {29721#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} assume !false; {29721#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,526 INFO L272 TraceCheckUtils]: 48: Hoare triple {29721#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,526 INFO L290 TraceCheckUtils]: 49: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,526 INFO L290 TraceCheckUtils]: 50: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,526 INFO L290 TraceCheckUtils]: 51: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,527 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {29573#true} {29721#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} #54#return; {29721#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {29721#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29743#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,528 INFO L290 TraceCheckUtils]: 54: Hoare triple {29743#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !false; {29743#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,528 INFO L272 TraceCheckUtils]: 55: Hoare triple {29743#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,528 INFO L290 TraceCheckUtils]: 56: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,528 INFO L290 TraceCheckUtils]: 57: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,528 INFO L290 TraceCheckUtils]: 58: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,529 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29573#true} {29743#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} #54#return; {29743#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,529 INFO L290 TraceCheckUtils]: 60: Hoare triple {29743#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29765#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,530 INFO L290 TraceCheckUtils]: 61: Hoare triple {29765#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} assume !false; {29765#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,530 INFO L272 TraceCheckUtils]: 62: Hoare triple {29765#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,534 INFO L290 TraceCheckUtils]: 63: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,534 INFO L290 TraceCheckUtils]: 64: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,535 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29573#true} {29765#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} #54#return; {29765#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,536 INFO L290 TraceCheckUtils]: 67: Hoare triple {29765#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29787#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,536 INFO L290 TraceCheckUtils]: 68: Hoare triple {29787#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} assume !false; {29787#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,536 INFO L272 TraceCheckUtils]: 69: Hoare triple {29787#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,536 INFO L290 TraceCheckUtils]: 70: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,536 INFO L290 TraceCheckUtils]: 71: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,536 INFO L290 TraceCheckUtils]: 72: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,537 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {29573#true} {29787#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} #54#return; {29787#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,537 INFO L290 TraceCheckUtils]: 74: Hoare triple {29787#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29809#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,537 INFO L290 TraceCheckUtils]: 75: Hoare triple {29809#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {29809#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,537 INFO L272 TraceCheckUtils]: 76: Hoare triple {29809#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,537 INFO L290 TraceCheckUtils]: 77: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,537 INFO L290 TraceCheckUtils]: 78: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,537 INFO L290 TraceCheckUtils]: 79: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,538 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {29573#true} {29809#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} #54#return; {29809#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,538 INFO L290 TraceCheckUtils]: 81: Hoare triple {29809#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29831#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-27 14:46:36,539 INFO L290 TraceCheckUtils]: 82: Hoare triple {29831#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} assume !false; {29831#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-27 14:46:36,539 INFO L272 TraceCheckUtils]: 83: Hoare triple {29831#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,539 INFO L290 TraceCheckUtils]: 84: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,539 INFO L290 TraceCheckUtils]: 85: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,539 INFO L290 TraceCheckUtils]: 86: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,539 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {29573#true} {29831#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} #54#return; {29831#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-27 14:46:36,540 INFO L290 TraceCheckUtils]: 88: Hoare triple {29831#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29853#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,540 INFO L290 TraceCheckUtils]: 89: Hoare triple {29853#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !false; {29853#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,540 INFO L272 TraceCheckUtils]: 90: Hoare triple {29853#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,540 INFO L290 TraceCheckUtils]: 91: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,540 INFO L290 TraceCheckUtils]: 92: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,540 INFO L290 TraceCheckUtils]: 93: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,540 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {29573#true} {29853#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} #54#return; {29853#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,541 INFO L290 TraceCheckUtils]: 95: Hoare triple {29853#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29875#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,541 INFO L290 TraceCheckUtils]: 96: Hoare triple {29875#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} assume !false; {29875#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,541 INFO L272 TraceCheckUtils]: 97: Hoare triple {29875#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,541 INFO L290 TraceCheckUtils]: 98: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,541 INFO L290 TraceCheckUtils]: 99: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,541 INFO L290 TraceCheckUtils]: 100: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,542 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {29573#true} {29875#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} #54#return; {29875#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,542 INFO L290 TraceCheckUtils]: 102: Hoare triple {29875#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29897#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,542 INFO L290 TraceCheckUtils]: 103: Hoare triple {29897#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {29897#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,543 INFO L272 TraceCheckUtils]: 104: Hoare triple {29897#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,543 INFO L290 TraceCheckUtils]: 105: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,543 INFO L290 TraceCheckUtils]: 106: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,543 INFO L290 TraceCheckUtils]: 107: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,543 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {29573#true} {29897#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {29897#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,543 INFO L290 TraceCheckUtils]: 109: Hoare triple {29897#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29919#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,544 INFO L290 TraceCheckUtils]: 110: Hoare triple {29919#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} assume !false; {29919#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,544 INFO L272 TraceCheckUtils]: 111: Hoare triple {29919#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,544 INFO L290 TraceCheckUtils]: 112: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,544 INFO L290 TraceCheckUtils]: 113: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,544 INFO L290 TraceCheckUtils]: 114: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,544 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {29573#true} {29919#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} #54#return; {29919#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,545 INFO L290 TraceCheckUtils]: 116: Hoare triple {29919#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29941#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:46:36,545 INFO L290 TraceCheckUtils]: 117: Hoare triple {29941#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} assume !false; {29941#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:46:36,545 INFO L272 TraceCheckUtils]: 118: Hoare triple {29941#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,545 INFO L290 TraceCheckUtils]: 119: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,545 INFO L290 TraceCheckUtils]: 120: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,545 INFO L290 TraceCheckUtils]: 121: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,546 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29573#true} {29941#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} #54#return; {29941#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:46:36,546 INFO L290 TraceCheckUtils]: 123: Hoare triple {29941#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29963#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,546 INFO L290 TraceCheckUtils]: 124: Hoare triple {29963#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} assume !false; {29963#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,546 INFO L272 TraceCheckUtils]: 125: Hoare triple {29963#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,546 INFO L290 TraceCheckUtils]: 126: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,547 INFO L290 TraceCheckUtils]: 127: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,547 INFO L290 TraceCheckUtils]: 128: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,547 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {29573#true} {29963#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} #54#return; {29963#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,547 INFO L290 TraceCheckUtils]: 130: Hoare triple {29963#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29985#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:46:36,548 INFO L290 TraceCheckUtils]: 131: Hoare triple {29985#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !false; {29985#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:46:36,548 INFO L272 TraceCheckUtils]: 132: Hoare triple {29985#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,548 INFO L290 TraceCheckUtils]: 133: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,548 INFO L290 TraceCheckUtils]: 134: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,548 INFO L290 TraceCheckUtils]: 135: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,548 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {29573#true} {29985#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} #54#return; {29985#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 14:46:36,549 INFO L290 TraceCheckUtils]: 137: Hoare triple {29985#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30007#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-27 14:46:36,549 INFO L290 TraceCheckUtils]: 138: Hoare triple {30007#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !false; {30007#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-27 14:46:36,549 INFO L272 TraceCheckUtils]: 139: Hoare triple {30007#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,549 INFO L290 TraceCheckUtils]: 140: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,549 INFO L290 TraceCheckUtils]: 141: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,549 INFO L290 TraceCheckUtils]: 142: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,550 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {29573#true} {30007#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} #54#return; {30007#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-27 14:46:36,550 INFO L290 TraceCheckUtils]: 144: Hoare triple {30007#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30029#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:46:36,550 INFO L290 TraceCheckUtils]: 145: Hoare triple {30029#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} assume !false; {30029#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:46:36,550 INFO L272 TraceCheckUtils]: 146: Hoare triple {30029#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,550 INFO L290 TraceCheckUtils]: 147: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,550 INFO L290 TraceCheckUtils]: 148: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,550 INFO L290 TraceCheckUtils]: 149: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,551 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {29573#true} {30029#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} #54#return; {30029#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:46:36,551 INFO L290 TraceCheckUtils]: 151: Hoare triple {30029#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30051#(and (= main_~c~0 20) (= main_~y~0 20) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,552 INFO L290 TraceCheckUtils]: 152: Hoare triple {30051#(and (= main_~c~0 20) (= main_~y~0 20) (< 0 main_~k~0))} assume !false; {30051#(and (= main_~c~0 20) (= main_~y~0 20) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,552 INFO L272 TraceCheckUtils]: 153: Hoare triple {30051#(and (= main_~c~0 20) (= main_~y~0 20) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,552 INFO L290 TraceCheckUtils]: 154: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,552 INFO L290 TraceCheckUtils]: 155: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,552 INFO L290 TraceCheckUtils]: 156: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,552 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {29573#true} {30051#(and (= main_~c~0 20) (= main_~y~0 20) (< 0 main_~k~0))} #54#return; {30051#(and (= main_~c~0 20) (= main_~y~0 20) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,553 INFO L290 TraceCheckUtils]: 158: Hoare triple {30051#(and (= main_~c~0 20) (= main_~y~0 20) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30073#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,553 INFO L290 TraceCheckUtils]: 159: Hoare triple {30073#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {30073#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,553 INFO L272 TraceCheckUtils]: 160: Hoare triple {30073#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,553 INFO L290 TraceCheckUtils]: 161: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,553 INFO L290 TraceCheckUtils]: 162: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,553 INFO L290 TraceCheckUtils]: 163: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,553 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {29573#true} {30073#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {30073#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,554 INFO L290 TraceCheckUtils]: 165: Hoare triple {30073#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30095#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,554 INFO L290 TraceCheckUtils]: 166: Hoare triple {30095#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {30095#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,554 INFO L272 TraceCheckUtils]: 167: Hoare triple {30095#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,554 INFO L290 TraceCheckUtils]: 168: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,554 INFO L290 TraceCheckUtils]: 169: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,554 INFO L290 TraceCheckUtils]: 170: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,555 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {29573#true} {30095#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #54#return; {30095#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,555 INFO L290 TraceCheckUtils]: 172: Hoare triple {30095#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30117#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:46:36,555 INFO L290 TraceCheckUtils]: 173: Hoare triple {30117#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {30117#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:46:36,556 INFO L272 TraceCheckUtils]: 174: Hoare triple {30117#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,556 INFO L290 TraceCheckUtils]: 175: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,556 INFO L290 TraceCheckUtils]: 176: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,556 INFO L290 TraceCheckUtils]: 177: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,556 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {29573#true} {30117#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} #54#return; {30117#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:46:36,556 INFO L290 TraceCheckUtils]: 179: Hoare triple {30117#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30139#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,557 INFO L290 TraceCheckUtils]: 180: Hoare triple {30139#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0))} assume !false; {30139#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,557 INFO L272 TraceCheckUtils]: 181: Hoare triple {30139#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,557 INFO L290 TraceCheckUtils]: 182: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,557 INFO L290 TraceCheckUtils]: 183: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,557 INFO L290 TraceCheckUtils]: 184: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,557 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {29573#true} {30139#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0))} #54#return; {30139#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,558 INFO L290 TraceCheckUtils]: 186: Hoare triple {30139#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30161#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,558 INFO L290 TraceCheckUtils]: 187: Hoare triple {30161#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} assume !false; {30161#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,558 INFO L272 TraceCheckUtils]: 188: Hoare triple {30161#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,558 INFO L290 TraceCheckUtils]: 189: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,558 INFO L290 TraceCheckUtils]: 190: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,558 INFO L290 TraceCheckUtils]: 191: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,559 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {29573#true} {30161#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} #54#return; {30161#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,559 INFO L290 TraceCheckUtils]: 193: Hoare triple {30161#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30183#(and (= (+ (- 2) main_~c~0) 24) (< 0 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-27 14:46:36,559 INFO L290 TraceCheckUtils]: 194: Hoare triple {30183#(and (= (+ (- 2) main_~c~0) 24) (< 0 main_~k~0) (= main_~y~0 26))} assume !false; {30183#(and (= (+ (- 2) main_~c~0) 24) (< 0 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-27 14:46:36,559 INFO L272 TraceCheckUtils]: 195: Hoare triple {30183#(and (= (+ (- 2) main_~c~0) 24) (< 0 main_~k~0) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,560 INFO L290 TraceCheckUtils]: 196: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,560 INFO L290 TraceCheckUtils]: 197: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,560 INFO L290 TraceCheckUtils]: 198: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,560 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {29573#true} {30183#(and (= (+ (- 2) main_~c~0) 24) (< 0 main_~k~0) (= main_~y~0 26))} #54#return; {30183#(and (= (+ (- 2) main_~c~0) 24) (< 0 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-27 14:46:36,560 INFO L290 TraceCheckUtils]: 200: Hoare triple {30183#(and (= (+ (- 2) main_~c~0) 24) (< 0 main_~k~0) (= main_~y~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30205#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,561 INFO L290 TraceCheckUtils]: 201: Hoare triple {30205#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27) (< 0 main_~k~0))} assume !false; {30205#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,561 INFO L272 TraceCheckUtils]: 202: Hoare triple {30205#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,561 INFO L290 TraceCheckUtils]: 203: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,561 INFO L290 TraceCheckUtils]: 204: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,561 INFO L290 TraceCheckUtils]: 205: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,561 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {29573#true} {30205#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27) (< 0 main_~k~0))} #54#return; {30205#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,562 INFO L290 TraceCheckUtils]: 207: Hoare triple {30205#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30227#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,562 INFO L290 TraceCheckUtils]: 208: Hoare triple {30227#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} assume !false; {30227#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,562 INFO L272 TraceCheckUtils]: 209: Hoare triple {30227#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,562 INFO L290 TraceCheckUtils]: 210: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,562 INFO L290 TraceCheckUtils]: 211: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,562 INFO L290 TraceCheckUtils]: 212: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,563 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {29573#true} {30227#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} #54#return; {30227#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,563 INFO L290 TraceCheckUtils]: 214: Hoare triple {30227#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30249#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,563 INFO L290 TraceCheckUtils]: 215: Hoare triple {30249#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} assume !false; {30249#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,563 INFO L272 TraceCheckUtils]: 216: Hoare triple {30249#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,563 INFO L290 TraceCheckUtils]: 217: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,563 INFO L290 TraceCheckUtils]: 218: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,563 INFO L290 TraceCheckUtils]: 219: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,564 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {29573#true} {30249#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} #54#return; {30249#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,564 INFO L290 TraceCheckUtils]: 221: Hoare triple {30249#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30271#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,565 INFO L290 TraceCheckUtils]: 222: Hoare triple {30271#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {30271#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,565 INFO L272 TraceCheckUtils]: 223: Hoare triple {30271#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,565 INFO L290 TraceCheckUtils]: 224: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,565 INFO L290 TraceCheckUtils]: 225: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,565 INFO L290 TraceCheckUtils]: 226: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,565 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {29573#true} {30271#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {30271#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,566 INFO L290 TraceCheckUtils]: 228: Hoare triple {30271#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30293#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,566 INFO L290 TraceCheckUtils]: 229: Hoare triple {30293#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29) (< 0 main_~k~0))} assume !false; {30293#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,566 INFO L272 TraceCheckUtils]: 230: Hoare triple {30293#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,566 INFO L290 TraceCheckUtils]: 231: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,566 INFO L290 TraceCheckUtils]: 232: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,566 INFO L290 TraceCheckUtils]: 233: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,566 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {29573#true} {30293#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29) (< 0 main_~k~0))} #54#return; {30293#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29) (< 0 main_~k~0))} is VALID [2022-04-27 14:46:36,567 INFO L290 TraceCheckUtils]: 235: Hoare triple {30293#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30315#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-27 14:46:36,567 INFO L290 TraceCheckUtils]: 236: Hoare triple {30315#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} assume !false; {30315#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-27 14:46:36,567 INFO L272 TraceCheckUtils]: 237: Hoare triple {30315#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29573#true} is VALID [2022-04-27 14:46:36,567 INFO L290 TraceCheckUtils]: 238: Hoare triple {29573#true} ~cond := #in~cond; {29573#true} is VALID [2022-04-27 14:46:36,567 INFO L290 TraceCheckUtils]: 239: Hoare triple {29573#true} assume !(0 == ~cond); {29573#true} is VALID [2022-04-27 14:46:36,567 INFO L290 TraceCheckUtils]: 240: Hoare triple {29573#true} assume true; {29573#true} is VALID [2022-04-27 14:46:36,568 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {29573#true} {30315#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} #54#return; {30315#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-27 14:46:36,571 INFO L290 TraceCheckUtils]: 242: Hoare triple {30315#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} assume !(~c~0 < ~k~0); {30337#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~k~0 32))} is VALID [2022-04-27 14:46:36,572 INFO L272 TraceCheckUtils]: 243: Hoare triple {30337#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~k~0 32))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {30341#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:46:36,572 INFO L290 TraceCheckUtils]: 244: Hoare triple {30341#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30345#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:46:36,573 INFO L290 TraceCheckUtils]: 245: Hoare triple {30345#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29574#false} is VALID [2022-04-27 14:46:36,573 INFO L290 TraceCheckUtils]: 246: Hoare triple {29574#false} assume !false; {29574#false} is VALID [2022-04-27 14:46:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3762 backedges. 66 proven. 1584 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2022-04-27 14:46:36,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:46:42,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:46:42,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246921899] [2022-04-27 14:46:42,152 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:46:42,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19313873] [2022-04-27 14:46:42,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19313873] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:46:42,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:46:42,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2022-04-27 14:46:42,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062533208] [2022-04-27 14:46:42,153 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:46:42,153 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) Word has length 247 [2022-04-27 14:46:42,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:46:42,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-27 14:46:42,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:46:42,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-27 14:46:42,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:46:42,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-27 14:46:42,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1172, Invalid=3940, Unknown=0, NotChecked=0, Total=5112 [2022-04-27 14:46:42,702 INFO L87 Difference]: Start difference. First operand 124 states and 155 transitions. Second operand has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-27 14:47:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:47:08,941 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-27 14:47:08,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-27 14:47:08,941 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) Word has length 247 [2022-04-27 14:47:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:47:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-27 14:47:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 160 transitions. [2022-04-27 14:47:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-27 14:47:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 160 transitions. [2022-04-27 14:47:08,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 160 transitions. [2022-04-27 14:47:09,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:47:09,604 INFO L225 Difference]: With dead ends: 132 [2022-04-27 14:47:09,604 INFO L226 Difference]: Without dead ends: 127 [2022-04-27 14:47:09,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 405 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1182, Invalid=4220, Unknown=0, NotChecked=0, Total=5402 [2022-04-27 14:47:09,605 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 3678 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2022-04-27 14:47:09,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1882 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3678 Invalid, 0 Unknown, 0 Unchecked, 13.9s Time] [2022-04-27 14:47:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-27 14:47:09,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-04-27 14:47:09,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:47:09,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 38 states have call successors, (38), 6 states have call predecessors, (38), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 14:47:09,691 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 38 states have call successors, (38), 6 states have call predecessors, (38), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 14:47:09,691 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 38 states have call successors, (38), 6 states have call predecessors, (38), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 14:47:09,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:47:09,694 INFO L93 Difference]: Finished difference Result 127 states and 159 transitions. [2022-04-27 14:47:09,694 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 159 transitions. [2022-04-27 14:47:09,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:47:09,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:47:09,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 38 states have call successors, (38), 6 states have call predecessors, (38), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 127 states. [2022-04-27 14:47:09,694 INFO L87 Difference]: Start difference. First operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 38 states have call successors, (38), 6 states have call predecessors, (38), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 127 states. [2022-04-27 14:47:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:47:09,696 INFO L93 Difference]: Finished difference Result 127 states and 159 transitions. [2022-04-27 14:47:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 159 transitions. [2022-04-27 14:47:09,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:47:09,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:47:09,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:47:09,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:47:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 38 states have call successors, (38), 6 states have call predecessors, (38), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 14:47:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 159 transitions. [2022-04-27 14:47:09,699 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 159 transitions. Word has length 247 [2022-04-27 14:47:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:47:09,699 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 159 transitions. [2022-04-27 14:47:09,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-27 14:47:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 159 transitions. [2022-04-27 14:47:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-04-27 14:47:09,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:47:09,700 INFO L195 NwaCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:47:09,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-27 14:47:09,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-27 14:47:09,909 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:47:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:47:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash -596558904, now seen corresponding path program 33 times [2022-04-27 14:47:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:47:09,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613753788] [2022-04-27 14:47:09,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:47:09,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:47:09,924 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:47:09,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142349944] [2022-04-27 14:47:09,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:47:09,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:47:09,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:47:09,925 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:47:09,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-27 14:47:12,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2022-04-27 14:47:12,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:47:12,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 140 conjunts are in the unsatisfiable core [2022-04-27 14:47:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:47:12,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:47:13,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {31750#true} call ULTIMATE.init(); {31750#true} is VALID [2022-04-27 14:47:13,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {31750#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(9, 2);call #Ultimate.allocInit(12, 3); {31750#true} is VALID [2022-04-27 14:47:13,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31750#true} {31750#true} #60#return; {31750#true} is VALID [2022-04-27 14:47:13,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {31750#true} call #t~ret5 := main(); {31750#true} is VALID [2022-04-27 14:47:13,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {31750#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {31750#true} is VALID [2022-04-27 14:47:13,777 INFO L272 TraceCheckUtils]: 6: Hoare triple {31750#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,777 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31750#true} {31750#true} #52#return; {31750#true} is VALID [2022-04-27 14:47:13,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {31750#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {31788#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:47:13,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {31788#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {31788#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:47:13,778 INFO L272 TraceCheckUtils]: 13: Hoare triple {31788#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,778 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {31750#true} {31788#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {31788#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:47:13,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {31788#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31810#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:47:13,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {31810#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {31810#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:47:13,779 INFO L272 TraceCheckUtils]: 20: Hoare triple {31810#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,780 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {31750#true} {31810#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {31810#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:47:13,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {31810#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31832#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:47:13,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {31832#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !false; {31832#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:47:13,780 INFO L272 TraceCheckUtils]: 27: Hoare triple {31832#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,781 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31750#true} {31832#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #54#return; {31832#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:47:13,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {31832#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31854#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:47:13,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {31854#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !false; {31854#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:47:13,782 INFO L272 TraceCheckUtils]: 34: Hoare triple {31854#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,782 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {31750#true} {31854#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #54#return; {31854#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:47:13,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {31854#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31876#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:47:13,783 INFO L290 TraceCheckUtils]: 40: Hoare triple {31876#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {31876#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:47:13,783 INFO L272 TraceCheckUtils]: 41: Hoare triple {31876#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,783 INFO L290 TraceCheckUtils]: 42: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,783 INFO L290 TraceCheckUtils]: 44: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,783 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {31750#true} {31876#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {31876#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:47:13,784 INFO L290 TraceCheckUtils]: 46: Hoare triple {31876#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31898#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:47:13,784 INFO L290 TraceCheckUtils]: 47: Hoare triple {31898#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {31898#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:47:13,784 INFO L272 TraceCheckUtils]: 48: Hoare triple {31898#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,784 INFO L290 TraceCheckUtils]: 50: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,784 INFO L290 TraceCheckUtils]: 51: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,784 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {31750#true} {31898#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {31898#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:47:13,785 INFO L290 TraceCheckUtils]: 53: Hoare triple {31898#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31920#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:47:13,785 INFO L290 TraceCheckUtils]: 54: Hoare triple {31920#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {31920#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:47:13,785 INFO L272 TraceCheckUtils]: 55: Hoare triple {31920#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,785 INFO L290 TraceCheckUtils]: 56: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,785 INFO L290 TraceCheckUtils]: 57: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,785 INFO L290 TraceCheckUtils]: 58: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,786 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {31750#true} {31920#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {31920#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:47:13,786 INFO L290 TraceCheckUtils]: 60: Hoare triple {31920#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31942#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:47:13,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {31942#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {31942#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:47:13,786 INFO L272 TraceCheckUtils]: 62: Hoare triple {31942#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,786 INFO L290 TraceCheckUtils]: 63: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,787 INFO L290 TraceCheckUtils]: 64: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,787 INFO L290 TraceCheckUtils]: 65: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,787 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {31750#true} {31942#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {31942#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:47:13,787 INFO L290 TraceCheckUtils]: 67: Hoare triple {31942#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31964#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:47:13,788 INFO L290 TraceCheckUtils]: 68: Hoare triple {31964#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {31964#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:47:13,788 INFO L272 TraceCheckUtils]: 69: Hoare triple {31964#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,788 INFO L290 TraceCheckUtils]: 70: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,788 INFO L290 TraceCheckUtils]: 71: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,788 INFO L290 TraceCheckUtils]: 72: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,788 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {31750#true} {31964#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {31964#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:47:13,789 INFO L290 TraceCheckUtils]: 74: Hoare triple {31964#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31986#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:47:13,789 INFO L290 TraceCheckUtils]: 75: Hoare triple {31986#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {31986#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:47:13,789 INFO L272 TraceCheckUtils]: 76: Hoare triple {31986#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,789 INFO L290 TraceCheckUtils]: 77: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,789 INFO L290 TraceCheckUtils]: 78: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,789 INFO L290 TraceCheckUtils]: 79: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,789 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {31750#true} {31986#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #54#return; {31986#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:47:13,790 INFO L290 TraceCheckUtils]: 81: Hoare triple {31986#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32008#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:47:13,790 INFO L290 TraceCheckUtils]: 82: Hoare triple {32008#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !false; {32008#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:47:13,790 INFO L272 TraceCheckUtils]: 83: Hoare triple {32008#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,790 INFO L290 TraceCheckUtils]: 84: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,790 INFO L290 TraceCheckUtils]: 85: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,790 INFO L290 TraceCheckUtils]: 86: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,791 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31750#true} {32008#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} #54#return; {32008#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-27 14:47:13,791 INFO L290 TraceCheckUtils]: 88: Hoare triple {32008#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32030#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:47:13,791 INFO L290 TraceCheckUtils]: 89: Hoare triple {32030#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {32030#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:47:13,791 INFO L272 TraceCheckUtils]: 90: Hoare triple {32030#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,791 INFO L290 TraceCheckUtils]: 91: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,791 INFO L290 TraceCheckUtils]: 92: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,792 INFO L290 TraceCheckUtils]: 93: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,792 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {31750#true} {32030#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {32030#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:47:13,792 INFO L290 TraceCheckUtils]: 95: Hoare triple {32030#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32052#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:47:13,793 INFO L290 TraceCheckUtils]: 96: Hoare triple {32052#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {32052#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:47:13,793 INFO L272 TraceCheckUtils]: 97: Hoare triple {32052#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,793 INFO L290 TraceCheckUtils]: 98: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,793 INFO L290 TraceCheckUtils]: 99: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,793 INFO L290 TraceCheckUtils]: 100: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,793 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {31750#true} {32052#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {32052#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 14:47:13,793 INFO L290 TraceCheckUtils]: 102: Hoare triple {32052#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32074#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:47:13,794 INFO L290 TraceCheckUtils]: 103: Hoare triple {32074#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {32074#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:47:13,794 INFO L272 TraceCheckUtils]: 104: Hoare triple {32074#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,794 INFO L290 TraceCheckUtils]: 105: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,794 INFO L290 TraceCheckUtils]: 106: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,794 INFO L290 TraceCheckUtils]: 107: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,794 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {31750#true} {32074#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {32074#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:47:13,795 INFO L290 TraceCheckUtils]: 109: Hoare triple {32074#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32096#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-27 14:47:13,795 INFO L290 TraceCheckUtils]: 110: Hoare triple {32096#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} assume !false; {32096#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-27 14:47:13,795 INFO L272 TraceCheckUtils]: 111: Hoare triple {32096#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,795 INFO L290 TraceCheckUtils]: 112: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,795 INFO L290 TraceCheckUtils]: 113: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,795 INFO L290 TraceCheckUtils]: 114: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,796 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {31750#true} {32096#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} #54#return; {32096#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-27 14:47:13,796 INFO L290 TraceCheckUtils]: 116: Hoare triple {32096#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32118#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 14:47:13,796 INFO L290 TraceCheckUtils]: 117: Hoare triple {32118#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {32118#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 14:47:13,796 INFO L272 TraceCheckUtils]: 118: Hoare triple {32118#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,796 INFO L290 TraceCheckUtils]: 119: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,796 INFO L290 TraceCheckUtils]: 120: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,796 INFO L290 TraceCheckUtils]: 121: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,797 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {31750#true} {32118#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #54#return; {32118#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 14:47:13,797 INFO L290 TraceCheckUtils]: 123: Hoare triple {32118#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32140#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:47:13,797 INFO L290 TraceCheckUtils]: 124: Hoare triple {32140#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {32140#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:47:13,798 INFO L272 TraceCheckUtils]: 125: Hoare triple {32140#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,798 INFO L290 TraceCheckUtils]: 126: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,798 INFO L290 TraceCheckUtils]: 127: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,798 INFO L290 TraceCheckUtils]: 128: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,798 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {31750#true} {32140#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #54#return; {32140#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:47:13,798 INFO L290 TraceCheckUtils]: 130: Hoare triple {32140#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32162#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-27 14:47:13,799 INFO L290 TraceCheckUtils]: 131: Hoare triple {32162#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !false; {32162#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-27 14:47:13,799 INFO L272 TraceCheckUtils]: 132: Hoare triple {32162#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,799 INFO L290 TraceCheckUtils]: 133: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,799 INFO L290 TraceCheckUtils]: 134: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,799 INFO L290 TraceCheckUtils]: 135: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,799 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {31750#true} {32162#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} #54#return; {32162#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-27 14:47:13,800 INFO L290 TraceCheckUtils]: 137: Hoare triple {32162#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32184#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:47:13,800 INFO L290 TraceCheckUtils]: 138: Hoare triple {32184#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} assume !false; {32184#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:47:13,800 INFO L272 TraceCheckUtils]: 139: Hoare triple {32184#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,800 INFO L290 TraceCheckUtils]: 140: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,800 INFO L290 TraceCheckUtils]: 141: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,800 INFO L290 TraceCheckUtils]: 142: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,801 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {31750#true} {32184#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} #54#return; {32184#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:47:13,801 INFO L290 TraceCheckUtils]: 144: Hoare triple {32184#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32206#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:47:13,801 INFO L290 TraceCheckUtils]: 145: Hoare triple {32206#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {32206#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:47:13,801 INFO L272 TraceCheckUtils]: 146: Hoare triple {32206#(and (= 19 main_~y~0) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,801 INFO L290 TraceCheckUtils]: 147: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,801 INFO L290 TraceCheckUtils]: 148: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,801 INFO L290 TraceCheckUtils]: 149: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,802 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {31750#true} {32206#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {32206#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:47:13,802 INFO L290 TraceCheckUtils]: 151: Hoare triple {32206#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32228#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-27 14:47:13,802 INFO L290 TraceCheckUtils]: 152: Hoare triple {32228#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} assume !false; {32228#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-27 14:47:13,803 INFO L272 TraceCheckUtils]: 153: Hoare triple {32228#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,803 INFO L290 TraceCheckUtils]: 154: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,803 INFO L290 TraceCheckUtils]: 155: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,803 INFO L290 TraceCheckUtils]: 156: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,803 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {31750#true} {32228#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} #54#return; {32228#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-27 14:47:13,803 INFO L290 TraceCheckUtils]: 158: Hoare triple {32228#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32250#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-27 14:47:13,804 INFO L290 TraceCheckUtils]: 159: Hoare triple {32250#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} assume !false; {32250#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-27 14:47:13,804 INFO L272 TraceCheckUtils]: 160: Hoare triple {32250#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,804 INFO L290 TraceCheckUtils]: 161: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,804 INFO L290 TraceCheckUtils]: 162: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,804 INFO L290 TraceCheckUtils]: 163: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,804 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {31750#true} {32250#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} #54#return; {32250#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-27 14:47:13,805 INFO L290 TraceCheckUtils]: 165: Hoare triple {32250#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32272#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-27 14:47:13,805 INFO L290 TraceCheckUtils]: 166: Hoare triple {32272#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} assume !false; {32272#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-27 14:47:13,805 INFO L272 TraceCheckUtils]: 167: Hoare triple {32272#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,805 INFO L290 TraceCheckUtils]: 168: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,805 INFO L290 TraceCheckUtils]: 169: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,805 INFO L290 TraceCheckUtils]: 170: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,806 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {31750#true} {32272#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} #54#return; {32272#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-27 14:47:13,806 INFO L290 TraceCheckUtils]: 172: Hoare triple {32272#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32294#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0))} is VALID [2022-04-27 14:47:13,806 INFO L290 TraceCheckUtils]: 173: Hoare triple {32294#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0))} assume !false; {32294#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0))} is VALID [2022-04-27 14:47:13,806 INFO L272 TraceCheckUtils]: 174: Hoare triple {32294#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,806 INFO L290 TraceCheckUtils]: 175: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,806 INFO L290 TraceCheckUtils]: 176: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,806 INFO L290 TraceCheckUtils]: 177: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,807 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {31750#true} {32294#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0))} #54#return; {32294#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0))} is VALID [2022-04-27 14:47:13,807 INFO L290 TraceCheckUtils]: 179: Hoare triple {32294#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32316#(and (= main_~c~0 24) (= (+ main_~y~0 (- 3)) 21))} is VALID [2022-04-27 14:47:13,807 INFO L290 TraceCheckUtils]: 180: Hoare triple {32316#(and (= main_~c~0 24) (= (+ main_~y~0 (- 3)) 21))} assume !false; {32316#(and (= main_~c~0 24) (= (+ main_~y~0 (- 3)) 21))} is VALID [2022-04-27 14:47:13,808 INFO L272 TraceCheckUtils]: 181: Hoare triple {32316#(and (= main_~c~0 24) (= (+ main_~y~0 (- 3)) 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,808 INFO L290 TraceCheckUtils]: 182: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,808 INFO L290 TraceCheckUtils]: 183: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,808 INFO L290 TraceCheckUtils]: 184: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,808 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {31750#true} {32316#(and (= main_~c~0 24) (= (+ main_~y~0 (- 3)) 21))} #54#return; {32316#(and (= main_~c~0 24) (= (+ main_~y~0 (- 3)) 21))} is VALID [2022-04-27 14:47:13,808 INFO L290 TraceCheckUtils]: 186: Hoare triple {32316#(and (= main_~c~0 24) (= (+ main_~y~0 (- 3)) 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32338#(and (= (+ main_~y~0 (- 4)) 21) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-27 14:47:13,809 INFO L290 TraceCheckUtils]: 187: Hoare triple {32338#(and (= (+ main_~y~0 (- 4)) 21) (= (+ (- 1) main_~c~0) 24))} assume !false; {32338#(and (= (+ main_~y~0 (- 4)) 21) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-27 14:47:13,809 INFO L272 TraceCheckUtils]: 188: Hoare triple {32338#(and (= (+ main_~y~0 (- 4)) 21) (= (+ (- 1) main_~c~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,809 INFO L290 TraceCheckUtils]: 189: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,809 INFO L290 TraceCheckUtils]: 190: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,809 INFO L290 TraceCheckUtils]: 191: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,809 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {31750#true} {32338#(and (= (+ main_~y~0 (- 4)) 21) (= (+ (- 1) main_~c~0) 24))} #54#return; {32338#(and (= (+ main_~y~0 (- 4)) 21) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-27 14:47:13,810 INFO L290 TraceCheckUtils]: 193: Hoare triple {32338#(and (= (+ main_~y~0 (- 4)) 21) (= (+ (- 1) main_~c~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32360#(and (= (+ (- 2) main_~c~0) 24) (= main_~y~0 26))} is VALID [2022-04-27 14:47:13,810 INFO L290 TraceCheckUtils]: 194: Hoare triple {32360#(and (= (+ (- 2) main_~c~0) 24) (= main_~y~0 26))} assume !false; {32360#(and (= (+ (- 2) main_~c~0) 24) (= main_~y~0 26))} is VALID [2022-04-27 14:47:13,810 INFO L272 TraceCheckUtils]: 195: Hoare triple {32360#(and (= (+ (- 2) main_~c~0) 24) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,810 INFO L290 TraceCheckUtils]: 196: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,810 INFO L290 TraceCheckUtils]: 197: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,810 INFO L290 TraceCheckUtils]: 198: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,811 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {31750#true} {32360#(and (= (+ (- 2) main_~c~0) 24) (= main_~y~0 26))} #54#return; {32360#(and (= (+ (- 2) main_~c~0) 24) (= main_~y~0 26))} is VALID [2022-04-27 14:47:13,811 INFO L290 TraceCheckUtils]: 200: Hoare triple {32360#(and (= (+ (- 2) main_~c~0) 24) (= main_~y~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32382#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-27 14:47:13,811 INFO L290 TraceCheckUtils]: 201: Hoare triple {32382#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} assume !false; {32382#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-27 14:47:13,811 INFO L272 TraceCheckUtils]: 202: Hoare triple {32382#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,811 INFO L290 TraceCheckUtils]: 203: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,811 INFO L290 TraceCheckUtils]: 204: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,811 INFO L290 TraceCheckUtils]: 205: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,812 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {31750#true} {32382#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} #54#return; {32382#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-27 14:47:13,812 INFO L290 TraceCheckUtils]: 207: Hoare triple {32382#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32404#(and (= (+ (- 2) main_~y~0) 26) (= main_~c~0 28))} is VALID [2022-04-27 14:47:13,812 INFO L290 TraceCheckUtils]: 208: Hoare triple {32404#(and (= (+ (- 2) main_~y~0) 26) (= main_~c~0 28))} assume !false; {32404#(and (= (+ (- 2) main_~y~0) 26) (= main_~c~0 28))} is VALID [2022-04-27 14:47:13,813 INFO L272 TraceCheckUtils]: 209: Hoare triple {32404#(and (= (+ (- 2) main_~y~0) 26) (= main_~c~0 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,813 INFO L290 TraceCheckUtils]: 210: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,813 INFO L290 TraceCheckUtils]: 211: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,813 INFO L290 TraceCheckUtils]: 212: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,813 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {31750#true} {32404#(and (= (+ (- 2) main_~y~0) 26) (= main_~c~0 28))} #54#return; {32404#(and (= (+ (- 2) main_~y~0) 26) (= main_~c~0 28))} is VALID [2022-04-27 14:47:13,813 INFO L290 TraceCheckUtils]: 214: Hoare triple {32404#(and (= (+ (- 2) main_~y~0) 26) (= main_~c~0 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32426#(and (= 29 main_~c~0) (= (+ main_~y~0 (- 3)) 26))} is VALID [2022-04-27 14:47:13,814 INFO L290 TraceCheckUtils]: 215: Hoare triple {32426#(and (= 29 main_~c~0) (= (+ main_~y~0 (- 3)) 26))} assume !false; {32426#(and (= 29 main_~c~0) (= (+ main_~y~0 (- 3)) 26))} is VALID [2022-04-27 14:47:13,814 INFO L272 TraceCheckUtils]: 216: Hoare triple {32426#(and (= 29 main_~c~0) (= (+ main_~y~0 (- 3)) 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,814 INFO L290 TraceCheckUtils]: 217: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,814 INFO L290 TraceCheckUtils]: 218: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,814 INFO L290 TraceCheckUtils]: 219: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,814 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {31750#true} {32426#(and (= 29 main_~c~0) (= (+ main_~y~0 (- 3)) 26))} #54#return; {32426#(and (= 29 main_~c~0) (= (+ main_~y~0 (- 3)) 26))} is VALID [2022-04-27 14:47:13,815 INFO L290 TraceCheckUtils]: 221: Hoare triple {32426#(and (= 29 main_~c~0) (= (+ main_~y~0 (- 3)) 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32448#(and (= (+ main_~y~0 (- 4)) 26) (= 30 main_~c~0))} is VALID [2022-04-27 14:47:13,815 INFO L290 TraceCheckUtils]: 222: Hoare triple {32448#(and (= (+ main_~y~0 (- 4)) 26) (= 30 main_~c~0))} assume !false; {32448#(and (= (+ main_~y~0 (- 4)) 26) (= 30 main_~c~0))} is VALID [2022-04-27 14:47:13,815 INFO L272 TraceCheckUtils]: 223: Hoare triple {32448#(and (= (+ main_~y~0 (- 4)) 26) (= 30 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,815 INFO L290 TraceCheckUtils]: 224: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,815 INFO L290 TraceCheckUtils]: 225: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,815 INFO L290 TraceCheckUtils]: 226: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,816 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {31750#true} {32448#(and (= (+ main_~y~0 (- 4)) 26) (= 30 main_~c~0))} #54#return; {32448#(and (= (+ main_~y~0 (- 4)) 26) (= 30 main_~c~0))} is VALID [2022-04-27 14:47:13,816 INFO L290 TraceCheckUtils]: 228: Hoare triple {32448#(and (= (+ main_~y~0 (- 4)) 26) (= 30 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32470#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-27 14:47:13,816 INFO L290 TraceCheckUtils]: 229: Hoare triple {32470#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !false; {32470#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-27 14:47:13,816 INFO L272 TraceCheckUtils]: 230: Hoare triple {32470#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,816 INFO L290 TraceCheckUtils]: 231: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,816 INFO L290 TraceCheckUtils]: 232: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,816 INFO L290 TraceCheckUtils]: 233: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,817 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {31750#true} {32470#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} #54#return; {32470#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-27 14:47:13,817 INFO L290 TraceCheckUtils]: 235: Hoare triple {32470#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32492#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:47:13,817 INFO L290 TraceCheckUtils]: 236: Hoare triple {32492#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} assume !false; {32492#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:47:13,818 INFO L272 TraceCheckUtils]: 237: Hoare triple {32492#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,818 INFO L290 TraceCheckUtils]: 238: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,818 INFO L290 TraceCheckUtils]: 239: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,818 INFO L290 TraceCheckUtils]: 240: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,818 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {31750#true} {32492#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} #54#return; {32492#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:47:13,818 INFO L290 TraceCheckUtils]: 242: Hoare triple {32492#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32514#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-27 14:47:13,819 INFO L290 TraceCheckUtils]: 243: Hoare triple {32514#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} assume !false; {32514#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-27 14:47:13,819 INFO L272 TraceCheckUtils]: 244: Hoare triple {32514#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31750#true} is VALID [2022-04-27 14:47:13,819 INFO L290 TraceCheckUtils]: 245: Hoare triple {31750#true} ~cond := #in~cond; {31750#true} is VALID [2022-04-27 14:47:13,819 INFO L290 TraceCheckUtils]: 246: Hoare triple {31750#true} assume !(0 == ~cond); {31750#true} is VALID [2022-04-27 14:47:13,819 INFO L290 TraceCheckUtils]: 247: Hoare triple {31750#true} assume true; {31750#true} is VALID [2022-04-27 14:47:13,819 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {31750#true} {32514#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} #54#return; {32514#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-27 14:47:13,821 INFO L290 TraceCheckUtils]: 249: Hoare triple {32514#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} assume !(~c~0 < ~k~0); {32536#(and (= (+ (- 2) main_~y~0) 31) (<= main_~k~0 33) (< 32 main_~k~0))} is VALID [2022-04-27 14:47:13,822 INFO L272 TraceCheckUtils]: 250: Hoare triple {32536#(and (= (+ (- 2) main_~y~0) 31) (<= main_~k~0 33) (< 32 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {32540#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:47:13,822 INFO L290 TraceCheckUtils]: 251: Hoare triple {32540#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32544#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:47:13,822 INFO L290 TraceCheckUtils]: 252: Hoare triple {32544#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31751#false} is VALID [2022-04-27 14:47:13,822 INFO L290 TraceCheckUtils]: 253: Hoare triple {31751#false} assume !false; {31751#false} is VALID [2022-04-27 14:47:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3995 backedges. 68 proven. 1683 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2022-04-27 14:47:13,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:47:14,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:47:14,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613753788] [2022-04-27 14:47:14,216 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:47:14,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142349944] [2022-04-27 14:47:14,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142349944] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:47:14,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:47:14,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2022-04-27 14:47:14,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705215384] [2022-04-27 14:47:14,217 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:47:14,217 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) Word has length 254 [2022-04-27 14:47:14,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:47:14,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2022-04-27 14:47:14,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:47:14,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-27 14:47:14,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:47:14,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-27 14:47:14,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 14:47:14,863 INFO L87 Difference]: Start difference. First operand 127 states and 159 transitions. Second operand has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2022-04-27 14:47:45,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:47:45,281 INFO L93 Difference]: Finished difference Result 135 states and 168 transitions. [2022-04-27 14:47:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-27 14:47:45,281 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) Word has length 254 [2022-04-27 14:47:45,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:47:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2022-04-27 14:47:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 164 transitions. [2022-04-27 14:47:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2022-04-27 14:47:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 164 transitions. [2022-04-27 14:47:45,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 164 transitions. [2022-04-27 14:47:46,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:47:46,036 INFO L225 Difference]: With dead ends: 135 [2022-04-27 14:47:46,036 INFO L226 Difference]: Without dead ends: 130 [2022-04-27 14:47:46,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=1762, Unknown=0, NotChecked=0, Total=1892 [2022-04-27 14:47:46,037 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 2 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 3859 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 3859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:47:46,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2003 Invalid, 3859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3859 Invalid, 0 Unknown, 0 Unchecked, 16.2s Time] [2022-04-27 14:47:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-27 14:47:46,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-04-27 14:47:46,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:47:46,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 39 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 14:47:46,126 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 39 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 14:47:46,126 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 39 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 14:47:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:47:46,128 INFO L93 Difference]: Finished difference Result 130 states and 163 transitions. [2022-04-27 14:47:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 163 transitions. [2022-04-27 14:47:46,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:47:46,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:47:46,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 39 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 130 states. [2022-04-27 14:47:46,129 INFO L87 Difference]: Start difference. First operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 39 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 130 states. [2022-04-27 14:47:46,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:47:46,131 INFO L93 Difference]: Finished difference Result 130 states and 163 transitions. [2022-04-27 14:47:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 163 transitions. [2022-04-27 14:47:46,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:47:46,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:47:46,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:47:46,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:47:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 39 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 14:47:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 163 transitions. [2022-04-27 14:47:46,134 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 163 transitions. Word has length 254 [2022-04-27 14:47:46,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:47:46,134 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 163 transitions. [2022-04-27 14:47:46,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2022-04-27 14:47:46,134 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 163 transitions. [2022-04-27 14:47:46,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-04-27 14:47:46,135 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:47:46,135 INFO L195 NwaCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:47:46,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-27 14:47:46,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-27 14:47:46,342 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:47:46,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:47:46,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1574773833, now seen corresponding path program 34 times [2022-04-27 14:47:46,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:47:46,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601551860] [2022-04-27 14:47:46,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:47:46,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:47:46,357 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:47:46,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1126185288] [2022-04-27 14:47:46,357 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:47:46,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:47:46,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:47:46,358 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:47:46,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-27 14:47:47,163 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:47:47,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:47:47,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 144 conjunts are in the unsatisfiable core [2022-04-27 14:47:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:47:47,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:47:48,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {33283#true} call ULTIMATE.init(); {33283#true} is VALID [2022-04-27 14:47:48,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {33283#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(9, 2);call #Ultimate.allocInit(12, 3); {33283#true} is VALID [2022-04-27 14:47:48,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33283#true} {33283#true} #60#return; {33283#true} is VALID [2022-04-27 14:47:48,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {33283#true} call #t~ret5 := main(); {33283#true} is VALID [2022-04-27 14:47:48,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {33283#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {33283#true} is VALID [2022-04-27 14:47:48,535 INFO L272 TraceCheckUtils]: 6: Hoare triple {33283#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,535 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33283#true} {33283#true} #52#return; {33283#true} is VALID [2022-04-27 14:47:48,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {33283#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33321#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:47:48,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {33321#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {33321#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:47:48,537 INFO L272 TraceCheckUtils]: 13: Hoare triple {33321#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,538 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {33283#true} {33321#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {33321#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:47:48,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {33321#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33343#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:47:48,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {33343#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {33343#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:47:48,538 INFO L272 TraceCheckUtils]: 20: Hoare triple {33343#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,539 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {33283#true} {33343#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {33343#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:47:48,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {33343#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33365#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:47:48,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {33365#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !false; {33365#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:47:48,540 INFO L272 TraceCheckUtils]: 27: Hoare triple {33365#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,540 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {33283#true} {33365#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #54#return; {33365#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:47:48,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {33365#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33387#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:47:48,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {33387#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !false; {33387#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:47:48,541 INFO L272 TraceCheckUtils]: 34: Hoare triple {33387#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,542 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {33283#true} {33387#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #54#return; {33387#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:47:48,542 INFO L290 TraceCheckUtils]: 39: Hoare triple {33387#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33409#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-27 14:47:48,542 INFO L290 TraceCheckUtils]: 40: Hoare triple {33409#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !false; {33409#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-27 14:47:48,542 INFO L272 TraceCheckUtils]: 41: Hoare triple {33409#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,543 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {33283#true} {33409#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #54#return; {33409#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-27 14:47:48,543 INFO L290 TraceCheckUtils]: 46: Hoare triple {33409#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33431#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:47:48,543 INFO L290 TraceCheckUtils]: 47: Hoare triple {33431#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {33431#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:47:48,543 INFO L272 TraceCheckUtils]: 48: Hoare triple {33431#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,544 INFO L290 TraceCheckUtils]: 50: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,544 INFO L290 TraceCheckUtils]: 51: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,544 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {33283#true} {33431#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {33431#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:47:48,544 INFO L290 TraceCheckUtils]: 53: Hoare triple {33431#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33453#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:47:48,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {33453#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {33453#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:47:48,545 INFO L272 TraceCheckUtils]: 55: Hoare triple {33453#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,545 INFO L290 TraceCheckUtils]: 56: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,545 INFO L290 TraceCheckUtils]: 57: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,545 INFO L290 TraceCheckUtils]: 58: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,545 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {33283#true} {33453#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {33453#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:47:48,546 INFO L290 TraceCheckUtils]: 60: Hoare triple {33453#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33475#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:47:48,546 INFO L290 TraceCheckUtils]: 61: Hoare triple {33475#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {33475#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:47:48,546 INFO L272 TraceCheckUtils]: 62: Hoare triple {33475#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,546 INFO L290 TraceCheckUtils]: 63: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,546 INFO L290 TraceCheckUtils]: 64: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,546 INFO L290 TraceCheckUtils]: 65: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,546 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {33283#true} {33475#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #54#return; {33475#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:47:48,547 INFO L290 TraceCheckUtils]: 67: Hoare triple {33475#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33497#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:47:48,547 INFO L290 TraceCheckUtils]: 68: Hoare triple {33497#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} assume !false; {33497#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:47:48,547 INFO L272 TraceCheckUtils]: 69: Hoare triple {33497#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,547 INFO L290 TraceCheckUtils]: 70: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,547 INFO L290 TraceCheckUtils]: 71: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,547 INFO L290 TraceCheckUtils]: 72: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,548 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {33283#true} {33497#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} #54#return; {33497#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 14:47:48,548 INFO L290 TraceCheckUtils]: 74: Hoare triple {33497#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33519#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:47:48,548 INFO L290 TraceCheckUtils]: 75: Hoare triple {33519#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {33519#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:47:48,548 INFO L272 TraceCheckUtils]: 76: Hoare triple {33519#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,548 INFO L290 TraceCheckUtils]: 77: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,548 INFO L290 TraceCheckUtils]: 78: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,549 INFO L290 TraceCheckUtils]: 79: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,549 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {33283#true} {33519#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #54#return; {33519#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 14:47:48,549 INFO L290 TraceCheckUtils]: 81: Hoare triple {33519#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33541#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 14:47:48,550 INFO L290 TraceCheckUtils]: 82: Hoare triple {33541#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} assume !false; {33541#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 14:47:48,550 INFO L272 TraceCheckUtils]: 83: Hoare triple {33541#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,550 INFO L290 TraceCheckUtils]: 84: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,550 INFO L290 TraceCheckUtils]: 85: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,550 INFO L290 TraceCheckUtils]: 86: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,550 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {33283#true} {33541#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} #54#return; {33541#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 14:47:48,550 INFO L290 TraceCheckUtils]: 88: Hoare triple {33541#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33563#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:47:48,551 INFO L290 TraceCheckUtils]: 89: Hoare triple {33563#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {33563#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:47:48,551 INFO L272 TraceCheckUtils]: 90: Hoare triple {33563#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,551 INFO L290 TraceCheckUtils]: 91: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,551 INFO L290 TraceCheckUtils]: 92: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,551 INFO L290 TraceCheckUtils]: 93: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,551 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {33283#true} {33563#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {33563#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 14:47:48,552 INFO L290 TraceCheckUtils]: 95: Hoare triple {33563#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33585#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:47:48,552 INFO L290 TraceCheckUtils]: 96: Hoare triple {33585#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {33585#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:47:48,552 INFO L272 TraceCheckUtils]: 97: Hoare triple {33585#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,552 INFO L290 TraceCheckUtils]: 98: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,552 INFO L290 TraceCheckUtils]: 99: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,552 INFO L290 TraceCheckUtils]: 100: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,553 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {33283#true} {33585#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #54#return; {33585#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 14:47:48,553 INFO L290 TraceCheckUtils]: 102: Hoare triple {33585#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33607#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:47:48,553 INFO L290 TraceCheckUtils]: 103: Hoare triple {33607#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {33607#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:47:48,553 INFO L272 TraceCheckUtils]: 104: Hoare triple {33607#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,553 INFO L290 TraceCheckUtils]: 105: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,553 INFO L290 TraceCheckUtils]: 106: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,553 INFO L290 TraceCheckUtils]: 107: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,554 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {33283#true} {33607#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {33607#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:47:48,554 INFO L290 TraceCheckUtils]: 109: Hoare triple {33607#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33629#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:47:48,554 INFO L290 TraceCheckUtils]: 110: Hoare triple {33629#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !false; {33629#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:47:48,555 INFO L272 TraceCheckUtils]: 111: Hoare triple {33629#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,555 INFO L290 TraceCheckUtils]: 112: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,555 INFO L290 TraceCheckUtils]: 113: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,555 INFO L290 TraceCheckUtils]: 114: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,555 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {33283#true} {33629#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} #54#return; {33629#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:47:48,555 INFO L290 TraceCheckUtils]: 116: Hoare triple {33629#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33651#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:47:48,556 INFO L290 TraceCheckUtils]: 117: Hoare triple {33651#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !false; {33651#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:47:48,556 INFO L272 TraceCheckUtils]: 118: Hoare triple {33651#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,556 INFO L290 TraceCheckUtils]: 119: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,556 INFO L290 TraceCheckUtils]: 120: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,556 INFO L290 TraceCheckUtils]: 121: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,556 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {33283#true} {33651#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} #54#return; {33651#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:47:48,557 INFO L290 TraceCheckUtils]: 123: Hoare triple {33651#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33673#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:47:48,557 INFO L290 TraceCheckUtils]: 124: Hoare triple {33673#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {33673#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:47:48,557 INFO L272 TraceCheckUtils]: 125: Hoare triple {33673#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,557 INFO L290 TraceCheckUtils]: 126: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,557 INFO L290 TraceCheckUtils]: 127: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,557 INFO L290 TraceCheckUtils]: 128: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,558 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {33283#true} {33673#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #54#return; {33673#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:47:48,558 INFO L290 TraceCheckUtils]: 130: Hoare triple {33673#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33695#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-27 14:47:48,558 INFO L290 TraceCheckUtils]: 131: Hoare triple {33695#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !false; {33695#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-27 14:47:48,558 INFO L272 TraceCheckUtils]: 132: Hoare triple {33695#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,558 INFO L290 TraceCheckUtils]: 133: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,559 INFO L290 TraceCheckUtils]: 134: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,559 INFO L290 TraceCheckUtils]: 135: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,559 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {33283#true} {33695#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} #54#return; {33695#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-27 14:47:48,559 INFO L290 TraceCheckUtils]: 137: Hoare triple {33695#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33717#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:47:48,560 INFO L290 TraceCheckUtils]: 138: Hoare triple {33717#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} assume !false; {33717#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:47:48,560 INFO L272 TraceCheckUtils]: 139: Hoare triple {33717#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,560 INFO L290 TraceCheckUtils]: 140: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,560 INFO L290 TraceCheckUtils]: 141: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,560 INFO L290 TraceCheckUtils]: 142: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,560 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {33283#true} {33717#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} #54#return; {33717#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 14:47:48,561 INFO L290 TraceCheckUtils]: 144: Hoare triple {33717#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33739#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:47:48,561 INFO L290 TraceCheckUtils]: 145: Hoare triple {33739#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {33739#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:47:48,561 INFO L272 TraceCheckUtils]: 146: Hoare triple {33739#(and (= 19 main_~y~0) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,561 INFO L290 TraceCheckUtils]: 147: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,561 INFO L290 TraceCheckUtils]: 148: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,561 INFO L290 TraceCheckUtils]: 149: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,561 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {33283#true} {33739#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {33739#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:47:48,562 INFO L290 TraceCheckUtils]: 151: Hoare triple {33739#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33761#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-27 14:47:48,562 INFO L290 TraceCheckUtils]: 152: Hoare triple {33761#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {33761#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-27 14:47:48,562 INFO L272 TraceCheckUtils]: 153: Hoare triple {33761#(and (= main_~c~0 20) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,562 INFO L290 TraceCheckUtils]: 154: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,562 INFO L290 TraceCheckUtils]: 155: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,562 INFO L290 TraceCheckUtils]: 156: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,563 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {33283#true} {33761#(and (= main_~c~0 20) (= main_~y~0 20))} #54#return; {33761#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-27 14:47:48,563 INFO L290 TraceCheckUtils]: 158: Hoare triple {33761#(and (= main_~c~0 20) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33783#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 14:47:48,563 INFO L290 TraceCheckUtils]: 159: Hoare triple {33783#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {33783#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 14:47:48,563 INFO L272 TraceCheckUtils]: 160: Hoare triple {33783#(and (= main_~c~0 21) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,563 INFO L290 TraceCheckUtils]: 161: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,564 INFO L290 TraceCheckUtils]: 162: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,564 INFO L290 TraceCheckUtils]: 163: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,564 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {33283#true} {33783#(and (= main_~c~0 21) (= main_~y~0 21))} #54#return; {33783#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 14:47:48,564 INFO L290 TraceCheckUtils]: 165: Hoare triple {33783#(and (= main_~c~0 21) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33805#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-27 14:47:48,565 INFO L290 TraceCheckUtils]: 166: Hoare triple {33805#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {33805#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-27 14:47:48,565 INFO L272 TraceCheckUtils]: 167: Hoare triple {33805#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,565 INFO L290 TraceCheckUtils]: 168: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,565 INFO L290 TraceCheckUtils]: 169: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,565 INFO L290 TraceCheckUtils]: 170: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,565 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {33283#true} {33805#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #54#return; {33805#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-27 14:47:48,566 INFO L290 TraceCheckUtils]: 172: Hoare triple {33805#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33827#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-27 14:47:48,566 INFO L290 TraceCheckUtils]: 173: Hoare triple {33827#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {33827#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-27 14:47:48,566 INFO L272 TraceCheckUtils]: 174: Hoare triple {33827#(and (= 23 main_~y~0) (= 23 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,566 INFO L290 TraceCheckUtils]: 175: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,566 INFO L290 TraceCheckUtils]: 176: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,566 INFO L290 TraceCheckUtils]: 177: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,566 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {33283#true} {33827#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {33827#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-27 14:47:48,567 INFO L290 TraceCheckUtils]: 179: Hoare triple {33827#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33849#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:47:48,567 INFO L290 TraceCheckUtils]: 180: Hoare triple {33849#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} assume !false; {33849#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:47:48,567 INFO L272 TraceCheckUtils]: 181: Hoare triple {33849#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,567 INFO L290 TraceCheckUtils]: 182: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,567 INFO L290 TraceCheckUtils]: 183: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,567 INFO L290 TraceCheckUtils]: 184: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,568 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {33283#true} {33849#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} #54#return; {33849#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:47:48,568 INFO L290 TraceCheckUtils]: 186: Hoare triple {33849#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33871#(and (= 23 (+ (- 2) main_~y~0)) (= 23 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:47:48,568 INFO L290 TraceCheckUtils]: 187: Hoare triple {33871#(and (= 23 (+ (- 2) main_~y~0)) (= 23 (+ (- 2) main_~c~0)))} assume !false; {33871#(and (= 23 (+ (- 2) main_~y~0)) (= 23 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:47:48,568 INFO L272 TraceCheckUtils]: 188: Hoare triple {33871#(and (= 23 (+ (- 2) main_~y~0)) (= 23 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,568 INFO L290 TraceCheckUtils]: 189: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,569 INFO L290 TraceCheckUtils]: 190: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,569 INFO L290 TraceCheckUtils]: 191: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,569 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {33283#true} {33871#(and (= 23 (+ (- 2) main_~y~0)) (= 23 (+ (- 2) main_~c~0)))} #54#return; {33871#(and (= 23 (+ (- 2) main_~y~0)) (= 23 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:47:48,569 INFO L290 TraceCheckUtils]: 193: Hoare triple {33871#(and (= 23 (+ (- 2) main_~y~0)) (= 23 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33893#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} is VALID [2022-04-27 14:47:48,570 INFO L290 TraceCheckUtils]: 194: Hoare triple {33893#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} assume !false; {33893#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} is VALID [2022-04-27 14:47:48,570 INFO L272 TraceCheckUtils]: 195: Hoare triple {33893#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,570 INFO L290 TraceCheckUtils]: 196: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,570 INFO L290 TraceCheckUtils]: 197: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,570 INFO L290 TraceCheckUtils]: 198: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,570 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {33283#true} {33893#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} #54#return; {33893#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} is VALID [2022-04-27 14:47:48,571 INFO L290 TraceCheckUtils]: 200: Hoare triple {33893#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33915#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-27 14:47:48,571 INFO L290 TraceCheckUtils]: 201: Hoare triple {33915#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {33915#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-27 14:47:48,571 INFO L272 TraceCheckUtils]: 202: Hoare triple {33915#(and (= main_~y~0 27) (= main_~c~0 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,571 INFO L290 TraceCheckUtils]: 203: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,571 INFO L290 TraceCheckUtils]: 204: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,571 INFO L290 TraceCheckUtils]: 205: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,571 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {33283#true} {33915#(and (= main_~y~0 27) (= main_~c~0 27))} #54#return; {33915#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-27 14:47:48,572 INFO L290 TraceCheckUtils]: 207: Hoare triple {33915#(and (= main_~y~0 27) (= main_~c~0 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33937#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-27 14:47:48,572 INFO L290 TraceCheckUtils]: 208: Hoare triple {33937#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} assume !false; {33937#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-27 14:47:48,572 INFO L272 TraceCheckUtils]: 209: Hoare triple {33937#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,572 INFO L290 TraceCheckUtils]: 210: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,572 INFO L290 TraceCheckUtils]: 211: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,572 INFO L290 TraceCheckUtils]: 212: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,573 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {33283#true} {33937#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} #54#return; {33937#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-27 14:47:48,573 INFO L290 TraceCheckUtils]: 214: Hoare triple {33937#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33959#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-27 14:47:48,573 INFO L290 TraceCheckUtils]: 215: Hoare triple {33959#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !false; {33959#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-27 14:47:48,573 INFO L272 TraceCheckUtils]: 216: Hoare triple {33959#(and (= 29 main_~y~0) (= 29 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,573 INFO L290 TraceCheckUtils]: 217: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,574 INFO L290 TraceCheckUtils]: 218: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,574 INFO L290 TraceCheckUtils]: 219: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,574 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {33283#true} {33959#(and (= 29 main_~y~0) (= 29 main_~c~0))} #54#return; {33959#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-27 14:47:48,574 INFO L290 TraceCheckUtils]: 221: Hoare triple {33959#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33981#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-27 14:47:48,575 INFO L290 TraceCheckUtils]: 222: Hoare triple {33981#(and (= 30 main_~y~0) (= 30 main_~c~0))} assume !false; {33981#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-27 14:47:48,575 INFO L272 TraceCheckUtils]: 223: Hoare triple {33981#(and (= 30 main_~y~0) (= 30 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,575 INFO L290 TraceCheckUtils]: 224: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,575 INFO L290 TraceCheckUtils]: 225: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,575 INFO L290 TraceCheckUtils]: 226: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,575 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {33283#true} {33981#(and (= 30 main_~y~0) (= 30 main_~c~0))} #54#return; {33981#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-27 14:47:48,576 INFO L290 TraceCheckUtils]: 228: Hoare triple {33981#(and (= 30 main_~y~0) (= 30 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34003#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-27 14:47:48,576 INFO L290 TraceCheckUtils]: 229: Hoare triple {34003#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !false; {34003#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-27 14:47:48,576 INFO L272 TraceCheckUtils]: 230: Hoare triple {34003#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,576 INFO L290 TraceCheckUtils]: 231: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,576 INFO L290 TraceCheckUtils]: 232: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,576 INFO L290 TraceCheckUtils]: 233: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,576 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {33283#true} {34003#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} #54#return; {34003#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-27 14:47:48,577 INFO L290 TraceCheckUtils]: 235: Hoare triple {34003#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34025#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-27 14:47:48,577 INFO L290 TraceCheckUtils]: 236: Hoare triple {34025#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !false; {34025#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-27 14:47:48,577 INFO L272 TraceCheckUtils]: 237: Hoare triple {34025#(and (= 32 main_~y~0) (= 32 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,577 INFO L290 TraceCheckUtils]: 238: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,577 INFO L290 TraceCheckUtils]: 239: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,577 INFO L290 TraceCheckUtils]: 240: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,578 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {33283#true} {34025#(and (= 32 main_~y~0) (= 32 main_~c~0))} #54#return; {34025#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-27 14:47:48,578 INFO L290 TraceCheckUtils]: 242: Hoare triple {34025#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34047#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} is VALID [2022-04-27 14:47:48,578 INFO L290 TraceCheckUtils]: 243: Hoare triple {34047#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} assume !false; {34047#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} is VALID [2022-04-27 14:47:48,578 INFO L272 TraceCheckUtils]: 244: Hoare triple {34047#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,578 INFO L290 TraceCheckUtils]: 245: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,579 INFO L290 TraceCheckUtils]: 246: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,579 INFO L290 TraceCheckUtils]: 247: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,579 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {33283#true} {34047#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} #54#return; {34047#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} is VALID [2022-04-27 14:47:48,579 INFO L290 TraceCheckUtils]: 249: Hoare triple {34047#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34069#(and (<= main_~c~0 34) (= (+ (- 2) main_~y~0) 32) (< 33 main_~k~0))} is VALID [2022-04-27 14:47:48,580 INFO L290 TraceCheckUtils]: 250: Hoare triple {34069#(and (<= main_~c~0 34) (= (+ (- 2) main_~y~0) 32) (< 33 main_~k~0))} assume !false; {34069#(and (<= main_~c~0 34) (= (+ (- 2) main_~y~0) 32) (< 33 main_~k~0))} is VALID [2022-04-27 14:47:48,580 INFO L272 TraceCheckUtils]: 251: Hoare triple {34069#(and (<= main_~c~0 34) (= (+ (- 2) main_~y~0) 32) (< 33 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33283#true} is VALID [2022-04-27 14:47:48,580 INFO L290 TraceCheckUtils]: 252: Hoare triple {33283#true} ~cond := #in~cond; {33283#true} is VALID [2022-04-27 14:47:48,580 INFO L290 TraceCheckUtils]: 253: Hoare triple {33283#true} assume !(0 == ~cond); {33283#true} is VALID [2022-04-27 14:47:48,580 INFO L290 TraceCheckUtils]: 254: Hoare triple {33283#true} assume true; {33283#true} is VALID [2022-04-27 14:47:48,580 INFO L284 TraceCheckUtils]: 255: Hoare quadruple {33283#true} {34069#(and (<= main_~c~0 34) (= (+ (- 2) main_~y~0) 32) (< 33 main_~k~0))} #54#return; {34069#(and (<= main_~c~0 34) (= (+ (- 2) main_~y~0) 32) (< 33 main_~k~0))} is VALID [2022-04-27 14:47:48,585 INFO L290 TraceCheckUtils]: 256: Hoare triple {34069#(and (<= main_~c~0 34) (= (+ (- 2) main_~y~0) 32) (< 33 main_~k~0))} assume !(~c~0 < ~k~0); {34091#(and (<= main_~k~0 34) (= (+ (- 2) main_~y~0) 32) (< 33 main_~k~0))} is VALID [2022-04-27 14:47:48,585 INFO L272 TraceCheckUtils]: 257: Hoare triple {34091#(and (<= main_~k~0 34) (= (+ (- 2) main_~y~0) 32) (< 33 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34095#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:47:48,586 INFO L290 TraceCheckUtils]: 258: Hoare triple {34095#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34099#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:47:48,586 INFO L290 TraceCheckUtils]: 259: Hoare triple {34099#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33284#false} is VALID [2022-04-27 14:47:48,586 INFO L290 TraceCheckUtils]: 260: Hoare triple {33284#false} assume !false; {33284#false} is VALID [2022-04-27 14:47:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 70 proven. 1785 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2022-04-27 14:47:48,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:47:48,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:47:48,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601551860] [2022-04-27 14:47:48,992 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:47:48,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126185288] [2022-04-27 14:47:48,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126185288] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:47:48,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:47:48,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2022-04-27 14:47:48,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827583124] [2022-04-27 14:47:48,993 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:47:48,993 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) Word has length 261 [2022-04-27 14:47:48,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:47:48,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) [2022-04-27 14:47:49,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:47:49,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-27 14:47:49,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:47:49,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-27 14:47:49,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 14:47:49,736 INFO L87 Difference]: Start difference. First operand 130 states and 163 transitions. Second operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) [2022-04-27 14:48:24,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:48:24,932 INFO L93 Difference]: Finished difference Result 138 states and 172 transitions. [2022-04-27 14:48:24,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-27 14:48:24,933 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) Word has length 261 [2022-04-27 14:48:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:48:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) [2022-04-27 14:48:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 168 transitions. [2022-04-27 14:48:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) [2022-04-27 14:48:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 168 transitions. [2022-04-27 14:48:24,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 168 transitions. [2022-04-27 14:48:25,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:48:25,840 INFO L225 Difference]: With dead ends: 138 [2022-04-27 14:48:25,840 INFO L226 Difference]: Without dead ends: 133 [2022-04-27 14:48:25,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=1847, Unknown=0, NotChecked=0, Total=1980 [2022-04-27 14:48:25,840 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 2 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 4077 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 4077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2022-04-27 14:48:25,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2095 Invalid, 4077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4077 Invalid, 0 Unknown, 0 Unchecked, 18.7s Time] [2022-04-27 14:48:25,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-27 14:48:25,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-04-27 14:48:25,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:48:25,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 40 states have call successors, (40), 6 states have call predecessors, (40), 4 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 14:48:25,930 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 40 states have call successors, (40), 6 states have call predecessors, (40), 4 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 14:48:25,930 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 40 states have call successors, (40), 6 states have call predecessors, (40), 4 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 14:48:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:48:25,932 INFO L93 Difference]: Finished difference Result 133 states and 167 transitions. [2022-04-27 14:48:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 167 transitions. [2022-04-27 14:48:25,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:48:25,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:48:25,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 40 states have call successors, (40), 6 states have call predecessors, (40), 4 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand 133 states. [2022-04-27 14:48:25,933 INFO L87 Difference]: Start difference. First operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 40 states have call successors, (40), 6 states have call predecessors, (40), 4 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand 133 states. [2022-04-27 14:48:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:48:25,935 INFO L93 Difference]: Finished difference Result 133 states and 167 transitions. [2022-04-27 14:48:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 167 transitions. [2022-04-27 14:48:25,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:48:25,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:48:25,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:48:25,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:48:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 40 states have call successors, (40), 6 states have call predecessors, (40), 4 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 14:48:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 167 transitions. [2022-04-27 14:48:25,938 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 167 transitions. Word has length 261 [2022-04-27 14:48:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:48:25,938 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 167 transitions. [2022-04-27 14:48:25,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) [2022-04-27 14:48:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 167 transitions. [2022-04-27 14:48:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-04-27 14:48:25,939 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:48:25,939 INFO L195 NwaCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:48:25,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-27 14:48:26,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:48:26,140 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:48:26,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:48:26,140 INFO L85 PathProgramCache]: Analyzing trace with hash -416032600, now seen corresponding path program 35 times [2022-04-27 14:48:26,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:48:26,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008464440] [2022-04-27 14:48:26,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:48:26,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:48:26,155 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:48:26,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [485719573] [2022-04-27 14:48:26,156 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:48:26,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:48:26,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:48:26,156 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:48:26,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-27 14:48:51,938 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2022-04-27 14:48:51,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:48:51,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 148 conjunts are in the unsatisfiable core [2022-04-27 14:48:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:48:52,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:48:53,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {34854#true} call ULTIMATE.init(); {34854#true} is VALID [2022-04-27 14:48:53,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {34854#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(9, 2);call #Ultimate.allocInit(12, 3); {34854#true} is VALID [2022-04-27 14:48:53,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34854#true} {34854#true} #60#return; {34854#true} is VALID [2022-04-27 14:48:53,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {34854#true} call #t~ret5 := main(); {34854#true} is VALID [2022-04-27 14:48:53,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {34854#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {34854#true} is VALID [2022-04-27 14:48:53,382 INFO L272 TraceCheckUtils]: 6: Hoare triple {34854#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34854#true} {34854#true} #52#return; {34854#true} is VALID [2022-04-27 14:48:53,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {34854#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {34892#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:48:53,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {34892#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {34892#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:48:53,382 INFO L272 TraceCheckUtils]: 13: Hoare triple {34892#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,383 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {34854#true} {34892#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {34892#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:48:53,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {34892#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34914#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:48:53,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {34914#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {34914#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:48:53,384 INFO L272 TraceCheckUtils]: 20: Hoare triple {34914#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,384 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {34854#true} {34914#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {34914#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:48:53,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {34914#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34936#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:48:53,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {34936#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {34936#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:48:53,385 INFO L272 TraceCheckUtils]: 27: Hoare triple {34936#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,385 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34854#true} {34936#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {34936#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 14:48:53,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {34936#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34958#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:48:53,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {34958#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {34958#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:48:53,386 INFO L272 TraceCheckUtils]: 34: Hoare triple {34958#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,387 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {34854#true} {34958#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {34958#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:48:53,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {34958#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34980#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:48:53,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {34980#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !false; {34980#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:48:53,388 INFO L272 TraceCheckUtils]: 41: Hoare triple {34980#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,388 INFO L290 TraceCheckUtils]: 42: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,388 INFO L290 TraceCheckUtils]: 43: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,388 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {34854#true} {34980#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #54#return; {34980#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 14:48:53,388 INFO L290 TraceCheckUtils]: 46: Hoare triple {34980#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35002#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:48:53,389 INFO L290 TraceCheckUtils]: 47: Hoare triple {35002#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {35002#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:48:53,389 INFO L272 TraceCheckUtils]: 48: Hoare triple {35002#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,389 INFO L290 TraceCheckUtils]: 49: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,389 INFO L290 TraceCheckUtils]: 50: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,389 INFO L290 TraceCheckUtils]: 51: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,389 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {34854#true} {35002#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {35002#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:48:53,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {35002#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35024#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:48:53,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {35024#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {35024#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:48:53,390 INFO L272 TraceCheckUtils]: 55: Hoare triple {35024#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,390 INFO L290 TraceCheckUtils]: 57: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,390 INFO L290 TraceCheckUtils]: 58: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,391 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {34854#true} {35024#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {35024#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 14:48:53,391 INFO L290 TraceCheckUtils]: 60: Hoare triple {35024#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35046#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:48:53,391 INFO L290 TraceCheckUtils]: 61: Hoare triple {35046#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !false; {35046#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:48:53,391 INFO L272 TraceCheckUtils]: 62: Hoare triple {35046#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,391 INFO L290 TraceCheckUtils]: 63: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,391 INFO L290 TraceCheckUtils]: 64: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,391 INFO L290 TraceCheckUtils]: 65: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,392 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {34854#true} {35046#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} #54#return; {35046#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:48:53,392 INFO L290 TraceCheckUtils]: 67: Hoare triple {35046#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35068#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 14:48:53,392 INFO L290 TraceCheckUtils]: 68: Hoare triple {35068#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {35068#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 14:48:53,393 INFO L272 TraceCheckUtils]: 69: Hoare triple {35068#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,393 INFO L290 TraceCheckUtils]: 70: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,393 INFO L290 TraceCheckUtils]: 71: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,393 INFO L290 TraceCheckUtils]: 72: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,393 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {34854#true} {35068#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {35068#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 14:48:53,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {35068#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35090#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-27 14:48:53,394 INFO L290 TraceCheckUtils]: 75: Hoare triple {35090#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !false; {35090#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-27 14:48:53,394 INFO L272 TraceCheckUtils]: 76: Hoare triple {35090#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,394 INFO L290 TraceCheckUtils]: 77: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,394 INFO L290 TraceCheckUtils]: 78: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,394 INFO L290 TraceCheckUtils]: 79: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,394 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {34854#true} {35090#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} #54#return; {35090#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-27 14:48:53,395 INFO L290 TraceCheckUtils]: 81: Hoare triple {35090#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35112#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} is VALID [2022-04-27 14:48:53,395 INFO L290 TraceCheckUtils]: 82: Hoare triple {35112#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} assume !false; {35112#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} is VALID [2022-04-27 14:48:53,395 INFO L272 TraceCheckUtils]: 83: Hoare triple {35112#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,395 INFO L290 TraceCheckUtils]: 84: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,395 INFO L290 TraceCheckUtils]: 85: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,395 INFO L290 TraceCheckUtils]: 86: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,396 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {34854#true} {35112#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} #54#return; {35112#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} is VALID [2022-04-27 14:48:53,396 INFO L290 TraceCheckUtils]: 88: Hoare triple {35112#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35134#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:48:53,396 INFO L290 TraceCheckUtils]: 89: Hoare triple {35134#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {35134#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:48:53,396 INFO L272 TraceCheckUtils]: 90: Hoare triple {35134#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,396 INFO L290 TraceCheckUtils]: 91: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,396 INFO L290 TraceCheckUtils]: 92: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,396 INFO L290 TraceCheckUtils]: 93: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,397 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {34854#true} {35134#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {35134#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 14:48:53,397 INFO L290 TraceCheckUtils]: 95: Hoare triple {35134#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35156#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:48:53,397 INFO L290 TraceCheckUtils]: 96: Hoare triple {35156#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {35156#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:48:53,398 INFO L272 TraceCheckUtils]: 97: Hoare triple {35156#(and (= main_~y~0 12) (= main_~c~0 12))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,398 INFO L290 TraceCheckUtils]: 98: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,398 INFO L290 TraceCheckUtils]: 99: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,398 INFO L290 TraceCheckUtils]: 100: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,398 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {34854#true} {35156#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {35156#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 14:48:53,398 INFO L290 TraceCheckUtils]: 102: Hoare triple {35156#(and (= main_~y~0 12) (= main_~c~0 12))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35178#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:48:53,399 INFO L290 TraceCheckUtils]: 103: Hoare triple {35178#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {35178#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:48:53,399 INFO L272 TraceCheckUtils]: 104: Hoare triple {35178#(and (= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,399 INFO L290 TraceCheckUtils]: 105: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,399 INFO L290 TraceCheckUtils]: 106: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,399 INFO L290 TraceCheckUtils]: 107: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,399 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {34854#true} {35178#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {35178#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 14:48:53,400 INFO L290 TraceCheckUtils]: 109: Hoare triple {35178#(and (= main_~c~0 13) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35200#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:48:53,400 INFO L290 TraceCheckUtils]: 110: Hoare triple {35200#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {35200#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:48:53,400 INFO L272 TraceCheckUtils]: 111: Hoare triple {35200#(and (= main_~y~0 14) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,400 INFO L290 TraceCheckUtils]: 112: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,400 INFO L290 TraceCheckUtils]: 113: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,400 INFO L290 TraceCheckUtils]: 114: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,401 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {34854#true} {35200#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {35200#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 14:48:53,401 INFO L290 TraceCheckUtils]: 116: Hoare triple {35200#(and (= main_~y~0 14) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35222#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:48:53,401 INFO L290 TraceCheckUtils]: 117: Hoare triple {35222#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {35222#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:48:53,401 INFO L272 TraceCheckUtils]: 118: Hoare triple {35222#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,401 INFO L290 TraceCheckUtils]: 119: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,401 INFO L290 TraceCheckUtils]: 120: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,401 INFO L290 TraceCheckUtils]: 121: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,408 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {34854#true} {35222#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {35222#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:48:53,408 INFO L290 TraceCheckUtils]: 123: Hoare triple {35222#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35244#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-27 14:48:53,409 INFO L290 TraceCheckUtils]: 124: Hoare triple {35244#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} assume !false; {35244#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-27 14:48:53,409 INFO L272 TraceCheckUtils]: 125: Hoare triple {35244#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,409 INFO L290 TraceCheckUtils]: 126: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,409 INFO L290 TraceCheckUtils]: 127: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,409 INFO L290 TraceCheckUtils]: 128: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,409 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {34854#true} {35244#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} #54#return; {35244#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-27 14:48:53,410 INFO L290 TraceCheckUtils]: 130: Hoare triple {35244#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35266#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:48:53,415 INFO L290 TraceCheckUtils]: 131: Hoare triple {35266#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} assume !false; {35266#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:48:53,415 INFO L272 TraceCheckUtils]: 132: Hoare triple {35266#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,415 INFO L290 TraceCheckUtils]: 133: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,415 INFO L290 TraceCheckUtils]: 134: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,415 INFO L290 TraceCheckUtils]: 135: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,417 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {34854#true} {35266#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} #54#return; {35266#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:48:53,418 INFO L290 TraceCheckUtils]: 137: Hoare triple {35266#(and (= (+ main_~y~0 (- 3)) 14) (= 15 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35288#(and (= (+ main_~y~0 (- 4)) 14) (= main_~c~0 18))} is VALID [2022-04-27 14:48:53,418 INFO L290 TraceCheckUtils]: 138: Hoare triple {35288#(and (= (+ main_~y~0 (- 4)) 14) (= main_~c~0 18))} assume !false; {35288#(and (= (+ main_~y~0 (- 4)) 14) (= main_~c~0 18))} is VALID [2022-04-27 14:48:53,418 INFO L272 TraceCheckUtils]: 139: Hoare triple {35288#(and (= (+ main_~y~0 (- 4)) 14) (= main_~c~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,418 INFO L290 TraceCheckUtils]: 140: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,418 INFO L290 TraceCheckUtils]: 141: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,418 INFO L290 TraceCheckUtils]: 142: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,419 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {34854#true} {35288#(and (= (+ main_~y~0 (- 4)) 14) (= main_~c~0 18))} #54#return; {35288#(and (= (+ main_~y~0 (- 4)) 14) (= main_~c~0 18))} is VALID [2022-04-27 14:48:53,419 INFO L290 TraceCheckUtils]: 144: Hoare triple {35288#(and (= (+ main_~y~0 (- 4)) 14) (= main_~c~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35310#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:48:53,419 INFO L290 TraceCheckUtils]: 145: Hoare triple {35310#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {35310#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:48:53,419 INFO L272 TraceCheckUtils]: 146: Hoare triple {35310#(and (= 19 main_~y~0) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,419 INFO L290 TraceCheckUtils]: 147: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,420 INFO L290 TraceCheckUtils]: 148: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,420 INFO L290 TraceCheckUtils]: 149: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,420 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {34854#true} {35310#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {35310#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 14:48:53,420 INFO L290 TraceCheckUtils]: 151: Hoare triple {35310#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35332#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-27 14:48:53,421 INFO L290 TraceCheckUtils]: 152: Hoare triple {35332#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !false; {35332#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-27 14:48:53,421 INFO L272 TraceCheckUtils]: 153: Hoare triple {35332#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,421 INFO L290 TraceCheckUtils]: 154: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,421 INFO L290 TraceCheckUtils]: 155: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,421 INFO L290 TraceCheckUtils]: 156: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,421 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {34854#true} {35332#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} #54#return; {35332#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-27 14:48:53,422 INFO L290 TraceCheckUtils]: 158: Hoare triple {35332#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35354#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:48:53,422 INFO L290 TraceCheckUtils]: 159: Hoare triple {35354#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} assume !false; {35354#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:48:53,422 INFO L272 TraceCheckUtils]: 160: Hoare triple {35354#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,422 INFO L290 TraceCheckUtils]: 161: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,422 INFO L290 TraceCheckUtils]: 162: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,422 INFO L290 TraceCheckUtils]: 163: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,422 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {34854#true} {35354#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} #54#return; {35354#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:48:53,423 INFO L290 TraceCheckUtils]: 165: Hoare triple {35354#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35376#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:48:53,423 INFO L290 TraceCheckUtils]: 166: Hoare triple {35376#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {35376#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:48:53,423 INFO L272 TraceCheckUtils]: 167: Hoare triple {35376#(and (= main_~y~0 22) (= main_~c~0 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,423 INFO L290 TraceCheckUtils]: 168: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,423 INFO L290 TraceCheckUtils]: 169: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,423 INFO L290 TraceCheckUtils]: 170: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,424 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {34854#true} {35376#(and (= main_~y~0 22) (= main_~c~0 22))} #54#return; {35376#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 14:48:53,424 INFO L290 TraceCheckUtils]: 172: Hoare triple {35376#(and (= main_~y~0 22) (= main_~c~0 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35398#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:48:53,424 INFO L290 TraceCheckUtils]: 173: Hoare triple {35398#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {35398#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:48:53,424 INFO L272 TraceCheckUtils]: 174: Hoare triple {35398#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,425 INFO L290 TraceCheckUtils]: 175: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,425 INFO L290 TraceCheckUtils]: 176: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,425 INFO L290 TraceCheckUtils]: 177: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,425 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {34854#true} {35398#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} #54#return; {35398#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:48:53,425 INFO L290 TraceCheckUtils]: 179: Hoare triple {35398#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35420#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:48:53,426 INFO L290 TraceCheckUtils]: 180: Hoare triple {35420#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !false; {35420#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:48:53,426 INFO L272 TraceCheckUtils]: 181: Hoare triple {35420#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,426 INFO L290 TraceCheckUtils]: 182: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,426 INFO L290 TraceCheckUtils]: 183: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,426 INFO L290 TraceCheckUtils]: 184: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,426 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {34854#true} {35420#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} #54#return; {35420#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 14:48:53,427 INFO L290 TraceCheckUtils]: 186: Hoare triple {35420#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35442#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 14:48:53,427 INFO L290 TraceCheckUtils]: 187: Hoare triple {35442#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} assume !false; {35442#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 14:48:53,427 INFO L272 TraceCheckUtils]: 188: Hoare triple {35442#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,427 INFO L290 TraceCheckUtils]: 189: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,427 INFO L290 TraceCheckUtils]: 190: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,427 INFO L290 TraceCheckUtils]: 191: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,428 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {34854#true} {35442#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} #54#return; {35442#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 14:48:53,428 INFO L290 TraceCheckUtils]: 193: Hoare triple {35442#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35464#(and (= 23 (+ main_~c~0 (- 3))) (= main_~y~0 26))} is VALID [2022-04-27 14:48:53,428 INFO L290 TraceCheckUtils]: 194: Hoare triple {35464#(and (= 23 (+ main_~c~0 (- 3))) (= main_~y~0 26))} assume !false; {35464#(and (= 23 (+ main_~c~0 (- 3))) (= main_~y~0 26))} is VALID [2022-04-27 14:48:53,428 INFO L272 TraceCheckUtils]: 195: Hoare triple {35464#(and (= 23 (+ main_~c~0 (- 3))) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,428 INFO L290 TraceCheckUtils]: 196: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,428 INFO L290 TraceCheckUtils]: 197: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,428 INFO L290 TraceCheckUtils]: 198: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,429 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {34854#true} {35464#(and (= 23 (+ main_~c~0 (- 3))) (= main_~y~0 26))} #54#return; {35464#(and (= 23 (+ main_~c~0 (- 3))) (= main_~y~0 26))} is VALID [2022-04-27 14:48:53,429 INFO L290 TraceCheckUtils]: 200: Hoare triple {35464#(and (= 23 (+ main_~c~0 (- 3))) (= main_~y~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35486#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-27 14:48:53,429 INFO L290 TraceCheckUtils]: 201: Hoare triple {35486#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} assume !false; {35486#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-27 14:48:53,429 INFO L272 TraceCheckUtils]: 202: Hoare triple {35486#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,430 INFO L290 TraceCheckUtils]: 203: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,430 INFO L290 TraceCheckUtils]: 204: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,430 INFO L290 TraceCheckUtils]: 205: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,430 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {34854#true} {35486#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} #54#return; {35486#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-27 14:48:53,430 INFO L290 TraceCheckUtils]: 207: Hoare triple {35486#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35508#(and (= (+ (- 2) main_~y~0) 26) (= main_~c~0 28))} is VALID [2022-04-27 14:48:53,431 INFO L290 TraceCheckUtils]: 208: Hoare triple {35508#(and (= (+ (- 2) main_~y~0) 26) (= main_~c~0 28))} assume !false; {35508#(and (= (+ (- 2) main_~y~0) 26) (= main_~c~0 28))} is VALID [2022-04-27 14:48:53,431 INFO L272 TraceCheckUtils]: 209: Hoare triple {35508#(and (= (+ (- 2) main_~y~0) 26) (= main_~c~0 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,431 INFO L290 TraceCheckUtils]: 210: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,431 INFO L290 TraceCheckUtils]: 211: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,431 INFO L290 TraceCheckUtils]: 212: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,431 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {34854#true} {35508#(and (= (+ (- 2) main_~y~0) 26) (= main_~c~0 28))} #54#return; {35508#(and (= (+ (- 2) main_~y~0) 26) (= main_~c~0 28))} is VALID [2022-04-27 14:48:53,432 INFO L290 TraceCheckUtils]: 214: Hoare triple {35508#(and (= (+ (- 2) main_~y~0) 26) (= main_~c~0 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35530#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-27 14:48:53,432 INFO L290 TraceCheckUtils]: 215: Hoare triple {35530#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} assume !false; {35530#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-27 14:48:53,432 INFO L272 TraceCheckUtils]: 216: Hoare triple {35530#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,432 INFO L290 TraceCheckUtils]: 217: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,432 INFO L290 TraceCheckUtils]: 218: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,432 INFO L290 TraceCheckUtils]: 219: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,433 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {34854#true} {35530#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} #54#return; {35530#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-27 14:48:53,433 INFO L290 TraceCheckUtils]: 221: Hoare triple {35530#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35552#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:48:53,433 INFO L290 TraceCheckUtils]: 222: Hoare triple {35552#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} assume !false; {35552#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:48:53,433 INFO L272 TraceCheckUtils]: 223: Hoare triple {35552#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,433 INFO L290 TraceCheckUtils]: 224: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,433 INFO L290 TraceCheckUtils]: 225: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,433 INFO L290 TraceCheckUtils]: 226: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,434 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {34854#true} {35552#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} #54#return; {35552#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:48:53,434 INFO L290 TraceCheckUtils]: 228: Hoare triple {35552#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35574#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-27 14:48:53,434 INFO L290 TraceCheckUtils]: 229: Hoare triple {35574#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !false; {35574#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-27 14:48:53,435 INFO L272 TraceCheckUtils]: 230: Hoare triple {35574#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,435 INFO L290 TraceCheckUtils]: 231: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,435 INFO L290 TraceCheckUtils]: 232: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,435 INFO L290 TraceCheckUtils]: 233: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,435 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {34854#true} {35574#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} #54#return; {35574#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-27 14:48:53,435 INFO L290 TraceCheckUtils]: 235: Hoare triple {35574#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35596#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} is VALID [2022-04-27 14:48:53,436 INFO L290 TraceCheckUtils]: 236: Hoare triple {35596#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} assume !false; {35596#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} is VALID [2022-04-27 14:48:53,436 INFO L272 TraceCheckUtils]: 237: Hoare triple {35596#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,436 INFO L290 TraceCheckUtils]: 238: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,436 INFO L290 TraceCheckUtils]: 239: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,436 INFO L290 TraceCheckUtils]: 240: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,436 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {34854#true} {35596#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} #54#return; {35596#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} is VALID [2022-04-27 14:48:53,437 INFO L290 TraceCheckUtils]: 242: Hoare triple {35596#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35618#(and (= main_~y~0 33) (= main_~c~0 33))} is VALID [2022-04-27 14:48:53,437 INFO L290 TraceCheckUtils]: 243: Hoare triple {35618#(and (= main_~y~0 33) (= main_~c~0 33))} assume !false; {35618#(and (= main_~y~0 33) (= main_~c~0 33))} is VALID [2022-04-27 14:48:53,437 INFO L272 TraceCheckUtils]: 244: Hoare triple {35618#(and (= main_~y~0 33) (= main_~c~0 33))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,437 INFO L290 TraceCheckUtils]: 245: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,437 INFO L290 TraceCheckUtils]: 246: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,437 INFO L290 TraceCheckUtils]: 247: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,438 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {34854#true} {35618#(and (= main_~y~0 33) (= main_~c~0 33))} #54#return; {35618#(and (= main_~y~0 33) (= main_~c~0 33))} is VALID [2022-04-27 14:48:53,438 INFO L290 TraceCheckUtils]: 249: Hoare triple {35618#(and (= main_~y~0 33) (= main_~c~0 33))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35640#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} is VALID [2022-04-27 14:48:53,438 INFO L290 TraceCheckUtils]: 250: Hoare triple {35640#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} assume !false; {35640#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} is VALID [2022-04-27 14:48:53,438 INFO L272 TraceCheckUtils]: 251: Hoare triple {35640#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,438 INFO L290 TraceCheckUtils]: 252: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,438 INFO L290 TraceCheckUtils]: 253: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,438 INFO L290 TraceCheckUtils]: 254: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,439 INFO L284 TraceCheckUtils]: 255: Hoare quadruple {34854#true} {35640#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} #54#return; {35640#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} is VALID [2022-04-27 14:48:53,439 INFO L290 TraceCheckUtils]: 256: Hoare triple {35640#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35662#(and (<= main_~c~0 35) (= (+ (- 2) main_~y~0) 33) (< 34 main_~k~0))} is VALID [2022-04-27 14:48:53,439 INFO L290 TraceCheckUtils]: 257: Hoare triple {35662#(and (<= main_~c~0 35) (= (+ (- 2) main_~y~0) 33) (< 34 main_~k~0))} assume !false; {35662#(and (<= main_~c~0 35) (= (+ (- 2) main_~y~0) 33) (< 34 main_~k~0))} is VALID [2022-04-27 14:48:53,440 INFO L272 TraceCheckUtils]: 258: Hoare triple {35662#(and (<= main_~c~0 35) (= (+ (- 2) main_~y~0) 33) (< 34 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34854#true} is VALID [2022-04-27 14:48:53,440 INFO L290 TraceCheckUtils]: 259: Hoare triple {34854#true} ~cond := #in~cond; {34854#true} is VALID [2022-04-27 14:48:53,440 INFO L290 TraceCheckUtils]: 260: Hoare triple {34854#true} assume !(0 == ~cond); {34854#true} is VALID [2022-04-27 14:48:53,440 INFO L290 TraceCheckUtils]: 261: Hoare triple {34854#true} assume true; {34854#true} is VALID [2022-04-27 14:48:53,440 INFO L284 TraceCheckUtils]: 262: Hoare quadruple {34854#true} {35662#(and (<= main_~c~0 35) (= (+ (- 2) main_~y~0) 33) (< 34 main_~k~0))} #54#return; {35662#(and (<= main_~c~0 35) (= (+ (- 2) main_~y~0) 33) (< 34 main_~k~0))} is VALID [2022-04-27 14:48:53,441 INFO L290 TraceCheckUtils]: 263: Hoare triple {35662#(and (<= main_~c~0 35) (= (+ (- 2) main_~y~0) 33) (< 34 main_~k~0))} assume !(~c~0 < ~k~0); {35684#(and (= (+ (- 2) main_~y~0) 33) (<= main_~k~0 35) (< 34 main_~k~0))} is VALID [2022-04-27 14:48:53,441 INFO L272 TraceCheckUtils]: 264: Hoare triple {35684#(and (= (+ (- 2) main_~y~0) 33) (<= main_~k~0 35) (< 34 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35688#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:48:53,441 INFO L290 TraceCheckUtils]: 265: Hoare triple {35688#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35692#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:48:53,442 INFO L290 TraceCheckUtils]: 266: Hoare triple {35692#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {34855#false} is VALID [2022-04-27 14:48:53,442 INFO L290 TraceCheckUtils]: 267: Hoare triple {34855#false} assume !false; {34855#false} is VALID [2022-04-27 14:48:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4482 backedges. 72 proven. 1890 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2022-04-27 14:48:53,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:48:53,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:48:53,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008464440] [2022-04-27 14:48:53,872 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:48:53,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485719573] [2022-04-27 14:48:53,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485719573] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:48:53,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:48:53,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2022-04-27 14:48:53,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149325064] [2022-04-27 14:48:53,872 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:48:53,873 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) Word has length 268 [2022-04-27 14:48:53,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:48:53,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-04-27 14:48:54,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:48:54,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-27 14:48:54,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:48:54,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-27 14:48:54,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2022-04-27 14:48:54,705 INFO L87 Difference]: Start difference. First operand 133 states and 167 transitions. Second operand has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-04-27 14:49:35,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:35,568 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2022-04-27 14:49:35,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-27 14:49:35,569 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) Word has length 268 [2022-04-27 14:49:35,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:49:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-04-27 14:49:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 172 transitions. [2022-04-27 14:49:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-04-27 14:49:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 172 transitions. [2022-04-27 14:49:35,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 172 transitions. [2022-04-27 14:49:36,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:36,556 INFO L225 Difference]: With dead ends: 141 [2022-04-27 14:49:36,556 INFO L226 Difference]: Without dead ends: 136 [2022-04-27 14:49:36,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=1934, Unknown=0, NotChecked=0, Total=2070 [2022-04-27 14:49:36,557 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 2 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 4301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 4301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:49:36,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2189 Invalid, 4301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4301 Invalid, 0 Unknown, 0 Unchecked, 21.6s Time] [2022-04-27 14:49:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-27 14:49:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-04-27 14:49:36,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:49:36,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 41 states have call successors, (41), 6 states have call predecessors, (41), 4 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-27 14:49:36,657 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 41 states have call successors, (41), 6 states have call predecessors, (41), 4 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-27 14:49:36,657 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 41 states have call successors, (41), 6 states have call predecessors, (41), 4 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-27 14:49:36,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:36,660 INFO L93 Difference]: Finished difference Result 136 states and 171 transitions. [2022-04-27 14:49:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 171 transitions. [2022-04-27 14:49:36,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:36,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:36,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 41 states have call successors, (41), 6 states have call predecessors, (41), 4 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 136 states. [2022-04-27 14:49:36,660 INFO L87 Difference]: Start difference. First operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 41 states have call successors, (41), 6 states have call predecessors, (41), 4 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 136 states. [2022-04-27 14:49:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:36,662 INFO L93 Difference]: Finished difference Result 136 states and 171 transitions. [2022-04-27 14:49:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 171 transitions. [2022-04-27 14:49:36,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:36,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:36,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:49:36,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:49:36,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 41 states have call successors, (41), 6 states have call predecessors, (41), 4 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-27 14:49:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 171 transitions. [2022-04-27 14:49:36,665 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 171 transitions. Word has length 268 [2022-04-27 14:49:36,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:49:36,666 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 171 transitions. [2022-04-27 14:49:36,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-04-27 14:49:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 171 transitions. [2022-04-27 14:49:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-04-27 14:49:36,667 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:49:36,667 INFO L195 NwaCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:49:36,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-27 14:49:36,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-27 14:49:36,879 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:49:36,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:49:36,880 INFO L85 PathProgramCache]: Analyzing trace with hash 825903977, now seen corresponding path program 36 times [2022-04-27 14:49:36,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:49:36,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154002639] [2022-04-27 14:49:36,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:36,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:49:36,895 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:49:36,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974229513] [2022-04-27 14:49:36,895 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:49:36,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:49:36,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:49:36,896 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:49:36,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-27 14:49:55,648 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2022-04-27 14:49:55,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:49:55,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 153 conjunts are in the unsatisfiable core [2022-04-27 14:49:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:55,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:49:57,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {36463#true} call ULTIMATE.init(); {36463#true} is VALID [2022-04-27 14:49:57,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {36463#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(9, 2);call #Ultimate.allocInit(12, 3); {36463#true} is VALID [2022-04-27 14:49:57,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36463#true} {36463#true} #60#return; {36463#true} is VALID [2022-04-27 14:49:57,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {36463#true} call #t~ret5 := main(); {36463#true} is VALID [2022-04-27 14:49:57,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {36463#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {36463#true} is VALID [2022-04-27 14:49:57,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {36463#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,680 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36463#true} {36463#true} #52#return; {36463#true} is VALID [2022-04-27 14:49:57,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {36463#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {36501#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:57,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {36501#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {36501#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:57,680 INFO L272 TraceCheckUtils]: 13: Hoare triple {36501#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,691 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {36463#true} {36501#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {36501#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:49:57,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {36501#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36523#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:49:57,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {36523#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {36523#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:49:57,692 INFO L272 TraceCheckUtils]: 20: Hoare triple {36523#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,693 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {36463#true} {36523#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {36523#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 14:49:57,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {36523#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36545#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {36545#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !false; {36545#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,694 INFO L272 TraceCheckUtils]: 27: Hoare triple {36545#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,694 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {36463#true} {36545#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} #54#return; {36545#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {36545#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36567#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {36567#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !false; {36567#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,695 INFO L272 TraceCheckUtils]: 34: Hoare triple {36567#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,696 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {36463#true} {36567#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #54#return; {36567#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {36567#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36589#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {36589#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4) (< 0 main_~k~0))} assume !false; {36589#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,697 INFO L272 TraceCheckUtils]: 41: Hoare triple {36589#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,697 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {36463#true} {36589#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4) (< 0 main_~k~0))} #54#return; {36589#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {36589#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36611#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,698 INFO L290 TraceCheckUtils]: 47: Hoare triple {36611#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {36611#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,698 INFO L272 TraceCheckUtils]: 48: Hoare triple {36611#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,698 INFO L290 TraceCheckUtils]: 49: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,698 INFO L290 TraceCheckUtils]: 50: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,699 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {36463#true} {36611#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} #54#return; {36611#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,699 INFO L290 TraceCheckUtils]: 53: Hoare triple {36611#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36633#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {36633#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !false; {36633#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,700 INFO L272 TraceCheckUtils]: 55: Hoare triple {36633#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,700 INFO L290 TraceCheckUtils]: 56: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,700 INFO L290 TraceCheckUtils]: 57: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,700 INFO L290 TraceCheckUtils]: 58: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,700 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {36463#true} {36633#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} #54#return; {36633#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {36633#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36655#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,701 INFO L290 TraceCheckUtils]: 61: Hoare triple {36655#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {36655#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,701 INFO L272 TraceCheckUtils]: 62: Hoare triple {36655#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,701 INFO L290 TraceCheckUtils]: 63: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,701 INFO L290 TraceCheckUtils]: 64: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,701 INFO L290 TraceCheckUtils]: 65: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,701 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {36463#true} {36655#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {36655#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,702 INFO L290 TraceCheckUtils]: 67: Hoare triple {36655#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36677#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,702 INFO L290 TraceCheckUtils]: 68: Hoare triple {36677#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} assume !false; {36677#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,702 INFO L272 TraceCheckUtils]: 69: Hoare triple {36677#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,702 INFO L290 TraceCheckUtils]: 70: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,702 INFO L290 TraceCheckUtils]: 71: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,702 INFO L290 TraceCheckUtils]: 72: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,703 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {36463#true} {36677#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} #54#return; {36677#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,703 INFO L290 TraceCheckUtils]: 74: Hoare triple {36677#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36699#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,704 INFO L290 TraceCheckUtils]: 75: Hoare triple {36699#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {36699#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,704 INFO L272 TraceCheckUtils]: 76: Hoare triple {36699#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,704 INFO L290 TraceCheckUtils]: 77: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,704 INFO L290 TraceCheckUtils]: 78: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,704 INFO L290 TraceCheckUtils]: 79: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,704 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {36463#true} {36699#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} #54#return; {36699#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,705 INFO L290 TraceCheckUtils]: 81: Hoare triple {36699#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36721#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,705 INFO L290 TraceCheckUtils]: 82: Hoare triple {36721#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} assume !false; {36721#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,705 INFO L272 TraceCheckUtils]: 83: Hoare triple {36721#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,705 INFO L290 TraceCheckUtils]: 84: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,705 INFO L290 TraceCheckUtils]: 85: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,705 INFO L290 TraceCheckUtils]: 86: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,706 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {36463#true} {36721#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} #54#return; {36721#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,706 INFO L290 TraceCheckUtils]: 88: Hoare triple {36721#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36743#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,706 INFO L290 TraceCheckUtils]: 89: Hoare triple {36743#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8) (< 0 main_~k~0))} assume !false; {36743#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,706 INFO L272 TraceCheckUtils]: 90: Hoare triple {36743#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,707 INFO L290 TraceCheckUtils]: 91: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,707 INFO L290 TraceCheckUtils]: 92: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,707 INFO L290 TraceCheckUtils]: 93: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,707 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {36463#true} {36743#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8) (< 0 main_~k~0))} #54#return; {36743#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,707 INFO L290 TraceCheckUtils]: 95: Hoare triple {36743#(and (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36765#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,708 INFO L290 TraceCheckUtils]: 96: Hoare triple {36765#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8) (< 0 main_~k~0))} assume !false; {36765#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,708 INFO L272 TraceCheckUtils]: 97: Hoare triple {36765#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,708 INFO L290 TraceCheckUtils]: 98: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,708 INFO L290 TraceCheckUtils]: 99: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,708 INFO L290 TraceCheckUtils]: 100: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,708 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {36463#true} {36765#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8) (< 0 main_~k~0))} #54#return; {36765#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,709 INFO L290 TraceCheckUtils]: 102: Hoare triple {36765#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36787#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:49:57,709 INFO L290 TraceCheckUtils]: 103: Hoare triple {36787#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {36787#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:49:57,709 INFO L272 TraceCheckUtils]: 104: Hoare triple {36787#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,709 INFO L290 TraceCheckUtils]: 105: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,709 INFO L290 TraceCheckUtils]: 106: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,709 INFO L290 TraceCheckUtils]: 107: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,710 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {36463#true} {36787#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} #54#return; {36787#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 14:49:57,710 INFO L290 TraceCheckUtils]: 109: Hoare triple {36787#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36809#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:49:57,710 INFO L290 TraceCheckUtils]: 110: Hoare triple {36809#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !false; {36809#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:49:57,711 INFO L272 TraceCheckUtils]: 111: Hoare triple {36809#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,711 INFO L290 TraceCheckUtils]: 112: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,711 INFO L290 TraceCheckUtils]: 113: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,711 INFO L290 TraceCheckUtils]: 114: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,711 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {36463#true} {36809#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} #54#return; {36809#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 14:49:57,711 INFO L290 TraceCheckUtils]: 116: Hoare triple {36809#(and (= main_~c~0 14) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36831#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,712 INFO L290 TraceCheckUtils]: 117: Hoare triple {36831#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} assume !false; {36831#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,712 INFO L272 TraceCheckUtils]: 118: Hoare triple {36831#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,712 INFO L290 TraceCheckUtils]: 119: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,712 INFO L290 TraceCheckUtils]: 120: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,712 INFO L290 TraceCheckUtils]: 121: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,712 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {36463#true} {36831#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} #54#return; {36831#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,713 INFO L290 TraceCheckUtils]: 123: Hoare triple {36831#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36853#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,713 INFO L290 TraceCheckUtils]: 124: Hoare triple {36853#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} assume !false; {36853#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,713 INFO L272 TraceCheckUtils]: 125: Hoare triple {36853#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,713 INFO L290 TraceCheckUtils]: 126: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,713 INFO L290 TraceCheckUtils]: 127: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,713 INFO L290 TraceCheckUtils]: 128: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,714 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {36463#true} {36853#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} #54#return; {36853#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,714 INFO L290 TraceCheckUtils]: 130: Hoare triple {36853#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36875#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,714 INFO L290 TraceCheckUtils]: 131: Hoare triple {36875#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13) (< 0 main_~k~0))} assume !false; {36875#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,714 INFO L272 TraceCheckUtils]: 132: Hoare triple {36875#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,714 INFO L290 TraceCheckUtils]: 133: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,714 INFO L290 TraceCheckUtils]: 134: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,715 INFO L290 TraceCheckUtils]: 135: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,715 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {36463#true} {36875#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13) (< 0 main_~k~0))} #54#return; {36875#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,715 INFO L290 TraceCheckUtils]: 137: Hoare triple {36875#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36897#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ main_~y~0 (- 5)) 13))} is VALID [2022-04-27 14:49:57,716 INFO L290 TraceCheckUtils]: 138: Hoare triple {36897#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ main_~y~0 (- 5)) 13))} assume !false; {36897#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ main_~y~0 (- 5)) 13))} is VALID [2022-04-27 14:49:57,716 INFO L272 TraceCheckUtils]: 139: Hoare triple {36897#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ main_~y~0 (- 5)) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,716 INFO L290 TraceCheckUtils]: 140: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,716 INFO L290 TraceCheckUtils]: 141: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,716 INFO L290 TraceCheckUtils]: 142: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,716 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {36463#true} {36897#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ main_~y~0 (- 5)) 13))} #54#return; {36897#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ main_~y~0 (- 5)) 13))} is VALID [2022-04-27 14:49:57,717 INFO L290 TraceCheckUtils]: 144: Hoare triple {36897#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 17) (= (+ main_~y~0 (- 5)) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36919#(and (= 17 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 13))} is VALID [2022-04-27 14:49:57,717 INFO L290 TraceCheckUtils]: 145: Hoare triple {36919#(and (= 17 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 13))} assume !false; {36919#(and (= 17 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 13))} is VALID [2022-04-27 14:49:57,717 INFO L272 TraceCheckUtils]: 146: Hoare triple {36919#(and (= 17 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,717 INFO L290 TraceCheckUtils]: 147: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,717 INFO L290 TraceCheckUtils]: 148: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,717 INFO L290 TraceCheckUtils]: 149: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,717 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {36463#true} {36919#(and (= 17 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 13))} #54#return; {36919#(and (= 17 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 13))} is VALID [2022-04-27 14:49:57,718 INFO L290 TraceCheckUtils]: 151: Hoare triple {36919#(and (= 17 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36941#(and (= (+ main_~y~0 (- 7)) 13) (= main_~c~0 20) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,718 INFO L290 TraceCheckUtils]: 152: Hoare triple {36941#(and (= (+ main_~y~0 (- 7)) 13) (= main_~c~0 20) (< 0 main_~k~0))} assume !false; {36941#(and (= (+ main_~y~0 (- 7)) 13) (= main_~c~0 20) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,718 INFO L272 TraceCheckUtils]: 153: Hoare triple {36941#(and (= (+ main_~y~0 (- 7)) 13) (= main_~c~0 20) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,718 INFO L290 TraceCheckUtils]: 154: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,718 INFO L290 TraceCheckUtils]: 155: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,718 INFO L290 TraceCheckUtils]: 156: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,719 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {36463#true} {36941#(and (= (+ main_~y~0 (- 7)) 13) (= main_~c~0 20) (< 0 main_~k~0))} #54#return; {36941#(and (= (+ main_~y~0 (- 7)) 13) (= main_~c~0 20) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,719 INFO L290 TraceCheckUtils]: 158: Hoare triple {36941#(and (= (+ main_~y~0 (- 7)) 13) (= main_~c~0 20) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36963#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,719 INFO L290 TraceCheckUtils]: 159: Hoare triple {36963#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} assume !false; {36963#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,719 INFO L272 TraceCheckUtils]: 160: Hoare triple {36963#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,719 INFO L290 TraceCheckUtils]: 161: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,720 INFO L290 TraceCheckUtils]: 162: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,720 INFO L290 TraceCheckUtils]: 163: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,720 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {36463#true} {36963#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} #54#return; {36963#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,720 INFO L290 TraceCheckUtils]: 165: Hoare triple {36963#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36985#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,721 INFO L290 TraceCheckUtils]: 166: Hoare triple {36985#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !false; {36985#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,721 INFO L272 TraceCheckUtils]: 167: Hoare triple {36985#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,721 INFO L290 TraceCheckUtils]: 168: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,721 INFO L290 TraceCheckUtils]: 169: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,721 INFO L290 TraceCheckUtils]: 170: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,721 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {36463#true} {36985#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} #54#return; {36985#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,722 INFO L290 TraceCheckUtils]: 172: Hoare triple {36985#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37007#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:49:57,722 INFO L290 TraceCheckUtils]: 173: Hoare triple {37007#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {37007#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:49:57,722 INFO L272 TraceCheckUtils]: 174: Hoare triple {37007#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,722 INFO L290 TraceCheckUtils]: 175: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,722 INFO L290 TraceCheckUtils]: 176: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,722 INFO L290 TraceCheckUtils]: 177: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,722 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {36463#true} {37007#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} #54#return; {37007#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:49:57,723 INFO L290 TraceCheckUtils]: 179: Hoare triple {37007#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37029#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,723 INFO L290 TraceCheckUtils]: 180: Hoare triple {37029#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} assume !false; {37029#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,723 INFO L272 TraceCheckUtils]: 181: Hoare triple {37029#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,723 INFO L290 TraceCheckUtils]: 182: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,723 INFO L290 TraceCheckUtils]: 183: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,723 INFO L290 TraceCheckUtils]: 184: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,724 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {36463#true} {37029#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} #54#return; {37029#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,724 INFO L290 TraceCheckUtils]: 186: Hoare triple {37029#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37051#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 14:49:57,724 INFO L290 TraceCheckUtils]: 187: Hoare triple {37051#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} assume !false; {37051#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 14:49:57,725 INFO L272 TraceCheckUtils]: 188: Hoare triple {37051#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,725 INFO L290 TraceCheckUtils]: 189: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,725 INFO L290 TraceCheckUtils]: 190: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,725 INFO L290 TraceCheckUtils]: 191: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,725 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {36463#true} {37051#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} #54#return; {37051#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 14:49:57,725 INFO L290 TraceCheckUtils]: 193: Hoare triple {37051#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37073#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,726 INFO L290 TraceCheckUtils]: 194: Hoare triple {37073#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24) (< 0 main_~k~0))} assume !false; {37073#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,726 INFO L272 TraceCheckUtils]: 195: Hoare triple {37073#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,726 INFO L290 TraceCheckUtils]: 196: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,726 INFO L290 TraceCheckUtils]: 197: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,726 INFO L290 TraceCheckUtils]: 198: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,726 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {36463#true} {37073#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24) (< 0 main_~k~0))} #54#return; {37073#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,727 INFO L290 TraceCheckUtils]: 200: Hoare triple {37073#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37095#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,727 INFO L290 TraceCheckUtils]: 201: Hoare triple {37095#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27) (< 0 main_~k~0))} assume !false; {37095#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,727 INFO L272 TraceCheckUtils]: 202: Hoare triple {37095#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,727 INFO L290 TraceCheckUtils]: 203: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,727 INFO L290 TraceCheckUtils]: 204: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,727 INFO L290 TraceCheckUtils]: 205: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,728 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {36463#true} {37095#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27) (< 0 main_~k~0))} #54#return; {37095#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,728 INFO L290 TraceCheckUtils]: 207: Hoare triple {37095#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37117#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,728 INFO L290 TraceCheckUtils]: 208: Hoare triple {37117#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} assume !false; {37117#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,728 INFO L272 TraceCheckUtils]: 209: Hoare triple {37117#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,728 INFO L290 TraceCheckUtils]: 210: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,728 INFO L290 TraceCheckUtils]: 211: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,728 INFO L290 TraceCheckUtils]: 212: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,729 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {36463#true} {37117#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} #54#return; {37117#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,729 INFO L290 TraceCheckUtils]: 214: Hoare triple {37117#(and (= main_~c~0 28) (= main_~y~0 28) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37139#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,729 INFO L290 TraceCheckUtils]: 215: Hoare triple {37139#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} assume !false; {37139#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,729 INFO L272 TraceCheckUtils]: 216: Hoare triple {37139#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,729 INFO L290 TraceCheckUtils]: 217: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,730 INFO L290 TraceCheckUtils]: 218: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,730 INFO L290 TraceCheckUtils]: 219: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,730 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {36463#true} {37139#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} #54#return; {37139#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,730 INFO L290 TraceCheckUtils]: 221: Hoare triple {37139#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37161#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,731 INFO L290 TraceCheckUtils]: 222: Hoare triple {37161#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {37161#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,731 INFO L272 TraceCheckUtils]: 223: Hoare triple {37161#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,731 INFO L290 TraceCheckUtils]: 224: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,731 INFO L290 TraceCheckUtils]: 225: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,731 INFO L290 TraceCheckUtils]: 226: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,731 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {36463#true} {37161#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {37161#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,732 INFO L290 TraceCheckUtils]: 228: Hoare triple {37161#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37183#(and (= main_~c~0 31) (= (+ (- 2) main_~y~0) 29) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,732 INFO L290 TraceCheckUtils]: 229: Hoare triple {37183#(and (= main_~c~0 31) (= (+ (- 2) main_~y~0) 29) (< 0 main_~k~0))} assume !false; {37183#(and (= main_~c~0 31) (= (+ (- 2) main_~y~0) 29) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,732 INFO L272 TraceCheckUtils]: 230: Hoare triple {37183#(and (= main_~c~0 31) (= (+ (- 2) main_~y~0) 29) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,732 INFO L290 TraceCheckUtils]: 231: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,732 INFO L290 TraceCheckUtils]: 232: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,732 INFO L290 TraceCheckUtils]: 233: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,732 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {36463#true} {37183#(and (= main_~c~0 31) (= (+ (- 2) main_~y~0) 29) (< 0 main_~k~0))} #54#return; {37183#(and (= main_~c~0 31) (= (+ (- 2) main_~y~0) 29) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,733 INFO L290 TraceCheckUtils]: 235: Hoare triple {37183#(and (= main_~c~0 31) (= (+ (- 2) main_~y~0) 29) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37205#(and (= 32 main_~y~0) (= 32 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,733 INFO L290 TraceCheckUtils]: 236: Hoare triple {37205#(and (= 32 main_~y~0) (= 32 main_~c~0) (< 0 main_~k~0))} assume !false; {37205#(and (= 32 main_~y~0) (= 32 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,733 INFO L272 TraceCheckUtils]: 237: Hoare triple {37205#(and (= 32 main_~y~0) (= 32 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,733 INFO L290 TraceCheckUtils]: 238: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,733 INFO L290 TraceCheckUtils]: 239: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,733 INFO L290 TraceCheckUtils]: 240: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,734 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {36463#true} {37205#(and (= 32 main_~y~0) (= 32 main_~c~0) (< 0 main_~k~0))} #54#return; {37205#(and (= 32 main_~y~0) (= 32 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,734 INFO L290 TraceCheckUtils]: 242: Hoare triple {37205#(and (= 32 main_~y~0) (= 32 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37227#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,734 INFO L290 TraceCheckUtils]: 243: Hoare triple {37227#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32) (< 0 main_~k~0))} assume !false; {37227#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,734 INFO L272 TraceCheckUtils]: 244: Hoare triple {37227#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,734 INFO L290 TraceCheckUtils]: 245: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,734 INFO L290 TraceCheckUtils]: 246: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,734 INFO L290 TraceCheckUtils]: 247: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,735 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {36463#true} {37227#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32) (< 0 main_~k~0))} #54#return; {37227#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,735 INFO L290 TraceCheckUtils]: 249: Hoare triple {37227#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37249#(and (= main_~c~0 34) (= main_~y~0 34) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,735 INFO L290 TraceCheckUtils]: 250: Hoare triple {37249#(and (= main_~c~0 34) (= main_~y~0 34) (< 0 main_~k~0))} assume !false; {37249#(and (= main_~c~0 34) (= main_~y~0 34) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,735 INFO L272 TraceCheckUtils]: 251: Hoare triple {37249#(and (= main_~c~0 34) (= main_~y~0 34) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,736 INFO L290 TraceCheckUtils]: 252: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,736 INFO L290 TraceCheckUtils]: 253: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,736 INFO L290 TraceCheckUtils]: 254: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,736 INFO L284 TraceCheckUtils]: 255: Hoare quadruple {36463#true} {37249#(and (= main_~c~0 34) (= main_~y~0 34) (< 0 main_~k~0))} #54#return; {37249#(and (= main_~c~0 34) (= main_~y~0 34) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,736 INFO L290 TraceCheckUtils]: 256: Hoare triple {37249#(and (= main_~c~0 34) (= main_~y~0 34) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37271#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,737 INFO L290 TraceCheckUtils]: 257: Hoare triple {37271#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0) (< 0 main_~k~0))} assume !false; {37271#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,737 INFO L272 TraceCheckUtils]: 258: Hoare triple {37271#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,737 INFO L290 TraceCheckUtils]: 259: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,737 INFO L290 TraceCheckUtils]: 260: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,737 INFO L290 TraceCheckUtils]: 261: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,737 INFO L284 TraceCheckUtils]: 262: Hoare quadruple {36463#true} {37271#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0) (< 0 main_~k~0))} #54#return; {37271#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 14:49:57,738 INFO L290 TraceCheckUtils]: 263: Hoare triple {37271#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37293#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-27 14:49:57,738 INFO L290 TraceCheckUtils]: 264: Hoare triple {37293#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} assume !false; {37293#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-27 14:49:57,738 INFO L272 TraceCheckUtils]: 265: Hoare triple {37293#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36463#true} is VALID [2022-04-27 14:49:57,738 INFO L290 TraceCheckUtils]: 266: Hoare triple {36463#true} ~cond := #in~cond; {36463#true} is VALID [2022-04-27 14:49:57,738 INFO L290 TraceCheckUtils]: 267: Hoare triple {36463#true} assume !(0 == ~cond); {36463#true} is VALID [2022-04-27 14:49:57,738 INFO L290 TraceCheckUtils]: 268: Hoare triple {36463#true} assume true; {36463#true} is VALID [2022-04-27 14:49:57,738 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {36463#true} {37293#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} #54#return; {37293#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-27 14:49:57,739 INFO L290 TraceCheckUtils]: 270: Hoare triple {37293#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} assume !(~c~0 < ~k~0); {37315#(and (<= main_~k~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-27 14:49:57,739 INFO L272 TraceCheckUtils]: 271: Hoare triple {37315#(and (<= main_~k~0 36) (= main_~y~0 36) (< 35 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37319#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:49:57,740 INFO L290 TraceCheckUtils]: 272: Hoare triple {37319#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37323#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:49:57,740 INFO L290 TraceCheckUtils]: 273: Hoare triple {37323#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36464#false} is VALID [2022-04-27 14:49:57,740 INFO L290 TraceCheckUtils]: 274: Hoare triple {36464#false} assume !false; {36464#false} is VALID [2022-04-27 14:49:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4736 backedges. 74 proven. 1998 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2022-04-27 14:49:57,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:50:05,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:50:05,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154002639] [2022-04-27 14:50:05,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:50:05,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974229513] [2022-04-27 14:50:05,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974229513] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:50:05,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:50:05,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2022-04-27 14:50:05,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606853317] [2022-04-27 14:50:05,486 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:50:05,486 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 39 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) Word has length 275 [2022-04-27 14:50:05,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:50:05,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 39 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2022-04-27 14:50:06,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:50:06,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-27 14:50:06,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:50:06,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-27 14:50:06,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1460, Invalid=4860, Unknown=0, NotChecked=0, Total=6320 [2022-04-27 14:50:06,519 INFO L87 Difference]: Start difference. First operand 136 states and 171 transitions. Second operand has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 39 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2022-04-27 14:50:54,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:50:54,784 INFO L93 Difference]: Finished difference Result 144 states and 180 transitions. [2022-04-27 14:50:54,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-27 14:50:54,784 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 39 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) Word has length 275 [2022-04-27 14:50:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:50:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 39 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2022-04-27 14:50:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 176 transitions. [2022-04-27 14:50:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 39 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2022-04-27 14:50:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 176 transitions. [2022-04-27 14:50:54,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 176 transitions. [2022-04-27 14:50:55,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:50:55,928 INFO L225 Difference]: With dead ends: 144 [2022-04-27 14:50:55,928 INFO L226 Difference]: Without dead ends: 139 [2022-04-27 14:50:55,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 453 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1470, Invalid=5172, Unknown=0, NotChecked=0, Total=6642 [2022-04-27 14:50:55,929 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 2 mSDsluCounter, 2120 mSDsCounter, 0 mSdLazyCounter, 4566 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 4566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:50:55,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2250 Invalid, 4566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4566 Invalid, 0 Unknown, 0 Unchecked, 25.4s Time] [2022-04-27 14:50:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-27 14:50:56,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-04-27 14:50:56,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:50:56,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 42 states have call successors, (42), 6 states have call predecessors, (42), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 14:50:56,027 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 42 states have call successors, (42), 6 states have call predecessors, (42), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 14:50:56,027 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 42 states have call successors, (42), 6 states have call predecessors, (42), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 14:50:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:50:56,030 INFO L93 Difference]: Finished difference Result 139 states and 175 transitions. [2022-04-27 14:50:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 175 transitions. [2022-04-27 14:50:56,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:50:56,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:50:56,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 42 states have call successors, (42), 6 states have call predecessors, (42), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 139 states. [2022-04-27 14:50:56,031 INFO L87 Difference]: Start difference. First operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 42 states have call successors, (42), 6 states have call predecessors, (42), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 139 states. [2022-04-27 14:50:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:50:56,033 INFO L93 Difference]: Finished difference Result 139 states and 175 transitions. [2022-04-27 14:50:56,033 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 175 transitions. [2022-04-27 14:50:56,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:50:56,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:50:56,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:50:56,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:50:56,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 42 states have call successors, (42), 6 states have call predecessors, (42), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 14:50:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 175 transitions. [2022-04-27 14:50:56,036 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 175 transitions. Word has length 275 [2022-04-27 14:50:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:50:56,036 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 175 transitions. [2022-04-27 14:50:56,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 39 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2022-04-27 14:50:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 175 transitions. [2022-04-27 14:50:56,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-04-27 14:50:56,037 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:50:56,037 INFO L195 NwaCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:50:56,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-27 14:50:56,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-27 14:50:56,238 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:50:56,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:50:56,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1261596040, now seen corresponding path program 37 times [2022-04-27 14:50:56,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:50:56,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608196604] [2022-04-27 14:50:56,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:50:56,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:50:56,254 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:50:56,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1239934393] [2022-04-27 14:50:56,254 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:50:56,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:50:56,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:50:56,255 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:50:56,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-27 14:50:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:50:57,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 156 conjunts are in the unsatisfiable core [2022-04-27 14:50:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:50:57,484 INFO L286 TraceCheckSpWp]: Computing forward predicates...