/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/ps4-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:56:09,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:56:09,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:56:09,316 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:56:09,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:56:09,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:56:09,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:56:09,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:56:09,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:56:09,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:56:09,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:56:09,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:56:09,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:56:09,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:56:09,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:56:09,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:56:09,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:56:09,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:56:09,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:56:09,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:56:09,338 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:56:09,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:56:09,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:56:09,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:56:09,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:56:09,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:56:09,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:56:09,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:56:09,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:56:09,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:56:09,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:56:09,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:56:09,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:56:09,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:56:09,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:56:09,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:56:09,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:56:09,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:56:09,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:56:09,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:56:09,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:56:09,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:56:09,354 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 11:56:09,377 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:56:09,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:56:09,378 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:56:09,378 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:56:09,378 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:56:09,379 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:56:09,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:56:09,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:56:09,379 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:56:09,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:56:09,380 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:56:09,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:56:09,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:56:09,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:56:09,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:56:09,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:56:09,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:56:09,381 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:56:09,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:56:09,381 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:56:09,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:56:09,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:56:09,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:56:09,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:56:09,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:56:09,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:56:09,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:56:09,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:56:09,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:56:09,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:56:09,382 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:56:09,382 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:56:09,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:56:09,382 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 11:56:09,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:56:09,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:56:09,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:56:09,580 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:56:09,580 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:56:09,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps4-ll.c [2022-04-27 11:56:09,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aecf42f8/cd9c718e2117432a89fc306c08ec1a6f/FLAG6d88d4308 [2022-04-27 11:56:09,974 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:56:09,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps4-ll.c [2022-04-27 11:56:09,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aecf42f8/cd9c718e2117432a89fc306c08ec1a6f/FLAG6d88d4308 [2022-04-27 11:56:10,418 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aecf42f8/cd9c718e2117432a89fc306c08ec1a6f [2022-04-27 11:56:10,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:56:10,424 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:56:10,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:56:10,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:56:10,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:56:10,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:56:10" (1/1) ... [2022-04-27 11:56:10,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@656b27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:10, skipping insertion in model container [2022-04-27 11:56:10,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:56:10" (1/1) ... [2022-04-27 11:56:10,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:56:10,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:56:10,609 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/ps4-ll.c[458,471] [2022-04-27 11:56:10,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:56:10,649 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:56:10,658 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/ps4-ll.c[458,471] [2022-04-27 11:56:10,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:56:10,674 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:56:10,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:10 WrapperNode [2022-04-27 11:56:10,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:56:10,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:56:10,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:56:10,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:56:10,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:10" (1/1) ... [2022-04-27 11:56:10,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:10" (1/1) ... [2022-04-27 11:56:10,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:10" (1/1) ... [2022-04-27 11:56:10,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:10" (1/1) ... [2022-04-27 11:56:10,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:10" (1/1) ... [2022-04-27 11:56:10,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:10" (1/1) ... [2022-04-27 11:56:10,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:10" (1/1) ... [2022-04-27 11:56:10,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:56:10,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:56:10,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:56:10,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:56:10,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:10" (1/1) ... [2022-04-27 11:56:10,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:56:10,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:10,781 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 11:56:10,808 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 11:56:10,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:56:10,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:56:10,846 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:56:10,847 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:56:10,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:56:10,849 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:56:10,849 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:56:10,849 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:56:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:56:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:56:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 11:56:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:56:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:56:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:56:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:56:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:56:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:56:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:56:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:56:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:56:10,905 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:56:10,907 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:56:11,035 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:56:11,041 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:56:11,041 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:56:11,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:56:11 BoogieIcfgContainer [2022-04-27 11:56:11,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:56:11,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:56:11,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:56:11,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:56:11,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:56:10" (1/3) ... [2022-04-27 11:56:11,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39efcc08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:56:11, skipping insertion in model container [2022-04-27 11:56:11,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:10" (2/3) ... [2022-04-27 11:56:11,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39efcc08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:56:11, skipping insertion in model container [2022-04-27 11:56:11,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:56:11" (3/3) ... [2022-04-27 11:56:11,063 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll.c [2022-04-27 11:56:11,075 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:56:11,075 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:56:11,112 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:56:11,117 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@44ae7cd5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ce9403c [2022-04-27 11:56:11,118 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:56:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:56:11,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:56:11,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:11,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:11,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:11,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:11,146 INFO L85 PathProgramCache]: Analyzing trace with hash -973133132, now seen corresponding path program 1 times [2022-04-27 11:56:11,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:11,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862944195] [2022-04-27 11:56:11,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:11,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:11,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:56:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:11,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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); {25#true} is VALID [2022-04-27 11:56:11,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 11:56:11,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-27 11:56:11,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:56:11,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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); {25#true} is VALID [2022-04-27 11:56:11,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 11:56:11,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-27 11:56:11,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-27 11:56:11,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {25#true} is VALID [2022-04-27 11:56:11,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume false; {26#false} is VALID [2022-04-27 11:56:11,328 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-27 11:56:11,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-27 11:56:11,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-27 11:56:11,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-27 11:56:11,329 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 11:56:11,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:11,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862944195] [2022-04-27 11:56:11,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862944195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:56:11,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:56:11,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:56:11,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761330269] [2022-04-27 11:56:11,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:56:11,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:56:11,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:11,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:56:11,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:11,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:56:11,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:11,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:56:11,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:56:11,391 INFO L87 Difference]: Start difference. First operand has 22 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:56:11,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:11,511 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-04-27 11:56:11,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:56:11,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:56:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:56:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-27 11:56:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:56:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-27 11:56:11,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-04-27 11:56:11,591 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 11:56:11,598 INFO L225 Difference]: With dead ends: 38 [2022-04-27 11:56:11,598 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 11:56:11,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 11:56:11,604 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:11,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:56:11,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 11:56:11,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 11:56:11,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:11,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:56:11,630 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:56:11,630 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:56:11,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:11,634 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 11:56:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:56:11,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:11,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:11,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 17 states. [2022-04-27 11:56:11,635 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 17 states. [2022-04-27 11:56:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:11,637 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 11:56:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:56:11,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:11,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:11,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:11,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:56:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 11:56:11,640 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-27 11:56:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:11,641 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 11:56:11,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:56:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:56:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:56:11,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:11,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:11,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:56:11,650 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:11,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:11,651 INFO L85 PathProgramCache]: Analyzing trace with hash -971345672, now seen corresponding path program 1 times [2022-04-27 11:56:11,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:11,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570964831] [2022-04-27 11:56:11,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:11,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:11,674 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:11,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [359592294] [2022-04-27 11:56:11,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:11,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:11,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:11,676 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 11:56:11,677 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 11:56:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:11,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:56:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:11,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:11,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {145#true} call ULTIMATE.init(); {145#true} is VALID [2022-04-27 11:56:11,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#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); {145#true} is VALID [2022-04-27 11:56:11,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {145#true} assume true; {145#true} is VALID [2022-04-27 11:56:11,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145#true} {145#true} #56#return; {145#true} is VALID [2022-04-27 11:56:11,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {145#true} call #t~ret5 := main(); {145#true} is VALID [2022-04-27 11:56:11,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {145#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {165#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:11,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {165#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {165#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:11,849 INFO L272 TraceCheckUtils]: 7: Hoare triple {165#(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)); {172#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:11,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {172#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {176#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:11,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {176#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {146#false} is VALID [2022-04-27 11:56:11,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#false} assume !false; {146#false} is VALID [2022-04-27 11:56:11,851 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 11:56:11,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:56:11,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:11,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570964831] [2022-04-27 11:56:11,852 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:11,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359592294] [2022-04-27 11:56:11,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359592294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:56:11,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:56:11,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:56:11,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109298159] [2022-04-27 11:56:11,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:56:11,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:56:11,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:11,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:56:11,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:11,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:56:11,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:11,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:56:11,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:56:11,870 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:56:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:12,021 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 11:56:12,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:56:12,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:56:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:12,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:56:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 11:56:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:56:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 11:56:12,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 11:56:12,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:12,056 INFO L225 Difference]: With dead ends: 28 [2022-04-27 11:56:12,056 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 11:56:12,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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 11:56:12,057 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:12,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 54 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:56:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 11:56:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 11:56:12,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:12,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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 11:56:12,062 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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 11:56:12,062 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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 11:56:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:12,063 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 11:56:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 11:56:12,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:12,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:12,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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 24 states. [2022-04-27 11:56:12,064 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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 24 states. [2022-04-27 11:56:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:12,065 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 11:56:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 11:56:12,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:12,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:12,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:12,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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 11:56:12,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-27 11:56:12,067 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 11 [2022-04-27 11:56:12,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:12,068 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-27 11:56:12,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:56:12,068 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 11:56:12,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 11:56:12,068 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:12,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:12,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 11:56:12,284 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 11:56:12,285 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:12,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:12,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1679137237, now seen corresponding path program 1 times [2022-04-27 11:56:12,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:12,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375441606] [2022-04-27 11:56:12,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:12,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:12,299 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:12,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1408434909] [2022-04-27 11:56:12,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:12,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:12,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:12,304 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 11:56:12,318 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 11:56:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:12,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:56:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:12,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:12,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {310#true} call ULTIMATE.init(); {310#true} is VALID [2022-04-27 11:56:12,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#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); {310#true} is VALID [2022-04-27 11:56:12,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-27 11:56:12,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {310#true} {310#true} #56#return; {310#true} is VALID [2022-04-27 11:56:12,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {310#true} call #t~ret5 := main(); {310#true} is VALID [2022-04-27 11:56:12,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {310#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {330#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:12,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {330#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {330#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:12,570 INFO L272 TraceCheckUtils]: 7: Hoare triple {330#(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)); {310#true} is VALID [2022-04-27 11:56:12,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#true} ~cond := #in~cond; {310#true} is VALID [2022-04-27 11:56:12,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {310#true} assume !(0 == ~cond); {310#true} is VALID [2022-04-27 11:56:12,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-27 11:56:12,574 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {310#true} {330#(and (= main_~x~0 0) (= main_~y~0 0))} #50#return; {330#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:12,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {330#(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; {352#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 11:56:12,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {352#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {352#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 11:56:12,576 INFO L272 TraceCheckUtils]: 14: Hoare triple {352#(and (= main_~y~0 1) (= (* 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)); {359#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:12,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {359#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {363#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:12,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {363#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {311#false} is VALID [2022-04-27 11:56:12,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {311#false} assume !false; {311#false} is VALID [2022-04-27 11:56:12,577 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 11:56:12,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:56:12,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {311#false} assume !false; {311#false} is VALID [2022-04-27 11:56:12,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {363#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {311#false} is VALID [2022-04-27 11:56:12,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {359#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {363#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:12,833 INFO L272 TraceCheckUtils]: 14: Hoare triple {379#(= (+ (* 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)); {359#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:12,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#(= (+ (* 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; {379#(= (+ (* 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 11:56:12,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {379#(= (+ (* 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; {379#(= (+ (* 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 11:56:12,842 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {310#true} {379#(= (+ (* 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))} #50#return; {379#(= (+ (* 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 11:56:12,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-27 11:56:12,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {310#true} assume !(0 == ~cond); {310#true} is VALID [2022-04-27 11:56:12,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#true} ~cond := #in~cond; {310#true} is VALID [2022-04-27 11:56:12,843 INFO L272 TraceCheckUtils]: 7: Hoare triple {379#(= (+ (* 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)); {310#true} is VALID [2022-04-27 11:56:12,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {379#(= (+ (* 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; {379#(= (+ (* 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 11:56:12,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {310#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {379#(= (+ (* 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 11:56:12,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {310#true} call #t~ret5 := main(); {310#true} is VALID [2022-04-27 11:56:12,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {310#true} {310#true} #56#return; {310#true} is VALID [2022-04-27 11:56:12,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-27 11:56:12,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#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); {310#true} is VALID [2022-04-27 11:56:12,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {310#true} call ULTIMATE.init(); {310#true} is VALID [2022-04-27 11:56:12,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 11:56:12,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:12,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375441606] [2022-04-27 11:56:12,845 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:12,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408434909] [2022-04-27 11:56:12,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408434909] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:56:12,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:56:12,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 11:56:12,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502085018] [2022-04-27 11:56:12,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:56:12,846 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), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 11:56:12,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:12,847 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:56:12,868 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 11:56:12,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:56:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:12,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:56:12,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:56:12,869 INFO L87 Difference]: Start difference. First operand 24 states and 26 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:56:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:12,949 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-27 11:56:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:56:12,949 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), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 11:56:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:12,950 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:56:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-27 11:56:12,951 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:56:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-27 11:56:12,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-27 11:56:12,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:12,980 INFO L225 Difference]: With dead ends: 30 [2022-04-27 11:56:12,980 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 11:56:12,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 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 11:56:12,981 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:12,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 47 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:56:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 11:56:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 11:56:12,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:12,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:56:12,987 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:56:12,987 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:56:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:12,988 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-27 11:56:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-27 11:56:12,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:12,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:12,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 11:56:12,989 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 11:56:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:12,990 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-27 11:56:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-27 11:56:12,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:12,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:12,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:12,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:56:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-27 11:56:12,992 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 18 [2022-04-27 11:56:12,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:12,992 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-27 11:56:12,992 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:56:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-27 11:56:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 11:56:12,993 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:12,993 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:13,014 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 11:56:13,214 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 11:56:13,214 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:13,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:13,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1991962395, now seen corresponding path program 1 times [2022-04-27 11:56:13,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:13,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605576080] [2022-04-27 11:56:13,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:13,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:13,224 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:13,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1252217492] [2022-04-27 11:56:13,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:13,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:13,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:13,226 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 11:56:13,227 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 11:56:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:13,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:56:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:13,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:13,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {556#true} call ULTIMATE.init(); {556#true} is VALID [2022-04-27 11:56:13,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#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); {556#true} is VALID [2022-04-27 11:56:13,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#true} assume true; {556#true} is VALID [2022-04-27 11:56:13,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {556#true} {556#true} #56#return; {556#true} is VALID [2022-04-27 11:56:13,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {556#true} call #t~ret5 := main(); {556#true} is VALID [2022-04-27 11:56:13,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {556#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {576#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:13,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {576#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {576#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:13,517 INFO L272 TraceCheckUtils]: 7: Hoare triple {576#(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)); {556#true} is VALID [2022-04-27 11:56:13,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {556#true} ~cond := #in~cond; {556#true} is VALID [2022-04-27 11:56:13,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {556#true} assume !(0 == ~cond); {556#true} is VALID [2022-04-27 11:56:13,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {556#true} assume true; {556#true} is VALID [2022-04-27 11:56:13,518 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {556#true} {576#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {576#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:13,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(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; {598#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 11:56:13,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {598#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {598#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 11:56:13,519 INFO L272 TraceCheckUtils]: 14: Hoare triple {598#(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)); {556#true} is VALID [2022-04-27 11:56:13,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {556#true} ~cond := #in~cond; {556#true} is VALID [2022-04-27 11:56:13,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {556#true} assume !(0 == ~cond); {556#true} is VALID [2022-04-27 11:56:13,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {556#true} assume true; {556#true} is VALID [2022-04-27 11:56:13,520 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {556#true} {598#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} #50#return; {598#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 11:56:13,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {598#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {620#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 11:56:13,521 INFO L272 TraceCheckUtils]: 20: Hoare triple {620#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {624#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:13,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {624#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {628#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:13,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {628#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {557#false} is VALID [2022-04-27 11:56:13,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {557#false} assume !false; {557#false} is VALID [2022-04-27 11:56:13,523 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 11:56:13,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:56:13,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:13,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605576080] [2022-04-27 11:56:13,822 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:13,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252217492] [2022-04-27 11:56:13,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252217492] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:56:13,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:56:13,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 11:56:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253400026] [2022-04-27 11:56:13,823 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 11:56:13,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2022-04-27 11:56:13,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:13,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:56:13,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:13,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:56:13,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:13,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:56:13,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:56:13,839 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:56:13,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:13,993 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-27 11:56:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:56:13,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2022-04-27 11:56:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:56:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-27 11:56:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:56:13,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-27 11:56:13,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2022-04-27 11:56:14,018 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 11:56:14,019 INFO L225 Difference]: With dead ends: 33 [2022-04-27 11:56:14,019 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 11:56:14,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 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 11:56:14,020 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:14,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:56:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 11:56:14,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-27 11:56:14,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:14,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 5 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 11:56:14,027 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 5 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 11:56:14,027 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 5 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 11:56:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:14,028 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-04-27 11:56:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-27 11:56:14,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:14,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:14,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 5 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 28 states. [2022-04-27 11:56:14,029 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 5 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 28 states. [2022-04-27 11:56:14,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:14,030 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-04-27 11:56:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-27 11:56:14,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:14,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:14,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:14,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 5 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 11:56:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-04-27 11:56:14,032 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2022-04-27 11:56:14,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:14,032 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-04-27 11:56:14,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:56:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-27 11:56:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 11:56:14,033 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:14,033 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:14,055 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 11:56:14,247 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 11:56:14,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:14,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:14,248 INFO L85 PathProgramCache]: Analyzing trace with hash 486172306, now seen corresponding path program 2 times [2022-04-27 11:56:14,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:14,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803525278] [2022-04-27 11:56:14,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:14,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:14,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:14,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1534162838] [2022-04-27 11:56:14,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:56:14,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:14,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:14,266 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 11:56:14,271 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 11:56:14,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:56:14,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:56:14,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 11:56:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:14,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:14,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {827#true} is VALID [2022-04-27 11:56:14,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {827#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); {827#true} is VALID [2022-04-27 11:56:14,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-27 11:56:14,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #56#return; {827#true} is VALID [2022-04-27 11:56:14,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret5 := main(); {827#true} is VALID [2022-04-27 11:56:14,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {827#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {847#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:14,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {847#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {847#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:14,548 INFO L272 TraceCheckUtils]: 7: Hoare triple {847#(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)); {827#true} is VALID [2022-04-27 11:56:14,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {827#true} ~cond := #in~cond; {827#true} is VALID [2022-04-27 11:56:14,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {827#true} assume !(0 == ~cond); {827#true} is VALID [2022-04-27 11:56:14,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-27 11:56:14,548 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {827#true} {847#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {847#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:14,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {847#(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; {869#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 11:56:14,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {869#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {869#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 11:56:14,549 INFO L272 TraceCheckUtils]: 14: Hoare triple {869#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< 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)); {827#true} is VALID [2022-04-27 11:56:14,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {827#true} ~cond := #in~cond; {827#true} is VALID [2022-04-27 11:56:14,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {827#true} assume !(0 == ~cond); {827#true} is VALID [2022-04-27 11:56:14,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-27 11:56:14,553 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {827#true} {869#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #50#return; {869#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 11:56:14,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {869#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< 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; {891#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 11:56:14,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {891#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {891#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 11:56:14,554 INFO L272 TraceCheckUtils]: 21: Hoare triple {891#(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)); {827#true} is VALID [2022-04-27 11:56:14,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {827#true} ~cond := #in~cond; {827#true} is VALID [2022-04-27 11:56:14,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {827#true} assume !(0 == ~cond); {827#true} is VALID [2022-04-27 11:56:14,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-27 11:56:14,555 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {827#true} {891#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #50#return; {891#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 11:56:14,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {891#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {913#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-27 11:56:14,556 INFO L272 TraceCheckUtils]: 27: Hoare triple {913#(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)); {917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:14,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:14,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {828#false} is VALID [2022-04-27 11:56:14,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {828#false} assume !false; {828#false} is VALID [2022-04-27 11:56:14,557 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 11:56:14,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:56:14,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:14,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803525278] [2022-04-27 11:56:14,884 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:14,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534162838] [2022-04-27 11:56:14,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534162838] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:56:14,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:56:14,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 11:56:14,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124904932] [2022-04-27 11:56:14,884 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 11:56:14,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2022-04-27 11:56:14,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:14,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:56:14,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:14,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:56:14,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:14,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:56:14,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:56:14,903 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:56:15,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:15,108 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-27 11:56:15,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:56:15,108 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2022-04-27 11:56:15,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:56:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-04-27 11:56:15,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:56:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-04-27 11:56:15,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 34 transitions. [2022-04-27 11:56:15,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:15,153 INFO L225 Difference]: With dead ends: 36 [2022-04-27 11:56:15,153 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 11:56:15,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:56:15,154 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:15,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 107 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:56:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 11:56:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 11:56:15,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:15,164 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), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:56:15,165 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), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:56:15,165 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), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:56:15,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:15,166 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-27 11:56:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-27 11:56:15,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:15,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:15,166 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), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 31 states. [2022-04-27 11:56:15,166 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), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 31 states. [2022-04-27 11:56:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:15,167 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-27 11:56:15,167 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-27 11:56:15,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:15,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:15,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:15,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:15,168 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), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:56:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-27 11:56:15,169 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 31 [2022-04-27 11:56:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:15,169 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-27 11:56:15,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:56:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-27 11:56:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 11:56:15,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:15,170 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:15,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 11:56:15,403 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 11:56:15,404 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:15,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:15,404 INFO L85 PathProgramCache]: Analyzing trace with hash -625556411, now seen corresponding path program 3 times [2022-04-27 11:56:15,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:15,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339897990] [2022-04-27 11:56:15,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:15,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:15,416 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:15,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [761983844] [2022-04-27 11:56:15,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:56:15,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:15,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:15,446 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 11:56:15,447 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 11:56:15,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 11:56:15,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:56:15,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 11:56:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:15,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:15,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {1158#true} call ULTIMATE.init(); {1158#true} is VALID [2022-04-27 11:56:15,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#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); {1158#true} is VALID [2022-04-27 11:56:15,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-04-27 11:56:15,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1158#true} {1158#true} #56#return; {1158#true} is VALID [2022-04-27 11:56:15,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {1158#true} call #t~ret5 := main(); {1158#true} is VALID [2022-04-27 11:56:15,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {1158#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1178#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:15,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {1178#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1178#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:15,792 INFO L272 TraceCheckUtils]: 7: Hoare triple {1178#(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)); {1158#true} is VALID [2022-04-27 11:56:15,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {1158#true} ~cond := #in~cond; {1158#true} is VALID [2022-04-27 11:56:15,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {1158#true} assume !(0 == ~cond); {1158#true} is VALID [2022-04-27 11:56:15,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-04-27 11:56:15,802 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1158#true} {1178#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {1178#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:15,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(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; {1200#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 11:56:15,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {1200#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {1200#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 11:56:15,804 INFO L272 TraceCheckUtils]: 14: Hoare triple {1200#(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)); {1158#true} is VALID [2022-04-27 11:56:15,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {1158#true} ~cond := #in~cond; {1158#true} is VALID [2022-04-27 11:56:15,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {1158#true} assume !(0 == ~cond); {1158#true} is VALID [2022-04-27 11:56:15,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-04-27 11:56:15,804 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1158#true} {1200#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {1200#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 11:56:15,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {1200#(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; {1222#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 11:56:15,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {1222#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {1222#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 11:56:15,805 INFO L272 TraceCheckUtils]: 21: Hoare triple {1222#(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)); {1158#true} is VALID [2022-04-27 11:56:15,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {1158#true} ~cond := #in~cond; {1158#true} is VALID [2022-04-27 11:56:15,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {1158#true} assume !(0 == ~cond); {1158#true} is VALID [2022-04-27 11:56:15,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-04-27 11:56:15,806 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1158#true} {1222#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #50#return; {1222#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 11:56:15,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {1222#(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; {1244#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 11:56:15,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {1244#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1244#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 11:56:15,807 INFO L272 TraceCheckUtils]: 28: Hoare triple {1244#(and (<= main_~c~0 3) (= main_~y~0 3) (< 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)); {1158#true} is VALID [2022-04-27 11:56:15,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {1158#true} ~cond := #in~cond; {1158#true} is VALID [2022-04-27 11:56:15,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {1158#true} assume !(0 == ~cond); {1158#true} is VALID [2022-04-27 11:56:15,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-04-27 11:56:15,807 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1158#true} {1244#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #50#return; {1244#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 11:56:15,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {1244#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1266#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 11:56:15,808 INFO L272 TraceCheckUtils]: 34: Hoare triple {1266#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:15,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:15,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {1274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1159#false} is VALID [2022-04-27 11:56:15,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {1159#false} assume !false; {1159#false} is VALID [2022-04-27 11:56:15,809 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 11:56:15,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:56:16,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:16,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339897990] [2022-04-27 11:56:16,045 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:16,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761983844] [2022-04-27 11:56:16,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761983844] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:56:16,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:56:16,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 11:56:16,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446170349] [2022-04-27 11:56:16,046 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 11:56:16,046 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 38 [2022-04-27 11:56:16,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:16,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:56:16,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:16,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:56:16,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:16,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:56:16,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:56:16,067 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:56:16,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:16,340 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-27 11:56:16,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:56:16,341 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 38 [2022-04-27 11:56:16,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:56:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-27 11:56:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:56:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-27 11:56:16,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2022-04-27 11:56:16,370 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 11:56:16,371 INFO L225 Difference]: With dead ends: 39 [2022-04-27 11:56:16,371 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 11:56:16,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 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 11:56:16,372 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:16,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:56:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 11:56:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 11:56:16,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:16,382 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), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:56:16,383 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), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:56:16,383 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), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:56:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:16,384 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 11:56:16,384 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-27 11:56:16,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:16,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:16,384 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), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-27 11:56:16,385 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), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-27 11:56:16,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:16,386 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 11:56:16,386 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-27 11:56:16,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:16,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:16,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:16,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:16,386 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), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:56:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-27 11:56:16,387 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 38 [2022-04-27 11:56:16,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:16,387 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-27 11:56:16,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:56:16,388 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-27 11:56:16,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 11:56:16,391 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:16,391 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:16,423 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 11:56:16,626 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 11:56:16,627 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:16,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:16,627 INFO L85 PathProgramCache]: Analyzing trace with hash -516282574, now seen corresponding path program 4 times [2022-04-27 11:56:16,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:16,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61096407] [2022-04-27 11:56:16,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:16,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:16,646 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:16,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [405480160] [2022-04-27 11:56:16,647 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:56:16,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:16,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:16,660 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 11:56:16,678 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 11:56:16,754 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:56:16,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:56:16,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 11:56:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:16,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:17,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {1505#true} call ULTIMATE.init(); {1505#true} is VALID [2022-04-27 11:56:17,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {1505#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); {1505#true} is VALID [2022-04-27 11:56:17,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-27 11:56:17,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1505#true} {1505#true} #56#return; {1505#true} is VALID [2022-04-27 11:56:17,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {1505#true} call #t~ret5 := main(); {1505#true} is VALID [2022-04-27 11:56:17,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {1505#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1525#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:17,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {1525#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1525#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:17,125 INFO L272 TraceCheckUtils]: 7: Hoare triple {1525#(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)); {1505#true} is VALID [2022-04-27 11:56:17,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-27 11:56:17,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-27 11:56:17,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-27 11:56:17,126 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1505#true} {1525#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {1525#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:17,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {1525#(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; {1547#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 11:56:17,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {1547#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1547#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 11:56:17,126 INFO L272 TraceCheckUtils]: 14: Hoare triple {1547#(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)); {1505#true} is VALID [2022-04-27 11:56:17,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-27 11:56:17,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-27 11:56:17,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-27 11:56:17,127 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1505#true} {1547#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {1547#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 11:56:17,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {1547#(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; {1569#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 11:56:17,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {1569#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {1569#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 11:56:17,128 INFO L272 TraceCheckUtils]: 21: Hoare triple {1569#(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)); {1505#true} is VALID [2022-04-27 11:56:17,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-27 11:56:17,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-27 11:56:17,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-27 11:56:17,129 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1505#true} {1569#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {1569#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 11:56:17,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {1569#(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; {1591#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 11:56:17,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {1591#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {1591#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 11:56:17,130 INFO L272 TraceCheckUtils]: 28: Hoare triple {1591#(and (= 2 (+ (- 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)); {1505#true} is VALID [2022-04-27 11:56:17,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-27 11:56:17,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-27 11:56:17,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-27 11:56:17,130 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1505#true} {1591#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #50#return; {1591#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 11:56:17,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {1591#(and (= 2 (+ (- 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; {1613#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-27 11:56:17,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {1613#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !false; {1613#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-27 11:56:17,134 INFO L272 TraceCheckUtils]: 35: Hoare triple {1613#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= 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)); {1505#true} is VALID [2022-04-27 11:56:17,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-27 11:56:17,135 INFO L290 TraceCheckUtils]: 37: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-27 11:56:17,135 INFO L290 TraceCheckUtils]: 38: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-27 11:56:17,135 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1505#true} {1613#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} #50#return; {1613#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-27 11:56:17,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {1613#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {1635#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 11:56:17,137 INFO L272 TraceCheckUtils]: 41: Hoare triple {1635#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1639#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:17,137 INFO L290 TraceCheckUtils]: 42: Hoare triple {1639#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1643#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:17,137 INFO L290 TraceCheckUtils]: 43: Hoare triple {1643#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1506#false} is VALID [2022-04-27 11:56:17,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {1506#false} assume !false; {1506#false} is VALID [2022-04-27 11:56:17,138 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 11:56:17,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:56:17,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:17,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61096407] [2022-04-27 11:56:17,443 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:17,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405480160] [2022-04-27 11:56:17,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405480160] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:56:17,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:56:17,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 11:56:17,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716649042] [2022-04-27 11:56:17,443 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 11:56:17,444 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2022-04-27 11:56:17,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:17,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:56:17,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:17,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:56:17,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:17,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:56:17,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:56:17,468 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:56:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:17,797 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-27 11:56:17,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:56:17,798 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2022-04-27 11:56:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:56:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-27 11:56:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:56:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-27 11:56:17,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-27 11:56:17,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:17,833 INFO L225 Difference]: With dead ends: 42 [2022-04-27 11:56:17,833 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 11:56:17,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:56:17,834 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:17,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 159 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:56:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 11:56:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 11:56:17,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:17,847 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), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:17,848 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), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:17,848 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), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:17,849 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-27 11:56:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-27 11:56:17,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:17,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:17,849 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), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-27 11:56:17,850 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), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-27 11:56:17,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:17,851 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-27 11:56:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-27 11:56:17,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:17,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:17,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:17,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:17,851 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), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-04-27 11:56:17,852 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 45 [2022-04-27 11:56:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:17,852 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-04-27 11:56:17,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:56:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-27 11:56:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 11:56:17,853 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:17,853 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:17,872 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 11:56:18,053 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 11:56:18,054 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:18,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:18,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1878724517, now seen corresponding path program 5 times [2022-04-27 11:56:18,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:18,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878341835] [2022-04-27 11:56:18,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:18,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:18,072 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:18,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1627315441] [2022-04-27 11:56:18,072 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:56:18,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:18,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:18,074 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 11:56:18,092 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 11:56:18,191 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 11:56:18,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:56:18,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 11:56:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:18,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:18,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {1890#true} call ULTIMATE.init(); {1890#true} is VALID [2022-04-27 11:56:18,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {1890#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); {1890#true} is VALID [2022-04-27 11:56:18,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-27 11:56:18,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1890#true} {1890#true} #56#return; {1890#true} is VALID [2022-04-27 11:56:18,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {1890#true} call #t~ret5 := main(); {1890#true} is VALID [2022-04-27 11:56:18,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {1890#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1910#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:18,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {1910#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1910#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:18,552 INFO L272 TraceCheckUtils]: 7: Hoare triple {1910#(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)); {1890#true} is VALID [2022-04-27 11:56:18,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2022-04-27 11:56:18,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {1890#true} assume !(0 == ~cond); {1890#true} is VALID [2022-04-27 11:56:18,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-27 11:56:18,553 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1890#true} {1910#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {1910#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:18,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {1910#(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; {1932#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 11:56:18,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {1932#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1932#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 11:56:18,554 INFO L272 TraceCheckUtils]: 14: Hoare triple {1932#(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)); {1890#true} is VALID [2022-04-27 11:56:18,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2022-04-27 11:56:18,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {1890#true} assume !(0 == ~cond); {1890#true} is VALID [2022-04-27 11:56:18,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-27 11:56:18,555 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1890#true} {1932#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {1932#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 11:56:18,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {1932#(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; {1954#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 11:56:18,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {1954#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1954#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 11:56:18,556 INFO L272 TraceCheckUtils]: 21: Hoare triple {1954#(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)); {1890#true} is VALID [2022-04-27 11:56:18,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2022-04-27 11:56:18,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {1890#true} assume !(0 == ~cond); {1890#true} is VALID [2022-04-27 11:56:18,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-27 11:56:18,557 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1890#true} {1954#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #50#return; {1954#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 11:56:18,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {1954#(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; {1976#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 11:56:18,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {1976#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {1976#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 11:56:18,557 INFO L272 TraceCheckUtils]: 28: Hoare triple {1976#(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)); {1890#true} is VALID [2022-04-27 11:56:18,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2022-04-27 11:56:18,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {1890#true} assume !(0 == ~cond); {1890#true} is VALID [2022-04-27 11:56:18,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-27 11:56:18,558 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1890#true} {1976#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #50#return; {1976#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 11:56:18,559 INFO L290 TraceCheckUtils]: 33: Hoare triple {1976#(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; {1998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 11:56:18,559 INFO L290 TraceCheckUtils]: 34: Hoare triple {1998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {1998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 11:56:18,559 INFO L272 TraceCheckUtils]: 35: Hoare triple {1998#(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)); {1890#true} is VALID [2022-04-27 11:56:18,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2022-04-27 11:56:18,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {1890#true} assume !(0 == ~cond); {1890#true} is VALID [2022-04-27 11:56:18,560 INFO L290 TraceCheckUtils]: 38: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-27 11:56:18,560 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1890#true} {1998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #50#return; {1998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 11:56:18,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {1998#(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; {2020#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 11:56:18,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {2020#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !false; {2020#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 11:56:18,561 INFO L272 TraceCheckUtils]: 42: Hoare triple {2020#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 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)); {1890#true} is VALID [2022-04-27 11:56:18,561 INFO L290 TraceCheckUtils]: 43: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2022-04-27 11:56:18,561 INFO L290 TraceCheckUtils]: 44: Hoare triple {1890#true} assume !(0 == ~cond); {1890#true} is VALID [2022-04-27 11:56:18,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {1890#true} assume true; {1890#true} is VALID [2022-04-27 11:56:18,562 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1890#true} {2020#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #50#return; {2020#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 11:56:18,563 INFO L290 TraceCheckUtils]: 47: Hoare triple {2020#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2042#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 11:56:18,563 INFO L272 TraceCheckUtils]: 48: Hoare triple {2042#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:18,564 INFO L290 TraceCheckUtils]: 49: Hoare triple {2046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:18,564 INFO L290 TraceCheckUtils]: 50: Hoare triple {2050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1891#false} is VALID [2022-04-27 11:56:18,565 INFO L290 TraceCheckUtils]: 51: Hoare triple {1891#false} assume !false; {1891#false} is VALID [2022-04-27 11:56:18,565 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 11:56:18,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:56:18,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:18,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878341835] [2022-04-27 11:56:18,846 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:18,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627315441] [2022-04-27 11:56:18,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627315441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:56:18,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:56:18,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 11:56:18,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218869992] [2022-04-27 11:56:18,846 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 11:56:18,847 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 52 [2022-04-27 11:56:18,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:18,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:18,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:18,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 11:56:18,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:18,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 11:56:18,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:56:18,879 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:19,365 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-27 11:56:19,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:56:19,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 52 [2022-04-27 11:56:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-27 11:56:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-27 11:56:19,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 46 transitions. [2022-04-27 11:56:19,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:19,422 INFO L225 Difference]: With dead ends: 45 [2022-04-27 11:56:19,422 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 11:56:19,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:56:19,423 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:19,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 188 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:56:19,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 11:56:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-27 11:56:19,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:19,438 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), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:56:19,438 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), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:56:19,438 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), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:56:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:19,439 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-27 11:56:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-04-27 11:56:19,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:19,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:19,440 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), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 40 states. [2022-04-27 11:56:19,440 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), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 40 states. [2022-04-27 11:56:19,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:19,441 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-27 11:56:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-04-27 11:56:19,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:19,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:19,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:19,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:19,441 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), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:56:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-04-27 11:56:19,442 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 52 [2022-04-27 11:56:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:19,443 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-04-27 11:56:19,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-04-27 11:56:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 11:56:19,443 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:19,443 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:19,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 11:56:19,660 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 11:56:19,661 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:19,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2079567918, now seen corresponding path program 6 times [2022-04-27 11:56:19,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:19,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416535590] [2022-04-27 11:56:19,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:19,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:19,670 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:19,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1489487421] [2022-04-27 11:56:19,670 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:56:19,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:19,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:19,671 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 11:56:19,679 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 11:56:19,851 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 11:56:19,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:56:19,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 11:56:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:19,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:20,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {2313#true} call ULTIMATE.init(); {2313#true} is VALID [2022-04-27 11:56:20,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {2313#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); {2313#true} is VALID [2022-04-27 11:56:20,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-04-27 11:56:20,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2313#true} {2313#true} #56#return; {2313#true} is VALID [2022-04-27 11:56:20,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {2313#true} call #t~ret5 := main(); {2313#true} is VALID [2022-04-27 11:56:20,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {2313#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2333#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:20,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {2333#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2333#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:20,325 INFO L272 TraceCheckUtils]: 7: Hoare triple {2333#(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)); {2313#true} is VALID [2022-04-27 11:56:20,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-04-27 11:56:20,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-04-27 11:56:20,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-04-27 11:56:20,326 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2313#true} {2333#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {2333#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:20,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {2333#(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; {2355#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 11:56:20,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {2355#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2355#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 11:56:20,327 INFO L272 TraceCheckUtils]: 14: Hoare triple {2355#(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)); {2313#true} is VALID [2022-04-27 11:56:20,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-04-27 11:56:20,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-04-27 11:56:20,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-04-27 11:56:20,327 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2313#true} {2355#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {2355#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 11:56:20,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {2355#(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; {2377#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 11:56:20,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {2377#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {2377#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 11:56:20,328 INFO L272 TraceCheckUtils]: 21: Hoare triple {2377#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< 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)); {2313#true} is VALID [2022-04-27 11:56:20,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-04-27 11:56:20,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-04-27 11:56:20,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-04-27 11:56:20,329 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2313#true} {2377#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #50#return; {2377#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 11:56:20,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {2377#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< 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; {2399#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 11:56:20,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {2399#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !false; {2399#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 11:56:20,330 INFO L272 TraceCheckUtils]: 28: Hoare triple {2399#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< 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)); {2313#true} is VALID [2022-04-27 11:56:20,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-04-27 11:56:20,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-04-27 11:56:20,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-04-27 11:56:20,332 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2313#true} {2399#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #50#return; {2399#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 11:56:20,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {2399#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< 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; {2421#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 11:56:20,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {2421#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} assume !false; {2421#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 11:56:20,333 INFO L272 TraceCheckUtils]: 35: Hoare triple {2421#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ 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)); {2313#true} is VALID [2022-04-27 11:56:20,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-04-27 11:56:20,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-04-27 11:56:20,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-04-27 11:56:20,334 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2313#true} {2421#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} #50#return; {2421#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 11:56:20,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {2421#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ 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; {2443#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 11:56:20,335 INFO L290 TraceCheckUtils]: 41: Hoare triple {2443#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {2443#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 11:56:20,335 INFO L272 TraceCheckUtils]: 42: Hoare triple {2443#(and (< 1 main_~k~0) (= (+ (- 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)); {2313#true} is VALID [2022-04-27 11:56:20,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-04-27 11:56:20,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-04-27 11:56:20,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-04-27 11:56:20,335 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2313#true} {2443#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #50#return; {2443#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 11:56:20,336 INFO L290 TraceCheckUtils]: 47: Hoare triple {2443#(and (< 1 main_~k~0) (= (+ (- 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; {2465#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 11:56:20,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {2465#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {2465#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 11:56:20,336 INFO L272 TraceCheckUtils]: 49: Hoare triple {2465#(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)); {2313#true} is VALID [2022-04-27 11:56:20,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-04-27 11:56:20,337 INFO L290 TraceCheckUtils]: 51: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-04-27 11:56:20,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-04-27 11:56:20,337 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2313#true} {2465#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #50#return; {2465#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 11:56:20,338 INFO L290 TraceCheckUtils]: 54: Hoare triple {2465#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {2487#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 11:56:20,338 INFO L272 TraceCheckUtils]: 55: Hoare triple {2487#(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)); {2491#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:20,339 INFO L290 TraceCheckUtils]: 56: Hoare triple {2491#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2495#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:20,339 INFO L290 TraceCheckUtils]: 57: Hoare triple {2495#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2314#false} is VALID [2022-04-27 11:56:20,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {2314#false} assume !false; {2314#false} is VALID [2022-04-27 11:56:20,340 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 11:56:20,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:56:20,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:20,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416535590] [2022-04-27 11:56:20,907 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:20,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489487421] [2022-04-27 11:56:20,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489487421] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:56:20,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:56:20,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 11:56:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076552276] [2022-04-27 11:56:20,907 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 11:56:20,908 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 59 [2022-04-27 11:56:20,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:20,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:56:20,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:20,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 11:56:20,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:20,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 11:56:20,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:56:20,941 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:56:21,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:21,552 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-27 11:56:21,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 11:56:21,552 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 59 [2022-04-27 11:56:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:56:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2022-04-27 11:56:21,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:56:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2022-04-27 11:56:21,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 50 transitions. [2022-04-27 11:56:21,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:21,592 INFO L225 Difference]: With dead ends: 48 [2022-04-27 11:56:21,592 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 11:56:21,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-27 11:56:21,594 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:21,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 219 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:56:21,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 11:56:21,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 11:56:21,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:21,637 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), 11 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:56:21,639 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), 11 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:56:21,640 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), 11 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:56:21,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:21,646 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-27 11:56:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-27 11:56:21,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:21,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:21,646 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), 11 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-27 11:56:21,647 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), 11 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-27 11:56:21,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:21,651 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-27 11:56:21,651 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-27 11:56:21,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:21,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:21,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:21,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:21,651 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), 11 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:56:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-04-27 11:56:21,656 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 59 [2022-04-27 11:56:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:21,656 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-04-27 11:56:21,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:56:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-27 11:56:21,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 11:56:21,657 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:21,657 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:21,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 11:56:21,866 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 11:56:21,866 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:21,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2024272645, now seen corresponding path program 7 times [2022-04-27 11:56:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:21,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144994683] [2022-04-27 11:56:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:21,876 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:21,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375749469] [2022-04-27 11:56:21,876 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:56:21,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:21,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:21,877 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 11:56:21,878 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 11:56:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:22,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 11:56:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:22,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:22,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {2862#true} call ULTIMATE.init(); {2862#true} is VALID [2022-04-27 11:56:22,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {2862#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); {2862#true} is VALID [2022-04-27 11:56:22,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {2862#true} assume true; {2862#true} is VALID [2022-04-27 11:56:22,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2862#true} {2862#true} #56#return; {2862#true} is VALID [2022-04-27 11:56:22,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {2862#true} call #t~ret5 := main(); {2862#true} is VALID [2022-04-27 11:56:22,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {2862#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2882#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:22,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {2882#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2882#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:22,671 INFO L272 TraceCheckUtils]: 7: Hoare triple {2882#(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)); {2862#true} is VALID [2022-04-27 11:56:22,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {2862#true} ~cond := #in~cond; {2862#true} is VALID [2022-04-27 11:56:22,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {2862#true} assume !(0 == ~cond); {2862#true} is VALID [2022-04-27 11:56:22,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {2862#true} assume true; {2862#true} is VALID [2022-04-27 11:56:22,672 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2862#true} {2882#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {2882#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:22,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {2882#(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; {2904#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 11:56:22,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {2904#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {2904#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 11:56:22,673 INFO L272 TraceCheckUtils]: 14: Hoare triple {2904#(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)); {2862#true} is VALID [2022-04-27 11:56:22,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {2862#true} ~cond := #in~cond; {2862#true} is VALID [2022-04-27 11:56:22,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {2862#true} assume !(0 == ~cond); {2862#true} is VALID [2022-04-27 11:56:22,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {2862#true} assume true; {2862#true} is VALID [2022-04-27 11:56:22,674 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2862#true} {2904#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {2904#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 11:56:22,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {2904#(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; {2926#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 11:56:22,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {2926#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {2926#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 11:56:22,674 INFO L272 TraceCheckUtils]: 21: Hoare triple {2926#(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)); {2862#true} is VALID [2022-04-27 11:56:22,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {2862#true} ~cond := #in~cond; {2862#true} is VALID [2022-04-27 11:56:22,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {2862#true} assume !(0 == ~cond); {2862#true} is VALID [2022-04-27 11:56:22,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {2862#true} assume true; {2862#true} is VALID [2022-04-27 11:56:22,675 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2862#true} {2926#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #50#return; {2926#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 11:56:22,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {2926#(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; {2948#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 11:56:22,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {2948#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {2948#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 11:56:22,676 INFO L272 TraceCheckUtils]: 28: Hoare triple {2948#(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)); {2862#true} is VALID [2022-04-27 11:56:22,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {2862#true} ~cond := #in~cond; {2862#true} is VALID [2022-04-27 11:56:22,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {2862#true} assume !(0 == ~cond); {2862#true} is VALID [2022-04-27 11:56:22,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {2862#true} assume true; {2862#true} is VALID [2022-04-27 11:56:22,677 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2862#true} {2948#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #50#return; {2948#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 11:56:22,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {2948#(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; {2970#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 11:56:22,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {2970#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !false; {2970#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 11:56:22,678 INFO L272 TraceCheckUtils]: 35: Hoare triple {2970#(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)); {2862#true} is VALID [2022-04-27 11:56:22,678 INFO L290 TraceCheckUtils]: 36: Hoare triple {2862#true} ~cond := #in~cond; {2862#true} is VALID [2022-04-27 11:56:22,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {2862#true} assume !(0 == ~cond); {2862#true} is VALID [2022-04-27 11:56:22,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {2862#true} assume true; {2862#true} is VALID [2022-04-27 11:56:22,678 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2862#true} {2970#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #50#return; {2970#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 11:56:22,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {2970#(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; {2992#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 11:56:22,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {2992#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {2992#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 11:56:22,679 INFO L272 TraceCheckUtils]: 42: Hoare triple {2992#(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)); {2862#true} is VALID [2022-04-27 11:56:22,679 INFO L290 TraceCheckUtils]: 43: Hoare triple {2862#true} ~cond := #in~cond; {2862#true} is VALID [2022-04-27 11:56:22,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {2862#true} assume !(0 == ~cond); {2862#true} is VALID [2022-04-27 11:56:22,680 INFO L290 TraceCheckUtils]: 45: Hoare triple {2862#true} assume true; {2862#true} is VALID [2022-04-27 11:56:22,680 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2862#true} {2992#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {2992#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 11:56:22,680 INFO L290 TraceCheckUtils]: 47: Hoare triple {2992#(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; {3014#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 11:56:22,681 INFO L290 TraceCheckUtils]: 48: Hoare triple {3014#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {3014#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 11:56:22,681 INFO L272 TraceCheckUtils]: 49: Hoare triple {3014#(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)); {2862#true} is VALID [2022-04-27 11:56:22,681 INFO L290 TraceCheckUtils]: 50: Hoare triple {2862#true} ~cond := #in~cond; {2862#true} is VALID [2022-04-27 11:56:22,681 INFO L290 TraceCheckUtils]: 51: Hoare triple {2862#true} assume !(0 == ~cond); {2862#true} is VALID [2022-04-27 11:56:22,681 INFO L290 TraceCheckUtils]: 52: Hoare triple {2862#true} assume true; {2862#true} is VALID [2022-04-27 11:56:22,681 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2862#true} {3014#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {3014#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 11:56:22,682 INFO L290 TraceCheckUtils]: 54: Hoare triple {3014#(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; {3036#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 11:56:22,682 INFO L290 TraceCheckUtils]: 55: Hoare triple {3036#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {3036#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 11:56:22,682 INFO L272 TraceCheckUtils]: 56: Hoare triple {3036#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 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)); {2862#true} is VALID [2022-04-27 11:56:22,682 INFO L290 TraceCheckUtils]: 57: Hoare triple {2862#true} ~cond := #in~cond; {2862#true} is VALID [2022-04-27 11:56:22,683 INFO L290 TraceCheckUtils]: 58: Hoare triple {2862#true} assume !(0 == ~cond); {2862#true} is VALID [2022-04-27 11:56:22,683 INFO L290 TraceCheckUtils]: 59: Hoare triple {2862#true} assume true; {2862#true} is VALID [2022-04-27 11:56:22,683 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2862#true} {3036#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #50#return; {3036#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 11:56:22,684 INFO L290 TraceCheckUtils]: 61: Hoare triple {3036#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3058#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 11:56:22,684 INFO L272 TraceCheckUtils]: 62: Hoare triple {3058#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3062#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:22,685 INFO L290 TraceCheckUtils]: 63: Hoare triple {3062#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3066#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:22,685 INFO L290 TraceCheckUtils]: 64: Hoare triple {3066#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2863#false} is VALID [2022-04-27 11:56:22,685 INFO L290 TraceCheckUtils]: 65: Hoare triple {2863#false} assume !false; {2863#false} is VALID [2022-04-27 11:56:22,685 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 11:56:22,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:56:22,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:22,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144994683] [2022-04-27 11:56:22,966 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:22,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375749469] [2022-04-27 11:56:22,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375749469] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:56:22,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:56:22,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 11:56:22,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793746789] [2022-04-27 11:56:22,966 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 11:56:22,966 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 66 [2022-04-27 11:56:22,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:22,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:56:22,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:22,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:56:22,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:22,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:56:22,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:56:22,999 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:56:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:23,627 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-27 11:56:23,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 11:56:23,627 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 66 [2022-04-27 11:56:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:56:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-27 11:56:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:56:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-27 11:56:23,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2022-04-27 11:56:23,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:23,663 INFO L225 Difference]: With dead ends: 51 [2022-04-27 11:56:23,663 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 11:56:23,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 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 11:56:23,664 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:23,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 252 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:56:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 11:56:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-27 11:56:23,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:23,700 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), 12 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 11:56:23,700 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), 12 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 11:56:23,700 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), 12 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 11:56:23,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:23,701 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-27 11:56:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-04-27 11:56:23,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:23,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:23,702 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), 12 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 46 states. [2022-04-27 11:56:23,702 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), 12 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 46 states. [2022-04-27 11:56:23,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:23,704 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-27 11:56:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-04-27 11:56:23,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:23,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:23,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:23,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:23,705 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), 12 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 11:56:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-04-27 11:56:23,706 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 66 [2022-04-27 11:56:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:23,707 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-04-27 11:56:23,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:56:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-04-27 11:56:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-27 11:56:23,707 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:23,708 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:23,714 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 11:56:23,915 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 11:56:23,915 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:23,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:23,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1092280434, now seen corresponding path program 8 times [2022-04-27 11:56:23,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:23,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525254844] [2022-04-27 11:56:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:23,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:23,939 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:23,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059192208] [2022-04-27 11:56:23,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:56:23,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:23,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:23,952 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 11:56:23,982 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 11:56:24,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:56:24,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:56:24,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 11:56:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:24,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:24,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {3361#true} call ULTIMATE.init(); {3361#true} is VALID [2022-04-27 11:56:24,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {3361#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); {3361#true} is VALID [2022-04-27 11:56:24,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {3361#true} assume true; {3361#true} is VALID [2022-04-27 11:56:24,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3361#true} {3361#true} #56#return; {3361#true} is VALID [2022-04-27 11:56:24,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {3361#true} call #t~ret5 := main(); {3361#true} is VALID [2022-04-27 11:56:24,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {3361#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3381#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:24,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {3381#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3381#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:24,966 INFO L272 TraceCheckUtils]: 7: Hoare triple {3381#(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)); {3361#true} is VALID [2022-04-27 11:56:24,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {3361#true} ~cond := #in~cond; {3361#true} is VALID [2022-04-27 11:56:24,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {3361#true} assume !(0 == ~cond); {3361#true} is VALID [2022-04-27 11:56:24,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {3361#true} assume true; {3361#true} is VALID [2022-04-27 11:56:24,968 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3361#true} {3381#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {3381#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:24,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {3381#(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; {3403#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 11:56:24,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {3403#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3403#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 11:56:24,969 INFO L272 TraceCheckUtils]: 14: Hoare triple {3403#(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)); {3361#true} is VALID [2022-04-27 11:56:24,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {3361#true} ~cond := #in~cond; {3361#true} is VALID [2022-04-27 11:56:24,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {3361#true} assume !(0 == ~cond); {3361#true} is VALID [2022-04-27 11:56:24,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {3361#true} assume true; {3361#true} is VALID [2022-04-27 11:56:24,970 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3361#true} {3403#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {3403#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 11:56:24,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {3403#(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; {3425#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 11:56:24,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {3425#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {3425#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 11:56:24,970 INFO L272 TraceCheckUtils]: 21: Hoare triple {3425#(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)); {3361#true} is VALID [2022-04-27 11:56:24,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {3361#true} ~cond := #in~cond; {3361#true} is VALID [2022-04-27 11:56:24,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {3361#true} assume !(0 == ~cond); {3361#true} is VALID [2022-04-27 11:56:24,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {3361#true} assume true; {3361#true} is VALID [2022-04-27 11:56:24,971 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3361#true} {3425#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #50#return; {3425#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 11:56:24,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {3425#(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; {3447#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 11:56:24,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {3447#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {3447#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 11:56:24,972 INFO L272 TraceCheckUtils]: 28: Hoare triple {3447#(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)); {3361#true} is VALID [2022-04-27 11:56:24,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {3361#true} ~cond := #in~cond; {3361#true} is VALID [2022-04-27 11:56:24,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {3361#true} assume !(0 == ~cond); {3361#true} is VALID [2022-04-27 11:56:24,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {3361#true} assume true; {3361#true} is VALID [2022-04-27 11:56:24,975 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3361#true} {3447#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {3447#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 11:56:24,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {3447#(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; {3469#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:56:24,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {3469#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {3469#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:56:24,977 INFO L272 TraceCheckUtils]: 35: Hoare triple {3469#(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)); {3361#true} is VALID [2022-04-27 11:56:24,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {3361#true} ~cond := #in~cond; {3361#true} is VALID [2022-04-27 11:56:24,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {3361#true} assume !(0 == ~cond); {3361#true} is VALID [2022-04-27 11:56:24,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {3361#true} assume true; {3361#true} is VALID [2022-04-27 11:56:24,977 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3361#true} {3469#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #50#return; {3469#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:56:24,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {3469#(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; {3491#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 11:56:24,978 INFO L290 TraceCheckUtils]: 41: Hoare triple {3491#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !false; {3491#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 11:56:24,978 INFO L272 TraceCheckUtils]: 42: Hoare triple {3491#(and (= 3 (+ (- 2) 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)); {3361#true} is VALID [2022-04-27 11:56:24,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {3361#true} ~cond := #in~cond; {3361#true} is VALID [2022-04-27 11:56:24,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {3361#true} assume !(0 == ~cond); {3361#true} is VALID [2022-04-27 11:56:24,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {3361#true} assume true; {3361#true} is VALID [2022-04-27 11:56:24,979 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3361#true} {3491#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #50#return; {3491#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 11:56:24,979 INFO L290 TraceCheckUtils]: 47: Hoare triple {3491#(and (= 3 (+ (- 2) 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; {3513#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 11:56:24,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {3513#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {3513#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 11:56:24,980 INFO L272 TraceCheckUtils]: 49: Hoare triple {3513#(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)); {3361#true} is VALID [2022-04-27 11:56:24,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {3361#true} ~cond := #in~cond; {3361#true} is VALID [2022-04-27 11:56:24,980 INFO L290 TraceCheckUtils]: 51: Hoare triple {3361#true} assume !(0 == ~cond); {3361#true} is VALID [2022-04-27 11:56:24,980 INFO L290 TraceCheckUtils]: 52: Hoare triple {3361#true} assume true; {3361#true} is VALID [2022-04-27 11:56:24,980 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3361#true} {3513#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {3513#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 11:56:24,981 INFO L290 TraceCheckUtils]: 54: Hoare triple {3513#(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; {3535#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 11:56:24,981 INFO L290 TraceCheckUtils]: 55: Hoare triple {3535#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {3535#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 11:56:24,981 INFO L272 TraceCheckUtils]: 56: Hoare triple {3535#(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)); {3361#true} is VALID [2022-04-27 11:56:24,981 INFO L290 TraceCheckUtils]: 57: Hoare triple {3361#true} ~cond := #in~cond; {3361#true} is VALID [2022-04-27 11:56:24,982 INFO L290 TraceCheckUtils]: 58: Hoare triple {3361#true} assume !(0 == ~cond); {3361#true} is VALID [2022-04-27 11:56:24,982 INFO L290 TraceCheckUtils]: 59: Hoare triple {3361#true} assume true; {3361#true} is VALID [2022-04-27 11:56:24,982 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3361#true} {3535#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {3535#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 11:56:24,982 INFO L290 TraceCheckUtils]: 61: Hoare triple {3535#(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; {3557#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 11:56:24,983 INFO L290 TraceCheckUtils]: 62: Hoare triple {3557#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {3557#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 11:56:24,983 INFO L272 TraceCheckUtils]: 63: Hoare triple {3557#(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)); {3361#true} is VALID [2022-04-27 11:56:24,983 INFO L290 TraceCheckUtils]: 64: Hoare triple {3361#true} ~cond := #in~cond; {3361#true} is VALID [2022-04-27 11:56:24,983 INFO L290 TraceCheckUtils]: 65: Hoare triple {3361#true} assume !(0 == ~cond); {3361#true} is VALID [2022-04-27 11:56:24,984 INFO L290 TraceCheckUtils]: 66: Hoare triple {3361#true} assume true; {3361#true} is VALID [2022-04-27 11:56:24,984 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {3361#true} {3557#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #50#return; {3557#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 11:56:24,985 INFO L290 TraceCheckUtils]: 68: Hoare triple {3557#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {3579#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 11:56:24,985 INFO L272 TraceCheckUtils]: 69: Hoare triple {3579#(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)); {3583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:24,985 INFO L290 TraceCheckUtils]: 70: Hoare triple {3583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:24,986 INFO L290 TraceCheckUtils]: 71: Hoare triple {3587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3362#false} is VALID [2022-04-27 11:56:24,986 INFO L290 TraceCheckUtils]: 72: Hoare triple {3362#false} assume !false; {3362#false} is VALID [2022-04-27 11:56:24,986 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 11:56:24,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:56:25,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:25,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525254844] [2022-04-27 11:56:25,267 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:25,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059192208] [2022-04-27 11:56:25,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059192208] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:56:25,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:56:25,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 11:56:25,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077723823] [2022-04-27 11:56:25,267 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 11:56:25,267 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 73 [2022-04-27 11:56:25,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:25,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 11:56:25,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:25,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:56:25,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:25,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:56:25,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:56:25,305 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 11:56:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:26,174 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-27 11:56:26,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 11:56:26,174 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 73 [2022-04-27 11:56:26,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 11:56:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-04-27 11:56:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 11:56:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-04-27 11:56:26,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 58 transitions. [2022-04-27 11:56:26,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:26,220 INFO L225 Difference]: With dead ends: 54 [2022-04-27 11:56:26,220 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 11:56:26,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:56:26,221 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:26,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 287 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:56:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 11:56:26,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-27 11:56:26,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:26,243 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), 13 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 11:56:26,243 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), 13 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 11:56:26,243 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), 13 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 11:56:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:26,245 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-27 11:56:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-27 11:56:26,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:26,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:26,245 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), 13 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 49 states. [2022-04-27 11:56:26,245 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), 13 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 49 states. [2022-04-27 11:56:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:26,247 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-27 11:56:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-27 11:56:26,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:26,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:26,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:26,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:26,247 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), 13 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 11:56:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-04-27 11:56:26,248 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 73 [2022-04-27 11:56:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:26,248 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-04-27 11:56:26,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 11:56:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-27 11:56:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-27 11:56:26,249 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:26,249 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:26,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 11:56:26,454 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 11:56:26,454 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:26,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash 634613349, now seen corresponding path program 9 times [2022-04-27 11:56:26,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:26,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880910441] [2022-04-27 11:56:26,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:26,464 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:26,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1031626299] [2022-04-27 11:56:26,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:56:26,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:26,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:26,465 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 11:56:26,466 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 11:56:27,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-27 11:56:27,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:56:27,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-27 11:56:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:27,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:28,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {3898#true} call ULTIMATE.init(); {3898#true} is VALID [2022-04-27 11:56:28,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {3898#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); {3898#true} is VALID [2022-04-27 11:56:28,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-27 11:56:28,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3898#true} {3898#true} #56#return; {3898#true} is VALID [2022-04-27 11:56:28,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {3898#true} call #t~ret5 := main(); {3898#true} is VALID [2022-04-27 11:56:28,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {3898#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3918#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:28,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {3918#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3918#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:28,015 INFO L272 TraceCheckUtils]: 7: Hoare triple {3918#(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)); {3898#true} is VALID [2022-04-27 11:56:28,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-27 11:56:28,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-27 11:56:28,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-27 11:56:28,016 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3898#true} {3918#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {3918#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:28,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {3918#(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; {3940#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 11:56:28,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {3940#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {3940#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 11:56:28,017 INFO L272 TraceCheckUtils]: 14: Hoare triple {3940#(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)); {3898#true} is VALID [2022-04-27 11:56:28,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-27 11:56:28,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-27 11:56:28,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-27 11:56:28,018 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3898#true} {3940#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {3940#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 11:56:28,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {3940#(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; {3962#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 11:56:28,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {3962#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {3962#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 11:56:28,018 INFO L272 TraceCheckUtils]: 21: Hoare triple {3962#(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)); {3898#true} is VALID [2022-04-27 11:56:28,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-27 11:56:28,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-27 11:56:28,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-27 11:56:28,019 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3898#true} {3962#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #50#return; {3962#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 11:56:28,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {3962#(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; {3984#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 11:56:28,020 INFO L290 TraceCheckUtils]: 27: Hoare triple {3984#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !false; {3984#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 11:56:28,020 INFO L272 TraceCheckUtils]: 28: Hoare triple {3984#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~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)); {3898#true} is VALID [2022-04-27 11:56:28,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-27 11:56:28,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-27 11:56:28,020 INFO L290 TraceCheckUtils]: 31: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-27 11:56:28,021 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3898#true} {3984#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} #50#return; {3984#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 11:56:28,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {3984#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~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; {4006#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 11:56:28,021 INFO L290 TraceCheckUtils]: 34: Hoare triple {4006#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !false; {4006#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 11:56:28,021 INFO L272 TraceCheckUtils]: 35: Hoare triple {4006#(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)); {3898#true} is VALID [2022-04-27 11:56:28,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-27 11:56:28,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-27 11:56:28,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-27 11:56:28,022 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3898#true} {4006#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} #50#return; {4006#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 11:56:28,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {4006#(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; {4028#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 11:56:28,023 INFO L290 TraceCheckUtils]: 41: Hoare triple {4028#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {4028#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 11:56:28,023 INFO L272 TraceCheckUtils]: 42: Hoare triple {4028#(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)); {3898#true} is VALID [2022-04-27 11:56:28,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-27 11:56:28,023 INFO L290 TraceCheckUtils]: 44: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-27 11:56:28,023 INFO L290 TraceCheckUtils]: 45: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-27 11:56:28,024 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3898#true} {4028#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {4028#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 11:56:28,024 INFO L290 TraceCheckUtils]: 47: Hoare triple {4028#(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; {4050#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 11:56:28,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {4050#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {4050#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 11:56:28,024 INFO L272 TraceCheckUtils]: 49: Hoare triple {4050#(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)); {3898#true} is VALID [2022-04-27 11:56:28,025 INFO L290 TraceCheckUtils]: 50: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-27 11:56:28,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-27 11:56:28,025 INFO L290 TraceCheckUtils]: 52: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-27 11:56:28,025 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3898#true} {4050#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {4050#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 11:56:28,026 INFO L290 TraceCheckUtils]: 54: Hoare triple {4050#(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; {4072#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 11:56:28,026 INFO L290 TraceCheckUtils]: 55: Hoare triple {4072#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {4072#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 11:56:28,026 INFO L272 TraceCheckUtils]: 56: Hoare triple {4072#(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)); {3898#true} is VALID [2022-04-27 11:56:28,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-27 11:56:28,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-27 11:56:28,026 INFO L290 TraceCheckUtils]: 59: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-27 11:56:28,027 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3898#true} {4072#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {4072#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 11:56:28,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {4072#(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; {4094#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 11:56:28,028 INFO L290 TraceCheckUtils]: 62: Hoare triple {4094#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {4094#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 11:56:28,028 INFO L272 TraceCheckUtils]: 63: Hoare triple {4094#(and (= 7 (+ (- 1) main_~y~0)) (= 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)); {3898#true} is VALID [2022-04-27 11:56:28,028 INFO L290 TraceCheckUtils]: 64: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-27 11:56:28,028 INFO L290 TraceCheckUtils]: 65: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-27 11:56:28,028 INFO L290 TraceCheckUtils]: 66: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-27 11:56:28,028 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {3898#true} {4094#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #50#return; {4094#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 11:56:28,029 INFO L290 TraceCheckUtils]: 68: Hoare triple {4094#(and (= 7 (+ (- 1) main_~y~0)) (= 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; {4116#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 11:56:28,029 INFO L290 TraceCheckUtils]: 69: Hoare triple {4116#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {4116#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 11:56:28,029 INFO L272 TraceCheckUtils]: 70: Hoare triple {4116#(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)); {3898#true} is VALID [2022-04-27 11:56:28,029 INFO L290 TraceCheckUtils]: 71: Hoare triple {3898#true} ~cond := #in~cond; {3898#true} is VALID [2022-04-27 11:56:28,029 INFO L290 TraceCheckUtils]: 72: Hoare triple {3898#true} assume !(0 == ~cond); {3898#true} is VALID [2022-04-27 11:56:28,030 INFO L290 TraceCheckUtils]: 73: Hoare triple {3898#true} assume true; {3898#true} is VALID [2022-04-27 11:56:28,030 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {3898#true} {4116#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #50#return; {4116#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 11:56:28,031 INFO L290 TraceCheckUtils]: 75: Hoare triple {4116#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {4138#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 11:56:28,031 INFO L272 TraceCheckUtils]: 76: Hoare triple {4138#(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)); {4142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:28,032 INFO L290 TraceCheckUtils]: 77: Hoare triple {4142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:28,032 INFO L290 TraceCheckUtils]: 78: Hoare triple {4146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3899#false} is VALID [2022-04-27 11:56:28,032 INFO L290 TraceCheckUtils]: 79: Hoare triple {3899#false} assume !false; {3899#false} is VALID [2022-04-27 11:56:28,032 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 11:56:28,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:56:28,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:28,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880910441] [2022-04-27 11:56:28,288 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:28,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031626299] [2022-04-27 11:56:28,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031626299] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:56:28,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:56:28,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-27 11:56:28,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102366885] [2022-04-27 11:56:28,288 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 11:56:28,289 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 80 [2022-04-27 11:56:28,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:28,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 11:56:28,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:28,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 11:56:28,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:28,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 11:56:28,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:56:28,329 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 11:56:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:29,351 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-27 11:56:29,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 11:56:29,352 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 80 [2022-04-27 11:56:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 11:56:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-27 11:56:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 11:56:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-27 11:56:29,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 62 transitions. [2022-04-27 11:56:29,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:29,401 INFO L225 Difference]: With dead ends: 57 [2022-04-27 11:56:29,401 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 11:56:29,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-27 11:56:29,402 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:29,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 324 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:56:29,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 11:56:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 11:56:29,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:29,427 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), 14 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:56:29,427 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), 14 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:56:29,427 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), 14 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:56:29,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:29,428 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-27 11:56:29,428 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-27 11:56:29,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:29,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:29,429 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), 14 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 52 states. [2022-04-27 11:56:29,429 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), 14 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 52 states. [2022-04-27 11:56:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:29,430 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-27 11:56:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-27 11:56:29,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:29,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:29,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:29,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:29,431 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), 14 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:56:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-04-27 11:56:29,432 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 80 [2022-04-27 11:56:29,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:29,432 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-04-27 11:56:29,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 11:56:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-27 11:56:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-27 11:56:29,432 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:29,432 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:29,439 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 11:56:29,633 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 11:56:29,633 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:29,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1567631086, now seen corresponding path program 10 times [2022-04-27 11:56:29,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:29,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907225328] [2022-04-27 11:56:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:29,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:29,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [306745364] [2022-04-27 11:56:29,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:56:29,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:29,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:29,644 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 11:56:29,645 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 11:56:30,307 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:56:30,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:56:30,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 11:56:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:30,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:30,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {4473#true} call ULTIMATE.init(); {4473#true} is VALID [2022-04-27 11:56:30,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {4473#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); {4473#true} is VALID [2022-04-27 11:56:30,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {4473#true} assume true; {4473#true} is VALID [2022-04-27 11:56:30,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4473#true} {4473#true} #56#return; {4473#true} is VALID [2022-04-27 11:56:30,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {4473#true} call #t~ret5 := main(); {4473#true} is VALID [2022-04-27 11:56:30,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {4473#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4493#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:30,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {4493#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4493#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:30,869 INFO L272 TraceCheckUtils]: 7: Hoare triple {4493#(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)); {4473#true} is VALID [2022-04-27 11:56:30,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {4473#true} ~cond := #in~cond; {4473#true} is VALID [2022-04-27 11:56:30,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {4473#true} assume !(0 == ~cond); {4473#true} is VALID [2022-04-27 11:56:30,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {4473#true} assume true; {4473#true} is VALID [2022-04-27 11:56:30,870 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4473#true} {4493#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {4493#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:30,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {4493#(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; {4515#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 11:56:30,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {4515#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {4515#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 11:56:30,871 INFO L272 TraceCheckUtils]: 14: Hoare triple {4515#(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)); {4473#true} is VALID [2022-04-27 11:56:30,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {4473#true} ~cond := #in~cond; {4473#true} is VALID [2022-04-27 11:56:30,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {4473#true} assume !(0 == ~cond); {4473#true} is VALID [2022-04-27 11:56:30,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {4473#true} assume true; {4473#true} is VALID [2022-04-27 11:56:30,872 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4473#true} {4515#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {4515#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 11:56:30,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {4515#(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; {4537#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 11:56:30,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {4537#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {4537#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 11:56:30,873 INFO L272 TraceCheckUtils]: 21: Hoare triple {4537#(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)); {4473#true} is VALID [2022-04-27 11:56:30,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {4473#true} ~cond := #in~cond; {4473#true} is VALID [2022-04-27 11:56:30,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {4473#true} assume !(0 == ~cond); {4473#true} is VALID [2022-04-27 11:56:30,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {4473#true} assume true; {4473#true} is VALID [2022-04-27 11:56:30,874 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4473#true} {4537#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {4537#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 11:56:30,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {4537#(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; {4559#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 11:56:30,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {4559#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {4559#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 11:56:30,875 INFO L272 TraceCheckUtils]: 28: Hoare triple {4559#(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)); {4473#true} is VALID [2022-04-27 11:56:30,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {4473#true} ~cond := #in~cond; {4473#true} is VALID [2022-04-27 11:56:30,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {4473#true} assume !(0 == ~cond); {4473#true} is VALID [2022-04-27 11:56:30,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {4473#true} assume true; {4473#true} is VALID [2022-04-27 11:56:30,875 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4473#true} {4559#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #50#return; {4559#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 11:56:30,876 INFO L290 TraceCheckUtils]: 33: Hoare triple {4559#(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; {4581#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 11:56:30,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {4581#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {4581#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 11:56:30,876 INFO L272 TraceCheckUtils]: 35: Hoare triple {4581#(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)); {4473#true} is VALID [2022-04-27 11:56:30,876 INFO L290 TraceCheckUtils]: 36: Hoare triple {4473#true} ~cond := #in~cond; {4473#true} is VALID [2022-04-27 11:56:30,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {4473#true} assume !(0 == ~cond); {4473#true} is VALID [2022-04-27 11:56:30,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {4473#true} assume true; {4473#true} is VALID [2022-04-27 11:56:30,877 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4473#true} {4581#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #50#return; {4581#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 11:56:30,877 INFO L290 TraceCheckUtils]: 40: Hoare triple {4581#(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; {4603#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 11:56:30,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {4603#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {4603#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 11:56:30,878 INFO L272 TraceCheckUtils]: 42: Hoare triple {4603#(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)); {4473#true} is VALID [2022-04-27 11:56:30,878 INFO L290 TraceCheckUtils]: 43: Hoare triple {4473#true} ~cond := #in~cond; {4473#true} is VALID [2022-04-27 11:56:30,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {4473#true} assume !(0 == ~cond); {4473#true} is VALID [2022-04-27 11:56:30,878 INFO L290 TraceCheckUtils]: 45: Hoare triple {4473#true} assume true; {4473#true} is VALID [2022-04-27 11:56:30,879 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4473#true} {4603#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #50#return; {4603#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 11:56:30,879 INFO L290 TraceCheckUtils]: 47: Hoare triple {4603#(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; {4625#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 11:56:30,879 INFO L290 TraceCheckUtils]: 48: Hoare triple {4625#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {4625#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 11:56:30,879 INFO L272 TraceCheckUtils]: 49: Hoare triple {4625#(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)); {4473#true} is VALID [2022-04-27 11:56:30,880 INFO L290 TraceCheckUtils]: 50: Hoare triple {4473#true} ~cond := #in~cond; {4473#true} is VALID [2022-04-27 11:56:30,880 INFO L290 TraceCheckUtils]: 51: Hoare triple {4473#true} assume !(0 == ~cond); {4473#true} is VALID [2022-04-27 11:56:30,880 INFO L290 TraceCheckUtils]: 52: Hoare triple {4473#true} assume true; {4473#true} is VALID [2022-04-27 11:56:30,880 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4473#true} {4625#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {4625#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 11:56:30,881 INFO L290 TraceCheckUtils]: 54: Hoare triple {4625#(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; {4647#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 11:56:30,881 INFO L290 TraceCheckUtils]: 55: Hoare triple {4647#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {4647#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 11:56:30,881 INFO L272 TraceCheckUtils]: 56: Hoare triple {4647#(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)); {4473#true} is VALID [2022-04-27 11:56:30,881 INFO L290 TraceCheckUtils]: 57: Hoare triple {4473#true} ~cond := #in~cond; {4473#true} is VALID [2022-04-27 11:56:30,881 INFO L290 TraceCheckUtils]: 58: Hoare triple {4473#true} assume !(0 == ~cond); {4473#true} is VALID [2022-04-27 11:56:30,881 INFO L290 TraceCheckUtils]: 59: Hoare triple {4473#true} assume true; {4473#true} is VALID [2022-04-27 11:56:30,882 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4473#true} {4647#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {4647#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 11:56:30,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {4647#(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; {4669#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:56:30,883 INFO L290 TraceCheckUtils]: 62: Hoare triple {4669#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !false; {4669#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:56:30,883 INFO L272 TraceCheckUtils]: 63: Hoare triple {4669#(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)); {4473#true} is VALID [2022-04-27 11:56:30,883 INFO L290 TraceCheckUtils]: 64: Hoare triple {4473#true} ~cond := #in~cond; {4473#true} is VALID [2022-04-27 11:56:30,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {4473#true} assume !(0 == ~cond); {4473#true} is VALID [2022-04-27 11:56:30,883 INFO L290 TraceCheckUtils]: 66: Hoare triple {4473#true} assume true; {4473#true} is VALID [2022-04-27 11:56:30,884 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {4473#true} {4669#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #50#return; {4669#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:56:30,884 INFO L290 TraceCheckUtils]: 68: Hoare triple {4669#(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; {4691#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 11:56:30,884 INFO L290 TraceCheckUtils]: 69: Hoare triple {4691#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} assume !false; {4691#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 11:56:30,884 INFO L272 TraceCheckUtils]: 70: Hoare triple {4691#(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)); {4473#true} is VALID [2022-04-27 11:56:30,885 INFO L290 TraceCheckUtils]: 71: Hoare triple {4473#true} ~cond := #in~cond; {4473#true} is VALID [2022-04-27 11:56:30,885 INFO L290 TraceCheckUtils]: 72: Hoare triple {4473#true} assume !(0 == ~cond); {4473#true} is VALID [2022-04-27 11:56:30,885 INFO L290 TraceCheckUtils]: 73: Hoare triple {4473#true} assume true; {4473#true} is VALID [2022-04-27 11:56:30,885 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {4473#true} {4691#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} #50#return; {4691#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 11:56:30,886 INFO L290 TraceCheckUtils]: 75: Hoare triple {4691#(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; {4713#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 11:56:30,886 INFO L290 TraceCheckUtils]: 76: Hoare triple {4713#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {4713#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 11:56:30,886 INFO L272 TraceCheckUtils]: 77: Hoare triple {4713#(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)); {4473#true} is VALID [2022-04-27 11:56:30,886 INFO L290 TraceCheckUtils]: 78: Hoare triple {4473#true} ~cond := #in~cond; {4473#true} is VALID [2022-04-27 11:56:30,886 INFO L290 TraceCheckUtils]: 79: Hoare triple {4473#true} assume !(0 == ~cond); {4473#true} is VALID [2022-04-27 11:56:30,886 INFO L290 TraceCheckUtils]: 80: Hoare triple {4473#true} assume true; {4473#true} is VALID [2022-04-27 11:56:30,887 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {4473#true} {4713#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #50#return; {4713#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 11:56:30,888 INFO L290 TraceCheckUtils]: 82: Hoare triple {4713#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {4735#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 11:56:30,888 INFO L272 TraceCheckUtils]: 83: Hoare triple {4735#(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)); {4739#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:30,889 INFO L290 TraceCheckUtils]: 84: Hoare triple {4739#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4743#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:30,889 INFO L290 TraceCheckUtils]: 85: Hoare triple {4743#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4474#false} is VALID [2022-04-27 11:56:30,889 INFO L290 TraceCheckUtils]: 86: Hoare triple {4474#false} assume !false; {4474#false} is VALID [2022-04-27 11:56:30,889 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 11:56:30,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:56:31,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:31,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907225328] [2022-04-27 11:56:31,179 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:31,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306745364] [2022-04-27 11:56:31,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306745364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:56:31,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:56:31,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-27 11:56:31,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342266170] [2022-04-27 11:56:31,180 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 11:56:31,180 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 87 [2022-04-27 11:56:31,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:31,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:56:31,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:31,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:56:31,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:31,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:56:31,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:56:31,223 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:56:32,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:32,085 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-27 11:56:32,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 11:56:32,086 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 87 [2022-04-27 11:56:32,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:56:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 66 transitions. [2022-04-27 11:56:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:56:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 66 transitions. [2022-04-27 11:56:32,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 66 transitions. [2022-04-27 11:56:32,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:32,127 INFO L225 Difference]: With dead ends: 60 [2022-04-27 11:56:32,128 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 11:56:32,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 81 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 11:56:32,128 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:32,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 363 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:56:32,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 11:56:32,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 11:56:32,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:32,156 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), 15 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:56:32,156 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), 15 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:56:32,156 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), 15 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:56:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:32,157 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-27 11:56:32,157 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-04-27 11:56:32,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:32,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:32,158 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), 15 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 55 states. [2022-04-27 11:56:32,158 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), 15 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 55 states. [2022-04-27 11:56:32,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:32,160 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-27 11:56:32,160 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-04-27 11:56:32,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:32,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:32,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:32,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:32,161 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), 15 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 11:56:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2022-04-27 11:56:32,162 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 87 [2022-04-27 11:56:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:32,163 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2022-04-27 11:56:32,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:56:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-04-27 11:56:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-27 11:56:32,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:32,168 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:32,174 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 11:56:32,375 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 11:56:32,375 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:32,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:32,376 INFO L85 PathProgramCache]: Analyzing trace with hash 169050565, now seen corresponding path program 11 times [2022-04-27 11:56:32,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:32,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774068520] [2022-04-27 11:56:32,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:32,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:32,395 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:32,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352894809] [2022-04-27 11:56:32,395 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:56:32,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:32,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:32,396 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 11:56:32,397 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 11:56:33,161 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-27 11:56:33,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:56:33,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-27 11:56:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:33,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:33,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {5086#true} call ULTIMATE.init(); {5086#true} is VALID [2022-04-27 11:56:33,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {5086#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); {5086#true} is VALID [2022-04-27 11:56:33,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-04-27 11:56:33,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5086#true} {5086#true} #56#return; {5086#true} is VALID [2022-04-27 11:56:33,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {5086#true} call #t~ret5 := main(); {5086#true} is VALID [2022-04-27 11:56:33,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {5086#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5106#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:33,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {5106#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5106#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:33,993 INFO L272 TraceCheckUtils]: 7: Hoare triple {5106#(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)); {5086#true} is VALID [2022-04-27 11:56:33,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {5086#true} ~cond := #in~cond; {5086#true} is VALID [2022-04-27 11:56:33,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {5086#true} assume !(0 == ~cond); {5086#true} is VALID [2022-04-27 11:56:33,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-04-27 11:56:33,993 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5086#true} {5106#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {5106#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:56:33,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {5106#(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; {5128#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 11:56:33,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {5128#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {5128#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 11:56:33,994 INFO L272 TraceCheckUtils]: 14: Hoare triple {5128#(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)); {5086#true} is VALID [2022-04-27 11:56:33,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {5086#true} ~cond := #in~cond; {5086#true} is VALID [2022-04-27 11:56:33,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {5086#true} assume !(0 == ~cond); {5086#true} is VALID [2022-04-27 11:56:33,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-04-27 11:56:33,994 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5086#true} {5128#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {5128#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 11:56:33,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {5128#(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; {5150#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 11:56:33,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {5150#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {5150#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 11:56:33,995 INFO L272 TraceCheckUtils]: 21: Hoare triple {5150#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< 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)); {5086#true} is VALID [2022-04-27 11:56:33,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {5086#true} ~cond := #in~cond; {5086#true} is VALID [2022-04-27 11:56:33,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {5086#true} assume !(0 == ~cond); {5086#true} is VALID [2022-04-27 11:56:34,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-04-27 11:56:34,000 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5086#true} {5150#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #50#return; {5150#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 11:56:34,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {5150#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< 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; {5172#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 11:56:34,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {5172#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} assume !false; {5172#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 11:56:34,001 INFO L272 TraceCheckUtils]: 28: Hoare triple {5172#(and (< 1 main_~k~0) (= 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)); {5086#true} is VALID [2022-04-27 11:56:34,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {5086#true} ~cond := #in~cond; {5086#true} is VALID [2022-04-27 11:56:34,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {5086#true} assume !(0 == ~cond); {5086#true} is VALID [2022-04-27 11:56:34,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-04-27 11:56:34,002 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5086#true} {5172#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} #50#return; {5172#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 11:56:34,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {5172#(and (< 1 main_~k~0) (= 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; {5194#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 11:56:34,002 INFO L290 TraceCheckUtils]: 34: Hoare triple {5194#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {5194#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 11:56:34,003 INFO L272 TraceCheckUtils]: 35: Hoare triple {5194#(and (< 1 main_~k~0) (= 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)); {5086#true} is VALID [2022-04-27 11:56:34,003 INFO L290 TraceCheckUtils]: 36: Hoare triple {5086#true} ~cond := #in~cond; {5086#true} is VALID [2022-04-27 11:56:34,003 INFO L290 TraceCheckUtils]: 37: Hoare triple {5086#true} assume !(0 == ~cond); {5086#true} is VALID [2022-04-27 11:56:34,003 INFO L290 TraceCheckUtils]: 38: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-04-27 11:56:34,003 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5086#true} {5194#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #50#return; {5194#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 11:56:34,003 INFO L290 TraceCheckUtils]: 40: Hoare triple {5194#(and (< 1 main_~k~0) (= 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; {5216#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 11:56:34,004 INFO L290 TraceCheckUtils]: 41: Hoare triple {5216#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {5216#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 11:56:34,004 INFO L272 TraceCheckUtils]: 42: Hoare triple {5216#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) 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)); {5086#true} is VALID [2022-04-27 11:56:34,004 INFO L290 TraceCheckUtils]: 43: Hoare triple {5086#true} ~cond := #in~cond; {5086#true} is VALID [2022-04-27 11:56:34,004 INFO L290 TraceCheckUtils]: 44: Hoare triple {5086#true} assume !(0 == ~cond); {5086#true} is VALID [2022-04-27 11:56:34,004 INFO L290 TraceCheckUtils]: 45: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-04-27 11:56:34,004 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5086#true} {5216#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #50#return; {5216#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 11:56:34,005 INFO L290 TraceCheckUtils]: 47: Hoare triple {5216#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) 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; {5238#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 11:56:34,005 INFO L290 TraceCheckUtils]: 48: Hoare triple {5238#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} assume !false; {5238#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 11:56:34,005 INFO L272 TraceCheckUtils]: 49: Hoare triple {5238#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 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)); {5086#true} is VALID [2022-04-27 11:56:34,005 INFO L290 TraceCheckUtils]: 50: Hoare triple {5086#true} ~cond := #in~cond; {5086#true} is VALID [2022-04-27 11:56:34,005 INFO L290 TraceCheckUtils]: 51: Hoare triple {5086#true} assume !(0 == ~cond); {5086#true} is VALID [2022-04-27 11:56:34,005 INFO L290 TraceCheckUtils]: 52: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-04-27 11:56:34,006 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5086#true} {5238#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} #50#return; {5238#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 11:56:34,006 INFO L290 TraceCheckUtils]: 54: Hoare triple {5238#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 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; {5260#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:56:34,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {5260#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !false; {5260#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:56:34,006 INFO L272 TraceCheckUtils]: 56: Hoare triple {5260#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 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)); {5086#true} is VALID [2022-04-27 11:56:34,006 INFO L290 TraceCheckUtils]: 57: Hoare triple {5086#true} ~cond := #in~cond; {5086#true} is VALID [2022-04-27 11:56:34,006 INFO L290 TraceCheckUtils]: 58: Hoare triple {5086#true} assume !(0 == ~cond); {5086#true} is VALID [2022-04-27 11:56:34,006 INFO L290 TraceCheckUtils]: 59: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-04-27 11:56:34,007 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5086#true} {5260#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #50#return; {5260#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:56:34,007 INFO L290 TraceCheckUtils]: 61: Hoare triple {5260#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 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; {5282#(and (< 1 main_~k~0) (= 4 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 11:56:34,007 INFO L290 TraceCheckUtils]: 62: Hoare triple {5282#(and (< 1 main_~k~0) (= 4 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 6))} assume !false; {5282#(and (< 1 main_~k~0) (= 4 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 11:56:34,008 INFO L272 TraceCheckUtils]: 63: Hoare triple {5282#(and (< 1 main_~k~0) (= 4 (+ main_~c~0 (- 4))) (= (+ (- 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)); {5086#true} is VALID [2022-04-27 11:56:34,008 INFO L290 TraceCheckUtils]: 64: Hoare triple {5086#true} ~cond := #in~cond; {5292#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:34,008 INFO L290 TraceCheckUtils]: 65: Hoare triple {5292#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5296#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:34,008 INFO L290 TraceCheckUtils]: 66: Hoare triple {5296#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5296#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:34,009 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {5296#(not (= |__VERIFIER_assert_#in~cond| 0))} {5282#(and (< 1 main_~k~0) (= 4 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 6))} #50#return; {5303#(and (< 1 main_~k~0) (= 4 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 6) (= (+ (* 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 11:56:34,010 INFO L290 TraceCheckUtils]: 68: Hoare triple {5303#(and (< 1 main_~k~0) (= 4 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 6) (= (+ (* 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; {5307#(and (= main_~y~0 9) (< 1 main_~k~0) (= main_~c~0 9) (<= (+ (* 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))} is VALID [2022-04-27 11:56:34,010 INFO L290 TraceCheckUtils]: 69: Hoare triple {5307#(and (= main_~y~0 9) (< 1 main_~k~0) (= main_~c~0 9) (<= (+ (* 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))} assume !false; {5307#(and (= main_~y~0 9) (< 1 main_~k~0) (= main_~c~0 9) (<= (+ (* 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))} is VALID [2022-04-27 11:56:34,010 INFO L272 TraceCheckUtils]: 70: Hoare triple {5307#(and (= main_~y~0 9) (< 1 main_~k~0) (= main_~c~0 9) (<= (+ (* 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))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5086#true} is VALID [2022-04-27 11:56:34,011 INFO L290 TraceCheckUtils]: 71: Hoare triple {5086#true} ~cond := #in~cond; {5086#true} is VALID [2022-04-27 11:56:34,011 INFO L290 TraceCheckUtils]: 72: Hoare triple {5086#true} assume !(0 == ~cond); {5086#true} is VALID [2022-04-27 11:56:34,011 INFO L290 TraceCheckUtils]: 73: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-04-27 11:56:34,011 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {5086#true} {5307#(and (= main_~y~0 9) (< 1 main_~k~0) (= main_~c~0 9) (<= (+ (* 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))} #50#return; {5307#(and (= main_~y~0 9) (< 1 main_~k~0) (= main_~c~0 9) (<= (+ (* 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))} is VALID [2022-04-27 11:56:34,012 INFO L290 TraceCheckUtils]: 75: Hoare triple {5307#(and (= main_~y~0 9) (< 1 main_~k~0) (= main_~c~0 9) (<= (+ (* 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))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5329#(and (= 9 (+ (- 1) main_~y~0)) (<= (+ (div (+ (* main_~y~0 12) (* (- 13) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 6) (- 4) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)) (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1)) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 11:56:34,012 INFO L290 TraceCheckUtils]: 76: Hoare triple {5329#(and (= 9 (+ (- 1) main_~y~0)) (<= (+ (div (+ (* main_~y~0 12) (* (- 13) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 6) (- 4) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)) (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1)) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 9))} assume !false; {5329#(and (= 9 (+ (- 1) main_~y~0)) (<= (+ (div (+ (* main_~y~0 12) (* (- 13) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 6) (- 4) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)) (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1)) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 11:56:34,013 INFO L272 TraceCheckUtils]: 77: Hoare triple {5329#(and (= 9 (+ (- 1) main_~y~0)) (<= (+ (div (+ (* main_~y~0 12) (* (- 13) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 6) (- 4) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)) (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1)) (< 1 main_~k~0) (= (+ (- 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)); {5086#true} is VALID [2022-04-27 11:56:34,013 INFO L290 TraceCheckUtils]: 78: Hoare triple {5086#true} ~cond := #in~cond; {5086#true} is VALID [2022-04-27 11:56:34,013 INFO L290 TraceCheckUtils]: 79: Hoare triple {5086#true} assume !(0 == ~cond); {5086#true} is VALID [2022-04-27 11:56:34,013 INFO L290 TraceCheckUtils]: 80: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-04-27 11:56:34,013 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {5086#true} {5329#(and (= 9 (+ (- 1) main_~y~0)) (<= (+ (div (+ (* main_~y~0 12) (* (- 13) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 6) (- 4) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)) (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1)) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 9))} #50#return; {5329#(and (= 9 (+ (- 1) main_~y~0)) (<= (+ (div (+ (* main_~y~0 12) (* (- 13) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 6) (- 4) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)) (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1)) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 11:56:34,014 INFO L290 TraceCheckUtils]: 82: Hoare triple {5329#(and (= 9 (+ (- 1) main_~y~0)) (<= (+ (div (+ (* main_~y~0 12) (* (- 13) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 6) (- 4) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)) (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1)) (< 1 main_~k~0) (= (+ (- 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; {5351#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 3025) main_~x~0))} is VALID [2022-04-27 11:56:34,014 INFO L290 TraceCheckUtils]: 83: Hoare triple {5351#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 3025) main_~x~0))} assume !false; {5351#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 3025) main_~x~0))} is VALID [2022-04-27 11:56:34,014 INFO L272 TraceCheckUtils]: 84: Hoare triple {5351#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 3025) 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)); {5086#true} is VALID [2022-04-27 11:56:34,014 INFO L290 TraceCheckUtils]: 85: Hoare triple {5086#true} ~cond := #in~cond; {5292#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:34,015 INFO L290 TraceCheckUtils]: 86: Hoare triple {5292#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5296#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:34,015 INFO L290 TraceCheckUtils]: 87: Hoare triple {5296#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5296#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:34,015 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {5296#(not (= |__VERIFIER_assert_#in~cond| 0))} {5351#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 3025) main_~x~0))} #50#return; {5370#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 11:56:34,016 INFO L290 TraceCheckUtils]: 89: Hoare triple {5370#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !(~c~0 < ~k~0); {5374#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} is VALID [2022-04-27 11:56:34,016 INFO L272 TraceCheckUtils]: 90: Hoare triple {5374#(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)); {5378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:34,016 INFO L290 TraceCheckUtils]: 91: Hoare triple {5378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:34,017 INFO L290 TraceCheckUtils]: 92: Hoare triple {5382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5087#false} is VALID [2022-04-27 11:56:34,017 INFO L290 TraceCheckUtils]: 93: Hoare triple {5087#false} assume !false; {5087#false} is VALID [2022-04-27 11:56:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 76 proven. 206 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-04-27 11:56:34,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:59:06,455 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ 3 c_main_~y~0))) (= (+ (* 6 c_main_~y~0) (* .cse0 .cse0) 27) (+ (* .cse0 c_main_~k~0) (* 3 c_main_~k~0)))) (< (div (+ (* 1080 c_main_~y~0) (* 253 c_main_~y~0 c_main_~y~0) 1704 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 26 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) (+ (* 45 (* c_main_~y~0 c_main_~y~0)) (* 228 c_main_~y~0) 390 (div (+ (* (- 1) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (- 144) (* (- 73) c_main_~y~0 c_main_~y~0) (* (- 14) c_main_~y~0 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 (- 168))) (- 4)) (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 3))) (< (+ 6 c_main_~c~0) c_main_~k~0) (<= c_main_~k~0 (+ 5 c_main_~c~0))) is different from false [2022-04-27 11:59:14,928 WARN L833 $PredicateComparison]: unable to prove that (or (< (div (+ (* 337 c_main_~y~0 c_main_~y~0) (* 1668 c_main_~y~0) 3064 (* 30 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) (+ (* (* c_main_~y~0 c_main_~y~0) 54) (* 327 c_main_~y~0) (div (+ (* (- 121) 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) (- 400) (* (- 18) c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 360) c_main_~y~0)) (- 4)) (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 3) 666)) (< (+ 7 c_main_~c~0) c_main_~k~0) (<= c_main_~k~0 (+ 6 c_main_~c~0)) (let ((.cse0 (+ 4 c_main_~y~0))) (= (+ (* .cse0 c_main_~k~0) (* 3 c_main_~k~0)) (+ (* 6 c_main_~y~0) (* .cse0 .cse0) 33)))) is different from false [2022-04-27 11:59:23,900 WARN L833 $PredicateComparison]: unable to prove that (or (< (+ c_main_~c~0 8) c_main_~k~0) (<= c_main_~k~0 (+ 7 c_main_~c~0)) (< (div (+ (* 433 c_main_~y~0 c_main_~y~0) 5100 (* 34 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 2436 c_main_~y~0) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) (+ (* 63 (* c_main_~y~0 c_main_~y~0)) (* 444 c_main_~y~0) 1050 (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 3) (div (+ (* (- 22) c_main_~y~0 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) (- 900) (* (- 181) c_main_~y~0 c_main_~y~0) (* (- 660) c_main_~y~0)) (- 4)))) (let ((.cse0 (+ 5 c_main_~y~0))) (= (+ (* 6 c_main_~y~0) (* .cse0 .cse0) 39) (+ (* .cse0 c_main_~k~0) (* 3 c_main_~k~0))))) is different from false [2022-04-27 11:59:59,126 WARN L833 $PredicateComparison]: unable to prove that (or (< (div (+ (* 42 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 4608 c_main_~y~0) 11992 (* 661 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) (+ (div (+ (* (- 1680) c_main_~y~0) (* (- 30) c_main_~y~0 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) (* (- 337) c_main_~y~0 c_main_~y~0) (- 3136)) (- 4)) (* 732 c_main_~y~0) (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 3) 2214 (* 81 (* c_main_~y~0 c_main_~y~0)))) (forall ((main_~k~0 Int)) (or (= (+ (* 20 c_main_~y~0) 100 (* c_main_~y~0 c_main_~y~0)) (+ (* main_~k~0 c_main_~y~0) (* main_~k~0 10))) (<= main_~k~0 (+ 9 c_main_~c~0)) (< (+ c_main_~c~0 10) main_~k~0)))) is different from false [2022-04-27 12:00:01,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:00:01,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774068520] [2022-04-27 12:00:01,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:00:01,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352894809] [2022-04-27 12:00:01,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352894809] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:00:01,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:00:01,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-27 12:00:01,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056962353] [2022-04-27 12:00:01,214 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:00:01,215 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 14 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 94 [2022-04-27 12:00:01,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:00:01,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 14 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:00:01,277 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 12:00:01,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 12:00:01,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:00:01,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 12:00:01,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=818, Unknown=15, NotChecked=252, Total=1260 [2022-04-27 12:00:01,279 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 14 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:00:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:03,190 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-27 12:00:03,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 12:00:03,191 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 14 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 94 [2022-04-27 12:00:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:00:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 14 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:00:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 70 transitions. [2022-04-27 12:00:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 14 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:00:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 70 transitions. [2022-04-27 12:00:03,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 70 transitions. [2022-04-27 12:00:03,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:03,275 INFO L225 Difference]: With dead ends: 63 [2022-04-27 12:00:03,275 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 12:00:03,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 132.1s TimeCoverageRelationStatistics Valid=196, Invalid=995, Unknown=15, NotChecked=276, Total=1482 [2022-04-27 12:00:03,276 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:00:03,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 360 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 12:00:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 12:00:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 12:00:03,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:00:03,317 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), 16 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:00:03,317 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), 16 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:00:03,317 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), 16 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:00:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:03,319 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-27 12:00:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-27 12:00:03,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:03,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:03,320 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), 16 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-27 12:00:03,320 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), 16 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-27 12:00:03,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:03,322 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-27 12:00:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-27 12:00:03,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:03,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:03,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:00:03,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:00:03,322 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), 16 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:00:03,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2022-04-27 12:00:03,323 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 94 [2022-04-27 12:00:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:00:03,324 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2022-04-27 12:00:03,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 14 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:00:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-27 12:00:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 12:00:03,325 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:00:03,326 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:00:03,331 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 12:00:03,531 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 12:00:03,531 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:00:03,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:00:03,532 INFO L85 PathProgramCache]: Analyzing trace with hash 555039154, now seen corresponding path program 12 times [2022-04-27 12:00:03,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:00:03,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145395248] [2022-04-27 12:00:03,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:00:03,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:00:03,546 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:00:03,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136930659] [2022-04-27 12:00:03,546 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 12:00:03,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:03,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:00:03,547 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 12:00:03,548 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 12:00:04,218 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-27 12:00:04,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:00:04,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-27 12:00:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:00:04,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:00:04,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {5944#true} call ULTIMATE.init(); {5944#true} is VALID [2022-04-27 12:00:04,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {5944#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); {5944#true} is VALID [2022-04-27 12:00:04,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {5944#true} assume true; {5944#true} is VALID [2022-04-27 12:00:04,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5944#true} {5944#true} #56#return; {5944#true} is VALID [2022-04-27 12:00:04,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {5944#true} call #t~ret5 := main(); {5944#true} is VALID [2022-04-27 12:00:04,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {5944#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5964#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:04,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {5964#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5964#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:04,783 INFO L272 TraceCheckUtils]: 7: Hoare triple {5964#(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)); {5944#true} is VALID [2022-04-27 12:00:04,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {5944#true} ~cond := #in~cond; {5944#true} is VALID [2022-04-27 12:00:04,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {5944#true} assume !(0 == ~cond); {5944#true} is VALID [2022-04-27 12:00:04,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {5944#true} assume true; {5944#true} is VALID [2022-04-27 12:00:04,784 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5944#true} {5964#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {5964#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:04,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {5964#(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; {5986#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:00:04,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {5986#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {5986#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:00:04,785 INFO L272 TraceCheckUtils]: 14: Hoare triple {5986#(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)); {5944#true} is VALID [2022-04-27 12:00:04,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {5944#true} ~cond := #in~cond; {5944#true} is VALID [2022-04-27 12:00:04,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {5944#true} assume !(0 == ~cond); {5944#true} is VALID [2022-04-27 12:00:04,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {5944#true} assume true; {5944#true} is VALID [2022-04-27 12:00:04,786 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5944#true} {5986#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {5986#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:00:04,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {5986#(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; {6008#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:04,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {6008#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {6008#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:04,786 INFO L272 TraceCheckUtils]: 21: Hoare triple {6008#(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)); {5944#true} is VALID [2022-04-27 12:00:04,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {5944#true} ~cond := #in~cond; {5944#true} is VALID [2022-04-27 12:00:04,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {5944#true} assume !(0 == ~cond); {5944#true} is VALID [2022-04-27 12:00:04,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {5944#true} assume true; {5944#true} is VALID [2022-04-27 12:00:04,787 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5944#true} {6008#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #50#return; {6008#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:04,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {6008#(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; {6030#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 12:00:04,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {6030#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {6030#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 12:00:04,788 INFO L272 TraceCheckUtils]: 28: Hoare triple {6030#(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)); {5944#true} is VALID [2022-04-27 12:00:04,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {5944#true} ~cond := #in~cond; {5944#true} is VALID [2022-04-27 12:00:04,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {5944#true} assume !(0 == ~cond); {5944#true} is VALID [2022-04-27 12:00:04,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {5944#true} assume true; {5944#true} is VALID [2022-04-27 12:00:04,789 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5944#true} {6030#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #50#return; {6030#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 12:00:04,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {6030#(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; {6052#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 12:00:04,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {6052#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !false; {6052#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 12:00:04,789 INFO L272 TraceCheckUtils]: 35: Hoare triple {6052#(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)); {5944#true} is VALID [2022-04-27 12:00:04,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {5944#true} ~cond := #in~cond; {5944#true} is VALID [2022-04-27 12:00:04,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {5944#true} assume !(0 == ~cond); {5944#true} is VALID [2022-04-27 12:00:04,790 INFO L290 TraceCheckUtils]: 38: Hoare triple {5944#true} assume true; {5944#true} is VALID [2022-04-27 12:00:04,790 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5944#true} {6052#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #50#return; {6052#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 12:00:04,790 INFO L290 TraceCheckUtils]: 40: Hoare triple {6052#(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; {6074#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 12:00:04,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {6074#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} assume !false; {6074#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 12:00:04,791 INFO L272 TraceCheckUtils]: 42: Hoare triple {6074#(and (= (+ main_~c~0 (- 5)) 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)); {5944#true} is VALID [2022-04-27 12:00:04,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {5944#true} ~cond := #in~cond; {5944#true} is VALID [2022-04-27 12:00:04,791 INFO L290 TraceCheckUtils]: 44: Hoare triple {5944#true} assume !(0 == ~cond); {5944#true} is VALID [2022-04-27 12:00:04,791 INFO L290 TraceCheckUtils]: 45: Hoare triple {5944#true} assume true; {5944#true} is VALID [2022-04-27 12:00:04,791 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5944#true} {6074#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} #50#return; {6074#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 12:00:04,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {6074#(and (= (+ main_~c~0 (- 5)) 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; {6096#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-27 12:00:04,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {6096#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} assume !false; {6096#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-27 12:00:04,792 INFO L272 TraceCheckUtils]: 49: Hoare triple {6096#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5944#true} is VALID [2022-04-27 12:00:04,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {5944#true} ~cond := #in~cond; {5944#true} is VALID [2022-04-27 12:00:04,792 INFO L290 TraceCheckUtils]: 51: Hoare triple {5944#true} assume !(0 == ~cond); {5944#true} is VALID [2022-04-27 12:00:04,792 INFO L290 TraceCheckUtils]: 52: Hoare triple {5944#true} assume true; {5944#true} is VALID [2022-04-27 12:00:04,793 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5944#true} {6096#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} #50#return; {6096#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-27 12:00:04,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {6096#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6118#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:00:04,794 INFO L290 TraceCheckUtils]: 55: Hoare triple {6118#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {6118#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:00:04,794 INFO L272 TraceCheckUtils]: 56: Hoare triple {6118#(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)); {5944#true} is VALID [2022-04-27 12:00:04,794 INFO L290 TraceCheckUtils]: 57: Hoare triple {5944#true} ~cond := #in~cond; {5944#true} is VALID [2022-04-27 12:00:04,794 INFO L290 TraceCheckUtils]: 58: Hoare triple {5944#true} assume !(0 == ~cond); {5944#true} is VALID [2022-04-27 12:00:04,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {5944#true} assume true; {5944#true} is VALID [2022-04-27 12:00:04,794 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5944#true} {6118#(and (= 7 main_~y~0) (= 7 main_~c~0))} #50#return; {6118#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:00:04,795 INFO L290 TraceCheckUtils]: 61: Hoare triple {6118#(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; {6140#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 12:00:04,795 INFO L290 TraceCheckUtils]: 62: Hoare triple {6140#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {6140#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 12:00:04,795 INFO L272 TraceCheckUtils]: 63: Hoare triple {6140#(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)); {5944#true} is VALID [2022-04-27 12:00:04,795 INFO L290 TraceCheckUtils]: 64: Hoare triple {5944#true} ~cond := #in~cond; {5944#true} is VALID [2022-04-27 12:00:04,795 INFO L290 TraceCheckUtils]: 65: Hoare triple {5944#true} assume !(0 == ~cond); {5944#true} is VALID [2022-04-27 12:00:04,795 INFO L290 TraceCheckUtils]: 66: Hoare triple {5944#true} assume true; {5944#true} is VALID [2022-04-27 12:00:04,796 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {5944#true} {6140#(and (= main_~y~0 8) (= main_~c~0 8))} #50#return; {6140#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 12:00:04,796 INFO L290 TraceCheckUtils]: 68: Hoare triple {6140#(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; {6162#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 12:00:04,797 INFO L290 TraceCheckUtils]: 69: Hoare triple {6162#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {6162#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 12:00:04,797 INFO L272 TraceCheckUtils]: 70: Hoare triple {6162#(and (= main_~y~0 9) (= (+ (- 1) 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)); {5944#true} is VALID [2022-04-27 12:00:04,797 INFO L290 TraceCheckUtils]: 71: Hoare triple {5944#true} ~cond := #in~cond; {5944#true} is VALID [2022-04-27 12:00:04,797 INFO L290 TraceCheckUtils]: 72: Hoare triple {5944#true} assume !(0 == ~cond); {5944#true} is VALID [2022-04-27 12:00:04,797 INFO L290 TraceCheckUtils]: 73: Hoare triple {5944#true} assume true; {5944#true} is VALID [2022-04-27 12:00:04,797 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {5944#true} {6162#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #50#return; {6162#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 12:00:04,798 INFO L290 TraceCheckUtils]: 75: Hoare triple {6162#(and (= main_~y~0 9) (= (+ (- 1) 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; {6184#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:04,798 INFO L290 TraceCheckUtils]: 76: Hoare triple {6184#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} assume !false; {6184#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:04,798 INFO L272 TraceCheckUtils]: 77: Hoare triple {6184#(and (= main_~y~0 10) (= 8 (+ (- 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)); {5944#true} is VALID [2022-04-27 12:00:04,798 INFO L290 TraceCheckUtils]: 78: Hoare triple {5944#true} ~cond := #in~cond; {5944#true} is VALID [2022-04-27 12:00:04,798 INFO L290 TraceCheckUtils]: 79: Hoare triple {5944#true} assume !(0 == ~cond); {5944#true} is VALID [2022-04-27 12:00:04,798 INFO L290 TraceCheckUtils]: 80: Hoare triple {5944#true} assume true; {5944#true} is VALID [2022-04-27 12:00:04,799 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {5944#true} {6184#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} #50#return; {6184#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:04,799 INFO L290 TraceCheckUtils]: 82: Hoare triple {6184#(and (= main_~y~0 10) (= 8 (+ (- 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; {6206#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 12:00:04,800 INFO L290 TraceCheckUtils]: 83: Hoare triple {6206#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {6206#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 12:00:04,800 INFO L272 TraceCheckUtils]: 84: Hoare triple {6206#(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)); {5944#true} is VALID [2022-04-27 12:00:04,800 INFO L290 TraceCheckUtils]: 85: Hoare triple {5944#true} ~cond := #in~cond; {5944#true} is VALID [2022-04-27 12:00:04,800 INFO L290 TraceCheckUtils]: 86: Hoare triple {5944#true} assume !(0 == ~cond); {5944#true} is VALID [2022-04-27 12:00:04,800 INFO L290 TraceCheckUtils]: 87: Hoare triple {5944#true} assume true; {5944#true} is VALID [2022-04-27 12:00:04,800 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {5944#true} {6206#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {6206#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 12:00:04,801 INFO L290 TraceCheckUtils]: 89: Hoare triple {6206#(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; {6228#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} is VALID [2022-04-27 12:00:04,801 INFO L290 TraceCheckUtils]: 90: Hoare triple {6228#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} assume !false; {6228#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} is VALID [2022-04-27 12:00:04,801 INFO L272 TraceCheckUtils]: 91: Hoare triple {6228#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 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)); {5944#true} is VALID [2022-04-27 12:00:04,801 INFO L290 TraceCheckUtils]: 92: Hoare triple {5944#true} ~cond := #in~cond; {5944#true} is VALID [2022-04-27 12:00:04,801 INFO L290 TraceCheckUtils]: 93: Hoare triple {5944#true} assume !(0 == ~cond); {5944#true} is VALID [2022-04-27 12:00:04,801 INFO L290 TraceCheckUtils]: 94: Hoare triple {5944#true} assume true; {5944#true} is VALID [2022-04-27 12:00:04,802 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {5944#true} {6228#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} #50#return; {6228#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} is VALID [2022-04-27 12:00:04,802 INFO L290 TraceCheckUtils]: 96: Hoare triple {6228#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {6250#(and (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-27 12:00:04,803 INFO L272 TraceCheckUtils]: 97: Hoare triple {6250#(and (= (+ (- 1) main_~y~0) 11) (< 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)); {6254#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:00:04,803 INFO L290 TraceCheckUtils]: 98: Hoare triple {6254#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6258#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:00:04,804 INFO L290 TraceCheckUtils]: 99: Hoare triple {6258#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5945#false} is VALID [2022-04-27 12:00:04,804 INFO L290 TraceCheckUtils]: 100: Hoare triple {5945#false} assume !false; {5945#false} is VALID [2022-04-27 12:00:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 26 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 12:00:04,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:00:05,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:00:05,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145395248] [2022-04-27 12:00:05,110 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:00:05,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136930659] [2022-04-27 12:00:05,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136930659] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:00:05,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:00:05,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-27 12:00:05,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671961041] [2022-04-27 12:00:05,111 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:00:05,111 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 101 [2022-04-27 12:00:05,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:00:05,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:00:05,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:05,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 12:00:05,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:00:05,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 12:00:05,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-27 12:00:05,162 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:00:06,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:06,666 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-27 12:00:06,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 12:00:06,666 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 101 [2022-04-27 12:00:06,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:00:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:00:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-27 12:00:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:00:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-27 12:00:06,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 74 transitions. [2022-04-27 12:00:06,767 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 12:00:06,768 INFO L225 Difference]: With dead ends: 66 [2022-04-27 12:00:06,768 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 12:00:06,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-04-27 12:00:06,769 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 12:00:06,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 447 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 12:00:06,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 12:00:06,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 12:00:06,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:00:06,811 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), 17 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:00:06,811 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), 17 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:00:06,812 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), 17 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:00:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:06,823 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-27 12:00:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-27 12:00:06,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:06,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:06,824 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), 17 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 61 states. [2022-04-27 12:00:06,824 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), 17 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 61 states. [2022-04-27 12:00:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:06,832 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-27 12:00:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-27 12:00:06,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:06,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:06,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:00:06,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:00:06,832 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), 17 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:00:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-04-27 12:00:06,834 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 101 [2022-04-27 12:00:06,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:00:06,834 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-04-27 12:00:06,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:00:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-27 12:00:06,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-27 12:00:06,835 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:00:06,835 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:00:06,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 12:00:07,035 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 12:00:07,035 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:00:07,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:00:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2038312229, now seen corresponding path program 13 times [2022-04-27 12:00:07,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:00:07,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795885233] [2022-04-27 12:00:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:00:07,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:00:07,050 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:00:07,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1190828882] [2022-04-27 12:00:07,050 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 12:00:07,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:07,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:00:07,051 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 12:00:07,052 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 12:00:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:00:08,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-27 12:00:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:00:08,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:00:09,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {6633#true} call ULTIMATE.init(); {6633#true} is VALID [2022-04-27 12:00:09,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {6633#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); {6633#true} is VALID [2022-04-27 12:00:09,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {6633#true} assume true; {6633#true} is VALID [2022-04-27 12:00:09,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6633#true} {6633#true} #56#return; {6633#true} is VALID [2022-04-27 12:00:09,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {6633#true} call #t~ret5 := main(); {6633#true} is VALID [2022-04-27 12:00:09,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {6633#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {6653#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:09,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {6653#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6653#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:09,050 INFO L272 TraceCheckUtils]: 7: Hoare triple {6653#(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)); {6633#true} is VALID [2022-04-27 12:00:09,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {6633#true} ~cond := #in~cond; {6633#true} is VALID [2022-04-27 12:00:09,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {6633#true} assume !(0 == ~cond); {6633#true} is VALID [2022-04-27 12:00:09,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {6633#true} assume true; {6633#true} is VALID [2022-04-27 12:00:09,050 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6633#true} {6653#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {6653#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:09,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {6653#(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; {6675#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 12:00:09,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {6675#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {6675#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 12:00:09,051 INFO L272 TraceCheckUtils]: 14: Hoare triple {6675#(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)); {6633#true} is VALID [2022-04-27 12:00:09,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {6633#true} ~cond := #in~cond; {6633#true} is VALID [2022-04-27 12:00:09,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {6633#true} assume !(0 == ~cond); {6633#true} is VALID [2022-04-27 12:00:09,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {6633#true} assume true; {6633#true} is VALID [2022-04-27 12:00:09,052 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6633#true} {6675#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} #50#return; {6675#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 12:00:09,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {6675#(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; {6697#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:09,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {6697#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !false; {6697#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:09,053 INFO L272 TraceCheckUtils]: 21: Hoare triple {6697#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~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)); {6633#true} is VALID [2022-04-27 12:00:09,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {6633#true} ~cond := #in~cond; {6633#true} is VALID [2022-04-27 12:00:09,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {6633#true} assume !(0 == ~cond); {6633#true} is VALID [2022-04-27 12:00:09,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {6633#true} assume true; {6633#true} is VALID [2022-04-27 12:00:09,054 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6633#true} {6697#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #50#return; {6697#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:09,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {6697#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~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; {6719#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 12:00:09,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {6719#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {6719#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 12:00:09,079 INFO L272 TraceCheckUtils]: 28: Hoare triple {6719#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ 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)); {6633#true} is VALID [2022-04-27 12:00:09,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {6633#true} ~cond := #in~cond; {6633#true} is VALID [2022-04-27 12:00:09,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {6633#true} assume !(0 == ~cond); {6633#true} is VALID [2022-04-27 12:00:09,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {6633#true} assume true; {6633#true} is VALID [2022-04-27 12:00:09,079 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6633#true} {6719#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #50#return; {6719#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-27 12:00:09,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {6719#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ 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; {6741#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {6741#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} assume !false; {6741#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,081 INFO L272 TraceCheckUtils]: 35: Hoare triple {6741#(and (= 3 (+ (- 1) main_~y~0)) (= 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)); {6633#true} is VALID [2022-04-27 12:00:09,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {6633#true} ~cond := #in~cond; {6633#true} is VALID [2022-04-27 12:00:09,081 INFO L290 TraceCheckUtils]: 37: Hoare triple {6633#true} assume !(0 == ~cond); {6633#true} is VALID [2022-04-27 12:00:09,081 INFO L290 TraceCheckUtils]: 38: Hoare triple {6633#true} assume true; {6633#true} is VALID [2022-04-27 12:00:09,081 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6633#true} {6741#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} #50#return; {6741#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,082 INFO L290 TraceCheckUtils]: 40: Hoare triple {6741#(and (= 3 (+ (- 1) main_~y~0)) (= 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; {6763#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,082 INFO L290 TraceCheckUtils]: 41: Hoare triple {6763#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} assume !false; {6763#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,082 INFO L272 TraceCheckUtils]: 42: Hoare triple {6763#(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)); {6633#true} is VALID [2022-04-27 12:00:09,082 INFO L290 TraceCheckUtils]: 43: Hoare triple {6633#true} ~cond := #in~cond; {6633#true} is VALID [2022-04-27 12:00:09,082 INFO L290 TraceCheckUtils]: 44: Hoare triple {6633#true} assume !(0 == ~cond); {6633#true} is VALID [2022-04-27 12:00:09,082 INFO L290 TraceCheckUtils]: 45: Hoare triple {6633#true} assume true; {6633#true} is VALID [2022-04-27 12:00:09,083 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6633#true} {6763#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} #50#return; {6763#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,083 INFO L290 TraceCheckUtils]: 47: Hoare triple {6763#(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; {6785#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,084 INFO L290 TraceCheckUtils]: 48: Hoare triple {6785#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3) (< 0 main_~k~0))} assume !false; {6785#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,084 INFO L272 TraceCheckUtils]: 49: Hoare triple {6785#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 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)); {6633#true} is VALID [2022-04-27 12:00:09,084 INFO L290 TraceCheckUtils]: 50: Hoare triple {6633#true} ~cond := #in~cond; {6633#true} is VALID [2022-04-27 12:00:09,084 INFO L290 TraceCheckUtils]: 51: Hoare triple {6633#true} assume !(0 == ~cond); {6633#true} is VALID [2022-04-27 12:00:09,084 INFO L290 TraceCheckUtils]: 52: Hoare triple {6633#true} assume true; {6633#true} is VALID [2022-04-27 12:00:09,084 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6633#true} {6785#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3) (< 0 main_~k~0))} #50#return; {6785#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {6785#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 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; {6807#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,085 INFO L290 TraceCheckUtils]: 55: Hoare triple {6807#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3) (< 0 main_~k~0))} assume !false; {6807#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,085 INFO L272 TraceCheckUtils]: 56: Hoare triple {6807#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 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)); {6633#true} is VALID [2022-04-27 12:00:09,085 INFO L290 TraceCheckUtils]: 57: Hoare triple {6633#true} ~cond := #in~cond; {6633#true} is VALID [2022-04-27 12:00:09,085 INFO L290 TraceCheckUtils]: 58: Hoare triple {6633#true} assume !(0 == ~cond); {6633#true} is VALID [2022-04-27 12:00:09,085 INFO L290 TraceCheckUtils]: 59: Hoare triple {6633#true} assume true; {6633#true} is VALID [2022-04-27 12:00:09,086 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6633#true} {6807#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3) (< 0 main_~k~0))} #50#return; {6807#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {6807#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 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; {6829#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,087 INFO L290 TraceCheckUtils]: 62: Hoare triple {6829#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} assume !false; {6829#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,087 INFO L272 TraceCheckUtils]: 63: Hoare triple {6829#(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)); {6633#true} is VALID [2022-04-27 12:00:09,087 INFO L290 TraceCheckUtils]: 64: Hoare triple {6633#true} ~cond := #in~cond; {6633#true} is VALID [2022-04-27 12:00:09,087 INFO L290 TraceCheckUtils]: 65: Hoare triple {6633#true} assume !(0 == ~cond); {6633#true} is VALID [2022-04-27 12:00:09,087 INFO L290 TraceCheckUtils]: 66: Hoare triple {6633#true} assume true; {6633#true} is VALID [2022-04-27 12:00:09,087 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {6633#true} {6829#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} #50#return; {6829#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,088 INFO L290 TraceCheckUtils]: 68: Hoare triple {6829#(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; {6851#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,088 INFO L290 TraceCheckUtils]: 69: Hoare triple {6851#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {6851#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,088 INFO L272 TraceCheckUtils]: 70: Hoare triple {6851#(and (= main_~y~0 9) (= 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)); {6633#true} is VALID [2022-04-27 12:00:09,088 INFO L290 TraceCheckUtils]: 71: Hoare triple {6633#true} ~cond := #in~cond; {6633#true} is VALID [2022-04-27 12:00:09,088 INFO L290 TraceCheckUtils]: 72: Hoare triple {6633#true} assume !(0 == ~cond); {6633#true} is VALID [2022-04-27 12:00:09,088 INFO L290 TraceCheckUtils]: 73: Hoare triple {6633#true} assume true; {6633#true} is VALID [2022-04-27 12:00:09,089 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6633#true} {6851#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} #50#return; {6851#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,089 INFO L290 TraceCheckUtils]: 75: Hoare triple {6851#(and (= main_~y~0 9) (= 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; {6873#(and (= 9 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-27 12:00:09,090 INFO L290 TraceCheckUtils]: 76: Hoare triple {6873#(and (= 9 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 10))} assume !false; {6873#(and (= 9 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-27 12:00:09,090 INFO L272 TraceCheckUtils]: 77: Hoare triple {6873#(and (= 9 (+ (- 1) main_~y~0)) (< 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)); {6633#true} is VALID [2022-04-27 12:00:09,090 INFO L290 TraceCheckUtils]: 78: Hoare triple {6633#true} ~cond := #in~cond; {6633#true} is VALID [2022-04-27 12:00:09,090 INFO L290 TraceCheckUtils]: 79: Hoare triple {6633#true} assume !(0 == ~cond); {6633#true} is VALID [2022-04-27 12:00:09,090 INFO L290 TraceCheckUtils]: 80: Hoare triple {6633#true} assume true; {6633#true} is VALID [2022-04-27 12:00:09,090 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6633#true} {6873#(and (= 9 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 10))} #50#return; {6873#(and (= 9 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-27 12:00:09,091 INFO L290 TraceCheckUtils]: 82: Hoare triple {6873#(and (= 9 (+ (- 1) main_~y~0)) (< 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; {6895#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,091 INFO L290 TraceCheckUtils]: 83: Hoare triple {6895#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11) (< 0 main_~k~0))} assume !false; {6895#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,091 INFO L272 TraceCheckUtils]: 84: Hoare triple {6895#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11) (< 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)); {6633#true} is VALID [2022-04-27 12:00:09,091 INFO L290 TraceCheckUtils]: 85: Hoare triple {6633#true} ~cond := #in~cond; {6633#true} is VALID [2022-04-27 12:00:09,091 INFO L290 TraceCheckUtils]: 86: Hoare triple {6633#true} assume !(0 == ~cond); {6633#true} is VALID [2022-04-27 12:00:09,091 INFO L290 TraceCheckUtils]: 87: Hoare triple {6633#true} assume true; {6633#true} is VALID [2022-04-27 12:00:09,092 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6633#true} {6895#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11) (< 0 main_~k~0))} #50#return; {6895#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,092 INFO L290 TraceCheckUtils]: 89: Hoare triple {6895#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11) (< 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; {6917#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,093 INFO L290 TraceCheckUtils]: 90: Hoare triple {6917#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} assume !false; {6917#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,093 INFO L272 TraceCheckUtils]: 91: Hoare triple {6917#(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)); {6633#true} is VALID [2022-04-27 12:00:09,093 INFO L290 TraceCheckUtils]: 92: Hoare triple {6633#true} ~cond := #in~cond; {6633#true} is VALID [2022-04-27 12:00:09,093 INFO L290 TraceCheckUtils]: 93: Hoare triple {6633#true} assume !(0 == ~cond); {6633#true} is VALID [2022-04-27 12:00:09,093 INFO L290 TraceCheckUtils]: 94: Hoare triple {6633#true} assume true; {6633#true} is VALID [2022-04-27 12:00:09,093 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {6633#true} {6917#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} #50#return; {6917#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-27 12:00:09,094 INFO L290 TraceCheckUtils]: 96: Hoare triple {6917#(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; {6939#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 12:00:09,094 INFO L290 TraceCheckUtils]: 97: Hoare triple {6939#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !false; {6939#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 12:00:09,094 INFO L272 TraceCheckUtils]: 98: Hoare triple {6939#(and (< 12 main_~k~0) (<= 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)); {6633#true} is VALID [2022-04-27 12:00:09,094 INFO L290 TraceCheckUtils]: 99: Hoare triple {6633#true} ~cond := #in~cond; {6633#true} is VALID [2022-04-27 12:00:09,094 INFO L290 TraceCheckUtils]: 100: Hoare triple {6633#true} assume !(0 == ~cond); {6633#true} is VALID [2022-04-27 12:00:09,094 INFO L290 TraceCheckUtils]: 101: Hoare triple {6633#true} assume true; {6633#true} is VALID [2022-04-27 12:00:09,095 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {6633#true} {6939#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #50#return; {6939#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 12:00:09,096 INFO L290 TraceCheckUtils]: 103: Hoare triple {6939#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {6961#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-27 12:00:09,096 INFO L272 TraceCheckUtils]: 104: Hoare triple {6961#(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)); {6965#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:00:09,097 INFO L290 TraceCheckUtils]: 105: Hoare triple {6965#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6969#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:00:09,097 INFO L290 TraceCheckUtils]: 106: Hoare triple {6969#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6634#false} is VALID [2022-04-27 12:00:09,097 INFO L290 TraceCheckUtils]: 107: Hoare triple {6634#false} assume !false; {6634#false} is VALID [2022-04-27 12:00:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 28 proven. 273 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-27 12:00:09,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:00:10,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:00:10,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795885233] [2022-04-27 12:00:10,566 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:00:10,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190828882] [2022-04-27 12:00:10,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190828882] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:00:10,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:00:10,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-27 12:00:10,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247799213] [2022-04-27 12:00:10,568 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:00:10,568 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 16 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 108 [2022-04-27 12:00:10,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:00:10,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 16 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:00:10,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:10,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 12:00:10,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:00:10,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 12:00:10,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 12:00:10,625 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 16 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:00:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:12,856 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-27 12:00:12,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 12:00:12,856 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 16 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 108 [2022-04-27 12:00:12,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:00:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 16 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:00:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 78 transitions. [2022-04-27 12:00:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 16 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:00:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 78 transitions. [2022-04-27 12:00:12,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 78 transitions. [2022-04-27 12:00:12,909 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 12:00:12,911 INFO L225 Difference]: With dead ends: 69 [2022-04-27 12:00:12,911 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 12:00:12,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=251, Invalid=1009, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 12:00:12,912 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:00:12,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 492 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 12:00:12,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 12:00:12,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-27 12:00:12,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:00:12,948 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), 18 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:00:12,949 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), 18 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:00:12,949 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), 18 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:00:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:12,951 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 12:00:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 12:00:12,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:12,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:12,952 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), 18 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 64 states. [2022-04-27 12:00:12,952 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), 18 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 64 states. [2022-04-27 12:00:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:12,955 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 12:00:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 12:00:12,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:12,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:12,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:00:12,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:00:12,955 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), 18 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:00:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2022-04-27 12:00:12,957 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 108 [2022-04-27 12:00:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:00:12,957 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2022-04-27 12:00:12,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 16 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:00:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 12:00:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-27 12:00:12,959 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:00:12,959 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:00:12,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 12:00:13,164 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 12:00:13,164 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:00:13,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:00:13,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1009450414, now seen corresponding path program 14 times [2022-04-27 12:00:13,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:00:13,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615811892] [2022-04-27 12:00:13,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:00:13,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:00:13,178 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:00:13,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392989029] [2022-04-27 12:00:13,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:00:13,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:13,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:00:13,179 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 12:00:13,183 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 12:00:13,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:00:13,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:00:13,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-27 12:00:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:00:13,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:00:14,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {7624#true} call ULTIMATE.init(); {7624#true} is VALID [2022-04-27 12:00:14,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {7624#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); {7624#true} is VALID [2022-04-27 12:00:14,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7624#true} {7624#true} #56#return; {7624#true} is VALID [2022-04-27 12:00:14,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {7624#true} call #t~ret5 := main(); {7624#true} is VALID [2022-04-27 12:00:14,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {7624#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7644#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:14,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {7644#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7644#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:14,775 INFO L272 TraceCheckUtils]: 7: Hoare triple {7644#(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)); {7624#true} is VALID [2022-04-27 12:00:14,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {7624#true} ~cond := #in~cond; {7624#true} is VALID [2022-04-27 12:00:14,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {7624#true} assume !(0 == ~cond); {7624#true} is VALID [2022-04-27 12:00:14,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,775 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7624#true} {7644#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {7644#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:14,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {7644#(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; {7666#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:00:14,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {7666#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7666#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:00:14,776 INFO L272 TraceCheckUtils]: 14: Hoare triple {7666#(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)); {7624#true} is VALID [2022-04-27 12:00:14,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {7624#true} ~cond := #in~cond; {7624#true} is VALID [2022-04-27 12:00:14,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {7624#true} assume !(0 == ~cond); {7624#true} is VALID [2022-04-27 12:00:14,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,776 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7624#true} {7666#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {7666#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:00:14,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {7666#(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; {7688#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 12:00:14,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {7688#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {7688#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 12:00:14,777 INFO L272 TraceCheckUtils]: 21: Hoare triple {7688#(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)); {7624#true} is VALID [2022-04-27 12:00:14,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {7624#true} ~cond := #in~cond; {7624#true} is VALID [2022-04-27 12:00:14,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {7624#true} assume !(0 == ~cond); {7624#true} is VALID [2022-04-27 12:00:14,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,778 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7624#true} {7688#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #50#return; {7688#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 12:00:14,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {7688#(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; {7710#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 12:00:14,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {7710#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {7710#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 12:00:14,778 INFO L272 TraceCheckUtils]: 28: Hoare triple {7710#(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)); {7624#true} is VALID [2022-04-27 12:00:14,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {7624#true} ~cond := #in~cond; {7624#true} is VALID [2022-04-27 12:00:14,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {7624#true} assume !(0 == ~cond); {7624#true} is VALID [2022-04-27 12:00:14,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,779 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7624#true} {7710#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #50#return; {7710#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 12:00:14,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {7710#(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; {7732#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:00:14,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {7732#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {7732#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:00:14,779 INFO L272 TraceCheckUtils]: 35: Hoare triple {7732#(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)); {7624#true} is VALID [2022-04-27 12:00:14,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {7624#true} ~cond := #in~cond; {7624#true} is VALID [2022-04-27 12:00:14,780 INFO L290 TraceCheckUtils]: 37: Hoare triple {7624#true} assume !(0 == ~cond); {7624#true} is VALID [2022-04-27 12:00:14,780 INFO L290 TraceCheckUtils]: 38: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,780 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7624#true} {7732#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {7732#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:00:14,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {7732#(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; {7754#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 12:00:14,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {7754#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {7754#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 12:00:14,781 INFO L272 TraceCheckUtils]: 42: Hoare triple {7754#(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)); {7624#true} is VALID [2022-04-27 12:00:14,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {7624#true} ~cond := #in~cond; {7624#true} is VALID [2022-04-27 12:00:14,781 INFO L290 TraceCheckUtils]: 44: Hoare triple {7624#true} assume !(0 == ~cond); {7624#true} is VALID [2022-04-27 12:00:14,781 INFO L290 TraceCheckUtils]: 45: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,782 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7624#true} {7754#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #50#return; {7754#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 12:00:14,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {7754#(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; {7776#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:14,782 INFO L290 TraceCheckUtils]: 48: Hoare triple {7776#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !false; {7776#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:14,782 INFO L272 TraceCheckUtils]: 49: Hoare triple {7776#(and (= 4 (+ (- 2) main_~c~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)); {7624#true} is VALID [2022-04-27 12:00:14,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {7624#true} ~cond := #in~cond; {7624#true} is VALID [2022-04-27 12:00:14,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {7624#true} assume !(0 == ~cond); {7624#true} is VALID [2022-04-27 12:00:14,783 INFO L290 TraceCheckUtils]: 52: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,784 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {7624#true} {7776#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #50#return; {7776#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:14,784 INFO L290 TraceCheckUtils]: 54: Hoare triple {7776#(and (= 4 (+ (- 2) main_~c~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; {7798#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 12:00:14,784 INFO L290 TraceCheckUtils]: 55: Hoare triple {7798#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !false; {7798#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 12:00:14,784 INFO L272 TraceCheckUtils]: 56: Hoare triple {7798#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 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)); {7624#true} is VALID [2022-04-27 12:00:14,785 INFO L290 TraceCheckUtils]: 57: Hoare triple {7624#true} ~cond := #in~cond; {7624#true} is VALID [2022-04-27 12:00:14,785 INFO L290 TraceCheckUtils]: 58: Hoare triple {7624#true} assume !(0 == ~cond); {7624#true} is VALID [2022-04-27 12:00:14,785 INFO L290 TraceCheckUtils]: 59: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,785 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7624#true} {7798#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #50#return; {7798#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 12:00:14,785 INFO L290 TraceCheckUtils]: 61: Hoare triple {7798#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 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; {7820#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 12:00:14,786 INFO L290 TraceCheckUtils]: 62: Hoare triple {7820#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {7820#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 12:00:14,793 INFO L272 TraceCheckUtils]: 63: Hoare triple {7820#(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)); {7624#true} is VALID [2022-04-27 12:00:14,794 INFO L290 TraceCheckUtils]: 64: Hoare triple {7624#true} ~cond := #in~cond; {7624#true} is VALID [2022-04-27 12:00:14,794 INFO L290 TraceCheckUtils]: 65: Hoare triple {7624#true} assume !(0 == ~cond); {7624#true} is VALID [2022-04-27 12:00:14,794 INFO L290 TraceCheckUtils]: 66: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,794 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7624#true} {7820#(and (= main_~y~0 8) (= main_~c~0 8))} #50#return; {7820#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 12:00:14,795 INFO L290 TraceCheckUtils]: 68: Hoare triple {7820#(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; {7842#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:00:14,795 INFO L290 TraceCheckUtils]: 69: Hoare triple {7842#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {7842#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:00:14,795 INFO L272 TraceCheckUtils]: 70: Hoare triple {7842#(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)); {7624#true} is VALID [2022-04-27 12:00:14,795 INFO L290 TraceCheckUtils]: 71: Hoare triple {7624#true} ~cond := #in~cond; {7624#true} is VALID [2022-04-27 12:00:14,795 INFO L290 TraceCheckUtils]: 72: Hoare triple {7624#true} assume !(0 == ~cond); {7624#true} is VALID [2022-04-27 12:00:14,795 INFO L290 TraceCheckUtils]: 73: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,795 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {7624#true} {7842#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {7842#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:00:14,796 INFO L290 TraceCheckUtils]: 75: Hoare triple {7842#(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; {7864#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 12:00:14,796 INFO L290 TraceCheckUtils]: 76: Hoare triple {7864#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {7864#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 12:00:14,796 INFO L272 TraceCheckUtils]: 77: Hoare triple {7864#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 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)); {7624#true} is VALID [2022-04-27 12:00:14,796 INFO L290 TraceCheckUtils]: 78: Hoare triple {7624#true} ~cond := #in~cond; {7624#true} is VALID [2022-04-27 12:00:14,796 INFO L290 TraceCheckUtils]: 79: Hoare triple {7624#true} assume !(0 == ~cond); {7624#true} is VALID [2022-04-27 12:00:14,796 INFO L290 TraceCheckUtils]: 80: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,797 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {7624#true} {7864#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #50#return; {7864#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 12:00:14,797 INFO L290 TraceCheckUtils]: 82: Hoare triple {7864#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 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; {7886#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 12:00:14,797 INFO L290 TraceCheckUtils]: 83: Hoare triple {7886#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {7886#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 12:00:14,797 INFO L272 TraceCheckUtils]: 84: Hoare triple {7886#(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)); {7624#true} is VALID [2022-04-27 12:00:14,797 INFO L290 TraceCheckUtils]: 85: Hoare triple {7624#true} ~cond := #in~cond; {7624#true} is VALID [2022-04-27 12:00:14,797 INFO L290 TraceCheckUtils]: 86: Hoare triple {7624#true} assume !(0 == ~cond); {7624#true} is VALID [2022-04-27 12:00:14,797 INFO L290 TraceCheckUtils]: 87: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,798 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7624#true} {7886#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {7886#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 12:00:14,798 INFO L290 TraceCheckUtils]: 89: Hoare triple {7886#(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; {7908#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 12:00:14,798 INFO L290 TraceCheckUtils]: 90: Hoare triple {7908#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {7908#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 12:00:14,798 INFO L272 TraceCheckUtils]: 91: Hoare triple {7908#(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)); {7624#true} is VALID [2022-04-27 12:00:14,798 INFO L290 TraceCheckUtils]: 92: Hoare triple {7624#true} ~cond := #in~cond; {7624#true} is VALID [2022-04-27 12:00:14,799 INFO L290 TraceCheckUtils]: 93: Hoare triple {7624#true} assume !(0 == ~cond); {7624#true} is VALID [2022-04-27 12:00:14,799 INFO L290 TraceCheckUtils]: 94: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,799 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7624#true} {7908#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #50#return; {7908#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 12:00:14,799 INFO L290 TraceCheckUtils]: 96: Hoare triple {7908#(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; {7930#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 12:00:14,805 INFO L290 TraceCheckUtils]: 97: Hoare triple {7930#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} assume !false; {7930#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 12:00:14,805 INFO L272 TraceCheckUtils]: 98: Hoare triple {7930#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 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)); {7624#true} is VALID [2022-04-27 12:00:14,805 INFO L290 TraceCheckUtils]: 99: Hoare triple {7624#true} ~cond := #in~cond; {7624#true} is VALID [2022-04-27 12:00:14,805 INFO L290 TraceCheckUtils]: 100: Hoare triple {7624#true} assume !(0 == ~cond); {7624#true} is VALID [2022-04-27 12:00:14,805 INFO L290 TraceCheckUtils]: 101: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,806 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {7624#true} {7930#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} #50#return; {7930#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 12:00:14,806 INFO L290 TraceCheckUtils]: 103: Hoare triple {7930#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 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; {7952#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 12:00:14,807 INFO L290 TraceCheckUtils]: 104: Hoare triple {7952#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} assume !false; {7952#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 12:00:14,807 INFO L272 TraceCheckUtils]: 105: Hoare triple {7952#(and (= (+ main_~y~0 (- 3)) 11) (< 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)); {7624#true} is VALID [2022-04-27 12:00:14,807 INFO L290 TraceCheckUtils]: 106: Hoare triple {7624#true} ~cond := #in~cond; {7624#true} is VALID [2022-04-27 12:00:14,807 INFO L290 TraceCheckUtils]: 107: Hoare triple {7624#true} assume !(0 == ~cond); {7624#true} is VALID [2022-04-27 12:00:14,807 INFO L290 TraceCheckUtils]: 108: Hoare triple {7624#true} assume true; {7624#true} is VALID [2022-04-27 12:00:14,807 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {7624#true} {7952#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} #50#return; {7952#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-27 12:00:14,808 INFO L290 TraceCheckUtils]: 110: Hoare triple {7952#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {7974#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-27 12:00:14,809 INFO L272 TraceCheckUtils]: 111: Hoare triple {7974#(and (= (+ main_~y~0 (- 3)) 11) (< 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)); {7978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:00:14,809 INFO L290 TraceCheckUtils]: 112: Hoare triple {7978#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:00:14,809 INFO L290 TraceCheckUtils]: 113: Hoare triple {7982#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7625#false} is VALID [2022-04-27 12:00:14,809 INFO L290 TraceCheckUtils]: 114: Hoare triple {7625#false} assume !false; {7625#false} is VALID [2022-04-27 12:00:14,810 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 12:00:14,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:00:15,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:00:15,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615811892] [2022-04-27 12:00:15,092 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:00:15,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392989029] [2022-04-27 12:00:15,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392989029] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:00:15,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:00:15,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-27 12:00:15,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525241993] [2022-04-27 12:00:15,093 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:00:15,093 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 115 [2022-04-27 12:00:15,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:00:15,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:00:15,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:15,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 12:00:15,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:00:15,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 12:00:15,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-27 12:00:15,164 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:00:17,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:17,564 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-04-27 12:00:17,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 12:00:17,564 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 115 [2022-04-27 12:00:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:00:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:00:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 82 transitions. [2022-04-27 12:00:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:00:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 82 transitions. [2022-04-27 12:00:17,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 82 transitions. [2022-04-27 12:00:17,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:17,665 INFO L225 Difference]: With dead ends: 72 [2022-04-27 12:00:17,665 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 12:00:17,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 105 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 12:00:17,666 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:00:17,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 539 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 12:00:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 12:00:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-27 12:00:17,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:00:17,730 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), 19 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:00:17,730 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), 19 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:00:17,730 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), 19 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:00:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:17,733 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2022-04-27 12:00:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-04-27 12:00:17,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:17,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:17,733 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), 19 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 67 states. [2022-04-27 12:00:17,733 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), 19 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 67 states. [2022-04-27 12:00:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:17,735 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2022-04-27 12:00:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-04-27 12:00:17,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:17,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:17,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:00:17,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:00:17,736 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), 19 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:00:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-04-27 12:00:17,738 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 115 [2022-04-27 12:00:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:00:17,738 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2022-04-27 12:00:17,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:00:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-04-27 12:00:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-27 12:00:17,739 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:00:17,739 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:00:17,763 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 12:00:17,947 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 12:00:17,947 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:00:17,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:00:17,948 INFO L85 PathProgramCache]: Analyzing trace with hash -374771579, now seen corresponding path program 15 times [2022-04-27 12:00:17,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:00:17,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147364970] [2022-04-27 12:00:17,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:00:17,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:00:17,971 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:00:17,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1482577742] [2022-04-27 12:00:17,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:00:17,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:17,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:00:17,973 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 12:00:17,974 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 12:00:18,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-04-27 12:00:18,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:00:18,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-27 12:00:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:00:18,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:00:21,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {8389#true} call ULTIMATE.init(); {8389#true} is VALID [2022-04-27 12:00:21,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {8389#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); {8389#true} is VALID [2022-04-27 12:00:21,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8389#true} {8389#true} #56#return; {8389#true} is VALID [2022-04-27 12:00:21,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {8389#true} call #t~ret5 := main(); {8389#true} is VALID [2022-04-27 12:00:21,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {8389#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {8409#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:21,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {8409#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8409#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:21,036 INFO L272 TraceCheckUtils]: 7: Hoare triple {8409#(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)); {8389#true} is VALID [2022-04-27 12:00:21,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,037 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {8389#true} {8409#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {8409#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:21,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {8409#(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; {8431#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:00:21,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {8431#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {8431#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:00:21,038 INFO L272 TraceCheckUtils]: 14: Hoare triple {8431#(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)); {8389#true} is VALID [2022-04-27 12:00:21,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,039 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8389#true} {8431#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {8431#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:00:21,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {8431#(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; {8453#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 12:00:21,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {8453#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {8453#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 12:00:21,040 INFO L272 TraceCheckUtils]: 21: Hoare triple {8453#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< 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)); {8389#true} is VALID [2022-04-27 12:00:21,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,040 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8389#true} {8453#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #50#return; {8453#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 12:00:21,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {8453#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< 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; {8475#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 12:00:21,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {8475#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0) (< main_~c~0 (+ main_~k~0 2)))} assume !false; {8475#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 12:00:21,042 INFO L272 TraceCheckUtils]: 28: Hoare triple {8475#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 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)); {8389#true} is VALID [2022-04-27 12:00:21,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,042 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8389#true} {8475#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0) (< main_~c~0 (+ main_~k~0 2)))} #50#return; {8475#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 12:00:21,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {8475#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 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; {8497#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:00:21,044 INFO L290 TraceCheckUtils]: 34: Hoare triple {8497#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} assume !false; {8497#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:00:21,044 INFO L272 TraceCheckUtils]: 35: Hoare triple {8497#(and (< 1 main_~k~0) (= 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)); {8389#true} is VALID [2022-04-27 12:00:21,044 INFO L290 TraceCheckUtils]: 36: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,045 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8389#true} {8497#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #50#return; {8497#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:00:21,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {8497#(and (< 1 main_~k~0) (= 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; {8519#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:00:21,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {8519#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {8519#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:00:21,046 INFO L272 TraceCheckUtils]: 42: Hoare triple {8519#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) 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)); {8389#true} is VALID [2022-04-27 12:00:21,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,046 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8389#true} {8519#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #50#return; {8519#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:00:21,047 INFO L290 TraceCheckUtils]: 47: Hoare triple {8519#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) 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; {8541#(and (= main_~y~0 6) (< 1 main_~k~0) (= main_~c~0 6))} is VALID [2022-04-27 12:00:21,047 INFO L290 TraceCheckUtils]: 48: Hoare triple {8541#(and (= main_~y~0 6) (< 1 main_~k~0) (= main_~c~0 6))} assume !false; {8541#(and (= main_~y~0 6) (< 1 main_~k~0) (= main_~c~0 6))} is VALID [2022-04-27 12:00:21,047 INFO L272 TraceCheckUtils]: 49: Hoare triple {8541#(and (= main_~y~0 6) (< 1 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)); {8389#true} is VALID [2022-04-27 12:00:21,047 INFO L290 TraceCheckUtils]: 50: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,048 INFO L290 TraceCheckUtils]: 51: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,048 INFO L290 TraceCheckUtils]: 52: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,048 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8389#true} {8541#(and (= main_~y~0 6) (< 1 main_~k~0) (= main_~c~0 6))} #50#return; {8541#(and (= main_~y~0 6) (< 1 main_~k~0) (= main_~c~0 6))} is VALID [2022-04-27 12:00:21,048 INFO L290 TraceCheckUtils]: 54: Hoare triple {8541#(and (= main_~y~0 6) (< 1 main_~k~0) (= 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; {8563#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:21,049 INFO L290 TraceCheckUtils]: 55: Hoare triple {8563#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {8563#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:21,049 INFO L272 TraceCheckUtils]: 56: Hoare triple {8563#(and (< 1 main_~k~0) (= (+ (- 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)); {8389#true} is VALID [2022-04-27 12:00:21,049 INFO L290 TraceCheckUtils]: 57: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,049 INFO L290 TraceCheckUtils]: 58: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,049 INFO L290 TraceCheckUtils]: 59: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,050 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8389#true} {8563#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #50#return; {8563#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:21,050 INFO L290 TraceCheckUtils]: 61: Hoare triple {8563#(and (< 1 main_~k~0) (= (+ (- 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; {8585#(and (< 1 main_~k~0) (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-27 12:00:21,050 INFO L290 TraceCheckUtils]: 62: Hoare triple {8585#(and (< 1 main_~k~0) (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {8585#(and (< 1 main_~k~0) (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-27 12:00:21,051 INFO L272 TraceCheckUtils]: 63: Hoare triple {8585#(and (< 1 main_~k~0) (= 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)); {8389#true} is VALID [2022-04-27 12:00:21,051 INFO L290 TraceCheckUtils]: 64: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,051 INFO L290 TraceCheckUtils]: 65: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,051 INFO L290 TraceCheckUtils]: 66: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,051 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {8389#true} {8585#(and (< 1 main_~k~0) (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #50#return; {8585#(and (< 1 main_~k~0) (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-27 12:00:21,052 INFO L290 TraceCheckUtils]: 68: Hoare triple {8585#(and (< 1 main_~k~0) (= 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; {8607#(and (= (+ main_~c~0 (- 3)) 6) (< 1 main_~k~0) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:21,052 INFO L290 TraceCheckUtils]: 69: Hoare triple {8607#(and (= (+ main_~c~0 (- 3)) 6) (< 1 main_~k~0) (= 8 (+ (- 1) main_~y~0)))} assume !false; {8607#(and (= (+ main_~c~0 (- 3)) 6) (< 1 main_~k~0) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:21,052 INFO L272 TraceCheckUtils]: 70: Hoare triple {8607#(and (= (+ main_~c~0 (- 3)) 6) (< 1 main_~k~0) (= 8 (+ (- 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)); {8389#true} is VALID [2022-04-27 12:00:21,052 INFO L290 TraceCheckUtils]: 71: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,052 INFO L290 TraceCheckUtils]: 72: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,052 INFO L290 TraceCheckUtils]: 73: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,053 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8389#true} {8607#(and (= (+ main_~c~0 (- 3)) 6) (< 1 main_~k~0) (= 8 (+ (- 1) main_~y~0)))} #50#return; {8607#(and (= (+ main_~c~0 (- 3)) 6) (< 1 main_~k~0) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:21,053 INFO L290 TraceCheckUtils]: 75: Hoare triple {8607#(and (= (+ main_~c~0 (- 3)) 6) (< 1 main_~k~0) (= 8 (+ (- 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; {8629#(and (< 1 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 12:00:21,054 INFO L290 TraceCheckUtils]: 76: Hoare triple {8629#(and (< 1 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} assume !false; {8629#(and (< 1 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 12:00:21,054 INFO L272 TraceCheckUtils]: 77: Hoare triple {8629#(and (< 1 main_~k~0) (= 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)); {8389#true} is VALID [2022-04-27 12:00:21,054 INFO L290 TraceCheckUtils]: 78: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,054 INFO L290 TraceCheckUtils]: 79: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,054 INFO L290 TraceCheckUtils]: 80: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,054 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8389#true} {8629#(and (< 1 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} #50#return; {8629#(and (< 1 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 12:00:21,055 INFO L290 TraceCheckUtils]: 82: Hoare triple {8629#(and (< 1 main_~k~0) (= 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; {8651#(and (< 1 main_~k~0) (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 12:00:21,055 INFO L290 TraceCheckUtils]: 83: Hoare triple {8651#(and (< 1 main_~k~0) (= main_~c~0 11) (= main_~y~0 11))} assume !false; {8651#(and (< 1 main_~k~0) (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 12:00:21,055 INFO L272 TraceCheckUtils]: 84: Hoare triple {8651#(and (< 1 main_~k~0) (= 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)); {8389#true} is VALID [2022-04-27 12:00:21,055 INFO L290 TraceCheckUtils]: 85: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,055 INFO L290 TraceCheckUtils]: 86: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,055 INFO L290 TraceCheckUtils]: 87: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,056 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8389#true} {8651#(and (< 1 main_~k~0) (= main_~c~0 11) (= main_~y~0 11))} #50#return; {8651#(and (< 1 main_~k~0) (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 12:00:21,056 INFO L290 TraceCheckUtils]: 89: Hoare triple {8651#(and (< 1 main_~k~0) (= 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; {8673#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 12:00:21,057 INFO L290 TraceCheckUtils]: 90: Hoare triple {8673#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {8673#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 12:00:21,057 INFO L272 TraceCheckUtils]: 91: Hoare triple {8673#(and (< 1 main_~k~0) (= (+ (- 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)); {8389#true} is VALID [2022-04-27 12:00:21,057 INFO L290 TraceCheckUtils]: 92: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,057 INFO L290 TraceCheckUtils]: 93: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,057 INFO L290 TraceCheckUtils]: 94: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,057 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8389#true} {8673#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #50#return; {8673#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 12:00:21,058 INFO L290 TraceCheckUtils]: 96: Hoare triple {8673#(and (< 1 main_~k~0) (= (+ (- 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; {8695#(and (= 11 (+ (- 2) main_~c~0)) (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 12:00:21,058 INFO L290 TraceCheckUtils]: 97: Hoare triple {8695#(and (= 11 (+ (- 2) main_~c~0)) (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 11))} assume !false; {8695#(and (= 11 (+ (- 2) main_~c~0)) (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 12:00:21,058 INFO L272 TraceCheckUtils]: 98: Hoare triple {8695#(and (= 11 (+ (- 2) main_~c~0)) (< 1 main_~k~0) (= (+ (- 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)); {8389#true} is VALID [2022-04-27 12:00:21,058 INFO L290 TraceCheckUtils]: 99: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,058 INFO L290 TraceCheckUtils]: 100: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,058 INFO L290 TraceCheckUtils]: 101: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,059 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {8389#true} {8695#(and (= 11 (+ (- 2) main_~c~0)) (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 11))} #50#return; {8695#(and (= 11 (+ (- 2) main_~c~0)) (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-27 12:00:21,060 INFO L290 TraceCheckUtils]: 103: Hoare triple {8695#(and (= 11 (+ (- 2) main_~c~0)) (< 1 main_~k~0) (= (+ (- 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; {8717#(and (= main_~y~0 14) (< 1 main_~k~0) (= main_~c~0 14))} is VALID [2022-04-27 12:00:21,060 INFO L290 TraceCheckUtils]: 104: Hoare triple {8717#(and (= main_~y~0 14) (< 1 main_~k~0) (= main_~c~0 14))} assume !false; {8717#(and (= main_~y~0 14) (< 1 main_~k~0) (= main_~c~0 14))} is VALID [2022-04-27 12:00:21,060 INFO L272 TraceCheckUtils]: 105: Hoare triple {8717#(and (= main_~y~0 14) (< 1 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)); {8389#true} is VALID [2022-04-27 12:00:21,060 INFO L290 TraceCheckUtils]: 106: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,060 INFO L290 TraceCheckUtils]: 107: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,060 INFO L290 TraceCheckUtils]: 108: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,061 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {8389#true} {8717#(and (= main_~y~0 14) (< 1 main_~k~0) (= main_~c~0 14))} #50#return; {8717#(and (= main_~y~0 14) (< 1 main_~k~0) (= main_~c~0 14))} is VALID [2022-04-27 12:00:21,061 INFO L290 TraceCheckUtils]: 110: Hoare triple {8717#(and (= main_~y~0 14) (< 1 main_~k~0) (= 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; {8739#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 12:00:21,062 INFO L290 TraceCheckUtils]: 111: Hoare triple {8739#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !false; {8739#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 12:00:21,062 INFO L272 TraceCheckUtils]: 112: Hoare triple {8739#(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)); {8389#true} is VALID [2022-04-27 12:00:21,062 INFO L290 TraceCheckUtils]: 113: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-27 12:00:21,062 INFO L290 TraceCheckUtils]: 114: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-27 12:00:21,062 INFO L290 TraceCheckUtils]: 115: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-27 12:00:21,062 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {8389#true} {8739#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} #50#return; {8739#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-27 12:00:21,063 INFO L290 TraceCheckUtils]: 117: Hoare triple {8739#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {8761#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-27 12:00:21,064 INFO L272 TraceCheckUtils]: 118: Hoare triple {8761#(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)); {8765#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:00:21,064 INFO L290 TraceCheckUtils]: 119: Hoare triple {8765#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8769#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:00:21,065 INFO L290 TraceCheckUtils]: 120: Hoare triple {8769#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8390#false} is VALID [2022-04-27 12:00:21,065 INFO L290 TraceCheckUtils]: 121: Hoare triple {8390#false} assume !false; {8390#false} is VALID [2022-04-27 12:00:21,065 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 12:00:21,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:00:23,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:00:23,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147364970] [2022-04-27 12:00:23,055 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:00:23,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482577742] [2022-04-27 12:00:23,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482577742] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:00:23,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:00:23,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-27 12:00:23,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903748709] [2022-04-27 12:00:23,055 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:00:23,055 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 122 [2022-04-27 12:00:23,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:00:23,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:00:23,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:23,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 12:00:23,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:00:23,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 12:00:23,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1044, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 12:00:23,161 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:00:25,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:25,734 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-27 12:00:25,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 12:00:25,734 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 122 [2022-04-27 12:00:25,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:00:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:00:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 86 transitions. [2022-04-27 12:00:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:00:25,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 86 transitions. [2022-04-27 12:00:25,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 86 transitions. [2022-04-27 12:00:25,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:25,832 INFO L225 Difference]: With dead ends: 75 [2022-04-27 12:00:25,832 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 12:00:25,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=298, Invalid=1184, Unknown=0, NotChecked=0, Total=1482 [2022-04-27 12:00:25,835 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:00:25,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 588 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 12:00:25,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 12:00:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-27 12:00:25,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:00:25,884 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), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:00:25,887 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), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:00:25,887 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), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:00:25,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:25,904 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-27 12:00:25,904 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-27 12:00:25,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:25,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:25,905 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), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 70 states. [2022-04-27 12:00:25,905 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), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 70 states. [2022-04-27 12:00:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:25,906 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-27 12:00:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-27 12:00:25,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:25,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:25,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:00:25,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:00:25,907 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), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:00:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-04-27 12:00:25,908 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 122 [2022-04-27 12:00:25,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:00:25,908 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-04-27 12:00:25,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:00:25,908 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-27 12:00:25,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-27 12:00:25,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:00:25,909 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:00:25,916 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 12:00:26,109 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 12:00:26,110 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:00:26,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:00:26,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1065798926, now seen corresponding path program 16 times [2022-04-27 12:00:26,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:00:26,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072215909] [2022-04-27 12:00:26,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:00:26,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:00:26,129 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:00:26,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326104925] [2022-04-27 12:00:26,129 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 12:00:26,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:26,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:00:26,136 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 12:00:26,147 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 12:00:26,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 12:00:26,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:00:26,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-27 12:00:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:00:26,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:00:27,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {9478#true} call ULTIMATE.init(); {9478#true} is VALID [2022-04-27 12:00:27,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {9478#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); {9478#true} is VALID [2022-04-27 12:00:27,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9478#true} {9478#true} #56#return; {9478#true} is VALID [2022-04-27 12:00:27,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {9478#true} call #t~ret5 := main(); {9478#true} is VALID [2022-04-27 12:00:27,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {9478#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {9498#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:27,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {9498#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {9498#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:27,635 INFO L272 TraceCheckUtils]: 7: Hoare triple {9498#(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)); {9478#true} is VALID [2022-04-27 12:00:27,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,636 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {9478#true} {9498#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {9498#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:27,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {9498#(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; {9520#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:00:27,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {9520#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {9520#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:00:27,637 INFO L272 TraceCheckUtils]: 14: Hoare triple {9520#(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)); {9478#true} is VALID [2022-04-27 12:00:27,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,637 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9478#true} {9520#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {9520#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:00:27,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {9520#(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; {9542#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 12:00:27,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {9542#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {9542#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 12:00:27,638 INFO L272 TraceCheckUtils]: 21: Hoare triple {9542#(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)); {9478#true} is VALID [2022-04-27 12:00:27,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,639 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {9478#true} {9542#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {9542#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 12:00:27,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {9542#(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; {9564#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 12:00:27,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {9564#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !false; {9564#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 12:00:27,640 INFO L272 TraceCheckUtils]: 28: Hoare triple {9564#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 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)); {9478#true} is VALID [2022-04-27 12:00:27,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,641 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9478#true} {9564#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #50#return; {9564#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 12:00:27,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {9564#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 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; {9586#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:00:27,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {9586#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {9586#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:00:27,641 INFO L272 TraceCheckUtils]: 35: Hoare triple {9586#(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)); {9478#true} is VALID [2022-04-27 12:00:27,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,642 INFO L290 TraceCheckUtils]: 37: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,642 INFO L290 TraceCheckUtils]: 38: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,642 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9478#true} {9586#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {9586#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:00:27,643 INFO L290 TraceCheckUtils]: 40: Hoare triple {9586#(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; {9608#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 12:00:27,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {9608#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {9608#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 12:00:27,643 INFO L272 TraceCheckUtils]: 42: Hoare triple {9608#(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)); {9478#true} is VALID [2022-04-27 12:00:27,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,643 INFO L290 TraceCheckUtils]: 44: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,643 INFO L290 TraceCheckUtils]: 45: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,644 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {9478#true} {9608#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #50#return; {9608#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 12:00:27,644 INFO L290 TraceCheckUtils]: 47: Hoare triple {9608#(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; {9630#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-27 12:00:27,644 INFO L290 TraceCheckUtils]: 48: Hoare triple {9630#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !false; {9630#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-27 12:00:27,645 INFO L272 TraceCheckUtils]: 49: Hoare triple {9630#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) 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)); {9478#true} is VALID [2022-04-27 12:00:27,645 INFO L290 TraceCheckUtils]: 50: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,645 INFO L290 TraceCheckUtils]: 51: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,645 INFO L290 TraceCheckUtils]: 52: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,645 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9478#true} {9630#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #50#return; {9630#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-27 12:00:27,646 INFO L290 TraceCheckUtils]: 54: Hoare triple {9630#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) 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; {9652#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:00:27,646 INFO L290 TraceCheckUtils]: 55: Hoare triple {9652#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {9652#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:00:27,646 INFO L272 TraceCheckUtils]: 56: Hoare triple {9652#(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)); {9478#true} is VALID [2022-04-27 12:00:27,646 INFO L290 TraceCheckUtils]: 57: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,646 INFO L290 TraceCheckUtils]: 58: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,646 INFO L290 TraceCheckUtils]: 59: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,647 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9478#true} {9652#(and (= 7 main_~y~0) (= 7 main_~c~0))} #50#return; {9652#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:00:27,647 INFO L290 TraceCheckUtils]: 61: Hoare triple {9652#(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; {9674#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:00:27,648 INFO L290 TraceCheckUtils]: 62: Hoare triple {9674#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {9674#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:00:27,648 INFO L272 TraceCheckUtils]: 63: Hoare triple {9674#(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)); {9478#true} is VALID [2022-04-27 12:00:27,648 INFO L290 TraceCheckUtils]: 64: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,648 INFO L290 TraceCheckUtils]: 65: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,648 INFO L290 TraceCheckUtils]: 66: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,649 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {9478#true} {9674#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #50#return; {9674#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:00:27,649 INFO L290 TraceCheckUtils]: 68: Hoare triple {9674#(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; {9696#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:00:27,649 INFO L290 TraceCheckUtils]: 69: Hoare triple {9696#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {9696#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:00:27,649 INFO L272 TraceCheckUtils]: 70: Hoare triple {9696#(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)); {9478#true} is VALID [2022-04-27 12:00:27,650 INFO L290 TraceCheckUtils]: 71: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,650 INFO L290 TraceCheckUtils]: 72: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,650 INFO L290 TraceCheckUtils]: 73: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,650 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9478#true} {9696#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {9696#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:00:27,651 INFO L290 TraceCheckUtils]: 75: Hoare triple {9696#(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; {9718#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 12:00:27,651 INFO L290 TraceCheckUtils]: 76: Hoare triple {9718#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {9718#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 12:00:27,651 INFO L272 TraceCheckUtils]: 77: Hoare triple {9718#(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)); {9478#true} is VALID [2022-04-27 12:00:27,651 INFO L290 TraceCheckUtils]: 78: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,651 INFO L290 TraceCheckUtils]: 79: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,651 INFO L290 TraceCheckUtils]: 80: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,652 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9478#true} {9718#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #50#return; {9718#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 12:00:27,652 INFO L290 TraceCheckUtils]: 82: Hoare triple {9718#(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; {9740#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 12:00:27,653 INFO L290 TraceCheckUtils]: 83: Hoare triple {9740#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {9740#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 12:00:27,653 INFO L272 TraceCheckUtils]: 84: Hoare triple {9740#(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)); {9478#true} is VALID [2022-04-27 12:00:27,653 INFO L290 TraceCheckUtils]: 85: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,653 INFO L290 TraceCheckUtils]: 86: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,653 INFO L290 TraceCheckUtils]: 87: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,653 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9478#true} {9740#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #50#return; {9740#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 12:00:27,654 INFO L290 TraceCheckUtils]: 89: Hoare triple {9740#(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; {9762#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 12:00:27,654 INFO L290 TraceCheckUtils]: 90: Hoare triple {9762#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} assume !false; {9762#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 12:00:27,654 INFO L272 TraceCheckUtils]: 91: Hoare triple {9762#(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)); {9478#true} is VALID [2022-04-27 12:00:27,654 INFO L290 TraceCheckUtils]: 92: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,654 INFO L290 TraceCheckUtils]: 93: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,654 INFO L290 TraceCheckUtils]: 94: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,655 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {9478#true} {9762#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} #50#return; {9762#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 12:00:27,655 INFO L290 TraceCheckUtils]: 96: Hoare triple {9762#(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; {9784#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-27 12:00:27,656 INFO L290 TraceCheckUtils]: 97: Hoare triple {9784#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !false; {9784#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-27 12:00:27,656 INFO L272 TraceCheckUtils]: 98: Hoare triple {9784#(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)); {9478#true} is VALID [2022-04-27 12:00:27,656 INFO L290 TraceCheckUtils]: 99: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,656 INFO L290 TraceCheckUtils]: 100: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,656 INFO L290 TraceCheckUtils]: 101: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,656 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {9478#true} {9784#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} #50#return; {9784#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-27 12:00:27,657 INFO L290 TraceCheckUtils]: 103: Hoare triple {9784#(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; {9806#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 12:00:27,657 INFO L290 TraceCheckUtils]: 104: Hoare triple {9806#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {9806#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 12:00:27,657 INFO L272 TraceCheckUtils]: 105: Hoare triple {9806#(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)); {9478#true} is VALID [2022-04-27 12:00:27,657 INFO L290 TraceCheckUtils]: 106: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,657 INFO L290 TraceCheckUtils]: 107: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,657 INFO L290 TraceCheckUtils]: 108: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,658 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {9478#true} {9806#(and (= main_~y~0 14) (= main_~c~0 14))} #50#return; {9806#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-27 12:00:27,658 INFO L290 TraceCheckUtils]: 110: Hoare triple {9806#(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; {9828#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:27,659 INFO L290 TraceCheckUtils]: 111: Hoare triple {9828#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !false; {9828#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:27,659 INFO L272 TraceCheckUtils]: 112: Hoare triple {9828#(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)); {9478#true} is VALID [2022-04-27 12:00:27,659 INFO L290 TraceCheckUtils]: 113: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,659 INFO L290 TraceCheckUtils]: 114: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,659 INFO L290 TraceCheckUtils]: 115: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,660 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {9478#true} {9828#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} #50#return; {9828#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:27,660 INFO L290 TraceCheckUtils]: 117: Hoare triple {9828#(and (= (+ (- 1) main_~c~0) 14) (= 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; {9850#(and (= (+ (- 2) main_~y~0) 14) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 12:00:27,660 INFO L290 TraceCheckUtils]: 118: Hoare triple {9850#(and (= (+ (- 2) main_~y~0) 14) (< 15 main_~k~0) (<= main_~c~0 16))} assume !false; {9850#(and (= (+ (- 2) main_~y~0) 14) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 12:00:27,660 INFO L272 TraceCheckUtils]: 119: Hoare triple {9850#(and (= (+ (- 2) main_~y~0) 14) (< 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)); {9478#true} is VALID [2022-04-27 12:00:27,661 INFO L290 TraceCheckUtils]: 120: Hoare triple {9478#true} ~cond := #in~cond; {9478#true} is VALID [2022-04-27 12:00:27,661 INFO L290 TraceCheckUtils]: 121: Hoare triple {9478#true} assume !(0 == ~cond); {9478#true} is VALID [2022-04-27 12:00:27,661 INFO L290 TraceCheckUtils]: 122: Hoare triple {9478#true} assume true; {9478#true} is VALID [2022-04-27 12:00:27,661 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {9478#true} {9850#(and (= (+ (- 2) main_~y~0) 14) (< 15 main_~k~0) (<= main_~c~0 16))} #50#return; {9850#(and (= (+ (- 2) main_~y~0) 14) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-27 12:00:27,662 INFO L290 TraceCheckUtils]: 124: Hoare triple {9850#(and (= (+ (- 2) main_~y~0) 14) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {9872#(and (<= main_~k~0 16) (= (+ (- 2) main_~y~0) 14) (< 15 main_~k~0))} is VALID [2022-04-27 12:00:27,663 INFO L272 TraceCheckUtils]: 125: Hoare triple {9872#(and (<= main_~k~0 16) (= (+ (- 2) main_~y~0) 14) (< 15 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9876#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:00:27,663 INFO L290 TraceCheckUtils]: 126: Hoare triple {9876#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9880#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:00:27,663 INFO L290 TraceCheckUtils]: 127: Hoare triple {9880#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9479#false} is VALID [2022-04-27 12:00:27,664 INFO L290 TraceCheckUtils]: 128: Hoare triple {9479#false} assume !false; {9479#false} is VALID [2022-04-27 12:00:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 34 proven. 408 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-27 12:00:27,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:00:27,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:00:27,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072215909] [2022-04-27 12:00:27,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:00:27,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326104925] [2022-04-27 12:00:27,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326104925] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:00:27,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:00:27,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-27 12:00:27,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826928079] [2022-04-27 12:00:27,949 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:00:27,950 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 129 [2022-04-27 12:00:27,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:00:27,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:00:28,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:28,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 12:00:28,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:00:28,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 12:00:28,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-27 12:00:28,032 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:00:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:31,872 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2022-04-27 12:00:31,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 12:00:31,872 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 129 [2022-04-27 12:00:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:00:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:00:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 90 transitions. [2022-04-27 12:00:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:00:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 90 transitions. [2022-04-27 12:00:31,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 90 transitions. [2022-04-27 12:00:31,968 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 12:00:31,969 INFO L225 Difference]: With dead ends: 78 [2022-04-27 12:00:31,969 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 12:00:31,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-04-27 12:00:31,969 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:00:31,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 639 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 12:00:31,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 12:00:32,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-27 12:00:32,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:00:32,029 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), 21 states have call successors, (21), 5 states have call predecessors, (21), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:00:32,029 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), 21 states have call successors, (21), 5 states have call predecessors, (21), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:00:32,029 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), 21 states have call successors, (21), 5 states have call predecessors, (21), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:00:32,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:32,031 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-27 12:00:32,031 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-27 12:00:32,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:32,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:32,031 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), 21 states have call successors, (21), 5 states have call predecessors, (21), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 73 states. [2022-04-27 12:00:32,031 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), 21 states have call successors, (21), 5 states have call predecessors, (21), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 73 states. [2022-04-27 12:00:32,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:32,033 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-27 12:00:32,033 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-27 12:00:32,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:32,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:32,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:00:32,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:00:32,033 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), 21 states have call successors, (21), 5 states have call predecessors, (21), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:00:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2022-04-27 12:00:32,035 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 129 [2022-04-27 12:00:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:00:32,035 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2022-04-27 12:00:32,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:00:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-27 12:00:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-27 12:00:32,037 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:00:32,037 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:00:32,051 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 12:00:32,242 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 12:00:32,242 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:00:32,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:00:32,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1370180581, now seen corresponding path program 17 times [2022-04-27 12:00:32,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:00:32,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727061249] [2022-04-27 12:00:32,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:00:32,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:00:32,258 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:00:32,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [537176646] [2022-04-27 12:00:32,258 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 12:00:32,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:32,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:00:32,262 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 12:00:32,267 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 12:00:33,418 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-04-27 12:00:33,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:00:33,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-27 12:00:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:00:33,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:00:34,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {10319#true} call ULTIMATE.init(); {10319#true} is VALID [2022-04-27 12:00:34,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {10319#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); {10319#true} is VALID [2022-04-27 12:00:34,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10319#true} {10319#true} #56#return; {10319#true} is VALID [2022-04-27 12:00:34,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {10319#true} call #t~ret5 := main(); {10319#true} is VALID [2022-04-27 12:00:34,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {10319#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {10339#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:34,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {10339#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {10339#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:34,278 INFO L272 TraceCheckUtils]: 7: Hoare triple {10339#(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)); {10319#true} is VALID [2022-04-27 12:00:34,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,278 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {10319#true} {10339#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {10339#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:34,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {10339#(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; {10361#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:00:34,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {10361#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {10361#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:00:34,279 INFO L272 TraceCheckUtils]: 14: Hoare triple {10361#(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)); {10319#true} is VALID [2022-04-27 12:00:34,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,280 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10319#true} {10361#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {10361#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:00:34,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {10361#(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; {10383#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 12:00:34,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {10383#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {10383#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 12:00:34,281 INFO L272 TraceCheckUtils]: 21: Hoare triple {10383#(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)); {10319#true} is VALID [2022-04-27 12:00:34,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,281 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10319#true} {10383#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {10383#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 12:00:34,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {10383#(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; {10405#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 12:00:34,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {10405#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {10405#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 12:00:34,282 INFO L272 TraceCheckUtils]: 28: Hoare triple {10405#(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)); {10319#true} is VALID [2022-04-27 12:00:34,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,282 INFO L290 TraceCheckUtils]: 30: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,283 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10319#true} {10405#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #50#return; {10405#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 12:00:34,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {10405#(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; {10427#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 12:00:34,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {10427#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {10427#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 12:00:34,284 INFO L272 TraceCheckUtils]: 35: Hoare triple {10427#(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)); {10319#true} is VALID [2022-04-27 12:00:34,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,284 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10319#true} {10427#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #50#return; {10427#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 12:00:34,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {10427#(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; {10449#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 12:00:34,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {10449#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {10449#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 12:00:34,285 INFO L272 TraceCheckUtils]: 42: Hoare triple {10449#(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)); {10319#true} is VALID [2022-04-27 12:00:34,285 INFO L290 TraceCheckUtils]: 43: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,285 INFO L290 TraceCheckUtils]: 45: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,286 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10319#true} {10449#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {10449#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 12:00:34,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {10449#(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; {10471#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 12:00:34,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {10471#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {10471#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 12:00:34,287 INFO L272 TraceCheckUtils]: 49: Hoare triple {10471#(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)); {10319#true} is VALID [2022-04-27 12:00:34,287 INFO L290 TraceCheckUtils]: 50: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,287 INFO L290 TraceCheckUtils]: 51: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,287 INFO L290 TraceCheckUtils]: 52: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,287 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10319#true} {10471#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {10471#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 12:00:34,288 INFO L290 TraceCheckUtils]: 54: Hoare triple {10471#(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; {10493#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:34,288 INFO L290 TraceCheckUtils]: 55: Hoare triple {10493#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {10493#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:34,288 INFO L272 TraceCheckUtils]: 56: Hoare triple {10493#(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)); {10319#true} is VALID [2022-04-27 12:00:34,288 INFO L290 TraceCheckUtils]: 57: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,289 INFO L290 TraceCheckUtils]: 58: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,289 INFO L290 TraceCheckUtils]: 59: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,289 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10319#true} {10493#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #50#return; {10493#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:34,290 INFO L290 TraceCheckUtils]: 61: Hoare triple {10493#(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; {10515#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 12:00:34,290 INFO L290 TraceCheckUtils]: 62: Hoare triple {10515#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {10515#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 12:00:34,290 INFO L272 TraceCheckUtils]: 63: Hoare triple {10515#(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)); {10319#true} is VALID [2022-04-27 12:00:34,290 INFO L290 TraceCheckUtils]: 64: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,290 INFO L290 TraceCheckUtils]: 65: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,290 INFO L290 TraceCheckUtils]: 66: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,291 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {10319#true} {10515#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #50#return; {10515#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 12:00:34,291 INFO L290 TraceCheckUtils]: 68: Hoare triple {10515#(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; {10537#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 12:00:34,291 INFO L290 TraceCheckUtils]: 69: Hoare triple {10537#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} assume !false; {10537#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 12:00:34,291 INFO L272 TraceCheckUtils]: 70: Hoare triple {10537#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) 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)); {10319#true} is VALID [2022-04-27 12:00:34,292 INFO L290 TraceCheckUtils]: 71: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,292 INFO L290 TraceCheckUtils]: 72: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,292 INFO L290 TraceCheckUtils]: 73: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,292 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10319#true} {10537#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} #50#return; {10537#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 12:00:34,293 INFO L290 TraceCheckUtils]: 75: Hoare triple {10537#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) 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; {10559#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} is VALID [2022-04-27 12:00:34,293 INFO L290 TraceCheckUtils]: 76: Hoare triple {10559#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} assume !false; {10559#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} is VALID [2022-04-27 12:00:34,293 INFO L272 TraceCheckUtils]: 77: Hoare triple {10559#(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)); {10319#true} is VALID [2022-04-27 12:00:34,293 INFO L290 TraceCheckUtils]: 78: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,293 INFO L290 TraceCheckUtils]: 79: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,293 INFO L290 TraceCheckUtils]: 80: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,294 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10319#true} {10559#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} #50#return; {10559#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} is VALID [2022-04-27 12:00:34,294 INFO L290 TraceCheckUtils]: 82: Hoare triple {10559#(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; {10581#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 12:00:34,294 INFO L290 TraceCheckUtils]: 83: Hoare triple {10581#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} assume !false; {10581#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 12:00:34,294 INFO L272 TraceCheckUtils]: 84: Hoare triple {10581#(and (= main_~c~0 11) (= 6 (+ 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)); {10319#true} is VALID [2022-04-27 12:00:34,294 INFO L290 TraceCheckUtils]: 85: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,294 INFO L290 TraceCheckUtils]: 86: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,295 INFO L290 TraceCheckUtils]: 87: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,295 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10319#true} {10581#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} #50#return; {10581#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 12:00:34,295 INFO L290 TraceCheckUtils]: 89: Hoare triple {10581#(and (= main_~c~0 11) (= 6 (+ 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; {10603#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 12:00:34,296 INFO L290 TraceCheckUtils]: 90: Hoare triple {10603#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} assume !false; {10603#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 12:00:34,296 INFO L272 TraceCheckUtils]: 91: Hoare triple {10603#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 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)); {10319#true} is VALID [2022-04-27 12:00:34,296 INFO L290 TraceCheckUtils]: 92: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,296 INFO L290 TraceCheckUtils]: 93: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,296 INFO L290 TraceCheckUtils]: 94: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,296 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {10319#true} {10603#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} #50#return; {10603#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 12:00:34,297 INFO L290 TraceCheckUtils]: 96: Hoare triple {10603#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 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; {10625#(and (= 6 (+ main_~y~0 (- 7))) (= main_~c~0 13))} is VALID [2022-04-27 12:00:34,297 INFO L290 TraceCheckUtils]: 97: Hoare triple {10625#(and (= 6 (+ main_~y~0 (- 7))) (= main_~c~0 13))} assume !false; {10625#(and (= 6 (+ main_~y~0 (- 7))) (= main_~c~0 13))} is VALID [2022-04-27 12:00:34,297 INFO L272 TraceCheckUtils]: 98: Hoare triple {10625#(and (= 6 (+ main_~y~0 (- 7))) (= 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)); {10319#true} is VALID [2022-04-27 12:00:34,297 INFO L290 TraceCheckUtils]: 99: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,297 INFO L290 TraceCheckUtils]: 100: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,297 INFO L290 TraceCheckUtils]: 101: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,298 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {10319#true} {10625#(and (= 6 (+ main_~y~0 (- 7))) (= main_~c~0 13))} #50#return; {10625#(and (= 6 (+ main_~y~0 (- 7))) (= main_~c~0 13))} is VALID [2022-04-27 12:00:34,298 INFO L290 TraceCheckUtils]: 103: Hoare triple {10625#(and (= 6 (+ main_~y~0 (- 7))) (= 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; {10647#(and (= (+ (- 1) main_~c~0) 13) (= 6 (+ main_~y~0 (- 8))))} is VALID [2022-04-27 12:00:34,299 INFO L290 TraceCheckUtils]: 104: Hoare triple {10647#(and (= (+ (- 1) main_~c~0) 13) (= 6 (+ main_~y~0 (- 8))))} assume !false; {10647#(and (= (+ (- 1) main_~c~0) 13) (= 6 (+ main_~y~0 (- 8))))} is VALID [2022-04-27 12:00:34,299 INFO L272 TraceCheckUtils]: 105: Hoare triple {10647#(and (= (+ (- 1) main_~c~0) 13) (= 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)); {10319#true} is VALID [2022-04-27 12:00:34,299 INFO L290 TraceCheckUtils]: 106: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,299 INFO L290 TraceCheckUtils]: 107: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,299 INFO L290 TraceCheckUtils]: 108: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,299 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {10319#true} {10647#(and (= (+ (- 1) main_~c~0) 13) (= 6 (+ main_~y~0 (- 8))))} #50#return; {10647#(and (= (+ (- 1) main_~c~0) 13) (= 6 (+ main_~y~0 (- 8))))} is VALID [2022-04-27 12:00:34,300 INFO L290 TraceCheckUtils]: 110: Hoare triple {10647#(and (= (+ (- 1) main_~c~0) 13) (= 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; {10669#(and (= (+ (- 9) main_~y~0) 6) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:34,300 INFO L290 TraceCheckUtils]: 111: Hoare triple {10669#(and (= (+ (- 9) main_~y~0) 6) (= 13 (+ (- 2) main_~c~0)))} assume !false; {10669#(and (= (+ (- 9) main_~y~0) 6) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:34,300 INFO L272 TraceCheckUtils]: 112: Hoare triple {10669#(and (= (+ (- 9) main_~y~0) 6) (= 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)); {10319#true} is VALID [2022-04-27 12:00:34,300 INFO L290 TraceCheckUtils]: 113: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,300 INFO L290 TraceCheckUtils]: 114: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,300 INFO L290 TraceCheckUtils]: 115: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,301 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10319#true} {10669#(and (= (+ (- 9) main_~y~0) 6) (= 13 (+ (- 2) main_~c~0)))} #50#return; {10669#(and (= (+ (- 9) main_~y~0) 6) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:34,301 INFO L290 TraceCheckUtils]: 117: Hoare triple {10669#(and (= (+ (- 9) main_~y~0) 6) (= 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; {10691#(and (= 6 (+ main_~y~0 (- 10))) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-27 12:00:34,302 INFO L290 TraceCheckUtils]: 118: Hoare triple {10691#(and (= 6 (+ main_~y~0 (- 10))) (= (+ main_~c~0 (- 3)) 13))} assume !false; {10691#(and (= 6 (+ main_~y~0 (- 10))) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-27 12:00:34,302 INFO L272 TraceCheckUtils]: 119: Hoare triple {10691#(and (= 6 (+ main_~y~0 (- 10))) (= (+ main_~c~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)); {10319#true} is VALID [2022-04-27 12:00:34,302 INFO L290 TraceCheckUtils]: 120: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,302 INFO L290 TraceCheckUtils]: 121: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,302 INFO L290 TraceCheckUtils]: 122: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,302 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {10319#true} {10691#(and (= 6 (+ main_~y~0 (- 10))) (= (+ main_~c~0 (- 3)) 13))} #50#return; {10691#(and (= 6 (+ main_~y~0 (- 10))) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-27 12:00:34,303 INFO L290 TraceCheckUtils]: 124: Hoare triple {10691#(and (= 6 (+ main_~y~0 (- 10))) (= (+ main_~c~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; {10713#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 12:00:34,303 INFO L290 TraceCheckUtils]: 125: Hoare triple {10713#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} assume !false; {10713#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 12:00:34,303 INFO L272 TraceCheckUtils]: 126: Hoare triple {10713#(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)); {10319#true} is VALID [2022-04-27 12:00:34,303 INFO L290 TraceCheckUtils]: 127: Hoare triple {10319#true} ~cond := #in~cond; {10319#true} is VALID [2022-04-27 12:00:34,303 INFO L290 TraceCheckUtils]: 128: Hoare triple {10319#true} assume !(0 == ~cond); {10319#true} is VALID [2022-04-27 12:00:34,303 INFO L290 TraceCheckUtils]: 129: Hoare triple {10319#true} assume true; {10319#true} is VALID [2022-04-27 12:00:34,304 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {10319#true} {10713#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} #50#return; {10713#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 12:00:34,305 INFO L290 TraceCheckUtils]: 131: Hoare triple {10713#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} assume !(~c~0 < ~k~0); {10735#(and (<= main_~k~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 12:00:34,306 INFO L272 TraceCheckUtils]: 132: Hoare triple {10735#(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)); {10739#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:00:34,306 INFO L290 TraceCheckUtils]: 133: Hoare triple {10739#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10743#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:00:34,307 INFO L290 TraceCheckUtils]: 134: Hoare triple {10743#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10320#false} is VALID [2022-04-27 12:00:34,307 INFO L290 TraceCheckUtils]: 135: Hoare triple {10320#false} assume !false; {10320#false} is VALID [2022-04-27 12:00:34,307 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 12:00:34,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:00:34,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:00:34,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727061249] [2022-04-27 12:00:34,643 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:00:34,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537176646] [2022-04-27 12:00:34,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537176646] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:00:34,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:00:34,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-27 12:00:34,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109480677] [2022-04-27 12:00:34,643 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:00:34,644 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 20 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Word has length 136 [2022-04-27 12:00:34,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:00:34,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 20 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:00:34,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:34,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 12:00:34,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:00:34,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 12:00:34,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-27 12:00:34,754 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 20 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:00:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:38,400 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2022-04-27 12:00:38,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-27 12:00:38,401 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 20 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Word has length 136 [2022-04-27 12:00:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:00:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 20 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:00:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2022-04-27 12:00:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 20 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:00:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2022-04-27 12:00:38,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 94 transitions. [2022-04-27 12:00:38,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:38,533 INFO L225 Difference]: With dead ends: 81 [2022-04-27 12:00:38,533 INFO L226 Difference]: Without dead ends: 76 [2022-04-27 12:00:38,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2022-04-27 12:00:38,534 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:00:38,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 692 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 12:00:38,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-27 12:00:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-27 12:00:38,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:00:38,648 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), 22 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:00:38,649 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), 22 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:00:38,651 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), 22 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:00:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:38,653 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-27 12:00:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-27 12:00:38,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:38,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:38,653 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), 22 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 76 states. [2022-04-27 12:00:38,653 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), 22 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 76 states. [2022-04-27 12:00:38,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:38,655 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-27 12:00:38,655 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-27 12:00:38,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:38,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:38,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:00:38,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:00:38,655 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), 22 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:00:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2022-04-27 12:00:38,657 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 136 [2022-04-27 12:00:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:00:38,657 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2022-04-27 12:00:38,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 20 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 12:00:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-27 12:00:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-27 12:00:38,658 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:00:38,658 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:00:38,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-27 12:00:38,858 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 12:00:38,858 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:00:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:00:38,859 INFO L85 PathProgramCache]: Analyzing trace with hash 455854994, now seen corresponding path program 18 times [2022-04-27 12:00:38,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:00:38,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359250432] [2022-04-27 12:00:38,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:00:38,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:00:38,871 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:00:38,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [462724210] [2022-04-27 12:00:38,872 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 12:00:38,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:38,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:00:38,873 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 12:00:38,878 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 12:00:40,653 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-27 12:00:40,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:00:40,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-27 12:00:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:00:40,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:00:41,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {11198#true} call ULTIMATE.init(); {11198#true} is VALID [2022-04-27 12:00:41,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {11198#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); {11198#true} is VALID [2022-04-27 12:00:41,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11198#true} {11198#true} #56#return; {11198#true} is VALID [2022-04-27 12:00:41,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {11198#true} call #t~ret5 := main(); {11198#true} is VALID [2022-04-27 12:00:41,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {11198#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {11218#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:41,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {11218#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {11218#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:41,874 INFO L272 TraceCheckUtils]: 7: Hoare triple {11218#(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)); {11198#true} is VALID [2022-04-27 12:00:41,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,874 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {11198#true} {11218#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {11218#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:41,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {11218#(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; {11240#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:00:41,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {11240#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {11240#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:00:41,875 INFO L272 TraceCheckUtils]: 14: Hoare triple {11240#(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)); {11198#true} is VALID [2022-04-27 12:00:41,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,876 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11198#true} {11240#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {11240#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:00:41,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {11240#(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; {11262#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 12:00:41,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {11262#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {11262#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 12:00:41,876 INFO L272 TraceCheckUtils]: 21: Hoare triple {11262#(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)); {11198#true} is VALID [2022-04-27 12:00:41,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,877 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11198#true} {11262#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {11262#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 12:00:41,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {11262#(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; {11284#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:00:41,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {11284#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {11284#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:00:41,878 INFO L272 TraceCheckUtils]: 28: Hoare triple {11284#(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)); {11198#true} is VALID [2022-04-27 12:00:41,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,878 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11198#true} {11284#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #50#return; {11284#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:00:41,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {11284#(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; {11306#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 12:00:41,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {11306#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !false; {11306#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 12:00:41,884 INFO L272 TraceCheckUtils]: 35: Hoare triple {11306#(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)); {11198#true} is VALID [2022-04-27 12:00:41,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,884 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11198#true} {11306#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #50#return; {11306#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-27 12:00:41,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {11306#(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; {11328#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 12:00:41,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {11328#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {11328#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 12:00:41,885 INFO L272 TraceCheckUtils]: 42: Hoare triple {11328#(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)); {11198#true} is VALID [2022-04-27 12:00:41,885 INFO L290 TraceCheckUtils]: 43: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,886 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11198#true} {11328#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {11328#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 12:00:41,886 INFO L290 TraceCheckUtils]: 47: Hoare triple {11328#(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; {11350#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:41,887 INFO L290 TraceCheckUtils]: 48: Hoare triple {11350#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {11350#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:41,887 INFO L272 TraceCheckUtils]: 49: Hoare triple {11350#(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)); {11198#true} is VALID [2022-04-27 12:00:41,887 INFO L290 TraceCheckUtils]: 50: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,887 INFO L290 TraceCheckUtils]: 51: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,887 INFO L290 TraceCheckUtils]: 52: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,887 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {11198#true} {11350#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #50#return; {11350#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:41,888 INFO L290 TraceCheckUtils]: 54: Hoare triple {11350#(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; {11372#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 12:00:41,888 INFO L290 TraceCheckUtils]: 55: Hoare triple {11372#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {11372#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 12:00:41,888 INFO L272 TraceCheckUtils]: 56: Hoare triple {11372#(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)); {11198#true} is VALID [2022-04-27 12:00:41,888 INFO L290 TraceCheckUtils]: 57: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,888 INFO L290 TraceCheckUtils]: 58: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,888 INFO L290 TraceCheckUtils]: 59: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,889 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11198#true} {11372#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {11372#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 12:00:41,889 INFO L290 TraceCheckUtils]: 61: Hoare triple {11372#(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; {11394#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 12:00:41,889 INFO L290 TraceCheckUtils]: 62: Hoare triple {11394#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {11394#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 12:00:41,889 INFO L272 TraceCheckUtils]: 63: Hoare triple {11394#(and (= 7 (+ (- 1) main_~y~0)) (= 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)); {11198#true} is VALID [2022-04-27 12:00:41,889 INFO L290 TraceCheckUtils]: 64: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,890 INFO L290 TraceCheckUtils]: 65: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,890 INFO L290 TraceCheckUtils]: 66: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,890 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {11198#true} {11394#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #50#return; {11394#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-27 12:00:41,890 INFO L290 TraceCheckUtils]: 68: Hoare triple {11394#(and (= 7 (+ (- 1) main_~y~0)) (= 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; {11416#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 12:00:41,891 INFO L290 TraceCheckUtils]: 69: Hoare triple {11416#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !false; {11416#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 12:00:41,891 INFO L272 TraceCheckUtils]: 70: Hoare triple {11416#(and (= 7 (+ (- 2) 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)); {11198#true} is VALID [2022-04-27 12:00:41,891 INFO L290 TraceCheckUtils]: 71: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,891 INFO L290 TraceCheckUtils]: 72: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,891 INFO L290 TraceCheckUtils]: 73: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,891 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11198#true} {11416#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} #50#return; {11416#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 12:00:41,892 INFO L290 TraceCheckUtils]: 75: Hoare triple {11416#(and (= 7 (+ (- 2) 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; {11438#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 12:00:41,892 INFO L290 TraceCheckUtils]: 76: Hoare triple {11438#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {11438#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 12:00:41,892 INFO L272 TraceCheckUtils]: 77: Hoare triple {11438#(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)); {11198#true} is VALID [2022-04-27 12:00:41,892 INFO L290 TraceCheckUtils]: 78: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,892 INFO L290 TraceCheckUtils]: 79: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,892 INFO L290 TraceCheckUtils]: 80: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,893 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {11198#true} {11438#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #50#return; {11438#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 12:00:41,893 INFO L290 TraceCheckUtils]: 82: Hoare triple {11438#(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; {11460#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 12:00:41,894 INFO L290 TraceCheckUtils]: 83: Hoare triple {11460#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10))} assume !false; {11460#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 12:00:41,894 INFO L272 TraceCheckUtils]: 84: Hoare triple {11460#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 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)); {11198#true} is VALID [2022-04-27 12:00:41,894 INFO L290 TraceCheckUtils]: 85: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,894 INFO L290 TraceCheckUtils]: 86: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,894 INFO L290 TraceCheckUtils]: 87: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,894 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11198#true} {11460#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10))} #50#return; {11460#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 12:00:41,895 INFO L290 TraceCheckUtils]: 89: Hoare triple {11460#(and (= 9 (+ (- 2) main_~c~0)) (= (+ (- 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; {11482#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 12:00:41,899 INFO L290 TraceCheckUtils]: 90: Hoare triple {11482#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} assume !false; {11482#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 12:00:41,900 INFO L272 TraceCheckUtils]: 91: Hoare triple {11482#(and (= main_~y~0 12) (= 9 (+ 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)); {11198#true} is VALID [2022-04-27 12:00:41,900 INFO L290 TraceCheckUtils]: 92: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,900 INFO L290 TraceCheckUtils]: 93: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,900 INFO L290 TraceCheckUtils]: 94: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,900 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {11198#true} {11482#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} #50#return; {11482#(and (= main_~y~0 12) (= 9 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 12:00:41,901 INFO L290 TraceCheckUtils]: 96: Hoare triple {11482#(and (= main_~y~0 12) (= 9 (+ 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; {11504#(and (= 9 (+ main_~c~0 (- 4))) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:41,901 INFO L290 TraceCheckUtils]: 97: Hoare triple {11504#(and (= 9 (+ main_~c~0 (- 4))) (= 12 (+ (- 1) main_~y~0)))} assume !false; {11504#(and (= 9 (+ main_~c~0 (- 4))) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:41,901 INFO L272 TraceCheckUtils]: 98: Hoare triple {11504#(and (= 9 (+ main_~c~0 (- 4))) (= 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)); {11198#true} is VALID [2022-04-27 12:00:41,901 INFO L290 TraceCheckUtils]: 99: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,901 INFO L290 TraceCheckUtils]: 100: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,901 INFO L290 TraceCheckUtils]: 101: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,902 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {11198#true} {11504#(and (= 9 (+ main_~c~0 (- 4))) (= 12 (+ (- 1) main_~y~0)))} #50#return; {11504#(and (= 9 (+ main_~c~0 (- 4))) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:41,902 INFO L290 TraceCheckUtils]: 103: Hoare triple {11504#(and (= 9 (+ main_~c~0 (- 4))) (= 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; {11526#(and (= main_~y~0 14) (= 9 (+ main_~c~0 (- 5))))} is VALID [2022-04-27 12:00:41,903 INFO L290 TraceCheckUtils]: 104: Hoare triple {11526#(and (= main_~y~0 14) (= 9 (+ main_~c~0 (- 5))))} assume !false; {11526#(and (= main_~y~0 14) (= 9 (+ main_~c~0 (- 5))))} is VALID [2022-04-27 12:00:41,903 INFO L272 TraceCheckUtils]: 105: Hoare triple {11526#(and (= main_~y~0 14) (= 9 (+ 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)); {11198#true} is VALID [2022-04-27 12:00:41,903 INFO L290 TraceCheckUtils]: 106: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,903 INFO L290 TraceCheckUtils]: 107: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,903 INFO L290 TraceCheckUtils]: 108: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,903 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {11198#true} {11526#(and (= main_~y~0 14) (= 9 (+ main_~c~0 (- 5))))} #50#return; {11526#(and (= main_~y~0 14) (= 9 (+ main_~c~0 (- 5))))} is VALID [2022-04-27 12:00:41,904 INFO L290 TraceCheckUtils]: 110: Hoare triple {11526#(and (= main_~y~0 14) (= 9 (+ 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; {11548#(and (= main_~y~0 15) (= 9 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 12:00:41,905 INFO L290 TraceCheckUtils]: 111: Hoare triple {11548#(and (= main_~y~0 15) (= 9 (+ main_~c~0 (- 6))))} assume !false; {11548#(and (= main_~y~0 15) (= 9 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 12:00:41,905 INFO L272 TraceCheckUtils]: 112: Hoare triple {11548#(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)); {11198#true} is VALID [2022-04-27 12:00:41,905 INFO L290 TraceCheckUtils]: 113: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,905 INFO L290 TraceCheckUtils]: 114: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,905 INFO L290 TraceCheckUtils]: 115: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,905 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11198#true} {11548#(and (= main_~y~0 15) (= 9 (+ main_~c~0 (- 6))))} #50#return; {11548#(and (= main_~y~0 15) (= 9 (+ main_~c~0 (- 6))))} is VALID [2022-04-27 12:00:41,906 INFO L290 TraceCheckUtils]: 117: Hoare triple {11548#(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; {11570#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 7)) 9))} is VALID [2022-04-27 12:00:41,906 INFO L290 TraceCheckUtils]: 118: Hoare triple {11570#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 7)) 9))} assume !false; {11570#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 7)) 9))} is VALID [2022-04-27 12:00:41,906 INFO L272 TraceCheckUtils]: 119: Hoare triple {11570#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 7)) 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)); {11198#true} is VALID [2022-04-27 12:00:41,906 INFO L290 TraceCheckUtils]: 120: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,906 INFO L290 TraceCheckUtils]: 121: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,906 INFO L290 TraceCheckUtils]: 122: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,907 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {11198#true} {11570#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 7)) 9))} #50#return; {11570#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 7)) 9))} is VALID [2022-04-27 12:00:41,912 INFO L290 TraceCheckUtils]: 124: Hoare triple {11570#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 7)) 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; {11592#(and (= 9 (+ main_~c~0 (- 8))) (= main_~y~0 17))} is VALID [2022-04-27 12:00:41,912 INFO L290 TraceCheckUtils]: 125: Hoare triple {11592#(and (= 9 (+ main_~c~0 (- 8))) (= main_~y~0 17))} assume !false; {11592#(and (= 9 (+ main_~c~0 (- 8))) (= main_~y~0 17))} is VALID [2022-04-27 12:00:41,912 INFO L272 TraceCheckUtils]: 126: Hoare triple {11592#(and (= 9 (+ main_~c~0 (- 8))) (= 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)); {11198#true} is VALID [2022-04-27 12:00:41,912 INFO L290 TraceCheckUtils]: 127: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,912 INFO L290 TraceCheckUtils]: 128: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,912 INFO L290 TraceCheckUtils]: 129: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,913 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {11198#true} {11592#(and (= 9 (+ main_~c~0 (- 8))) (= main_~y~0 17))} #50#return; {11592#(and (= 9 (+ main_~c~0 (- 8))) (= main_~y~0 17))} is VALID [2022-04-27 12:00:41,913 INFO L290 TraceCheckUtils]: 131: Hoare triple {11592#(and (= 9 (+ main_~c~0 (- 8))) (= 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; {11614#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:00:41,913 INFO L290 TraceCheckUtils]: 132: Hoare triple {11614#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !false; {11614#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:00:41,914 INFO L272 TraceCheckUtils]: 133: Hoare triple {11614#(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)); {11198#true} is VALID [2022-04-27 12:00:41,914 INFO L290 TraceCheckUtils]: 134: Hoare triple {11198#true} ~cond := #in~cond; {11198#true} is VALID [2022-04-27 12:00:41,914 INFO L290 TraceCheckUtils]: 135: Hoare triple {11198#true} assume !(0 == ~cond); {11198#true} is VALID [2022-04-27 12:00:41,914 INFO L290 TraceCheckUtils]: 136: Hoare triple {11198#true} assume true; {11198#true} is VALID [2022-04-27 12:00:41,915 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {11198#true} {11614#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} #50#return; {11614#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:00:41,916 INFO L290 TraceCheckUtils]: 138: Hoare triple {11614#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !(~c~0 < ~k~0); {11636#(and (< 17 main_~k~0) (<= main_~k~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:00:41,917 INFO L272 TraceCheckUtils]: 139: Hoare triple {11636#(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)); {11640#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:00:41,917 INFO L290 TraceCheckUtils]: 140: Hoare triple {11640#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11644#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:00:41,917 INFO L290 TraceCheckUtils]: 141: Hoare triple {11644#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11199#false} is VALID [2022-04-27 12:00:41,918 INFO L290 TraceCheckUtils]: 142: Hoare triple {11199#false} assume !false; {11199#false} is VALID [2022-04-27 12:00:41,928 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 12:00:41,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:00:42,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:00:42,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359250432] [2022-04-27 12:00:42,358 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:00:42,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462724210] [2022-04-27 12:00:42,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462724210] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:00:42,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:00:42,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-04-27 12:00:42,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989146073] [2022-04-27 12:00:42,358 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:00:42,358 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 21 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 143 [2022-04-27 12:00:42,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:00:42,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 21 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:00:42,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:42,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 12:00:42,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:00:42,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 12:00:42,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-04-27 12:00:42,461 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 21 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:00:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:46,123 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2022-04-27 12:00:46,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 12:00:46,124 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 21 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 143 [2022-04-27 12:00:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:00:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 21 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:00:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 98 transitions. [2022-04-27 12:00:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 21 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:00:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 98 transitions. [2022-04-27 12:00:46,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 98 transitions. [2022-04-27 12:00:46,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:46,225 INFO L225 Difference]: With dead ends: 84 [2022-04-27 12:00:46,225 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 12:00:46,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2022-04-27 12:00:46,225 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:00:46,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 747 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-27 12:00:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 12:00:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-27 12:00:46,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:00:46,292 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), 23 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:00:46,292 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), 23 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:00:46,292 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), 23 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:00:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:46,295 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2022-04-27 12:00:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-27 12:00:46,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:46,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:46,295 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), 23 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 79 states. [2022-04-27 12:00:46,296 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), 23 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 79 states. [2022-04-27 12:00:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:46,297 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2022-04-27 12:00:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-27 12:00:46,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:46,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:46,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:00:46,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:00:46,302 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), 23 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:00:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2022-04-27 12:00:46,321 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 143 [2022-04-27 12:00:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:00:46,321 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-04-27 12:00:46,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 21 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-27 12:00:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-27 12:00:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-27 12:00:46,322 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:00:46,322 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:00:46,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-27 12:00:46,529 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 12:00:46,530 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:00:46,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:00:46,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1978024123, now seen corresponding path program 19 times [2022-04-27 12:00:46,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:00:46,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018639688] [2022-04-27 12:00:46,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:00:46,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:00:46,542 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:00:46,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [144397775] [2022-04-27 12:00:46,542 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 12:00:46,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:46,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:00:46,548 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 12:00:46,595 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 12:00:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:00:47,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-27 12:00:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:00:47,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:00:48,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {12115#true} call ULTIMATE.init(); {12115#true} is VALID [2022-04-27 12:00:48,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {12115#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); {12115#true} is VALID [2022-04-27 12:00:48,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12115#true} {12115#true} #56#return; {12115#true} is VALID [2022-04-27 12:00:48,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {12115#true} call #t~ret5 := main(); {12115#true} is VALID [2022-04-27 12:00:48,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {12115#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {12135#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:48,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {12135#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {12135#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:48,183 INFO L272 TraceCheckUtils]: 7: Hoare triple {12135#(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)); {12115#true} is VALID [2022-04-27 12:00:48,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,183 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {12115#true} {12135#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {12135#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:48,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {12135#(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; {12157#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:00:48,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {12157#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {12157#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:00:48,184 INFO L272 TraceCheckUtils]: 14: Hoare triple {12157#(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)); {12115#true} is VALID [2022-04-27 12:00:48,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,185 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12115#true} {12157#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {12157#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:00:48,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {12157#(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; {12179#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 12:00:48,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {12179#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {12179#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 12:00:48,186 INFO L272 TraceCheckUtils]: 21: Hoare triple {12179#(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)); {12115#true} is VALID [2022-04-27 12:00:48,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,186 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12115#true} {12179#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #50#return; {12179#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 12:00:48,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {12179#(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; {12201#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:00:48,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {12201#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {12201#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:00:48,187 INFO L272 TraceCheckUtils]: 28: Hoare triple {12201#(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)); {12115#true} is VALID [2022-04-27 12:00:48,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,188 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12115#true} {12201#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {12201#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:00:48,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {12201#(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; {12223#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:48,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {12223#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {12223#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:48,189 INFO L272 TraceCheckUtils]: 35: Hoare triple {12223#(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)); {12115#true} is VALID [2022-04-27 12:00:48,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,189 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12115#true} {12223#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #50#return; {12223#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:48,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {12223#(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; {12245#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 12:00:48,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {12245#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !false; {12245#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 12:00:48,190 INFO L272 TraceCheckUtils]: 42: Hoare triple {12245#(and (= 3 (+ (- 2) 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)); {12115#true} is VALID [2022-04-27 12:00:48,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,191 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12115#true} {12245#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #50#return; {12245#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 12:00:48,191 INFO L290 TraceCheckUtils]: 47: Hoare triple {12245#(and (= 3 (+ (- 2) 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; {12267#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:48,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {12267#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {12267#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:48,191 INFO L272 TraceCheckUtils]: 49: Hoare triple {12267#(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)); {12115#true} is VALID [2022-04-27 12:00:48,191 INFO L290 TraceCheckUtils]: 50: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,192 INFO L290 TraceCheckUtils]: 52: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,192 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12115#true} {12267#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #50#return; {12267#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:48,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {12267#(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; {12289#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 12:00:48,193 INFO L290 TraceCheckUtils]: 55: Hoare triple {12289#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !false; {12289#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 12:00:48,193 INFO L272 TraceCheckUtils]: 56: Hoare triple {12289#(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)); {12115#true} is VALID [2022-04-27 12:00:48,193 INFO L290 TraceCheckUtils]: 57: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,193 INFO L290 TraceCheckUtils]: 58: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,193 INFO L290 TraceCheckUtils]: 59: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,193 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12115#true} {12289#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #50#return; {12289#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 12:00:48,194 INFO L290 TraceCheckUtils]: 61: Hoare triple {12289#(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; {12311#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:48,194 INFO L290 TraceCheckUtils]: 62: Hoare triple {12311#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} assume !false; {12311#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:48,194 INFO L272 TraceCheckUtils]: 63: Hoare triple {12311#(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)); {12115#true} is VALID [2022-04-27 12:00:48,194 INFO L290 TraceCheckUtils]: 64: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,194 INFO L290 TraceCheckUtils]: 65: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,194 INFO L290 TraceCheckUtils]: 66: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,195 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {12115#true} {12311#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} #50#return; {12311#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:48,195 INFO L290 TraceCheckUtils]: 68: Hoare triple {12311#(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; {12333#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:00:48,195 INFO L290 TraceCheckUtils]: 69: Hoare triple {12333#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {12333#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:00:48,196 INFO L272 TraceCheckUtils]: 70: Hoare triple {12333#(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)); {12115#true} is VALID [2022-04-27 12:00:48,196 INFO L290 TraceCheckUtils]: 71: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,196 INFO L290 TraceCheckUtils]: 72: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,196 INFO L290 TraceCheckUtils]: 73: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,196 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12115#true} {12333#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {12333#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:00:48,197 INFO L290 TraceCheckUtils]: 75: Hoare triple {12333#(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; {12355#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 12:00:48,197 INFO L290 TraceCheckUtils]: 76: Hoare triple {12355#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {12355#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 12:00:48,197 INFO L272 TraceCheckUtils]: 77: Hoare triple {12355#(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)); {12115#true} is VALID [2022-04-27 12:00:48,197 INFO L290 TraceCheckUtils]: 78: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,197 INFO L290 TraceCheckUtils]: 79: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,197 INFO L290 TraceCheckUtils]: 80: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,198 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {12115#true} {12355#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #50#return; {12355#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 12:00:48,198 INFO L290 TraceCheckUtils]: 82: Hoare triple {12355#(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; {12377#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:00:48,198 INFO L290 TraceCheckUtils]: 83: Hoare triple {12377#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {12377#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:00:48,198 INFO L272 TraceCheckUtils]: 84: Hoare triple {12377#(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)); {12115#true} is VALID [2022-04-27 12:00:48,198 INFO L290 TraceCheckUtils]: 85: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,198 INFO L290 TraceCheckUtils]: 86: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,198 INFO L290 TraceCheckUtils]: 87: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,199 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12115#true} {12377#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {12377#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:00:48,199 INFO L290 TraceCheckUtils]: 89: Hoare triple {12377#(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; {12399#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 12:00:48,200 INFO L290 TraceCheckUtils]: 90: Hoare triple {12399#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {12399#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 12:00:48,200 INFO L272 TraceCheckUtils]: 91: Hoare triple {12399#(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)); {12115#true} is VALID [2022-04-27 12:00:48,200 INFO L290 TraceCheckUtils]: 92: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,200 INFO L290 TraceCheckUtils]: 93: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,200 INFO L290 TraceCheckUtils]: 94: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,200 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {12115#true} {12399#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {12399#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 12:00:48,201 INFO L290 TraceCheckUtils]: 96: Hoare triple {12399#(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; {12421#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 12:00:48,201 INFO L290 TraceCheckUtils]: 97: Hoare triple {12421#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {12421#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 12:00:48,201 INFO L272 TraceCheckUtils]: 98: Hoare triple {12421#(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)); {12115#true} is VALID [2022-04-27 12:00:48,201 INFO L290 TraceCheckUtils]: 99: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,201 INFO L290 TraceCheckUtils]: 100: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,201 INFO L290 TraceCheckUtils]: 101: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,202 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {12115#true} {12421#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #50#return; {12421#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 12:00:48,202 INFO L290 TraceCheckUtils]: 103: Hoare triple {12421#(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; {12443#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:00:48,202 INFO L290 TraceCheckUtils]: 104: Hoare triple {12443#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} assume !false; {12443#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:00:48,203 INFO L272 TraceCheckUtils]: 105: Hoare triple {12443#(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)); {12115#true} is VALID [2022-04-27 12:00:48,203 INFO L290 TraceCheckUtils]: 106: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,203 INFO L290 TraceCheckUtils]: 107: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,203 INFO L290 TraceCheckUtils]: 108: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,203 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {12115#true} {12443#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} #50#return; {12443#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:00:48,204 INFO L290 TraceCheckUtils]: 110: Hoare triple {12443#(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; {12465#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 12:00:48,204 INFO L290 TraceCheckUtils]: 111: Hoare triple {12465#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} assume !false; {12465#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 12:00:48,204 INFO L272 TraceCheckUtils]: 112: Hoare triple {12465#(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)); {12115#true} is VALID [2022-04-27 12:00:48,204 INFO L290 TraceCheckUtils]: 113: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,204 INFO L290 TraceCheckUtils]: 114: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,204 INFO L290 TraceCheckUtils]: 115: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,204 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {12115#true} {12465#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} #50#return; {12465#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 12:00:48,205 INFO L290 TraceCheckUtils]: 117: Hoare triple {12465#(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; {12487#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 12:00:48,205 INFO L290 TraceCheckUtils]: 118: Hoare triple {12487#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 3)) 13))} assume !false; {12487#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 12:00:48,205 INFO L272 TraceCheckUtils]: 119: Hoare triple {12487#(and (= (+ (- 1) main_~c~0) 15) (= (+ 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)); {12115#true} is VALID [2022-04-27 12:00:48,205 INFO L290 TraceCheckUtils]: 120: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,205 INFO L290 TraceCheckUtils]: 121: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,206 INFO L290 TraceCheckUtils]: 122: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,206 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {12115#true} {12487#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 3)) 13))} #50#return; {12487#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 12:00:48,206 INFO L290 TraceCheckUtils]: 124: Hoare triple {12487#(and (= (+ (- 1) main_~c~0) 15) (= (+ 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; {12509#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-27 12:00:48,207 INFO L290 TraceCheckUtils]: 125: Hoare triple {12509#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} assume !false; {12509#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-27 12:00:48,207 INFO L272 TraceCheckUtils]: 126: Hoare triple {12509#(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)); {12115#true} is VALID [2022-04-27 12:00:48,207 INFO L290 TraceCheckUtils]: 127: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,207 INFO L290 TraceCheckUtils]: 128: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,207 INFO L290 TraceCheckUtils]: 129: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,207 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {12115#true} {12509#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} #50#return; {12509#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-27 12:00:48,208 INFO L290 TraceCheckUtils]: 131: Hoare triple {12509#(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; {12531#(and (= (+ main_~c~0 (- 3)) 15) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 12:00:48,208 INFO L290 TraceCheckUtils]: 132: Hoare triple {12531#(and (= (+ main_~c~0 (- 3)) 15) (= (+ (- 1) main_~y~0) 17))} assume !false; {12531#(and (= (+ main_~c~0 (- 3)) 15) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 12:00:48,208 INFO L272 TraceCheckUtils]: 133: Hoare triple {12531#(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)); {12115#true} is VALID [2022-04-27 12:00:48,208 INFO L290 TraceCheckUtils]: 134: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,208 INFO L290 TraceCheckUtils]: 135: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,208 INFO L290 TraceCheckUtils]: 136: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,209 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {12115#true} {12531#(and (= (+ main_~c~0 (- 3)) 15) (= (+ (- 1) main_~y~0) 17))} #50#return; {12531#(and (= (+ main_~c~0 (- 3)) 15) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 12:00:48,209 INFO L290 TraceCheckUtils]: 138: Hoare triple {12531#(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; {12553#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~c~0 19))} is VALID [2022-04-27 12:00:48,210 INFO L290 TraceCheckUtils]: 139: Hoare triple {12553#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~c~0 19))} assume !false; {12553#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~c~0 19))} is VALID [2022-04-27 12:00:48,210 INFO L272 TraceCheckUtils]: 140: Hoare triple {12553#(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)); {12115#true} is VALID [2022-04-27 12:00:48,210 INFO L290 TraceCheckUtils]: 141: Hoare triple {12115#true} ~cond := #in~cond; {12115#true} is VALID [2022-04-27 12:00:48,210 INFO L290 TraceCheckUtils]: 142: Hoare triple {12115#true} assume !(0 == ~cond); {12115#true} is VALID [2022-04-27 12:00:48,210 INFO L290 TraceCheckUtils]: 143: Hoare triple {12115#true} assume true; {12115#true} is VALID [2022-04-27 12:00:48,210 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {12115#true} {12553#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~c~0 19))} #50#return; {12553#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~c~0 19))} is VALID [2022-04-27 12:00:48,211 INFO L290 TraceCheckUtils]: 145: Hoare triple {12553#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~c~0 19))} assume !(~c~0 < ~k~0); {12575#(and (< 18 main_~k~0) (= (+ (- 2) main_~y~0) 17) (<= main_~k~0 19))} is VALID [2022-04-27 12:00:48,211 INFO L272 TraceCheckUtils]: 146: Hoare triple {12575#(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)); {12579#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:00:48,212 INFO L290 TraceCheckUtils]: 147: Hoare triple {12579#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12583#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:00:48,212 INFO L290 TraceCheckUtils]: 148: Hoare triple {12583#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12116#false} is VALID [2022-04-27 12:00:48,212 INFO L290 TraceCheckUtils]: 149: Hoare triple {12116#false} assume !false; {12116#false} is VALID [2022-04-27 12:00:48,213 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 12:00:48,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:00:48,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:00:48,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018639688] [2022-04-27 12:00:48,641 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:00:48,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144397775] [2022-04-27 12:00:48,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144397775] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:00:48,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:00:48,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-04-27 12:00:48,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260398921] [2022-04-27 12:00:48,642 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:00:48,642 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Word has length 150 [2022-04-27 12:00:48,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:00:48,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:00:48,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:48,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 12:00:48,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:00:48,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 12:00:48,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-04-27 12:00:48,730 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:00:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:52,800 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2022-04-27 12:00:52,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 12:00:52,800 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Word has length 150 [2022-04-27 12:00:52,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:00:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:00:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 102 transitions. [2022-04-27 12:00:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:00:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 102 transitions. [2022-04-27 12:00:52,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 102 transitions. [2022-04-27 12:00:52,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:52,947 INFO L225 Difference]: With dead ends: 87 [2022-04-27 12:00:52,947 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 12:00:52,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2022-04-27 12:00:52,948 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-27 12:00:52,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 804 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-27 12:00:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 12:00:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-27 12:00:53,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:00:53,047 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), 24 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 12:00:53,047 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), 24 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 12:00:53,047 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), 24 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 12:00:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:53,050 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-27 12:00:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-27 12:00:53,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:53,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:53,050 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), 24 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 82 states. [2022-04-27 12:00:53,051 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), 24 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 82 states. [2022-04-27 12:00:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:53,058 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-27 12:00:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-27 12:00:53,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:53,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:53,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:00:53,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:00:53,059 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), 24 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 12:00:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-27 12:00:53,082 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 150 [2022-04-27 12:00:53,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:00:53,082 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-27 12:00:53,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 12:00:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-27 12:00:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-27 12:00:53,084 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:00:53,084 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:00:53,111 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 12:00:53,289 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 12:00:53,289 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:00:53,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:00:53,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1184287794, now seen corresponding path program 20 times [2022-04-27 12:00:53,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:00:53,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942489140] [2022-04-27 12:00:53,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:00:53,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:00:53,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:00:53,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [450592637] [2022-04-27 12:00:53,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:00:53,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:53,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:00:53,305 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 12:00:53,306 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 12:00:53,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:00:53,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:00:53,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-27 12:00:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:00:53,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:00:54,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {13070#true} call ULTIMATE.init(); {13070#true} is VALID [2022-04-27 12:00:54,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {13070#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); {13070#true} is VALID [2022-04-27 12:00:54,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13070#true} {13070#true} #56#return; {13070#true} is VALID [2022-04-27 12:00:54,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {13070#true} call #t~ret5 := main(); {13070#true} is VALID [2022-04-27 12:00:54,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {13070#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {13090#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:54,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {13090#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {13090#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:54,763 INFO L272 TraceCheckUtils]: 7: Hoare triple {13090#(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)); {13070#true} is VALID [2022-04-27 12:00:54,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,763 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {13070#true} {13090#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {13090#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:54,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {13090#(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; {13112#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:00:54,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {13112#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {13112#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:00:54,764 INFO L272 TraceCheckUtils]: 14: Hoare triple {13112#(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)); {13070#true} is VALID [2022-04-27 12:00:54,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,765 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13070#true} {13112#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {13112#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:00:54,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {13112#(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; {13134#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 12:00:54,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {13134#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {13134#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 12:00:54,766 INFO L272 TraceCheckUtils]: 21: Hoare triple {13134#(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)); {13070#true} is VALID [2022-04-27 12:00:54,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,766 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13070#true} {13134#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #50#return; {13134#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 12:00:54,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {13134#(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; {13156#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 12:00:54,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {13156#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {13156#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 12:00:54,767 INFO L272 TraceCheckUtils]: 28: Hoare triple {13156#(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)); {13070#true} is VALID [2022-04-27 12:00:54,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,768 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13070#true} {13156#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #50#return; {13156#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 12:00:54,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {13156#(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; {13178#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:00:54,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {13178#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {13178#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:00:54,768 INFO L272 TraceCheckUtils]: 35: Hoare triple {13178#(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)); {13070#true} is VALID [2022-04-27 12:00:54,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,769 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13070#true} {13178#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {13178#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:00:54,769 INFO L290 TraceCheckUtils]: 40: Hoare triple {13178#(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; {13200#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 12:00:54,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {13200#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {13200#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 12:00:54,770 INFO L272 TraceCheckUtils]: 42: Hoare triple {13200#(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)); {13070#true} is VALID [2022-04-27 12:00:54,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,770 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13070#true} {13200#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #50#return; {13200#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 12:00:54,771 INFO L290 TraceCheckUtils]: 47: Hoare triple {13200#(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; {13222#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:54,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {13222#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !false; {13222#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:54,771 INFO L272 TraceCheckUtils]: 49: Hoare triple {13222#(and (= 4 (+ (- 2) main_~c~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)); {13070#true} is VALID [2022-04-27 12:00:54,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,771 INFO L290 TraceCheckUtils]: 51: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,771 INFO L290 TraceCheckUtils]: 52: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,772 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {13070#true} {13222#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #50#return; {13222#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:00:54,772 INFO L290 TraceCheckUtils]: 54: Hoare triple {13222#(and (= 4 (+ (- 2) main_~c~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; {13244#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 12:00:54,772 INFO L290 TraceCheckUtils]: 55: Hoare triple {13244#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !false; {13244#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 12:00:54,773 INFO L272 TraceCheckUtils]: 56: Hoare triple {13244#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 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)); {13070#true} is VALID [2022-04-27 12:00:54,773 INFO L290 TraceCheckUtils]: 57: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,773 INFO L290 TraceCheckUtils]: 58: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,773 INFO L290 TraceCheckUtils]: 59: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,773 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13070#true} {13244#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #50#return; {13244#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-27 12:00:54,774 INFO L290 TraceCheckUtils]: 61: Hoare triple {13244#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 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; {13266#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 12:00:54,774 INFO L290 TraceCheckUtils]: 62: Hoare triple {13266#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {13266#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 12:00:54,774 INFO L272 TraceCheckUtils]: 63: Hoare triple {13266#(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)); {13070#true} is VALID [2022-04-27 12:00:54,774 INFO L290 TraceCheckUtils]: 64: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,774 INFO L290 TraceCheckUtils]: 65: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,774 INFO L290 TraceCheckUtils]: 66: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,775 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {13070#true} {13266#(and (= main_~y~0 8) (= main_~c~0 8))} #50#return; {13266#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 12:00:54,775 INFO L290 TraceCheckUtils]: 68: Hoare triple {13266#(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; {13288#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 12:00:54,775 INFO L290 TraceCheckUtils]: 69: Hoare triple {13288#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {13288#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 12:00:54,775 INFO L272 TraceCheckUtils]: 70: Hoare triple {13288#(and (= main_~y~0 9) (= (+ (- 1) 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)); {13070#true} is VALID [2022-04-27 12:00:54,775 INFO L290 TraceCheckUtils]: 71: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,775 INFO L290 TraceCheckUtils]: 72: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,776 INFO L290 TraceCheckUtils]: 73: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,776 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13070#true} {13288#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #50#return; {13288#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 12:00:54,776 INFO L290 TraceCheckUtils]: 75: Hoare triple {13288#(and (= main_~y~0 9) (= (+ (- 1) 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; {13310#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:54,777 INFO L290 TraceCheckUtils]: 76: Hoare triple {13310#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} assume !false; {13310#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:54,777 INFO L272 TraceCheckUtils]: 77: Hoare triple {13310#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 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)); {13070#true} is VALID [2022-04-27 12:00:54,777 INFO L290 TraceCheckUtils]: 78: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,791 INFO L290 TraceCheckUtils]: 79: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,791 INFO L290 TraceCheckUtils]: 80: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,809 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13070#true} {13310#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} #50#return; {13310#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:54,810 INFO L290 TraceCheckUtils]: 82: Hoare triple {13310#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 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; {13332#(and (= main_~y~0 11) (= (+ main_~c~0 (- 3)) 8))} is VALID [2022-04-27 12:00:54,810 INFO L290 TraceCheckUtils]: 83: Hoare triple {13332#(and (= main_~y~0 11) (= (+ main_~c~0 (- 3)) 8))} assume !false; {13332#(and (= main_~y~0 11) (= (+ main_~c~0 (- 3)) 8))} is VALID [2022-04-27 12:00:54,810 INFO L272 TraceCheckUtils]: 84: Hoare triple {13332#(and (= main_~y~0 11) (= (+ main_~c~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)); {13070#true} is VALID [2022-04-27 12:00:54,810 INFO L290 TraceCheckUtils]: 85: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,810 INFO L290 TraceCheckUtils]: 86: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,810 INFO L290 TraceCheckUtils]: 87: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,811 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13070#true} {13332#(and (= main_~y~0 11) (= (+ main_~c~0 (- 3)) 8))} #50#return; {13332#(and (= main_~y~0 11) (= (+ main_~c~0 (- 3)) 8))} is VALID [2022-04-27 12:00:54,811 INFO L290 TraceCheckUtils]: 89: Hoare triple {13332#(and (= main_~y~0 11) (= (+ main_~c~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; {13354#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 12:00:54,812 INFO L290 TraceCheckUtils]: 90: Hoare triple {13354#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {13354#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 12:00:54,812 INFO L272 TraceCheckUtils]: 91: Hoare triple {13354#(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)); {13070#true} is VALID [2022-04-27 12:00:54,812 INFO L290 TraceCheckUtils]: 92: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,812 INFO L290 TraceCheckUtils]: 93: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,812 INFO L290 TraceCheckUtils]: 94: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,813 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {13070#true} {13354#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {13354#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 12:00:54,813 INFO L290 TraceCheckUtils]: 96: Hoare triple {13354#(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; {13376#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 12:00:54,814 INFO L290 TraceCheckUtils]: 97: Hoare triple {13376#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {13376#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 12:00:54,814 INFO L272 TraceCheckUtils]: 98: Hoare triple {13376#(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)); {13070#true} is VALID [2022-04-27 12:00:54,814 INFO L290 TraceCheckUtils]: 99: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,814 INFO L290 TraceCheckUtils]: 100: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,814 INFO L290 TraceCheckUtils]: 101: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,815 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {13070#true} {13376#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #50#return; {13376#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 12:00:54,815 INFO L290 TraceCheckUtils]: 103: Hoare triple {13376#(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; {13398#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:00:54,815 INFO L290 TraceCheckUtils]: 104: Hoare triple {13398#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} assume !false; {13398#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:00:54,816 INFO L272 TraceCheckUtils]: 105: Hoare triple {13398#(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)); {13070#true} is VALID [2022-04-27 12:00:54,816 INFO L290 TraceCheckUtils]: 106: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,816 INFO L290 TraceCheckUtils]: 107: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,816 INFO L290 TraceCheckUtils]: 108: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,816 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {13070#true} {13398#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} #50#return; {13398#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:00:54,817 INFO L290 TraceCheckUtils]: 110: Hoare triple {13398#(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; {13420#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 12:00:54,817 INFO L290 TraceCheckUtils]: 111: Hoare triple {13420#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} assume !false; {13420#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 12:00:54,817 INFO L272 TraceCheckUtils]: 112: Hoare triple {13420#(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)); {13070#true} is VALID [2022-04-27 12:00:54,817 INFO L290 TraceCheckUtils]: 113: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,818 INFO L290 TraceCheckUtils]: 114: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,818 INFO L290 TraceCheckUtils]: 115: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,818 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13070#true} {13420#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} #50#return; {13420#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 12:00:54,819 INFO L290 TraceCheckUtils]: 117: Hoare triple {13420#(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; {13442#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-27 12:00:54,819 INFO L290 TraceCheckUtils]: 118: Hoare triple {13442#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !false; {13442#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-27 12:00:54,819 INFO L272 TraceCheckUtils]: 119: Hoare triple {13442#(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)); {13070#true} is VALID [2022-04-27 12:00:54,819 INFO L290 TraceCheckUtils]: 120: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,819 INFO L290 TraceCheckUtils]: 121: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,819 INFO L290 TraceCheckUtils]: 122: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,820 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {13070#true} {13442#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} #50#return; {13442#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-27 12:00:54,820 INFO L290 TraceCheckUtils]: 124: Hoare triple {13442#(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; {13464#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:54,821 INFO L290 TraceCheckUtils]: 125: Hoare triple {13464#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} assume !false; {13464#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:54,821 INFO L272 TraceCheckUtils]: 126: Hoare triple {13464#(and (= 16 (+ (- 1) main_~y~0)) (= 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)); {13070#true} is VALID [2022-04-27 12:00:54,821 INFO L290 TraceCheckUtils]: 127: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,821 INFO L290 TraceCheckUtils]: 128: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,821 INFO L290 TraceCheckUtils]: 129: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,822 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {13070#true} {13464#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} #50#return; {13464#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:00:54,822 INFO L290 TraceCheckUtils]: 131: Hoare triple {13464#(and (= 16 (+ (- 1) main_~y~0)) (= 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; {13486#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-27 12:00:54,823 INFO L290 TraceCheckUtils]: 132: Hoare triple {13486#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} assume !false; {13486#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-27 12:00:54,823 INFO L272 TraceCheckUtils]: 133: Hoare triple {13486#(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)); {13070#true} is VALID [2022-04-27 12:00:54,823 INFO L290 TraceCheckUtils]: 134: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,823 INFO L290 TraceCheckUtils]: 135: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,823 INFO L290 TraceCheckUtils]: 136: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,823 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {13070#true} {13486#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} #50#return; {13486#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-27 12:00:54,824 INFO L290 TraceCheckUtils]: 138: Hoare triple {13486#(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; {13508#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 12:00:54,824 INFO L290 TraceCheckUtils]: 139: Hoare triple {13508#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {13508#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 12:00:54,824 INFO L272 TraceCheckUtils]: 140: Hoare triple {13508#(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)); {13070#true} is VALID [2022-04-27 12:00:54,825 INFO L290 TraceCheckUtils]: 141: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,825 INFO L290 TraceCheckUtils]: 142: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,825 INFO L290 TraceCheckUtils]: 143: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,826 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {13070#true} {13508#(and (= 19 main_~y~0) (= 19 main_~c~0))} #50#return; {13508#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 12:00:54,827 INFO L290 TraceCheckUtils]: 145: Hoare triple {13508#(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; {13530#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-27 12:00:54,827 INFO L290 TraceCheckUtils]: 146: Hoare triple {13530#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} assume !false; {13530#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-27 12:00:54,827 INFO L272 TraceCheckUtils]: 147: Hoare triple {13530#(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)); {13070#true} is VALID [2022-04-27 12:00:54,827 INFO L290 TraceCheckUtils]: 148: Hoare triple {13070#true} ~cond := #in~cond; {13070#true} is VALID [2022-04-27 12:00:54,827 INFO L290 TraceCheckUtils]: 149: Hoare triple {13070#true} assume !(0 == ~cond); {13070#true} is VALID [2022-04-27 12:00:54,827 INFO L290 TraceCheckUtils]: 150: Hoare triple {13070#true} assume true; {13070#true} is VALID [2022-04-27 12:00:54,828 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {13070#true} {13530#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} #50#return; {13530#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-27 12:00:54,829 INFO L290 TraceCheckUtils]: 152: Hoare triple {13530#(and (<= main_~c~0 20) (< 19 main_~k~0) (= main_~y~0 20))} assume !(~c~0 < ~k~0); {13552#(and (<= main_~k~0 20) (< 19 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-27 12:00:54,830 INFO L272 TraceCheckUtils]: 153: Hoare triple {13552#(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)); {13556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:00:54,830 INFO L290 TraceCheckUtils]: 154: Hoare triple {13556#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:00:54,831 INFO L290 TraceCheckUtils]: 155: Hoare triple {13560#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13071#false} is VALID [2022-04-27 12:00:54,831 INFO L290 TraceCheckUtils]: 156: Hoare triple {13071#false} assume !false; {13071#false} is VALID [2022-04-27 12:00:54,832 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 12:00:54,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:00:55,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:00:55,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942489140] [2022-04-27 12:00:55,212 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:00:55,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450592637] [2022-04-27 12:00:55,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450592637] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:00:55,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:00:55,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-27 12:00:55,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16881884] [2022-04-27 12:00:55,212 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:00:55,213 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 23 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Word has length 157 [2022-04-27 12:00:55,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:00:55,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 23 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 12:00:55,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:55,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 12:00:55,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:00:55,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 12:00:55,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-27 12:00:55,428 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 23 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 12:01:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:01,097 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-04-27 12:01:01,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 12:01:01,097 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 23 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Word has length 157 [2022-04-27 12:01:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:01:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 23 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 12:01:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-27 12:01:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 23 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 12:01:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-27 12:01:01,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 106 transitions. [2022-04-27 12:01:01,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:01:01,268 INFO L225 Difference]: With dead ends: 90 [2022-04-27 12:01:01,268 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 12:01:01,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2022-04-27 12:01:01,269 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:01:01,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 863 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 12:01:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 12:01:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-27 12:01:01,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:01:01,336 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), 25 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:01:01,336 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), 25 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:01:01,336 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), 25 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:01:01,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:01,338 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2022-04-27 12:01:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2022-04-27 12:01:01,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:01:01,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:01:01,338 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), 25 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 85 states. [2022-04-27 12:01:01,338 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), 25 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 85 states. [2022-04-27 12:01:01,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:01,341 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2022-04-27 12:01:01,341 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2022-04-27 12:01:01,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:01:01,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:01:01,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:01:01,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:01:01,341 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), 25 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:01:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2022-04-27 12:01:01,343 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 157 [2022-04-27 12:01:01,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:01:01,343 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2022-04-27 12:01:01,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 23 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 12:01:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2022-04-27 12:01:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-27 12:01:01,344 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:01:01,344 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:01:01,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-27 12:01:01,564 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 12:01:01,564 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:01:01,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:01:01,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1391801691, now seen corresponding path program 21 times [2022-04-27 12:01:01,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:01:01,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828369460] [2022-04-27 12:01:01,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:01:01,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:01:01,577 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:01:01,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1770987883] [2022-04-27 12:01:01,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:01:01,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:01:01,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:01:01,583 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 12:01:01,584 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 12:01:03,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2022-04-27 12:01:03,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:01:03,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-27 12:01:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:01:03,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:01:03,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {14063#true} call ULTIMATE.init(); {14063#true} is VALID [2022-04-27 12:01:03,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {14063#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); {14063#true} is VALID [2022-04-27 12:01:03,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14063#true} {14063#true} #56#return; {14063#true} is VALID [2022-04-27 12:01:03,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {14063#true} call #t~ret5 := main(); {14063#true} is VALID [2022-04-27 12:01:03,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {14063#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {14083#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:01:03,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {14083#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {14083#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:01:03,938 INFO L272 TraceCheckUtils]: 7: Hoare triple {14083#(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)); {14063#true} is VALID [2022-04-27 12:01:03,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,938 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {14063#true} {14083#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {14083#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:01:03,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {14083#(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; {14105#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:01:03,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {14105#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {14105#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:01:03,939 INFO L272 TraceCheckUtils]: 14: Hoare triple {14105#(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)); {14063#true} is VALID [2022-04-27 12:01:03,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,940 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14063#true} {14105#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {14105#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:01:03,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {14105#(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; {14127#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 12:01:03,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {14127#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {14127#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 12:01:03,941 INFO L272 TraceCheckUtils]: 21: Hoare triple {14127#(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)); {14063#true} is VALID [2022-04-27 12:01:03,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,941 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14063#true} {14127#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {14127#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 12:01:03,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {14127#(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; {14149#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:01:03,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {14149#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {14149#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:01:03,942 INFO L272 TraceCheckUtils]: 28: Hoare triple {14149#(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)); {14063#true} is VALID [2022-04-27 12:01:03,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,943 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14063#true} {14149#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {14149#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:01:03,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {14149#(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; {14171#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:03,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {14171#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {14171#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:03,944 INFO L272 TraceCheckUtils]: 35: Hoare triple {14171#(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)); {14063#true} is VALID [2022-04-27 12:01:03,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,944 INFO L290 TraceCheckUtils]: 38: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,944 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14063#true} {14171#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #50#return; {14171#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:03,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {14171#(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; {14193#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 12:01:03,945 INFO L290 TraceCheckUtils]: 41: Hoare triple {14193#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !false; {14193#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 12:01:03,945 INFO L272 TraceCheckUtils]: 42: Hoare triple {14193#(and (= 3 (+ (- 2) 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)); {14063#true} is VALID [2022-04-27 12:01:03,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,945 INFO L290 TraceCheckUtils]: 45: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,946 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14063#true} {14193#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #50#return; {14193#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-27 12:01:03,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {14193#(and (= 3 (+ (- 2) 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; {14215#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 12:01:03,946 INFO L290 TraceCheckUtils]: 48: Hoare triple {14215#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {14215#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 12:01:03,946 INFO L272 TraceCheckUtils]: 49: Hoare triple {14215#(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)); {14063#true} is VALID [2022-04-27 12:01:03,946 INFO L290 TraceCheckUtils]: 50: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,947 INFO L290 TraceCheckUtils]: 51: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,947 INFO L290 TraceCheckUtils]: 52: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,947 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {14063#true} {14215#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {14215#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 12:01:03,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {14215#(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; {14237#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:03,948 INFO L290 TraceCheckUtils]: 55: Hoare triple {14237#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {14237#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:03,948 INFO L272 TraceCheckUtils]: 56: Hoare triple {14237#(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)); {14063#true} is VALID [2022-04-27 12:01:03,948 INFO L290 TraceCheckUtils]: 57: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,948 INFO L290 TraceCheckUtils]: 58: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,948 INFO L290 TraceCheckUtils]: 59: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,948 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14063#true} {14237#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #50#return; {14237#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:03,949 INFO L290 TraceCheckUtils]: 61: Hoare triple {14237#(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; {14259#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 12:01:03,949 INFO L290 TraceCheckUtils]: 62: Hoare triple {14259#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {14259#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 12:01:03,949 INFO L272 TraceCheckUtils]: 63: Hoare triple {14259#(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)); {14063#true} is VALID [2022-04-27 12:01:03,949 INFO L290 TraceCheckUtils]: 64: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,949 INFO L290 TraceCheckUtils]: 65: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,949 INFO L290 TraceCheckUtils]: 66: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,950 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {14063#true} {14259#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #50#return; {14259#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 12:01:03,950 INFO L290 TraceCheckUtils]: 68: Hoare triple {14259#(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; {14281#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-27 12:01:03,951 INFO L290 TraceCheckUtils]: 69: Hoare triple {14281#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !false; {14281#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-27 12:01:03,951 INFO L272 TraceCheckUtils]: 70: Hoare triple {14281#(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)); {14063#true} is VALID [2022-04-27 12:01:03,951 INFO L290 TraceCheckUtils]: 71: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,951 INFO L290 TraceCheckUtils]: 72: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,951 INFO L290 TraceCheckUtils]: 73: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,951 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14063#true} {14281#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} #50#return; {14281#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-27 12:01:03,952 INFO L290 TraceCheckUtils]: 75: Hoare triple {14281#(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; {14303#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 12:01:03,952 INFO L290 TraceCheckUtils]: 76: Hoare triple {14303#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {14303#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 12:01:03,952 INFO L272 TraceCheckUtils]: 77: Hoare triple {14303#(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)); {14063#true} is VALID [2022-04-27 12:01:03,952 INFO L290 TraceCheckUtils]: 78: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,952 INFO L290 TraceCheckUtils]: 79: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,952 INFO L290 TraceCheckUtils]: 80: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,953 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14063#true} {14303#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {14303#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 12:01:03,953 INFO L290 TraceCheckUtils]: 82: Hoare triple {14303#(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; {14325#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:01:03,953 INFO L290 TraceCheckUtils]: 83: Hoare triple {14325#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {14325#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:01:03,953 INFO L272 TraceCheckUtils]: 84: Hoare triple {14325#(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)); {14063#true} is VALID [2022-04-27 12:01:03,954 INFO L290 TraceCheckUtils]: 85: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,954 INFO L290 TraceCheckUtils]: 86: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,954 INFO L290 TraceCheckUtils]: 87: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,954 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {14063#true} {14325#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {14325#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:01:03,954 INFO L290 TraceCheckUtils]: 89: Hoare triple {14325#(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; {14347#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 12:01:03,955 INFO L290 TraceCheckUtils]: 90: Hoare triple {14347#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {14347#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 12:01:03,955 INFO L272 TraceCheckUtils]: 91: Hoare triple {14347#(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)); {14063#true} is VALID [2022-04-27 12:01:03,955 INFO L290 TraceCheckUtils]: 92: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,955 INFO L290 TraceCheckUtils]: 93: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,955 INFO L290 TraceCheckUtils]: 94: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,955 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {14063#true} {14347#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #50#return; {14347#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 12:01:03,956 INFO L290 TraceCheckUtils]: 96: Hoare triple {14347#(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; {14369#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 12:01:03,956 INFO L290 TraceCheckUtils]: 97: Hoare triple {14369#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {14369#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 12:01:03,956 INFO L272 TraceCheckUtils]: 98: Hoare triple {14369#(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)); {14063#true} is VALID [2022-04-27 12:01:03,956 INFO L290 TraceCheckUtils]: 99: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,956 INFO L290 TraceCheckUtils]: 100: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,956 INFO L290 TraceCheckUtils]: 101: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,957 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {14063#true} {14369#(and (= main_~c~0 13) (= main_~y~0 13))} #50#return; {14369#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 12:01:03,957 INFO L290 TraceCheckUtils]: 103: Hoare triple {14369#(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; {14391#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:01:03,958 INFO L290 TraceCheckUtils]: 104: Hoare triple {14391#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {14391#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:01:03,958 INFO L272 TraceCheckUtils]: 105: Hoare triple {14391#(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)); {14063#true} is VALID [2022-04-27 12:01:03,958 INFO L290 TraceCheckUtils]: 106: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,958 INFO L290 TraceCheckUtils]: 107: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,958 INFO L290 TraceCheckUtils]: 108: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,958 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {14063#true} {14391#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #50#return; {14391#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:01:03,959 INFO L290 TraceCheckUtils]: 110: Hoare triple {14391#(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; {14413#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 12:01:03,959 INFO L290 TraceCheckUtils]: 111: Hoare triple {14413#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {14413#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 12:01:03,959 INFO L272 TraceCheckUtils]: 112: Hoare triple {14413#(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)); {14063#true} is VALID [2022-04-27 12:01:03,959 INFO L290 TraceCheckUtils]: 113: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,959 INFO L290 TraceCheckUtils]: 114: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,959 INFO L290 TraceCheckUtils]: 115: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,960 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {14063#true} {14413#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #50#return; {14413#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 12:01:03,960 INFO L290 TraceCheckUtils]: 117: Hoare triple {14413#(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; {14435#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-27 12:01:03,960 INFO L290 TraceCheckUtils]: 118: Hoare triple {14435#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} assume !false; {14435#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-27 12:01:03,961 INFO L272 TraceCheckUtils]: 119: Hoare triple {14435#(and (= 14 (+ (- 2) main_~c~0)) (= 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)); {14063#true} is VALID [2022-04-27 12:01:03,961 INFO L290 TraceCheckUtils]: 120: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,961 INFO L290 TraceCheckUtils]: 121: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,961 INFO L290 TraceCheckUtils]: 122: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,961 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {14063#true} {14435#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} #50#return; {14435#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-27 12:01:03,962 INFO L290 TraceCheckUtils]: 124: Hoare triple {14435#(and (= 14 (+ (- 2) main_~c~0)) (= 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; {14457#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:03,962 INFO L290 TraceCheckUtils]: 125: Hoare triple {14457#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {14457#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:03,962 INFO L272 TraceCheckUtils]: 126: Hoare triple {14457#(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)); {14063#true} is VALID [2022-04-27 12:01:03,962 INFO L290 TraceCheckUtils]: 127: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,962 INFO L290 TraceCheckUtils]: 128: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,962 INFO L290 TraceCheckUtils]: 129: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,963 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {14063#true} {14457#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #50#return; {14457#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:03,963 INFO L290 TraceCheckUtils]: 131: Hoare triple {14457#(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; {14479#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 12:01:03,963 INFO L290 TraceCheckUtils]: 132: Hoare triple {14479#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !false; {14479#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 12:01:03,963 INFO L272 TraceCheckUtils]: 133: Hoare triple {14479#(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)); {14063#true} is VALID [2022-04-27 12:01:03,963 INFO L290 TraceCheckUtils]: 134: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,964 INFO L290 TraceCheckUtils]: 135: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,964 INFO L290 TraceCheckUtils]: 136: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,964 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {14063#true} {14479#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} #50#return; {14479#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 12:01:03,964 INFO L290 TraceCheckUtils]: 138: Hoare triple {14479#(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; {14501#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-27 12:01:03,965 INFO L290 TraceCheckUtils]: 139: Hoare triple {14501#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} assume !false; {14501#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-27 12:01:03,965 INFO L272 TraceCheckUtils]: 140: Hoare triple {14501#(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)); {14063#true} is VALID [2022-04-27 12:01:03,965 INFO L290 TraceCheckUtils]: 141: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,965 INFO L290 TraceCheckUtils]: 142: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,965 INFO L290 TraceCheckUtils]: 143: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,965 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {14063#true} {14501#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} #50#return; {14501#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-27 12:01:03,966 INFO L290 TraceCheckUtils]: 145: Hoare triple {14501#(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; {14523#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-27 12:01:03,966 INFO L290 TraceCheckUtils]: 146: Hoare triple {14523#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} assume !false; {14523#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-27 12:01:03,966 INFO L272 TraceCheckUtils]: 147: Hoare triple {14523#(and (= 19 (+ (- 1) main_~c~0)) (= (+ 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)); {14063#true} is VALID [2022-04-27 12:01:03,966 INFO L290 TraceCheckUtils]: 148: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,966 INFO L290 TraceCheckUtils]: 149: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,966 INFO L290 TraceCheckUtils]: 150: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,967 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {14063#true} {14523#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} #50#return; {14523#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-27 12:01:03,967 INFO L290 TraceCheckUtils]: 152: Hoare triple {14523#(and (= 19 (+ (- 1) main_~c~0)) (= (+ 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; {14545#(and (<= main_~c~0 21) (< 20 main_~k~0) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 12:01:03,968 INFO L290 TraceCheckUtils]: 153: Hoare triple {14545#(and (<= main_~c~0 21) (< 20 main_~k~0) (= 16 (+ main_~y~0 (- 5))))} assume !false; {14545#(and (<= main_~c~0 21) (< 20 main_~k~0) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 12:01:03,968 INFO L272 TraceCheckUtils]: 154: Hoare triple {14545#(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)); {14063#true} is VALID [2022-04-27 12:01:03,968 INFO L290 TraceCheckUtils]: 155: Hoare triple {14063#true} ~cond := #in~cond; {14063#true} is VALID [2022-04-27 12:01:03,968 INFO L290 TraceCheckUtils]: 156: Hoare triple {14063#true} assume !(0 == ~cond); {14063#true} is VALID [2022-04-27 12:01:03,968 INFO L290 TraceCheckUtils]: 157: Hoare triple {14063#true} assume true; {14063#true} is VALID [2022-04-27 12:01:03,968 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {14063#true} {14545#(and (<= main_~c~0 21) (< 20 main_~k~0) (= 16 (+ main_~y~0 (- 5))))} #50#return; {14545#(and (<= main_~c~0 21) (< 20 main_~k~0) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 12:01:03,969 INFO L290 TraceCheckUtils]: 159: Hoare triple {14545#(and (<= main_~c~0 21) (< 20 main_~k~0) (= 16 (+ main_~y~0 (- 5))))} assume !(~c~0 < ~k~0); {14567#(and (< 20 main_~k~0) (<= main_~k~0 21) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 12:01:03,970 INFO L272 TraceCheckUtils]: 160: Hoare triple {14567#(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)); {14571#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:01:03,970 INFO L290 TraceCheckUtils]: 161: Hoare triple {14571#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14575#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:01:03,970 INFO L290 TraceCheckUtils]: 162: Hoare triple {14575#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14064#false} is VALID [2022-04-27 12:01:03,970 INFO L290 TraceCheckUtils]: 163: Hoare triple {14064#false} assume !false; {14064#false} is VALID [2022-04-27 12:01:03,971 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 12:01:03,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:01:04,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:01:04,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828369460] [2022-04-27 12:01:04,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:01:04,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770987883] [2022-04-27 12:01:04,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770987883] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:01:04,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:01:04,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-04-27 12:01:04,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707830586] [2022-04-27 12:01:04,344 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:01:04,345 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 24 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Word has length 164 [2022-04-27 12:01:04,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:01:04,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 24 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:01:04,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:01:04,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-27 12:01:04,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:01:04,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-27 12:01:04,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-04-27 12:01:04,454 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 24 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:01:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:10,979 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2022-04-27 12:01:10,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 12:01:10,980 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 24 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Word has length 164 [2022-04-27 12:01:10,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:01:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 24 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:01:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 110 transitions. [2022-04-27 12:01:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 24 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:01:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 110 transitions. [2022-04-27 12:01:10,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 110 transitions. [2022-04-27 12:01:11,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:01:11,192 INFO L225 Difference]: With dead ends: 93 [2022-04-27 12:01:11,192 INFO L226 Difference]: Without dead ends: 88 [2022-04-27 12:01:11,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2022-04-27 12:01:11,193 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:01:11,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 924 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1686 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-27 12:01:11,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-27 12:01:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-27 12:01:11,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:01:11,276 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), 26 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:01:11,276 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), 26 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:01:11,276 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), 26 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:01:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:11,277 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2022-04-27 12:01:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-04-27 12:01:11,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:01:11,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:01:11,278 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), 26 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 88 states. [2022-04-27 12:01:11,278 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), 26 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 88 states. [2022-04-27 12:01:11,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:11,279 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2022-04-27 12:01:11,279 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-04-27 12:01:11,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:01:11,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:01:11,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:01:11,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:01:11,280 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), 26 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:01:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-04-27 12:01:11,281 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 164 [2022-04-27 12:01:11,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:01:11,282 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-04-27 12:01:11,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 24 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:01:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-04-27 12:01:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-27 12:01:11,283 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:01:11,283 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:01:11,293 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 12:01:11,490 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 12:01:11,490 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:01:11,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:01:11,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1008454446, now seen corresponding path program 22 times [2022-04-27 12:01:11,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:01:11,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736347910] [2022-04-27 12:01:11,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:01:11,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:01:11,504 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:01:11,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1626563111] [2022-04-27 12:01:11,504 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 12:01:11,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:01:11,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:01:11,505 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 12:01:11,506 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 12:01:13,354 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 12:01:13,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:01:13,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-27 12:01:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:01:13,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:01:14,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {15094#true} call ULTIMATE.init(); {15094#true} is VALID [2022-04-27 12:01:14,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {15094#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); {15094#true} is VALID [2022-04-27 12:01:14,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15094#true} {15094#true} #56#return; {15094#true} is VALID [2022-04-27 12:01:14,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {15094#true} call #t~ret5 := main(); {15094#true} is VALID [2022-04-27 12:01:14,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {15094#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {15114#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:01:14,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {15114#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {15114#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:01:14,390 INFO L272 TraceCheckUtils]: 7: Hoare triple {15114#(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)); {15094#true} is VALID [2022-04-27 12:01:14,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,390 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {15094#true} {15114#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {15114#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:01:14,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {15114#(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; {15136#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:01:14,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {15136#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {15136#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:01:14,391 INFO L272 TraceCheckUtils]: 14: Hoare triple {15136#(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)); {15094#true} is VALID [2022-04-27 12:01:14,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,392 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15094#true} {15136#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {15136#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:01:14,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {15136#(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; {15158#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:14,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {15158#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {15158#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:14,392 INFO L272 TraceCheckUtils]: 21: Hoare triple {15158#(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)); {15094#true} is VALID [2022-04-27 12:01:14,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,393 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15094#true} {15158#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #50#return; {15158#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:14,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {15158#(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; {15180#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 12:01:14,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {15180#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {15180#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 12:01:14,394 INFO L272 TraceCheckUtils]: 28: Hoare triple {15180#(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)); {15094#true} is VALID [2022-04-27 12:01:14,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,395 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15094#true} {15180#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #50#return; {15180#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 12:01:14,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {15180#(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; {15202#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 12:01:14,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {15202#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {15202#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 12:01:14,395 INFO L272 TraceCheckUtils]: 35: Hoare triple {15202#(and (= main_~c~0 4) (= (+ (- 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)); {15094#true} is VALID [2022-04-27 12:01:14,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,396 INFO L290 TraceCheckUtils]: 37: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,396 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15094#true} {15202#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #50#return; {15202#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 12:01:14,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {15202#(and (= main_~c~0 4) (= (+ (- 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; {15224#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:01:14,397 INFO L290 TraceCheckUtils]: 41: Hoare triple {15224#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} assume !false; {15224#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:01:14,397 INFO L272 TraceCheckUtils]: 42: Hoare triple {15224#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) 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)); {15094#true} is VALID [2022-04-27 12:01:14,397 INFO L290 TraceCheckUtils]: 43: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,398 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15094#true} {15224#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} #50#return; {15224#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:01:14,398 INFO L290 TraceCheckUtils]: 47: Hoare triple {15224#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) 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; {15246#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:14,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {15246#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} assume !false; {15246#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:14,398 INFO L272 TraceCheckUtils]: 49: Hoare triple {15246#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 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)); {15094#true} is VALID [2022-04-27 12:01:14,398 INFO L290 TraceCheckUtils]: 50: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,398 INFO L290 TraceCheckUtils]: 51: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,399 INFO L290 TraceCheckUtils]: 52: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,399 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15094#true} {15246#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} #50#return; {15246#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:14,399 INFO L290 TraceCheckUtils]: 54: Hoare triple {15246#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 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; {15268#(and (= 7 main_~c~0) (= 2 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 12:01:14,400 INFO L290 TraceCheckUtils]: 55: Hoare triple {15268#(and (= 7 main_~c~0) (= 2 (+ main_~y~0 (- 5))))} assume !false; {15268#(and (= 7 main_~c~0) (= 2 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 12:01:14,400 INFO L272 TraceCheckUtils]: 56: Hoare triple {15268#(and (= 7 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)); {15094#true} is VALID [2022-04-27 12:01:14,400 INFO L290 TraceCheckUtils]: 57: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,400 INFO L290 TraceCheckUtils]: 58: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,400 INFO L290 TraceCheckUtils]: 59: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,400 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15094#true} {15268#(and (= 7 main_~c~0) (= 2 (+ main_~y~0 (- 5))))} #50#return; {15268#(and (= 7 main_~c~0) (= 2 (+ main_~y~0 (- 5))))} is VALID [2022-04-27 12:01:14,401 INFO L290 TraceCheckUtils]: 61: Hoare triple {15268#(and (= 7 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; {15290#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8))} is VALID [2022-04-27 12:01:14,401 INFO L290 TraceCheckUtils]: 62: Hoare triple {15290#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8))} assume !false; {15290#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8))} is VALID [2022-04-27 12:01:14,401 INFO L272 TraceCheckUtils]: 63: Hoare triple {15290#(and (= (+ main_~y~0 (- 6)) 2) (= 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)); {15094#true} is VALID [2022-04-27 12:01:14,401 INFO L290 TraceCheckUtils]: 64: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,401 INFO L290 TraceCheckUtils]: 65: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,401 INFO L290 TraceCheckUtils]: 66: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,402 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {15094#true} {15290#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8))} #50#return; {15290#(and (= (+ main_~y~0 (- 6)) 2) (= main_~c~0 8))} is VALID [2022-04-27 12:01:14,402 INFO L290 TraceCheckUtils]: 68: Hoare triple {15290#(and (= (+ main_~y~0 (- 6)) 2) (= 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; {15312#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 12:01:14,402 INFO L290 TraceCheckUtils]: 69: Hoare triple {15312#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {15312#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 12:01:14,403 INFO L272 TraceCheckUtils]: 70: Hoare triple {15312#(and (= main_~y~0 9) (= (+ (- 1) 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)); {15094#true} is VALID [2022-04-27 12:01:14,403 INFO L290 TraceCheckUtils]: 71: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,403 INFO L290 TraceCheckUtils]: 72: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,403 INFO L290 TraceCheckUtils]: 73: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,403 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15094#true} {15312#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #50#return; {15312#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 12:01:14,404 INFO L290 TraceCheckUtils]: 75: Hoare triple {15312#(and (= main_~y~0 9) (= (+ (- 1) 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; {15334#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 12:01:14,404 INFO L290 TraceCheckUtils]: 76: Hoare triple {15334#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {15334#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 12:01:14,404 INFO L272 TraceCheckUtils]: 77: Hoare triple {15334#(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)); {15094#true} is VALID [2022-04-27 12:01:14,404 INFO L290 TraceCheckUtils]: 78: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,404 INFO L290 TraceCheckUtils]: 79: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,404 INFO L290 TraceCheckUtils]: 80: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,405 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {15094#true} {15334#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #50#return; {15334#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 12:01:14,405 INFO L290 TraceCheckUtils]: 82: Hoare triple {15334#(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; {15356#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:01:14,405 INFO L290 TraceCheckUtils]: 83: Hoare triple {15356#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {15356#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:01:14,405 INFO L272 TraceCheckUtils]: 84: Hoare triple {15356#(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)); {15094#true} is VALID [2022-04-27 12:01:14,405 INFO L290 TraceCheckUtils]: 85: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,406 INFO L290 TraceCheckUtils]: 86: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,406 INFO L290 TraceCheckUtils]: 87: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,406 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {15094#true} {15356#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {15356#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:01:14,406 INFO L290 TraceCheckUtils]: 89: Hoare triple {15356#(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; {15378#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:14,407 INFO L290 TraceCheckUtils]: 90: Hoare triple {15378#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} assume !false; {15378#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:14,407 INFO L272 TraceCheckUtils]: 91: Hoare triple {15378#(and (= main_~y~0 12) (= 10 (+ (- 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)); {15094#true} is VALID [2022-04-27 12:01:14,407 INFO L290 TraceCheckUtils]: 92: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,407 INFO L290 TraceCheckUtils]: 93: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,407 INFO L290 TraceCheckUtils]: 94: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,407 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {15094#true} {15378#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} #50#return; {15378#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:14,408 INFO L290 TraceCheckUtils]: 96: Hoare triple {15378#(and (= main_~y~0 12) (= 10 (+ (- 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; {15400#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-27 12:01:14,408 INFO L290 TraceCheckUtils]: 97: Hoare triple {15400#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} assume !false; {15400#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-27 12:01:14,408 INFO L272 TraceCheckUtils]: 98: Hoare triple {15400#(and (= (+ main_~c~0 (- 3)) 10) (= 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)); {15094#true} is VALID [2022-04-27 12:01:14,408 INFO L290 TraceCheckUtils]: 99: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,408 INFO L290 TraceCheckUtils]: 100: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,408 INFO L290 TraceCheckUtils]: 101: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,409 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {15094#true} {15400#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} #50#return; {15400#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-27 12:01:14,409 INFO L290 TraceCheckUtils]: 103: Hoare triple {15400#(and (= (+ main_~c~0 (- 3)) 10) (= 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; {15422#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:01:14,410 INFO L290 TraceCheckUtils]: 104: Hoare triple {15422#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} assume !false; {15422#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:01:14,410 INFO L272 TraceCheckUtils]: 105: Hoare triple {15422#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 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)); {15094#true} is VALID [2022-04-27 12:01:14,410 INFO L290 TraceCheckUtils]: 106: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,410 INFO L290 TraceCheckUtils]: 107: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,410 INFO L290 TraceCheckUtils]: 108: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,410 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {15094#true} {15422#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} #50#return; {15422#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:01:14,411 INFO L290 TraceCheckUtils]: 110: Hoare triple {15422#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 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; {15444#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 12:01:14,411 INFO L290 TraceCheckUtils]: 111: Hoare triple {15444#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} assume !false; {15444#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 12:01:14,411 INFO L272 TraceCheckUtils]: 112: Hoare triple {15444#(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)); {15094#true} is VALID [2022-04-27 12:01:14,411 INFO L290 TraceCheckUtils]: 113: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,411 INFO L290 TraceCheckUtils]: 114: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,411 INFO L290 TraceCheckUtils]: 115: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,412 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15094#true} {15444#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} #50#return; {15444#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 12:01:14,412 INFO L290 TraceCheckUtils]: 117: Hoare triple {15444#(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; {15466#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 12:01:14,412 INFO L290 TraceCheckUtils]: 118: Hoare triple {15466#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 3)) 13))} assume !false; {15466#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 12:01:14,412 INFO L272 TraceCheckUtils]: 119: Hoare triple {15466#(and (= (+ (- 1) main_~c~0) 15) (= (+ 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)); {15094#true} is VALID [2022-04-27 12:01:14,413 INFO L290 TraceCheckUtils]: 120: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,413 INFO L290 TraceCheckUtils]: 121: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,413 INFO L290 TraceCheckUtils]: 122: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,413 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {15094#true} {15466#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 3)) 13))} #50#return; {15466#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 12:01:14,413 INFO L290 TraceCheckUtils]: 124: Hoare triple {15466#(and (= (+ (- 1) main_~c~0) 15) (= (+ 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; {15488#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 12:01:14,414 INFO L290 TraceCheckUtils]: 125: Hoare triple {15488#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {15488#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 12:01:14,414 INFO L272 TraceCheckUtils]: 126: Hoare triple {15488#(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)); {15094#true} is VALID [2022-04-27 12:01:14,414 INFO L290 TraceCheckUtils]: 127: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,414 INFO L290 TraceCheckUtils]: 128: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,414 INFO L290 TraceCheckUtils]: 129: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,414 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {15094#true} {15488#(and (= main_~c~0 17) (= main_~y~0 17))} #50#return; {15488#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 12:01:14,415 INFO L290 TraceCheckUtils]: 131: Hoare triple {15488#(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; {15510#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:01:14,415 INFO L290 TraceCheckUtils]: 132: Hoare triple {15510#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {15510#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:01:14,415 INFO L272 TraceCheckUtils]: 133: Hoare triple {15510#(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)); {15094#true} is VALID [2022-04-27 12:01:14,415 INFO L290 TraceCheckUtils]: 134: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,415 INFO L290 TraceCheckUtils]: 135: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,415 INFO L290 TraceCheckUtils]: 136: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,416 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {15094#true} {15510#(and (= main_~c~0 18) (= main_~y~0 18))} #50#return; {15510#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:01:14,416 INFO L290 TraceCheckUtils]: 138: Hoare triple {15510#(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; {15532#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 12:01:14,416 INFO L290 TraceCheckUtils]: 139: Hoare triple {15532#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {15532#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 12:01:14,417 INFO L272 TraceCheckUtils]: 140: Hoare triple {15532#(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)); {15094#true} is VALID [2022-04-27 12:01:14,417 INFO L290 TraceCheckUtils]: 141: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,417 INFO L290 TraceCheckUtils]: 142: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,417 INFO L290 TraceCheckUtils]: 143: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,417 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {15094#true} {15532#(and (= 19 main_~y~0) (= 19 main_~c~0))} #50#return; {15532#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 12:01:14,418 INFO L290 TraceCheckUtils]: 145: Hoare triple {15532#(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; {15554#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-27 12:01:14,418 INFO L290 TraceCheckUtils]: 146: Hoare triple {15554#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} assume !false; {15554#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-27 12:01:14,418 INFO L272 TraceCheckUtils]: 147: Hoare triple {15554#(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)); {15094#true} is VALID [2022-04-27 12:01:14,418 INFO L290 TraceCheckUtils]: 148: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,418 INFO L290 TraceCheckUtils]: 149: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,418 INFO L290 TraceCheckUtils]: 150: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,419 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {15094#true} {15554#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} #50#return; {15554#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-27 12:01:14,419 INFO L290 TraceCheckUtils]: 152: Hoare triple {15554#(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; {15576#(and (= (+ (- 1) main_~c~0) 20) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 12:01:14,419 INFO L290 TraceCheckUtils]: 153: Hoare triple {15576#(and (= (+ (- 1) main_~c~0) 20) (= 19 (+ (- 2) main_~y~0)))} assume !false; {15576#(and (= (+ (- 1) main_~c~0) 20) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 12:01:14,419 INFO L272 TraceCheckUtils]: 154: Hoare triple {15576#(and (= (+ (- 1) main_~c~0) 20) (= 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)); {15094#true} is VALID [2022-04-27 12:01:14,419 INFO L290 TraceCheckUtils]: 155: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,420 INFO L290 TraceCheckUtils]: 156: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,420 INFO L290 TraceCheckUtils]: 157: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,420 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {15094#true} {15576#(and (= (+ (- 1) main_~c~0) 20) (= 19 (+ (- 2) main_~y~0)))} #50#return; {15576#(and (= (+ (- 1) main_~c~0) 20) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 12:01:14,420 INFO L290 TraceCheckUtils]: 159: Hoare triple {15576#(and (= (+ (- 1) main_~c~0) 20) (= 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; {15598#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-27 12:01:14,421 INFO L290 TraceCheckUtils]: 160: Hoare triple {15598#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} assume !false; {15598#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-27 12:01:14,421 INFO L272 TraceCheckUtils]: 161: Hoare triple {15598#(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)); {15094#true} is VALID [2022-04-27 12:01:14,421 INFO L290 TraceCheckUtils]: 162: Hoare triple {15094#true} ~cond := #in~cond; {15094#true} is VALID [2022-04-27 12:01:14,421 INFO L290 TraceCheckUtils]: 163: Hoare triple {15094#true} assume !(0 == ~cond); {15094#true} is VALID [2022-04-27 12:01:14,421 INFO L290 TraceCheckUtils]: 164: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-04-27 12:01:14,421 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {15094#true} {15598#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} #50#return; {15598#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-27 12:01:14,422 INFO L290 TraceCheckUtils]: 166: Hoare triple {15598#(and (<= main_~c~0 22) (= main_~y~0 22) (< 21 main_~k~0))} assume !(~c~0 < ~k~0); {15620#(and (<= main_~k~0 22) (= main_~y~0 22) (< 21 main_~k~0))} is VALID [2022-04-27 12:01:14,423 INFO L272 TraceCheckUtils]: 167: Hoare triple {15620#(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)); {15624#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:01:14,423 INFO L290 TraceCheckUtils]: 168: Hoare triple {15624#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15628#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:01:14,424 INFO L290 TraceCheckUtils]: 169: Hoare triple {15628#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15095#false} is VALID [2022-04-27 12:01:14,424 INFO L290 TraceCheckUtils]: 170: Hoare triple {15095#false} assume !false; {15095#false} is VALID [2022-04-27 12:01:14,425 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 12:01:14,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:01:15,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:01:15,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736347910] [2022-04-27 12:01:15,211 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:01:15,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626563111] [2022-04-27 12:01:15,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626563111] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:01:15,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:01:15,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-04-27 12:01:15,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334271582] [2022-04-27 12:01:15,211 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:01:15,211 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 25 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Word has length 171 [2022-04-27 12:01:15,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:01:15,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 25 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:01:15,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:01:15,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 12:01:15,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:01:15,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 12:01:15,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-04-27 12:01:15,336 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 25 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:01:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:21,447 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-27 12:01:21,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-27 12:01:21,447 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 25 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Word has length 171 [2022-04-27 12:01:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:01:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 25 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:01:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 114 transitions. [2022-04-27 12:01:21,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 25 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:01:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 114 transitions. [2022-04-27 12:01:21,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 114 transitions. [2022-04-27 12:01:21,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:01:21,782 INFO L225 Difference]: With dead ends: 96 [2022-04-27 12:01:21,782 INFO L226 Difference]: Without dead ends: 91 [2022-04-27 12:01:21,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 12:01:21,783 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 1831 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:01:21,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 987 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1831 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-27 12:01:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-27 12:01:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-27 12:01:21,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:01:21,886 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), 27 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:01:21,886 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), 27 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:01:21,886 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), 27 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:01:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:21,888 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-04-27 12:01:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-04-27 12:01:21,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:01:21,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:01:21,888 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), 27 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 91 states. [2022-04-27 12:01:21,888 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), 27 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 91 states. [2022-04-27 12:01:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:21,890 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-04-27 12:01:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-04-27 12:01:21,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:01:21,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:01:21,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:01:21,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:01:21,890 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), 27 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:01:21,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2022-04-27 12:01:21,892 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 171 [2022-04-27 12:01:21,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:01:21,892 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2022-04-27 12:01:21,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 25 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:01:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-04-27 12:01:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-27 12:01:21,893 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:01:21,893 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:01:21,902 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 12:01:22,100 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 12:01:22,101 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:01:22,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:01:22,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1981050373, now seen corresponding path program 23 times [2022-04-27 12:01:22,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:01:22,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624646426] [2022-04-27 12:01:22,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:01:22,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:01:22,119 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:01:22,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [945078205] [2022-04-27 12:01:22,135 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 12:01:22,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:01:22,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:01:22,137 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 12:01:22,180 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 12:01:24,018 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-04-27 12:01:24,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:01:24,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-27 12:01:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:01:24,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:01:25,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {16163#true} call ULTIMATE.init(); {16163#true} is VALID [2022-04-27 12:01:25,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {16163#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); {16163#true} is VALID [2022-04-27 12:01:25,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16163#true} {16163#true} #56#return; {16163#true} is VALID [2022-04-27 12:01:25,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {16163#true} call #t~ret5 := main(); {16163#true} is VALID [2022-04-27 12:01:25,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {16163#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {16183#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:01:25,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {16183#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {16183#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:01:25,123 INFO L272 TraceCheckUtils]: 7: Hoare triple {16183#(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)); {16163#true} is VALID [2022-04-27 12:01:25,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,124 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {16163#true} {16183#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {16183#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:01:25,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {16183#(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; {16205#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:01:25,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {16205#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {16205#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:01:25,125 INFO L272 TraceCheckUtils]: 14: Hoare triple {16205#(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)); {16163#true} is VALID [2022-04-27 12:01:25,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,126 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16163#true} {16205#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {16205#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:01:25,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {16205#(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; {16227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:25,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {16227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {16227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:25,126 INFO L272 TraceCheckUtils]: 21: Hoare triple {16227#(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)); {16163#true} is VALID [2022-04-27 12:01:25,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,127 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16163#true} {16227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #50#return; {16227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:25,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {16227#(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; {16249#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:01:25,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {16249#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {16249#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:01:25,128 INFO L272 TraceCheckUtils]: 28: Hoare triple {16249#(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)); {16163#true} is VALID [2022-04-27 12:01:25,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,128 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16163#true} {16249#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {16249#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:01:25,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {16249#(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; {16271#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:01:25,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {16271#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {16271#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:01:25,129 INFO L272 TraceCheckUtils]: 35: Hoare triple {16271#(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)); {16163#true} is VALID [2022-04-27 12:01:25,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,130 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16163#true} {16271#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #50#return; {16271#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:01:25,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {16271#(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; {16293#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 12:01:25,131 INFO L290 TraceCheckUtils]: 41: Hoare triple {16293#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {16293#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 12:01:25,131 INFO L272 TraceCheckUtils]: 42: Hoare triple {16293#(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)); {16163#true} is VALID [2022-04-27 12:01:25,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,131 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16163#true} {16293#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #50#return; {16293#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 12:01:25,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {16293#(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; {16315#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 12:01:25,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {16315#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {16315#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 12:01:25,132 INFO L272 TraceCheckUtils]: 49: Hoare triple {16315#(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)); {16163#true} is VALID [2022-04-27 12:01:25,132 INFO L290 TraceCheckUtils]: 50: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,132 INFO L290 TraceCheckUtils]: 51: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,132 INFO L290 TraceCheckUtils]: 52: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,133 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16163#true} {16315#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {16315#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 12:01:25,133 INFO L290 TraceCheckUtils]: 54: Hoare triple {16315#(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; {16337#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:01:25,133 INFO L290 TraceCheckUtils]: 55: Hoare triple {16337#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {16337#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:01:25,133 INFO L272 TraceCheckUtils]: 56: Hoare triple {16337#(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)); {16163#true} is VALID [2022-04-27 12:01:25,134 INFO L290 TraceCheckUtils]: 57: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,134 INFO L290 TraceCheckUtils]: 58: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,134 INFO L290 TraceCheckUtils]: 59: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,134 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16163#true} {16337#(and (= 7 main_~y~0) (= 7 main_~c~0))} #50#return; {16337#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:01:25,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {16337#(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; {16359#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:01:25,135 INFO L290 TraceCheckUtils]: 62: Hoare triple {16359#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {16359#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:01:25,135 INFO L272 TraceCheckUtils]: 63: Hoare triple {16359#(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)); {16163#true} is VALID [2022-04-27 12:01:25,135 INFO L290 TraceCheckUtils]: 64: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,135 INFO L290 TraceCheckUtils]: 65: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,135 INFO L290 TraceCheckUtils]: 66: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,136 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {16163#true} {16359#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #50#return; {16359#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:01:25,136 INFO L290 TraceCheckUtils]: 68: Hoare triple {16359#(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; {16381#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:25,136 INFO L290 TraceCheckUtils]: 69: Hoare triple {16381#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {16381#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:25,136 INFO L272 TraceCheckUtils]: 70: Hoare triple {16381#(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)); {16163#true} is VALID [2022-04-27 12:01:25,136 INFO L290 TraceCheckUtils]: 71: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,136 INFO L290 TraceCheckUtils]: 72: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,137 INFO L290 TraceCheckUtils]: 73: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,137 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16163#true} {16381#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #50#return; {16381#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:25,137 INFO L290 TraceCheckUtils]: 75: Hoare triple {16381#(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; {16403#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 12:01:25,138 INFO L290 TraceCheckUtils]: 76: Hoare triple {16403#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {16403#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 12:01:25,138 INFO L272 TraceCheckUtils]: 77: Hoare triple {16403#(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)); {16163#true} is VALID [2022-04-27 12:01:25,138 INFO L290 TraceCheckUtils]: 78: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,138 INFO L290 TraceCheckUtils]: 79: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,138 INFO L290 TraceCheckUtils]: 80: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,138 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16163#true} {16403#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {16403#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 12:01:25,139 INFO L290 TraceCheckUtils]: 82: Hoare triple {16403#(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; {16425#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:01:25,139 INFO L290 TraceCheckUtils]: 83: Hoare triple {16425#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {16425#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:01:25,139 INFO L272 TraceCheckUtils]: 84: Hoare triple {16425#(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)); {16163#true} is VALID [2022-04-27 12:01:25,139 INFO L290 TraceCheckUtils]: 85: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,139 INFO L290 TraceCheckUtils]: 86: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,139 INFO L290 TraceCheckUtils]: 87: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,140 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {16163#true} {16425#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {16425#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:01:25,140 INFO L290 TraceCheckUtils]: 89: Hoare triple {16425#(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; {16447#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:25,141 INFO L290 TraceCheckUtils]: 90: Hoare triple {16447#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} assume !false; {16447#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:25,141 INFO L272 TraceCheckUtils]: 91: Hoare triple {16447#(and (= main_~y~0 12) (= 10 (+ (- 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)); {16163#true} is VALID [2022-04-27 12:01:25,141 INFO L290 TraceCheckUtils]: 92: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,141 INFO L290 TraceCheckUtils]: 93: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,141 INFO L290 TraceCheckUtils]: 94: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,141 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {16163#true} {16447#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} #50#return; {16447#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:25,142 INFO L290 TraceCheckUtils]: 96: Hoare triple {16447#(and (= main_~y~0 12) (= 10 (+ (- 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; {16469#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:25,142 INFO L290 TraceCheckUtils]: 97: Hoare triple {16469#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} assume !false; {16469#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:25,142 INFO L272 TraceCheckUtils]: 98: Hoare triple {16469#(and (= (+ main_~c~0 (- 3)) 10) (= 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)); {16163#true} is VALID [2022-04-27 12:01:25,142 INFO L290 TraceCheckUtils]: 99: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,142 INFO L290 TraceCheckUtils]: 100: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,142 INFO L290 TraceCheckUtils]: 101: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,143 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {16163#true} {16469#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} #50#return; {16469#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:25,143 INFO L290 TraceCheckUtils]: 103: Hoare triple {16469#(and (= (+ main_~c~0 (- 3)) 10) (= 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; {16491#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 12:01:25,144 INFO L290 TraceCheckUtils]: 104: Hoare triple {16491#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} assume !false; {16491#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 12:01:25,144 INFO L272 TraceCheckUtils]: 105: Hoare triple {16491#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ 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)); {16163#true} is VALID [2022-04-27 12:01:25,144 INFO L290 TraceCheckUtils]: 106: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,144 INFO L290 TraceCheckUtils]: 107: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,144 INFO L290 TraceCheckUtils]: 108: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,144 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {16163#true} {16491#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} #50#return; {16491#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 12:01:25,145 INFO L290 TraceCheckUtils]: 110: Hoare triple {16491#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ 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; {16513#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-27 12:01:25,145 INFO L290 TraceCheckUtils]: 111: Hoare triple {16513#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} assume !false; {16513#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-27 12:01:25,145 INFO L272 TraceCheckUtils]: 112: Hoare triple {16513#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~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)); {16163#true} is VALID [2022-04-27 12:01:25,145 INFO L290 TraceCheckUtils]: 113: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,145 INFO L290 TraceCheckUtils]: 114: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,145 INFO L290 TraceCheckUtils]: 115: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,146 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {16163#true} {16513#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} #50#return; {16513#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-27 12:01:25,146 INFO L290 TraceCheckUtils]: 117: Hoare triple {16513#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~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; {16535#(and (= (+ main_~c~0 (- 6)) 10) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-27 12:01:25,146 INFO L290 TraceCheckUtils]: 118: Hoare triple {16535#(and (= (+ main_~c~0 (- 6)) 10) (= (+ main_~y~0 (- 4)) 12))} assume !false; {16535#(and (= (+ main_~c~0 (- 6)) 10) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-27 12:01:25,146 INFO L272 TraceCheckUtils]: 119: Hoare triple {16535#(and (= (+ main_~c~0 (- 6)) 10) (= (+ 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)); {16163#true} is VALID [2022-04-27 12:01:25,147 INFO L290 TraceCheckUtils]: 120: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,147 INFO L290 TraceCheckUtils]: 121: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,147 INFO L290 TraceCheckUtils]: 122: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,147 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {16163#true} {16535#(and (= (+ main_~c~0 (- 6)) 10) (= (+ main_~y~0 (- 4)) 12))} #50#return; {16535#(and (= (+ main_~c~0 (- 6)) 10) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-27 12:01:25,147 INFO L290 TraceCheckUtils]: 124: Hoare triple {16535#(and (= (+ main_~c~0 (- 6)) 10) (= (+ 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; {16557#(and (= (+ main_~c~0 (- 7)) 10) (= main_~y~0 17))} is VALID [2022-04-27 12:01:25,148 INFO L290 TraceCheckUtils]: 125: Hoare triple {16557#(and (= (+ main_~c~0 (- 7)) 10) (= main_~y~0 17))} assume !false; {16557#(and (= (+ main_~c~0 (- 7)) 10) (= main_~y~0 17))} is VALID [2022-04-27 12:01:25,148 INFO L272 TraceCheckUtils]: 126: Hoare triple {16557#(and (= (+ main_~c~0 (- 7)) 10) (= 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)); {16163#true} is VALID [2022-04-27 12:01:25,148 INFO L290 TraceCheckUtils]: 127: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,148 INFO L290 TraceCheckUtils]: 128: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,148 INFO L290 TraceCheckUtils]: 129: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,149 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {16163#true} {16557#(and (= (+ main_~c~0 (- 7)) 10) (= main_~y~0 17))} #50#return; {16557#(and (= (+ main_~c~0 (- 7)) 10) (= main_~y~0 17))} is VALID [2022-04-27 12:01:25,149 INFO L290 TraceCheckUtils]: 131: Hoare triple {16557#(and (= (+ main_~c~0 (- 7)) 10) (= 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; {16579#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:01:25,149 INFO L290 TraceCheckUtils]: 132: Hoare triple {16579#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {16579#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:01:25,149 INFO L272 TraceCheckUtils]: 133: Hoare triple {16579#(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)); {16163#true} is VALID [2022-04-27 12:01:25,149 INFO L290 TraceCheckUtils]: 134: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,149 INFO L290 TraceCheckUtils]: 135: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,149 INFO L290 TraceCheckUtils]: 136: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,150 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {16163#true} {16579#(and (= main_~c~0 18) (= main_~y~0 18))} #50#return; {16579#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:01:25,150 INFO L290 TraceCheckUtils]: 138: Hoare triple {16579#(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; {16601#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 12:01:25,151 INFO L290 TraceCheckUtils]: 139: Hoare triple {16601#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {16601#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 12:01:25,151 INFO L272 TraceCheckUtils]: 140: Hoare triple {16601#(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)); {16163#true} is VALID [2022-04-27 12:01:25,151 INFO L290 TraceCheckUtils]: 141: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,151 INFO L290 TraceCheckUtils]: 142: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,151 INFO L290 TraceCheckUtils]: 143: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,151 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {16163#true} {16601#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #50#return; {16601#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 12:01:25,152 INFO L290 TraceCheckUtils]: 145: Hoare triple {16601#(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; {16623#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-27 12:01:25,152 INFO L290 TraceCheckUtils]: 146: Hoare triple {16623#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} assume !false; {16623#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-27 12:01:25,152 INFO L272 TraceCheckUtils]: 147: Hoare triple {16623#(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)); {16163#true} is VALID [2022-04-27 12:01:25,152 INFO L290 TraceCheckUtils]: 148: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,152 INFO L290 TraceCheckUtils]: 149: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,152 INFO L290 TraceCheckUtils]: 150: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,153 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {16163#true} {16623#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} #50#return; {16623#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-27 12:01:25,153 INFO L290 TraceCheckUtils]: 152: Hoare triple {16623#(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; {16645#(and (= (+ (- 1) main_~c~0) 20) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 12:01:25,153 INFO L290 TraceCheckUtils]: 153: Hoare triple {16645#(and (= (+ (- 1) main_~c~0) 20) (= 19 (+ (- 2) main_~y~0)))} assume !false; {16645#(and (= (+ (- 1) main_~c~0) 20) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 12:01:25,154 INFO L272 TraceCheckUtils]: 154: Hoare triple {16645#(and (= (+ (- 1) main_~c~0) 20) (= 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)); {16163#true} is VALID [2022-04-27 12:01:25,154 INFO L290 TraceCheckUtils]: 155: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,154 INFO L290 TraceCheckUtils]: 156: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,154 INFO L290 TraceCheckUtils]: 157: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,154 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {16163#true} {16645#(and (= (+ (- 1) main_~c~0) 20) (= 19 (+ (- 2) main_~y~0)))} #50#return; {16645#(and (= (+ (- 1) main_~c~0) 20) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 12:01:25,155 INFO L290 TraceCheckUtils]: 159: Hoare triple {16645#(and (= (+ (- 1) main_~c~0) 20) (= 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; {16667#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:25,155 INFO L290 TraceCheckUtils]: 160: Hoare triple {16667#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} assume !false; {16667#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:25,155 INFO L272 TraceCheckUtils]: 161: Hoare triple {16667#(and (= main_~y~0 22) (= 20 (+ (- 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)); {16163#true} is VALID [2022-04-27 12:01:25,155 INFO L290 TraceCheckUtils]: 162: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,155 INFO L290 TraceCheckUtils]: 163: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,155 INFO L290 TraceCheckUtils]: 164: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,156 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {16163#true} {16667#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} #50#return; {16667#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:25,156 INFO L290 TraceCheckUtils]: 166: Hoare triple {16667#(and (= main_~y~0 22) (= 20 (+ (- 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; {16689#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-27 12:01:25,156 INFO L290 TraceCheckUtils]: 167: Hoare triple {16689#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} assume !false; {16689#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-27 12:01:25,156 INFO L272 TraceCheckUtils]: 168: Hoare triple {16689#(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)); {16163#true} is VALID [2022-04-27 12:01:25,157 INFO L290 TraceCheckUtils]: 169: Hoare triple {16163#true} ~cond := #in~cond; {16163#true} is VALID [2022-04-27 12:01:25,157 INFO L290 TraceCheckUtils]: 170: Hoare triple {16163#true} assume !(0 == ~cond); {16163#true} is VALID [2022-04-27 12:01:25,157 INFO L290 TraceCheckUtils]: 171: Hoare triple {16163#true} assume true; {16163#true} is VALID [2022-04-27 12:01:25,157 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {16163#true} {16689#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} #50#return; {16689#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-27 12:01:25,159 INFO L290 TraceCheckUtils]: 173: Hoare triple {16689#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} assume !(~c~0 < ~k~0); {16711#(and (< 22 main_~k~0) (<= main_~k~0 23) (= 23 main_~y~0))} is VALID [2022-04-27 12:01:25,160 INFO L272 TraceCheckUtils]: 174: Hoare triple {16711#(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)); {16715#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:01:25,160 INFO L290 TraceCheckUtils]: 175: Hoare triple {16715#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16719#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:01:25,161 INFO L290 TraceCheckUtils]: 176: Hoare triple {16719#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16164#false} is VALID [2022-04-27 12:01:25,161 INFO L290 TraceCheckUtils]: 177: Hoare triple {16164#false} assume !false; {16164#false} is VALID [2022-04-27 12:01:25,161 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 12:01:25,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:01:25,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:01:25,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624646426] [2022-04-27 12:01:25,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:01:25,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945078205] [2022-04-27 12:01:25,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945078205] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:01:25,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:01:25,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2022-04-27 12:01:25,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248028461] [2022-04-27 12:01:25,562 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:01:25,562 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 26 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Word has length 178 [2022-04-27 12:01:25,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:01:25,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 26 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:01:25,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:01:25,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-27 12:01:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:01:25,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-27 12:01:25,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-04-27 12:01:25,701 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 26 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:01:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:33,942 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2022-04-27 12:01:33,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 12:01:33,942 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 26 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Word has length 178 [2022-04-27 12:01:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:01:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 26 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:01:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 118 transitions. [2022-04-27 12:01:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 26 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:01:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 118 transitions. [2022-04-27 12:01:33,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 118 transitions. [2022-04-27 12:01:34,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:01:34,118 INFO L225 Difference]: With dead ends: 99 [2022-04-27 12:01:34,118 INFO L226 Difference]: Without dead ends: 94 [2022-04-27 12:01:34,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 12:01:34,119 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 2 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:01:34,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1052 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-27 12:01:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-27 12:01:34,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-27 12:01:34,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:01:34,194 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), 28 states have call successors, (28), 5 states have call predecessors, (28), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:01:34,194 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), 28 states have call successors, (28), 5 states have call predecessors, (28), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:01:34,194 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), 28 states have call successors, (28), 5 states have call predecessors, (28), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:01:34,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:34,202 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-04-27 12:01:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-04-27 12:01:34,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:01:34,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:01:34,203 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), 28 states have call successors, (28), 5 states have call predecessors, (28), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 94 states. [2022-04-27 12:01:34,203 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), 28 states have call successors, (28), 5 states have call predecessors, (28), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 94 states. [2022-04-27 12:01:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:34,205 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-04-27 12:01:34,205 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-04-27 12:01:34,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:01:34,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:01:34,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:01:34,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:01:34,205 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), 28 states have call successors, (28), 5 states have call predecessors, (28), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:01:34,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2022-04-27 12:01:34,207 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 178 [2022-04-27 12:01:34,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:01:34,207 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2022-04-27 12:01:34,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 26 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:01:34,208 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-04-27 12:01:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-04-27 12:01:34,208 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:01:34,208 INFO L195 NwaCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:01:34,231 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 12:01:34,429 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 12:01:34,430 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:01:34,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:01:34,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1027734158, now seen corresponding path program 24 times [2022-04-27 12:01:34,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:01:34,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557164827] [2022-04-27 12:01:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:01:34,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:01:34,478 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:01:34,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913879463] [2022-04-27 12:01:34,478 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 12:01:34,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:01:34,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:01:34,480 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 12:01:34,520 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 12:01:37,857 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-27 12:01:37,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:01:37,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-27 12:01:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:01:37,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:01:38,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {17270#true} call ULTIMATE.init(); {17270#true} is VALID [2022-04-27 12:01:38,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {17270#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); {17270#true} is VALID [2022-04-27 12:01:38,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:38,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17270#true} {17270#true} #56#return; {17270#true} is VALID [2022-04-27 12:01:38,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {17270#true} call #t~ret5 := main(); {17270#true} is VALID [2022-04-27 12:01:38,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {17270#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {17290#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:01:38,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {17290#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {17290#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:01:38,976 INFO L272 TraceCheckUtils]: 7: Hoare triple {17290#(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)); {17270#true} is VALID [2022-04-27 12:01:38,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:38,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:38,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:38,976 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {17270#true} {17290#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {17290#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:01:38,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {17290#(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; {17312#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 12:01:38,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {17312#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {17312#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 12:01:38,977 INFO L272 TraceCheckUtils]: 14: Hoare triple {17312#(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)); {17270#true} is VALID [2022-04-27 12:01:38,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:38,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:38,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:38,978 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17270#true} {17312#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {17312#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 12:01:38,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {17312#(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; {17334#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 12:01:38,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {17334#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !false; {17334#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 12:01:38,978 INFO L272 TraceCheckUtils]: 21: Hoare triple {17334#(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)); {17270#true} is VALID [2022-04-27 12:01:38,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:38,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:38,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:38,979 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17270#true} {17334#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #50#return; {17334#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 12:01:38,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {17334#(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; {17356#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 12:01:38,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {17356#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {17356#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 12:01:38,980 INFO L272 TraceCheckUtils]: 28: Hoare triple {17356#(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)); {17270#true} is VALID [2022-04-27 12:01:38,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:38,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:38,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:38,980 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17270#true} {17356#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #50#return; {17356#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 12:01:38,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {17356#(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; {17378#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:01:38,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {17378#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {17378#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:01:38,981 INFO L272 TraceCheckUtils]: 35: Hoare triple {17378#(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)); {17270#true} is VALID [2022-04-27 12:01:38,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:38,981 INFO L290 TraceCheckUtils]: 37: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:38,981 INFO L290 TraceCheckUtils]: 38: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:38,982 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17270#true} {17378#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #50#return; {17378#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:01:38,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {17378#(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; {17400#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:01:38,983 INFO L290 TraceCheckUtils]: 41: Hoare triple {17400#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {17400#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:01:38,983 INFO L272 TraceCheckUtils]: 42: Hoare triple {17400#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) 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)); {17270#true} is VALID [2022-04-27 12:01:38,983 INFO L290 TraceCheckUtils]: 43: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:38,983 INFO L290 TraceCheckUtils]: 44: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:38,983 INFO L290 TraceCheckUtils]: 45: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:38,988 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {17270#true} {17400#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #50#return; {17400#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:01:38,989 INFO L290 TraceCheckUtils]: 47: Hoare triple {17400#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) 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; {17422#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 12:01:38,989 INFO L290 TraceCheckUtils]: 48: Hoare triple {17422#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} assume !false; {17422#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 12:01:38,989 INFO L272 TraceCheckUtils]: 49: Hoare triple {17422#(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)); {17270#true} is VALID [2022-04-27 12:01:38,989 INFO L290 TraceCheckUtils]: 50: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:38,989 INFO L290 TraceCheckUtils]: 51: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:38,989 INFO L290 TraceCheckUtils]: 52: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:38,990 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {17270#true} {17422#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} #50#return; {17422#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 12:01:38,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {17422#(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; {17444#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 12:01:38,990 INFO L290 TraceCheckUtils]: 55: Hoare triple {17444#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !false; {17444#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 12:01:38,990 INFO L272 TraceCheckUtils]: 56: Hoare triple {17444#(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)); {17270#true} is VALID [2022-04-27 12:01:38,990 INFO L290 TraceCheckUtils]: 57: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:38,990 INFO L290 TraceCheckUtils]: 58: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:38,991 INFO L290 TraceCheckUtils]: 59: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:38,991 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {17270#true} {17444#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} #50#return; {17444#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 12:01:38,991 INFO L290 TraceCheckUtils]: 61: Hoare triple {17444#(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; {17466#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:01:38,992 INFO L290 TraceCheckUtils]: 62: Hoare triple {17466#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {17466#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:01:38,992 INFO L272 TraceCheckUtils]: 63: Hoare triple {17466#(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)); {17270#true} is VALID [2022-04-27 12:01:38,992 INFO L290 TraceCheckUtils]: 64: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:38,992 INFO L290 TraceCheckUtils]: 65: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:38,992 INFO L290 TraceCheckUtils]: 66: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:38,992 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {17270#true} {17466#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #50#return; {17466#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:01:38,993 INFO L290 TraceCheckUtils]: 68: Hoare triple {17466#(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; {17488#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:01:38,993 INFO L290 TraceCheckUtils]: 69: Hoare triple {17488#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {17488#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:01:38,993 INFO L272 TraceCheckUtils]: 70: Hoare triple {17488#(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)); {17270#true} is VALID [2022-04-27 12:01:38,993 INFO L290 TraceCheckUtils]: 71: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:38,993 INFO L290 TraceCheckUtils]: 72: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:38,993 INFO L290 TraceCheckUtils]: 73: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:38,994 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17270#true} {17488#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {17488#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:01:38,994 INFO L290 TraceCheckUtils]: 75: Hoare triple {17488#(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; {17510#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 12:01:38,994 INFO L290 TraceCheckUtils]: 76: Hoare triple {17510#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {17510#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 12:01:38,995 INFO L272 TraceCheckUtils]: 77: Hoare triple {17510#(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)); {17270#true} is VALID [2022-04-27 12:01:38,995 INFO L290 TraceCheckUtils]: 78: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:38,995 INFO L290 TraceCheckUtils]: 79: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:38,995 INFO L290 TraceCheckUtils]: 80: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:38,995 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17270#true} {17510#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {17510#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 12:01:38,995 INFO L290 TraceCheckUtils]: 82: Hoare triple {17510#(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; {17532#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 12:01:38,996 INFO L290 TraceCheckUtils]: 83: Hoare triple {17532#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {17532#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 12:01:38,996 INFO L272 TraceCheckUtils]: 84: Hoare triple {17532#(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)); {17270#true} is VALID [2022-04-27 12:01:38,996 INFO L290 TraceCheckUtils]: 85: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:38,996 INFO L290 TraceCheckUtils]: 86: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:38,996 INFO L290 TraceCheckUtils]: 87: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:38,996 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {17270#true} {17532#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {17532#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 12:01:38,997 INFO L290 TraceCheckUtils]: 89: Hoare triple {17532#(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; {17554#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 12:01:38,997 INFO L290 TraceCheckUtils]: 90: Hoare triple {17554#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {17554#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 12:01:38,997 INFO L272 TraceCheckUtils]: 91: Hoare triple {17554#(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)); {17270#true} is VALID [2022-04-27 12:01:38,997 INFO L290 TraceCheckUtils]: 92: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:38,997 INFO L290 TraceCheckUtils]: 93: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:38,997 INFO L290 TraceCheckUtils]: 94: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:38,998 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {17270#true} {17554#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {17554#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 12:01:38,998 INFO L290 TraceCheckUtils]: 96: Hoare triple {17554#(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; {17576#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 12:01:38,999 INFO L290 TraceCheckUtils]: 97: Hoare triple {17576#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {17576#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 12:01:38,999 INFO L272 TraceCheckUtils]: 98: Hoare triple {17576#(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)); {17270#true} is VALID [2022-04-27 12:01:38,999 INFO L290 TraceCheckUtils]: 99: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:38,999 INFO L290 TraceCheckUtils]: 100: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:38,999 INFO L290 TraceCheckUtils]: 101: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:38,999 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {17270#true} {17576#(and (= main_~c~0 13) (= main_~y~0 13))} #50#return; {17576#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-27 12:01:39,000 INFO L290 TraceCheckUtils]: 103: Hoare triple {17576#(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; {17598#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:01:39,000 INFO L290 TraceCheckUtils]: 104: Hoare triple {17598#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !false; {17598#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:01:39,000 INFO L272 TraceCheckUtils]: 105: Hoare triple {17598#(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)); {17270#true} is VALID [2022-04-27 12:01:39,000 INFO L290 TraceCheckUtils]: 106: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:39,000 INFO L290 TraceCheckUtils]: 107: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:39,000 INFO L290 TraceCheckUtils]: 108: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:39,001 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {17270#true} {17598#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} #50#return; {17598#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:01:39,001 INFO L290 TraceCheckUtils]: 110: Hoare triple {17598#(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; {17620#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:39,001 INFO L290 TraceCheckUtils]: 111: Hoare triple {17620#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !false; {17620#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:39,001 INFO L272 TraceCheckUtils]: 112: Hoare triple {17620#(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)); {17270#true} is VALID [2022-04-27 12:01:39,002 INFO L290 TraceCheckUtils]: 113: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:39,002 INFO L290 TraceCheckUtils]: 114: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:39,002 INFO L290 TraceCheckUtils]: 115: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:39,002 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {17270#true} {17620#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} #50#return; {17620#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:39,002 INFO L290 TraceCheckUtils]: 117: Hoare triple {17620#(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; {17642#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 12:01:39,003 INFO L290 TraceCheckUtils]: 118: Hoare triple {17642#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {17642#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 12:01:39,003 INFO L272 TraceCheckUtils]: 119: Hoare triple {17642#(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)); {17270#true} is VALID [2022-04-27 12:01:39,003 INFO L290 TraceCheckUtils]: 120: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:39,003 INFO L290 TraceCheckUtils]: 121: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:39,003 INFO L290 TraceCheckUtils]: 122: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:39,003 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {17270#true} {17642#(and (= main_~c~0 16) (= main_~y~0 16))} #50#return; {17642#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 12:01:39,004 INFO L290 TraceCheckUtils]: 124: Hoare triple {17642#(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; {17664#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 12:01:39,004 INFO L290 TraceCheckUtils]: 125: Hoare triple {17664#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !false; {17664#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 12:01:39,004 INFO L272 TraceCheckUtils]: 126: Hoare triple {17664#(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)); {17270#true} is VALID [2022-04-27 12:01:39,004 INFO L290 TraceCheckUtils]: 127: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:39,004 INFO L290 TraceCheckUtils]: 128: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:39,004 INFO L290 TraceCheckUtils]: 129: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:39,015 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {17270#true} {17664#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} #50#return; {17664#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 12:01:39,019 INFO L290 TraceCheckUtils]: 131: Hoare triple {17664#(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; {17686#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:39,020 INFO L290 TraceCheckUtils]: 132: Hoare triple {17686#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} assume !false; {17686#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:39,020 INFO L272 TraceCheckUtils]: 133: Hoare triple {17686#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 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)); {17270#true} is VALID [2022-04-27 12:01:39,020 INFO L290 TraceCheckUtils]: 134: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:39,020 INFO L290 TraceCheckUtils]: 135: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:39,020 INFO L290 TraceCheckUtils]: 136: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:39,020 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {17270#true} {17686#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} #50#return; {17686#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:39,021 INFO L290 TraceCheckUtils]: 138: Hoare triple {17686#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 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; {17708#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-27 12:01:39,021 INFO L290 TraceCheckUtils]: 139: Hoare triple {17708#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} assume !false; {17708#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-27 12:01:39,021 INFO L272 TraceCheckUtils]: 140: Hoare triple {17708#(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)); {17270#true} is VALID [2022-04-27 12:01:39,021 INFO L290 TraceCheckUtils]: 141: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:39,021 INFO L290 TraceCheckUtils]: 142: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:39,021 INFO L290 TraceCheckUtils]: 143: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:39,022 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {17270#true} {17708#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} #50#return; {17708#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-27 12:01:39,022 INFO L290 TraceCheckUtils]: 145: Hoare triple {17708#(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; {17730#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-27 12:01:39,023 INFO L290 TraceCheckUtils]: 146: Hoare triple {17730#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !false; {17730#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-27 12:01:39,023 INFO L272 TraceCheckUtils]: 147: Hoare triple {17730#(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)); {17270#true} is VALID [2022-04-27 12:01:39,023 INFO L290 TraceCheckUtils]: 148: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:39,023 INFO L290 TraceCheckUtils]: 149: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:39,023 INFO L290 TraceCheckUtils]: 150: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:39,023 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {17270#true} {17730#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} #50#return; {17730#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-27 12:01:39,024 INFO L290 TraceCheckUtils]: 152: Hoare triple {17730#(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; {17752#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:39,024 INFO L290 TraceCheckUtils]: 153: Hoare triple {17752#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} assume !false; {17752#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:39,024 INFO L272 TraceCheckUtils]: 154: Hoare triple {17752#(and (= 19 (+ (- 2) main_~c~0)) (= 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)); {17270#true} is VALID [2022-04-27 12:01:39,024 INFO L290 TraceCheckUtils]: 155: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:39,024 INFO L290 TraceCheckUtils]: 156: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:39,024 INFO L290 TraceCheckUtils]: 157: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:39,027 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {17270#true} {17752#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} #50#return; {17752#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:39,028 INFO L290 TraceCheckUtils]: 159: Hoare triple {17752#(and (= 19 (+ (- 2) main_~c~0)) (= 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; {17774#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 12:01:39,028 INFO L290 TraceCheckUtils]: 160: Hoare triple {17774#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {17774#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 12:01:39,028 INFO L272 TraceCheckUtils]: 161: Hoare triple {17774#(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)); {17270#true} is VALID [2022-04-27 12:01:39,028 INFO L290 TraceCheckUtils]: 162: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:39,028 INFO L290 TraceCheckUtils]: 163: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:39,028 INFO L290 TraceCheckUtils]: 164: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:39,029 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {17270#true} {17774#(and (= main_~y~0 22) (= main_~c~0 22))} #50#return; {17774#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-27 12:01:39,029 INFO L290 TraceCheckUtils]: 166: Hoare triple {17774#(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; {17796#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:39,029 INFO L290 TraceCheckUtils]: 167: Hoare triple {17796#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} assume !false; {17796#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:39,029 INFO L272 TraceCheckUtils]: 168: Hoare triple {17796#(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)); {17270#true} is VALID [2022-04-27 12:01:39,029 INFO L290 TraceCheckUtils]: 169: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:39,029 INFO L290 TraceCheckUtils]: 170: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:39,030 INFO L290 TraceCheckUtils]: 171: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:39,030 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {17270#true} {17796#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} #50#return; {17796#(and (= (+ (- 1) main_~c~0) 22) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:39,030 INFO L290 TraceCheckUtils]: 173: Hoare triple {17796#(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; {17818#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-27 12:01:39,031 INFO L290 TraceCheckUtils]: 174: Hoare triple {17818#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !false; {17818#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-27 12:01:39,031 INFO L272 TraceCheckUtils]: 175: Hoare triple {17818#(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)); {17270#true} is VALID [2022-04-27 12:01:39,031 INFO L290 TraceCheckUtils]: 176: Hoare triple {17270#true} ~cond := #in~cond; {17270#true} is VALID [2022-04-27 12:01:39,031 INFO L290 TraceCheckUtils]: 177: Hoare triple {17270#true} assume !(0 == ~cond); {17270#true} is VALID [2022-04-27 12:01:39,031 INFO L290 TraceCheckUtils]: 178: Hoare triple {17270#true} assume true; {17270#true} is VALID [2022-04-27 12:01:39,032 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {17270#true} {17818#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} #50#return; {17818#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-27 12:01:39,033 INFO L290 TraceCheckUtils]: 180: Hoare triple {17818#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !(~c~0 < ~k~0); {17840#(and (<= main_~k~0 24) (< 23 main_~k~0) (= main_~y~0 24))} is VALID [2022-04-27 12:01:39,041 INFO L272 TraceCheckUtils]: 181: Hoare triple {17840#(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)); {17844#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:01:39,041 INFO L290 TraceCheckUtils]: 182: Hoare triple {17844#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17848#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:01:39,041 INFO L290 TraceCheckUtils]: 183: Hoare triple {17848#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17271#false} is VALID [2022-04-27 12:01:39,042 INFO L290 TraceCheckUtils]: 184: Hoare triple {17271#false} assume !false; {17271#false} is VALID [2022-04-27 12:01:39,043 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 12:01:39,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:01:39,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:01:39,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557164827] [2022-04-27 12:01:39,453 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:01:39,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913879463] [2022-04-27 12:01:39,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913879463] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:01:39,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:01:39,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2022-04-27 12:01:39,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269830087] [2022-04-27 12:01:39,454 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:01:39,454 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 27 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Word has length 185 [2022-04-27 12:01:39,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:01:39,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 27 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:01:39,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:01:39,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 12:01:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:01:39,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 12:01:39,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 12:01:39,614 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 27 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:01:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:47,102 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-04-27 12:01:47,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-27 12:01:47,102 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 27 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Word has length 185 [2022-04-27 12:01:47,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:01:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 27 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:01:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 122 transitions. [2022-04-27 12:01:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 27 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:01:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 122 transitions. [2022-04-27 12:01:47,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 122 transitions. [2022-04-27 12:01:47,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:01:47,393 INFO L225 Difference]: With dead ends: 102 [2022-04-27 12:01:47,394 INFO L226 Difference]: Without dead ends: 97 [2022-04-27 12:01:47,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 12:01:47,394 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 2139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 2139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-27 12:01:47,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1119 Invalid, 2139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2139 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-27 12:01:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-27 12:01:47,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-04-27 12:01:47,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:01:47,510 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), 29 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:01:47,510 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), 29 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:01:47,510 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), 29 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:01:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:47,513 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-04-27 12:01:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2022-04-27 12:01:47,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:01:47,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:01:47,513 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), 29 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 97 states. [2022-04-27 12:01:47,513 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), 29 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 97 states. [2022-04-27 12:01:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:47,515 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-04-27 12:01:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2022-04-27 12:01:47,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:01:47,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:01:47,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:01:47,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:01:47,516 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), 29 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:01:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 121 transitions. [2022-04-27 12:01:47,517 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 121 transitions. Word has length 185 [2022-04-27 12:01:47,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:01:47,518 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 121 transitions. [2022-04-27 12:01:47,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 27 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:01:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2022-04-27 12:01:47,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-04-27 12:01:47,519 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:01:47,519 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:01:47,547 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 12:01:47,743 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 12:01:47,743 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:01:47,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:01:47,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1572034203, now seen corresponding path program 25 times [2022-04-27 12:01:47,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:01:47,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986123340] [2022-04-27 12:01:47,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:01:47,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:01:47,757 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:01:47,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954233933] [2022-04-27 12:01:47,758 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 12:01:47,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:01:47,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:01:47,760 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 12:01:47,761 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 12:01:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:01:48,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-27 12:01:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:01:48,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:01:49,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {18415#true} call ULTIMATE.init(); {18415#true} is VALID [2022-04-27 12:01:49,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {18415#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); {18415#true} is VALID [2022-04-27 12:01:49,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18415#true} {18415#true} #56#return; {18415#true} is VALID [2022-04-27 12:01:49,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {18415#true} call #t~ret5 := main(); {18415#true} is VALID [2022-04-27 12:01:49,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {18415#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {18435#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:01:49,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {18435#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {18435#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:01:49,691 INFO L272 TraceCheckUtils]: 7: Hoare triple {18435#(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)); {18415#true} is VALID [2022-04-27 12:01:49,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,691 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {18415#true} {18435#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {18435#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:01:49,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {18435#(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; {18457#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:01:49,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {18457#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {18457#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:01:49,692 INFO L272 TraceCheckUtils]: 14: Hoare triple {18457#(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)); {18415#true} is VALID [2022-04-27 12:01:49,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,692 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18415#true} {18457#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {18457#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 12:01:49,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {18457#(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; {18479#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 12:01:49,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {18479#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {18479#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 12:01:49,693 INFO L272 TraceCheckUtils]: 21: Hoare triple {18479#(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)); {18415#true} is VALID [2022-04-27 12:01:49,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,694 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {18415#true} {18479#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #50#return; {18479#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 12:01:49,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {18479#(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; {18501#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:01:49,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {18501#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {18501#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:01:49,695 INFO L272 TraceCheckUtils]: 28: Hoare triple {18501#(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)); {18415#true} is VALID [2022-04-27 12:01:49,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,706 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18415#true} {18501#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {18501#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:01:49,707 INFO L290 TraceCheckUtils]: 33: Hoare triple {18501#(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; {18523#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:01:49,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {18523#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {18523#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:01:49,707 INFO L272 TraceCheckUtils]: 35: Hoare triple {18523#(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)); {18415#true} is VALID [2022-04-27 12:01:49,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,707 INFO L290 TraceCheckUtils]: 38: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,708 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18415#true} {18523#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {18523#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:01:49,708 INFO L290 TraceCheckUtils]: 40: Hoare triple {18523#(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; {18545#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:01:49,709 INFO L290 TraceCheckUtils]: 41: Hoare triple {18545#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {18545#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:01:49,709 INFO L272 TraceCheckUtils]: 42: Hoare triple {18545#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) 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)); {18415#true} is VALID [2022-04-27 12:01:49,709 INFO L290 TraceCheckUtils]: 43: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,709 INFO L290 TraceCheckUtils]: 44: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,709 INFO L290 TraceCheckUtils]: 45: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,709 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18415#true} {18545#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #50#return; {18545#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:01:49,710 INFO L290 TraceCheckUtils]: 47: Hoare triple {18545#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) 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; {18567#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:49,710 INFO L290 TraceCheckUtils]: 48: Hoare triple {18567#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {18567#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:49,710 INFO L272 TraceCheckUtils]: 49: Hoare triple {18567#(and (= main_~y~0 6) (= 4 (+ (- 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)); {18415#true} is VALID [2022-04-27 12:01:49,710 INFO L290 TraceCheckUtils]: 50: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,710 INFO L290 TraceCheckUtils]: 51: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,710 INFO L290 TraceCheckUtils]: 52: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,711 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18415#true} {18567#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #50#return; {18567#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:49,711 INFO L290 TraceCheckUtils]: 54: Hoare triple {18567#(and (= main_~y~0 6) (= 4 (+ (- 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; {18589#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:49,711 INFO L290 TraceCheckUtils]: 55: Hoare triple {18589#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !false; {18589#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:49,711 INFO L272 TraceCheckUtils]: 56: Hoare triple {18589#(and (= (+ main_~c~0 (- 3)) 4) (= 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)); {18415#true} is VALID [2022-04-27 12:01:49,711 INFO L290 TraceCheckUtils]: 57: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,712 INFO L290 TraceCheckUtils]: 58: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,712 INFO L290 TraceCheckUtils]: 59: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,712 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18415#true} {18589#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #50#return; {18589#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:49,712 INFO L290 TraceCheckUtils]: 61: Hoare triple {18589#(and (= (+ main_~c~0 (- 3)) 4) (= 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; {18611#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 12:01:49,713 INFO L290 TraceCheckUtils]: 62: Hoare triple {18611#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {18611#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 12:01:49,713 INFO L272 TraceCheckUtils]: 63: Hoare triple {18611#(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)); {18415#true} is VALID [2022-04-27 12:01:49,713 INFO L290 TraceCheckUtils]: 64: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,713 INFO L290 TraceCheckUtils]: 65: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,713 INFO L290 TraceCheckUtils]: 66: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,713 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {18415#true} {18611#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #50#return; {18611#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-27 12:01:49,714 INFO L290 TraceCheckUtils]: 68: Hoare triple {18611#(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; {18633#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 12:01:49,714 INFO L290 TraceCheckUtils]: 69: Hoare triple {18633#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {18633#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 12:01:49,714 INFO L272 TraceCheckUtils]: 70: Hoare triple {18633#(and (= main_~y~0 9) (= (+ (- 1) 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)); {18415#true} is VALID [2022-04-27 12:01:49,714 INFO L290 TraceCheckUtils]: 71: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,714 INFO L290 TraceCheckUtils]: 72: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,714 INFO L290 TraceCheckUtils]: 73: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,715 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18415#true} {18633#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #50#return; {18633#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-27 12:01:49,715 INFO L290 TraceCheckUtils]: 75: Hoare triple {18633#(and (= main_~y~0 9) (= (+ (- 1) 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; {18655#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:49,716 INFO L290 TraceCheckUtils]: 76: Hoare triple {18655#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} assume !false; {18655#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:49,716 INFO L272 TraceCheckUtils]: 77: Hoare triple {18655#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 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)); {18415#true} is VALID [2022-04-27 12:01:49,716 INFO L290 TraceCheckUtils]: 78: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,716 INFO L290 TraceCheckUtils]: 79: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,716 INFO L290 TraceCheckUtils]: 80: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,716 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {18415#true} {18655#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} #50#return; {18655#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:49,717 INFO L290 TraceCheckUtils]: 82: Hoare triple {18655#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 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; {18677#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} is VALID [2022-04-27 12:01:49,717 INFO L290 TraceCheckUtils]: 83: Hoare triple {18677#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} assume !false; {18677#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} is VALID [2022-04-27 12:01:49,717 INFO L272 TraceCheckUtils]: 84: Hoare triple {18677#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~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)); {18415#true} is VALID [2022-04-27 12:01:49,717 INFO L290 TraceCheckUtils]: 85: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,717 INFO L290 TraceCheckUtils]: 86: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,717 INFO L290 TraceCheckUtils]: 87: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,718 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {18415#true} {18677#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} #50#return; {18677#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} is VALID [2022-04-27 12:01:49,718 INFO L290 TraceCheckUtils]: 89: Hoare triple {18677#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~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; {18699#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-27 12:01:49,719 INFO L290 TraceCheckUtils]: 90: Hoare triple {18699#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} assume !false; {18699#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-27 12:01:49,719 INFO L272 TraceCheckUtils]: 91: Hoare triple {18699#(and (= main_~c~0 12) (= (+ 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)); {18415#true} is VALID [2022-04-27 12:01:49,719 INFO L290 TraceCheckUtils]: 92: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,719 INFO L290 TraceCheckUtils]: 93: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,719 INFO L290 TraceCheckUtils]: 94: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,719 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18415#true} {18699#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} #50#return; {18699#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-27 12:01:49,720 INFO L290 TraceCheckUtils]: 96: Hoare triple {18699#(and (= main_~c~0 12) (= (+ 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; {18721#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 12:01:49,720 INFO L290 TraceCheckUtils]: 97: Hoare triple {18721#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {18721#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 12:01:49,720 INFO L272 TraceCheckUtils]: 98: Hoare triple {18721#(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)); {18415#true} is VALID [2022-04-27 12:01:49,720 INFO L290 TraceCheckUtils]: 99: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,720 INFO L290 TraceCheckUtils]: 100: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,720 INFO L290 TraceCheckUtils]: 101: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,721 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {18415#true} {18721#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #50#return; {18721#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 12:01:49,721 INFO L290 TraceCheckUtils]: 103: Hoare triple {18721#(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; {18743#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:01:49,722 INFO L290 TraceCheckUtils]: 104: Hoare triple {18743#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {18743#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:01:49,722 INFO L272 TraceCheckUtils]: 105: Hoare triple {18743#(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)); {18415#true} is VALID [2022-04-27 12:01:49,722 INFO L290 TraceCheckUtils]: 106: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,722 INFO L290 TraceCheckUtils]: 107: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,727 INFO L290 TraceCheckUtils]: 108: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,727 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {18415#true} {18743#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #50#return; {18743#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:01:49,728 INFO L290 TraceCheckUtils]: 110: Hoare triple {18743#(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; {18765#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 12:01:49,728 INFO L290 TraceCheckUtils]: 111: Hoare triple {18765#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} assume !false; {18765#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 12:01:49,728 INFO L272 TraceCheckUtils]: 112: Hoare triple {18765#(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)); {18415#true} is VALID [2022-04-27 12:01:49,728 INFO L290 TraceCheckUtils]: 113: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,728 INFO L290 TraceCheckUtils]: 114: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,728 INFO L290 TraceCheckUtils]: 115: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,730 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {18415#true} {18765#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} #50#return; {18765#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 12:01:49,730 INFO L290 TraceCheckUtils]: 117: Hoare triple {18765#(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; {18787#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 12:01:49,730 INFO L290 TraceCheckUtils]: 118: Hoare triple {18787#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {18787#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 12:01:49,731 INFO L272 TraceCheckUtils]: 119: Hoare triple {18787#(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)); {18415#true} is VALID [2022-04-27 12:01:49,731 INFO L290 TraceCheckUtils]: 120: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,731 INFO L290 TraceCheckUtils]: 121: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,731 INFO L290 TraceCheckUtils]: 122: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,731 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {18415#true} {18787#(and (= main_~c~0 16) (= main_~y~0 16))} #50#return; {18787#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 12:01:49,732 INFO L290 TraceCheckUtils]: 124: Hoare triple {18787#(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; {18809#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:49,732 INFO L290 TraceCheckUtils]: 125: Hoare triple {18809#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {18809#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:49,732 INFO L272 TraceCheckUtils]: 126: Hoare triple {18809#(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)); {18415#true} is VALID [2022-04-27 12:01:49,732 INFO L290 TraceCheckUtils]: 127: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,732 INFO L290 TraceCheckUtils]: 128: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,732 INFO L290 TraceCheckUtils]: 129: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,733 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {18415#true} {18809#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #50#return; {18809#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:01:49,733 INFO L290 TraceCheckUtils]: 131: Hoare triple {18809#(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; {18831#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 12:01:49,733 INFO L290 TraceCheckUtils]: 132: Hoare triple {18831#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !false; {18831#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 12:01:49,733 INFO L272 TraceCheckUtils]: 133: Hoare triple {18831#(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)); {18415#true} is VALID [2022-04-27 12:01:49,733 INFO L290 TraceCheckUtils]: 134: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,733 INFO L290 TraceCheckUtils]: 135: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,734 INFO L290 TraceCheckUtils]: 136: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,734 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {18415#true} {18831#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} #50#return; {18831#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-27 12:01:49,734 INFO L290 TraceCheckUtils]: 138: Hoare triple {18831#(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; {18853#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 12:01:49,735 INFO L290 TraceCheckUtils]: 139: Hoare triple {18853#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {18853#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 12:01:49,735 INFO L272 TraceCheckUtils]: 140: Hoare triple {18853#(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)); {18415#true} is VALID [2022-04-27 12:01:49,735 INFO L290 TraceCheckUtils]: 141: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,735 INFO L290 TraceCheckUtils]: 142: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,735 INFO L290 TraceCheckUtils]: 143: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,735 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {18415#true} {18853#(and (= 19 main_~y~0) (= 19 main_~c~0))} #50#return; {18853#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 12:01:49,736 INFO L290 TraceCheckUtils]: 145: Hoare triple {18853#(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; {18875#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:01:49,736 INFO L290 TraceCheckUtils]: 146: Hoare triple {18875#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {18875#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:01:49,736 INFO L272 TraceCheckUtils]: 147: Hoare triple {18875#(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)); {18415#true} is VALID [2022-04-27 12:01:49,736 INFO L290 TraceCheckUtils]: 148: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,736 INFO L290 TraceCheckUtils]: 149: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,736 INFO L290 TraceCheckUtils]: 150: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,737 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {18415#true} {18875#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #50#return; {18875#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:01:49,737 INFO L290 TraceCheckUtils]: 152: Hoare triple {18875#(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; {18897#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 12:01:49,737 INFO L290 TraceCheckUtils]: 153: Hoare triple {18897#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {18897#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 12:01:49,738 INFO L272 TraceCheckUtils]: 154: Hoare triple {18897#(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)); {18415#true} is VALID [2022-04-27 12:01:49,738 INFO L290 TraceCheckUtils]: 155: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,738 INFO L290 TraceCheckUtils]: 156: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,738 INFO L290 TraceCheckUtils]: 157: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,738 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {18415#true} {18897#(and (= main_~c~0 21) (= main_~y~0 21))} #50#return; {18897#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 12:01:49,739 INFO L290 TraceCheckUtils]: 159: Hoare triple {18897#(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; {18919#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-27 12:01:49,739 INFO L290 TraceCheckUtils]: 160: Hoare triple {18919#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} assume !false; {18919#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-27 12:01:49,739 INFO L272 TraceCheckUtils]: 161: Hoare triple {18919#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 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)); {18415#true} is VALID [2022-04-27 12:01:49,739 INFO L290 TraceCheckUtils]: 162: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,739 INFO L290 TraceCheckUtils]: 163: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,739 INFO L290 TraceCheckUtils]: 164: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,740 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {18415#true} {18919#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} #50#return; {18919#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-27 12:01:49,740 INFO L290 TraceCheckUtils]: 166: Hoare triple {18919#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 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; {18941#(and (= (+ (- 2) main_~y~0) 21) (= 21 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:49,740 INFO L290 TraceCheckUtils]: 167: Hoare triple {18941#(and (= (+ (- 2) main_~y~0) 21) (= 21 (+ (- 2) main_~c~0)))} assume !false; {18941#(and (= (+ (- 2) main_~y~0) 21) (= 21 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:49,740 INFO L272 TraceCheckUtils]: 168: Hoare triple {18941#(and (= (+ (- 2) main_~y~0) 21) (= 21 (+ (- 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)); {18415#true} is VALID [2022-04-27 12:01:49,740 INFO L290 TraceCheckUtils]: 169: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,740 INFO L290 TraceCheckUtils]: 170: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,741 INFO L290 TraceCheckUtils]: 171: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,741 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {18415#true} {18941#(and (= (+ (- 2) main_~y~0) 21) (= 21 (+ (- 2) main_~c~0)))} #50#return; {18941#(and (= (+ (- 2) main_~y~0) 21) (= 21 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:01:49,741 INFO L290 TraceCheckUtils]: 173: Hoare triple {18941#(and (= (+ (- 2) main_~y~0) 21) (= 21 (+ (- 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; {18963#(and (= main_~c~0 24) (= (+ main_~y~0 (- 3)) 21))} is VALID [2022-04-27 12:01:49,742 INFO L290 TraceCheckUtils]: 174: Hoare triple {18963#(and (= main_~c~0 24) (= (+ main_~y~0 (- 3)) 21))} assume !false; {18963#(and (= main_~c~0 24) (= (+ main_~y~0 (- 3)) 21))} is VALID [2022-04-27 12:01:49,742 INFO L272 TraceCheckUtils]: 175: Hoare triple {18963#(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)); {18415#true} is VALID [2022-04-27 12:01:49,742 INFO L290 TraceCheckUtils]: 176: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,742 INFO L290 TraceCheckUtils]: 177: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,744 INFO L290 TraceCheckUtils]: 178: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,745 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {18415#true} {18963#(and (= main_~c~0 24) (= (+ main_~y~0 (- 3)) 21))} #50#return; {18963#(and (= main_~c~0 24) (= (+ main_~y~0 (- 3)) 21))} is VALID [2022-04-27 12:01:49,746 INFO L290 TraceCheckUtils]: 180: Hoare triple {18963#(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; {18985#(and (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0) (<= main_~c~0 25))} is VALID [2022-04-27 12:01:49,746 INFO L290 TraceCheckUtils]: 181: Hoare triple {18985#(and (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0) (<= main_~c~0 25))} assume !false; {18985#(and (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0) (<= main_~c~0 25))} is VALID [2022-04-27 12:01:49,746 INFO L272 TraceCheckUtils]: 182: Hoare triple {18985#(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)); {18415#true} is VALID [2022-04-27 12:01:49,746 INFO L290 TraceCheckUtils]: 183: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-27 12:01:49,746 INFO L290 TraceCheckUtils]: 184: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-27 12:01:49,746 INFO L290 TraceCheckUtils]: 185: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-27 12:01:49,747 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {18415#true} {18985#(and (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0) (<= main_~c~0 25))} #50#return; {18985#(and (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0) (<= main_~c~0 25))} is VALID [2022-04-27 12:01:49,749 INFO L290 TraceCheckUtils]: 187: Hoare triple {18985#(and (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0) (<= main_~c~0 25))} assume !(~c~0 < ~k~0); {19007#(and (<= main_~k~0 25) (= (+ main_~y~0 (- 4)) 21) (< 24 main_~k~0))} is VALID [2022-04-27 12:01:49,750 INFO L272 TraceCheckUtils]: 188: Hoare triple {19007#(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)); {19011#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:01:49,750 INFO L290 TraceCheckUtils]: 189: Hoare triple {19011#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19015#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:01:49,751 INFO L290 TraceCheckUtils]: 190: Hoare triple {19015#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18416#false} is VALID [2022-04-27 12:01:49,751 INFO L290 TraceCheckUtils]: 191: Hoare triple {18416#false} assume !false; {18416#false} is VALID [2022-04-27 12:01:49,752 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 12:01:49,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:01:50,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:01:50,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986123340] [2022-04-27 12:01:50,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:01:50,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954233933] [2022-04-27 12:01:50,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954233933] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:01:50,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:01:50,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2022-04-27 12:01:50,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546515724] [2022-04-27 12:01:50,129 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:01:50,129 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 28 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Word has length 192 [2022-04-27 12:01:50,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:01:50,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 28 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:01:50,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:01:50,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-27 12:01:50,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:01:50,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-27 12:01:50,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 12:01:50,359 INFO L87 Difference]: Start difference. First operand 97 states and 121 transitions. Second operand has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 28 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:01:59,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:01:59,497 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2022-04-27 12:01:59,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 12:01:59,497 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 28 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Word has length 192 [2022-04-27 12:01:59,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:01:59,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 28 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:01:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2022-04-27 12:01:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 28 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:01:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2022-04-27 12:01:59,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 126 transitions. [2022-04-27 12:02:00,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:02:00,028 INFO L225 Difference]: With dead ends: 105 [2022-04-27 12:02:00,029 INFO L226 Difference]: Without dead ends: 100 [2022-04-27 12:02:00,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=1154, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 12:02:00,029 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:02:00,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1188 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-27 12:02:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-27 12:02:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-27 12:02:00,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:02:00,112 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), 30 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:02:00,113 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), 30 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:02:00,123 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), 30 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:02:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:02:00,125 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2022-04-27 12:02:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2022-04-27 12:02:00,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:02:00,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:02:00,126 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), 30 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 100 states. [2022-04-27 12:02:00,126 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), 30 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 100 states. [2022-04-27 12:02:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:02:00,128 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2022-04-27 12:02:00,128 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2022-04-27 12:02:00,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:02:00,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:02:00,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:02:00,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:02:00,128 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), 30 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:02:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2022-04-27 12:02:00,137 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 192 [2022-04-27 12:02:00,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:02:00,137 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2022-04-27 12:02:00,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 28 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:02:00,138 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2022-04-27 12:02:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-04-27 12:02:00,139 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:02:00,139 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:02:00,183 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 12:02:00,361 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 12:02:00,361 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:02:00,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:02:00,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1051836910, now seen corresponding path program 26 times [2022-04-27 12:02:00,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:02:00,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676281774] [2022-04-27 12:02:00,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:02:00,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:02:00,378 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:02:00,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [277903439] [2022-04-27 12:02:00,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:02:00,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:02:00,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:02:00,387 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 12:02:00,463 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 12:02:01,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:02:01,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:02:01,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-27 12:02:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:02:01,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:02:02,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {19598#true} call ULTIMATE.init(); {19598#true} is VALID [2022-04-27 12:02:02,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {19598#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); {19598#true} is VALID [2022-04-27 12:02:02,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19598#true} {19598#true} #56#return; {19598#true} is VALID [2022-04-27 12:02:02,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {19598#true} call #t~ret5 := main(); {19598#true} is VALID [2022-04-27 12:02:02,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {19598#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {19618#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:02:02,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {19618#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {19618#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:02:02,833 INFO L272 TraceCheckUtils]: 7: Hoare triple {19618#(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)); {19598#true} is VALID [2022-04-27 12:02:02,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,833 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {19598#true} {19618#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {19618#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:02:02,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {19618#(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; {19640#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:02:02,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {19640#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {19640#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:02:02,834 INFO L272 TraceCheckUtils]: 14: Hoare triple {19640#(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)); {19598#true} is VALID [2022-04-27 12:02:02,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,835 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {19598#true} {19640#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {19640#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:02:02,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {19640#(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; {19662#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 12:02:02,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {19662#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {19662#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 12:02:02,836 INFO L272 TraceCheckUtils]: 21: Hoare triple {19662#(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)); {19598#true} is VALID [2022-04-27 12:02:02,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,836 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {19598#true} {19662#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #50#return; {19662#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-27 12:02:02,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {19662#(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; {19684#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 12:02:02,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {19684#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {19684#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 12:02:02,837 INFO L272 TraceCheckUtils]: 28: Hoare triple {19684#(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)); {19598#true} is VALID [2022-04-27 12:02:02,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,837 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19598#true} {19684#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #50#return; {19684#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 12:02:02,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {19684#(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; {19706#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 12:02:02,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {19706#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !false; {19706#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 12:02:02,838 INFO L272 TraceCheckUtils]: 35: Hoare triple {19706#(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)); {19598#true} is VALID [2022-04-27 12:02:02,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,839 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {19598#true} {19706#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} #50#return; {19706#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-27 12:02:02,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {19706#(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; {19728#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 12:02:02,840 INFO L290 TraceCheckUtils]: 41: Hoare triple {19728#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {19728#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 12:02:02,840 INFO L272 TraceCheckUtils]: 42: Hoare triple {19728#(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)); {19598#true} is VALID [2022-04-27 12:02:02,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,840 INFO L290 TraceCheckUtils]: 45: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,840 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {19598#true} {19728#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {19728#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 12:02:02,841 INFO L290 TraceCheckUtils]: 47: Hoare triple {19728#(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; {19750#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 12:02:02,841 INFO L290 TraceCheckUtils]: 48: Hoare triple {19750#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {19750#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 12:02:02,841 INFO L272 TraceCheckUtils]: 49: Hoare triple {19750#(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)); {19598#true} is VALID [2022-04-27 12:02:02,841 INFO L290 TraceCheckUtils]: 50: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,841 INFO L290 TraceCheckUtils]: 51: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,841 INFO L290 TraceCheckUtils]: 52: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,842 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {19598#true} {19750#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #50#return; {19750#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-27 12:02:02,842 INFO L290 TraceCheckUtils]: 54: Hoare triple {19750#(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; {19772#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:02,842 INFO L290 TraceCheckUtils]: 55: Hoare triple {19772#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {19772#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:02,843 INFO L272 TraceCheckUtils]: 56: Hoare triple {19772#(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)); {19598#true} is VALID [2022-04-27 12:02:02,843 INFO L290 TraceCheckUtils]: 57: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,843 INFO L290 TraceCheckUtils]: 58: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,843 INFO L290 TraceCheckUtils]: 59: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,843 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19598#true} {19772#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #50#return; {19772#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:02,844 INFO L290 TraceCheckUtils]: 61: Hoare triple {19772#(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; {19794#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 12:02:02,844 INFO L290 TraceCheckUtils]: 62: Hoare triple {19794#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {19794#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 12:02:02,844 INFO L272 TraceCheckUtils]: 63: Hoare triple {19794#(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)); {19598#true} is VALID [2022-04-27 12:02:02,844 INFO L290 TraceCheckUtils]: 64: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,844 INFO L290 TraceCheckUtils]: 65: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,844 INFO L290 TraceCheckUtils]: 66: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,845 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {19598#true} {19794#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #50#return; {19794#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-27 12:02:02,845 INFO L290 TraceCheckUtils]: 68: Hoare triple {19794#(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; {19816#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-27 12:02:02,845 INFO L290 TraceCheckUtils]: 69: Hoare triple {19816#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !false; {19816#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-27 12:02:02,845 INFO L272 TraceCheckUtils]: 70: Hoare triple {19816#(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)); {19598#true} is VALID [2022-04-27 12:02:02,845 INFO L290 TraceCheckUtils]: 71: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,845 INFO L290 TraceCheckUtils]: 72: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,846 INFO L290 TraceCheckUtils]: 73: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,846 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {19598#true} {19816#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} #50#return; {19816#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-27 12:02:02,846 INFO L290 TraceCheckUtils]: 75: Hoare triple {19816#(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; {19838#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} is VALID [2022-04-27 12:02:02,847 INFO L290 TraceCheckUtils]: 76: Hoare triple {19838#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} assume !false; {19838#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} is VALID [2022-04-27 12:02:02,847 INFO L272 TraceCheckUtils]: 77: Hoare triple {19838#(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)); {19598#true} is VALID [2022-04-27 12:02:02,847 INFO L290 TraceCheckUtils]: 78: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,847 INFO L290 TraceCheckUtils]: 79: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,847 INFO L290 TraceCheckUtils]: 80: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,847 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19598#true} {19838#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} #50#return; {19838#(and (= (+ main_~y~0 (- 4)) 6) (= main_~c~0 10))} is VALID [2022-04-27 12:02:02,848 INFO L290 TraceCheckUtils]: 82: Hoare triple {19838#(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; {19860#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:02:02,848 INFO L290 TraceCheckUtils]: 83: Hoare triple {19860#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {19860#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:02:02,848 INFO L272 TraceCheckUtils]: 84: Hoare triple {19860#(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)); {19598#true} is VALID [2022-04-27 12:02:02,848 INFO L290 TraceCheckUtils]: 85: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,848 INFO L290 TraceCheckUtils]: 86: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,848 INFO L290 TraceCheckUtils]: 87: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,849 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {19598#true} {19860#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {19860#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:02:02,849 INFO L290 TraceCheckUtils]: 89: Hoare triple {19860#(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; {19882#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:02:02,849 INFO L290 TraceCheckUtils]: 90: Hoare triple {19882#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} assume !false; {19882#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:02:02,850 INFO L272 TraceCheckUtils]: 91: Hoare triple {19882#(and (= main_~y~0 12) (= 10 (+ (- 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)); {19598#true} is VALID [2022-04-27 12:02:02,850 INFO L290 TraceCheckUtils]: 92: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,850 INFO L290 TraceCheckUtils]: 93: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,850 INFO L290 TraceCheckUtils]: 94: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,850 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {19598#true} {19882#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} #50#return; {19882#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:02:02,851 INFO L290 TraceCheckUtils]: 96: Hoare triple {19882#(and (= main_~y~0 12) (= 10 (+ (- 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; {19904#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:02,851 INFO L290 TraceCheckUtils]: 97: Hoare triple {19904#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} assume !false; {19904#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:02,851 INFO L272 TraceCheckUtils]: 98: Hoare triple {19904#(and (= (+ main_~c~0 (- 3)) 10) (= 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)); {19598#true} is VALID [2022-04-27 12:02:02,851 INFO L290 TraceCheckUtils]: 99: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,851 INFO L290 TraceCheckUtils]: 100: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,851 INFO L290 TraceCheckUtils]: 101: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,852 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {19598#true} {19904#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} #50#return; {19904#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:02,852 INFO L290 TraceCheckUtils]: 103: Hoare triple {19904#(and (= (+ main_~c~0 (- 3)) 10) (= 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; {19926#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-27 12:02:02,852 INFO L290 TraceCheckUtils]: 104: Hoare triple {19926#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} assume !false; {19926#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-27 12:02:02,852 INFO L272 TraceCheckUtils]: 105: Hoare triple {19926#(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)); {19598#true} is VALID [2022-04-27 12:02:02,852 INFO L290 TraceCheckUtils]: 106: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,852 INFO L290 TraceCheckUtils]: 107: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,853 INFO L290 TraceCheckUtils]: 108: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,853 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {19598#true} {19926#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} #50#return; {19926#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-27 12:02:02,853 INFO L290 TraceCheckUtils]: 110: Hoare triple {19926#(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; {19948#(and (= (+ main_~y~0 (- 3)) 12) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 12:02:02,854 INFO L290 TraceCheckUtils]: 111: Hoare triple {19948#(and (= (+ main_~y~0 (- 3)) 12) (= (+ (- 1) main_~c~0) 14))} assume !false; {19948#(and (= (+ main_~y~0 (- 3)) 12) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 12:02:02,854 INFO L272 TraceCheckUtils]: 112: Hoare triple {19948#(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)); {19598#true} is VALID [2022-04-27 12:02:02,854 INFO L290 TraceCheckUtils]: 113: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,854 INFO L290 TraceCheckUtils]: 114: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,854 INFO L290 TraceCheckUtils]: 115: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,854 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {19598#true} {19948#(and (= (+ main_~y~0 (- 3)) 12) (= (+ (- 1) main_~c~0) 14))} #50#return; {19948#(and (= (+ main_~y~0 (- 3)) 12) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 12:02:02,855 INFO L290 TraceCheckUtils]: 117: Hoare triple {19948#(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; {19970#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-27 12:02:02,855 INFO L290 TraceCheckUtils]: 118: Hoare triple {19970#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 12))} assume !false; {19970#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-27 12:02:02,855 INFO L272 TraceCheckUtils]: 119: Hoare triple {19970#(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)); {19598#true} is VALID [2022-04-27 12:02:02,855 INFO L290 TraceCheckUtils]: 120: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,855 INFO L290 TraceCheckUtils]: 121: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,855 INFO L290 TraceCheckUtils]: 122: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,856 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {19598#true} {19970#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 12))} #50#return; {19970#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-27 12:02:02,856 INFO L290 TraceCheckUtils]: 124: Hoare triple {19970#(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; {19992#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 12:02:02,857 INFO L290 TraceCheckUtils]: 125: Hoare triple {19992#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {19992#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 12:02:02,857 INFO L272 TraceCheckUtils]: 126: Hoare triple {19992#(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)); {19598#true} is VALID [2022-04-27 12:02:02,857 INFO L290 TraceCheckUtils]: 127: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,857 INFO L290 TraceCheckUtils]: 128: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,857 INFO L290 TraceCheckUtils]: 129: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,857 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {19598#true} {19992#(and (= main_~c~0 17) (= main_~y~0 17))} #50#return; {19992#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 12:02:02,858 INFO L290 TraceCheckUtils]: 131: Hoare triple {19992#(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; {20014#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:02:02,858 INFO L290 TraceCheckUtils]: 132: Hoare triple {20014#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {20014#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:02:02,858 INFO L272 TraceCheckUtils]: 133: Hoare triple {20014#(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)); {19598#true} is VALID [2022-04-27 12:02:02,858 INFO L290 TraceCheckUtils]: 134: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,858 INFO L290 TraceCheckUtils]: 135: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,858 INFO L290 TraceCheckUtils]: 136: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,859 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {19598#true} {20014#(and (= main_~c~0 18) (= main_~y~0 18))} #50#return; {20014#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:02:02,859 INFO L290 TraceCheckUtils]: 138: Hoare triple {20014#(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; {20036#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-27 12:02:02,859 INFO L290 TraceCheckUtils]: 139: Hoare triple {20036#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !false; {20036#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-27 12:02:02,859 INFO L272 TraceCheckUtils]: 140: Hoare triple {20036#(and (= 18 (+ (- 1) 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)); {19598#true} is VALID [2022-04-27 12:02:02,860 INFO L290 TraceCheckUtils]: 141: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,860 INFO L290 TraceCheckUtils]: 142: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,860 INFO L290 TraceCheckUtils]: 143: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,860 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {19598#true} {20036#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} #50#return; {20036#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-27 12:02:02,860 INFO L290 TraceCheckUtils]: 145: Hoare triple {20036#(and (= 18 (+ (- 1) 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; {20058#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} is VALID [2022-04-27 12:02:02,861 INFO L290 TraceCheckUtils]: 146: Hoare triple {20058#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} assume !false; {20058#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} is VALID [2022-04-27 12:02:02,861 INFO L272 TraceCheckUtils]: 147: Hoare triple {20058#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 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)); {19598#true} is VALID [2022-04-27 12:02:02,861 INFO L290 TraceCheckUtils]: 148: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,861 INFO L290 TraceCheckUtils]: 149: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,861 INFO L290 TraceCheckUtils]: 150: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,861 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {19598#true} {20058#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} #50#return; {20058#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} is VALID [2022-04-27 12:02:02,862 INFO L290 TraceCheckUtils]: 152: Hoare triple {20058#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 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; {20080#(and (= 19 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-27 12:02:02,862 INFO L290 TraceCheckUtils]: 153: Hoare triple {20080#(and (= 19 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 18))} assume !false; {20080#(and (= 19 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-27 12:02:02,862 INFO L272 TraceCheckUtils]: 154: Hoare triple {20080#(and (= 19 (+ (- 2) main_~c~0)) (= (+ 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)); {19598#true} is VALID [2022-04-27 12:02:02,862 INFO L290 TraceCheckUtils]: 155: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,862 INFO L290 TraceCheckUtils]: 156: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,862 INFO L290 TraceCheckUtils]: 157: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,863 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {19598#true} {20080#(and (= 19 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 18))} #50#return; {20080#(and (= 19 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-27 12:02:02,863 INFO L290 TraceCheckUtils]: 159: Hoare triple {20080#(and (= 19 (+ (- 2) main_~c~0)) (= (+ 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; {20102#(and (= main_~y~0 22) (= 19 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 12:02:02,864 INFO L290 TraceCheckUtils]: 160: Hoare triple {20102#(and (= main_~y~0 22) (= 19 (+ main_~c~0 (- 3))))} assume !false; {20102#(and (= main_~y~0 22) (= 19 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 12:02:02,864 INFO L272 TraceCheckUtils]: 161: Hoare triple {20102#(and (= main_~y~0 22) (= 19 (+ 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)); {19598#true} is VALID [2022-04-27 12:02:02,864 INFO L290 TraceCheckUtils]: 162: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,864 INFO L290 TraceCheckUtils]: 163: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,864 INFO L290 TraceCheckUtils]: 164: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,864 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {19598#true} {20102#(and (= main_~y~0 22) (= 19 (+ main_~c~0 (- 3))))} #50#return; {20102#(and (= main_~y~0 22) (= 19 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 12:02:02,865 INFO L290 TraceCheckUtils]: 166: Hoare triple {20102#(and (= main_~y~0 22) (= 19 (+ 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; {20124#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:02,865 INFO L290 TraceCheckUtils]: 167: Hoare triple {20124#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {20124#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:02,865 INFO L272 TraceCheckUtils]: 168: Hoare triple {20124#(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)); {19598#true} is VALID [2022-04-27 12:02:02,865 INFO L290 TraceCheckUtils]: 169: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,865 INFO L290 TraceCheckUtils]: 170: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,865 INFO L290 TraceCheckUtils]: 171: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,866 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {19598#true} {20124#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} #50#return; {20124#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:02,866 INFO L290 TraceCheckUtils]: 173: Hoare triple {20124#(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; {20146#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 12:02:02,867 INFO L290 TraceCheckUtils]: 174: Hoare triple {20146#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {20146#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 12:02:02,867 INFO L272 TraceCheckUtils]: 175: Hoare triple {20146#(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)); {19598#true} is VALID [2022-04-27 12:02:02,867 INFO L290 TraceCheckUtils]: 176: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,867 INFO L290 TraceCheckUtils]: 177: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,867 INFO L290 TraceCheckUtils]: 178: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,867 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {19598#true} {20146#(and (= main_~c~0 24) (= main_~y~0 24))} #50#return; {20146#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 12:02:02,868 INFO L290 TraceCheckUtils]: 180: Hoare triple {20146#(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; {20168#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-27 12:02:02,868 INFO L290 TraceCheckUtils]: 181: Hoare triple {20168#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} assume !false; {20168#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-27 12:02:02,868 INFO L272 TraceCheckUtils]: 182: Hoare triple {20168#(and (= main_~y~0 25) (= (+ (- 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)); {19598#true} is VALID [2022-04-27 12:02:02,868 INFO L290 TraceCheckUtils]: 183: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,868 INFO L290 TraceCheckUtils]: 184: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,868 INFO L290 TraceCheckUtils]: 185: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,869 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {19598#true} {20168#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} #50#return; {20168#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-27 12:02:02,869 INFO L290 TraceCheckUtils]: 187: Hoare triple {20168#(and (= main_~y~0 25) (= (+ (- 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; {20190#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-27 12:02:02,870 INFO L290 TraceCheckUtils]: 188: Hoare triple {20190#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} assume !false; {20190#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-27 12:02:02,870 INFO L272 TraceCheckUtils]: 189: Hoare triple {20190#(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)); {19598#true} is VALID [2022-04-27 12:02:02,870 INFO L290 TraceCheckUtils]: 190: Hoare triple {19598#true} ~cond := #in~cond; {19598#true} is VALID [2022-04-27 12:02:02,870 INFO L290 TraceCheckUtils]: 191: Hoare triple {19598#true} assume !(0 == ~cond); {19598#true} is VALID [2022-04-27 12:02:02,870 INFO L290 TraceCheckUtils]: 192: Hoare triple {19598#true} assume true; {19598#true} is VALID [2022-04-27 12:02:02,870 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {19598#true} {20190#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} #50#return; {20190#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-27 12:02:02,872 INFO L290 TraceCheckUtils]: 194: Hoare triple {20190#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} assume !(~c~0 < ~k~0); {20212#(and (<= main_~k~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-27 12:02:02,873 INFO L272 TraceCheckUtils]: 195: Hoare triple {20212#(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)); {20216#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:02:02,873 INFO L290 TraceCheckUtils]: 196: Hoare triple {20216#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20220#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:02:02,873 INFO L290 TraceCheckUtils]: 197: Hoare triple {20220#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19599#false} is VALID [2022-04-27 12:02:02,873 INFO L290 TraceCheckUtils]: 198: Hoare triple {19599#false} assume !false; {19599#false} is VALID [2022-04-27 12:02:02,874 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 12:02:02,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:02:03,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:02:03,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676281774] [2022-04-27 12:02:03,362 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:02:03,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277903439] [2022-04-27 12:02:03,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277903439] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:02:03,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:02:03,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2022-04-27 12:02:03,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799718010] [2022-04-27 12:02:03,362 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:02:03,363 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 29 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Word has length 199 [2022-04-27 12:02:03,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:02:03,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 29 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:02:03,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:02:03,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-27 12:02:03,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:02:03,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-27 12:02:03,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 12:02:03,749 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 29 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:02:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:02:20,352 INFO L93 Difference]: Finished difference Result 108 states and 134 transitions. [2022-04-27 12:02:20,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-27 12:02:20,352 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 29 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Word has length 199 [2022-04-27 12:02:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:02:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 29 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:02:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 130 transitions. [2022-04-27 12:02:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 29 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:02:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 130 transitions. [2022-04-27 12:02:20,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 130 transitions. [2022-04-27 12:02:21,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:02:21,008 INFO L225 Difference]: With dead ends: 108 [2022-04-27 12:02:21,008 INFO L226 Difference]: Without dead ends: 103 [2022-04-27 12:02:21,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=1223, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 12:02:21,009 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:02:21,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1259 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-04-27 12:02:21,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-27 12:02:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-27 12:02:21,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:02:21,115 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), 31 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 12:02:21,115 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), 31 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 12:02:21,115 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), 31 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 12:02:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:02:21,129 INFO L93 Difference]: Finished difference Result 103 states and 129 transitions. [2022-04-27 12:02:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2022-04-27 12:02:21,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:02:21,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:02:21,130 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), 31 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 103 states. [2022-04-27 12:02:21,130 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), 31 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 103 states. [2022-04-27 12:02:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:02:21,133 INFO L93 Difference]: Finished difference Result 103 states and 129 transitions. [2022-04-27 12:02:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2022-04-27 12:02:21,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:02:21,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:02:21,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:02:21,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:02:21,134 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), 31 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 12:02:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2022-04-27 12:02:21,136 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 199 [2022-04-27 12:02:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:02:21,136 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2022-04-27 12:02:21,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 29 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:02:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2022-04-27 12:02:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-04-27 12:02:21,137 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:02:21,138 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:02:21,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-27 12:02:21,354 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 12:02:21,354 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:02:21,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:02:21,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1346993349, now seen corresponding path program 27 times [2022-04-27 12:02:21,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:02:21,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988481358] [2022-04-27 12:02:21,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:02:21,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:02:21,370 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:02:21,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [710746995] [2022-04-27 12:02:21,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:02:21,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:02:21,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:02:21,384 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 12:02:21,417 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 12:02:22,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2022-04-27 12:02:22,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:02:22,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 117 conjunts are in the unsatisfiable core [2022-04-27 12:02:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:02:23,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:02:24,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {20819#true} call ULTIMATE.init(); {20819#true} is VALID [2022-04-27 12:02:24,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {20819#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); {20819#true} is VALID [2022-04-27 12:02:24,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20819#true} {20819#true} #56#return; {20819#true} is VALID [2022-04-27 12:02:24,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {20819#true} call #t~ret5 := main(); {20819#true} is VALID [2022-04-27 12:02:24,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {20819#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {20839#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:02:24,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {20839#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {20839#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:02:24,618 INFO L272 TraceCheckUtils]: 7: Hoare triple {20839#(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)); {20819#true} is VALID [2022-04-27 12:02:24,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,619 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {20819#true} {20839#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {20839#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:02:24,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {20839#(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; {20861#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 12:02:24,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {20861#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {20861#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 12:02:24,620 INFO L272 TraceCheckUtils]: 14: Hoare triple {20861#(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)); {20819#true} is VALID [2022-04-27 12:02:24,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,620 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20819#true} {20861#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {20861#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 12:02:24,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {20861#(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; {20883#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 12:02:24,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {20883#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {20883#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 12:02:24,621 INFO L272 TraceCheckUtils]: 21: Hoare triple {20883#(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)); {20819#true} is VALID [2022-04-27 12:02:24,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,622 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20819#true} {20883#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #50#return; {20883#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 12:02:24,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {20883#(and (< 1 main_~k~0) (= (+ (- 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; {20905#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:02:24,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {20905#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {20905#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:02:24,622 INFO L272 TraceCheckUtils]: 28: Hoare triple {20905#(and (< 1 main_~k~0) (= 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)); {20819#true} is VALID [2022-04-27 12:02:24,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,623 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20819#true} {20905#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #50#return; {20905#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:02:24,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {20905#(and (< 1 main_~k~0) (= 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; {20927#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:24,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {20927#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {20927#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:24,624 INFO L272 TraceCheckUtils]: 35: Hoare triple {20927#(and (< 1 main_~k~0) (= 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)); {20819#true} is VALID [2022-04-27 12:02:24,624 INFO L290 TraceCheckUtils]: 36: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,625 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20819#true} {20927#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #50#return; {20927#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:24,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {20927#(and (< 1 main_~k~0) (= 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; {20949#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 12:02:24,625 INFO L290 TraceCheckUtils]: 41: Hoare triple {20949#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {20949#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 12:02:24,625 INFO L272 TraceCheckUtils]: 42: Hoare triple {20949#(and (< 1 main_~k~0) (= (+ (- 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)); {20819#true} is VALID [2022-04-27 12:02:24,625 INFO L290 TraceCheckUtils]: 43: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,626 INFO L290 TraceCheckUtils]: 44: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,626 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {20819#true} {20949#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #50#return; {20949#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 12:02:24,626 INFO L290 TraceCheckUtils]: 47: Hoare triple {20949#(and (< 1 main_~k~0) (= (+ (- 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; {20971#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 12:02:24,627 INFO L290 TraceCheckUtils]: 48: Hoare triple {20971#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} assume !false; {20971#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 12:02:24,627 INFO L272 TraceCheckUtils]: 49: Hoare triple {20971#(and (< 1 main_~k~0) (= (+ (- 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)); {20819#true} is VALID [2022-04-27 12:02:24,627 INFO L290 TraceCheckUtils]: 50: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,627 INFO L290 TraceCheckUtils]: 51: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,627 INFO L290 TraceCheckUtils]: 52: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,627 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {20819#true} {20971#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} #50#return; {20971#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 12:02:24,628 INFO L290 TraceCheckUtils]: 54: Hoare triple {20971#(and (< 1 main_~k~0) (= (+ (- 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; {20993#(and (= 7 main_~y~0) (< 1 main_~k~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:02:24,628 INFO L290 TraceCheckUtils]: 55: Hoare triple {20993#(and (= 7 main_~y~0) (< 1 main_~k~0) (= 7 main_~c~0))} assume !false; {20993#(and (= 7 main_~y~0) (< 1 main_~k~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:02:24,628 INFO L272 TraceCheckUtils]: 56: Hoare triple {20993#(and (= 7 main_~y~0) (< 1 main_~k~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)); {20819#true} is VALID [2022-04-27 12:02:24,636 INFO L290 TraceCheckUtils]: 57: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,636 INFO L290 TraceCheckUtils]: 58: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,636 INFO L290 TraceCheckUtils]: 59: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,637 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20819#true} {20993#(and (= 7 main_~y~0) (< 1 main_~k~0) (= 7 main_~c~0))} #50#return; {20993#(and (= 7 main_~y~0) (< 1 main_~k~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:02:24,637 INFO L290 TraceCheckUtils]: 61: Hoare triple {20993#(and (= 7 main_~y~0) (< 1 main_~k~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; {21015#(and (< 1 main_~k~0) (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:02:24,637 INFO L290 TraceCheckUtils]: 62: Hoare triple {21015#(and (< 1 main_~k~0) (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {21015#(and (< 1 main_~k~0) (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:02:24,638 INFO L272 TraceCheckUtils]: 63: Hoare triple {21015#(and (< 1 main_~k~0) (= 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)); {20819#true} is VALID [2022-04-27 12:02:24,638 INFO L290 TraceCheckUtils]: 64: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,638 INFO L290 TraceCheckUtils]: 65: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,638 INFO L290 TraceCheckUtils]: 66: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,638 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {20819#true} {21015#(and (< 1 main_~k~0) (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #50#return; {21015#(and (< 1 main_~k~0) (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:02:24,639 INFO L290 TraceCheckUtils]: 68: Hoare triple {21015#(and (< 1 main_~k~0) (= 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; {21037#(and (< 1 main_~k~0) (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:02:24,639 INFO L290 TraceCheckUtils]: 69: Hoare triple {21037#(and (< 1 main_~k~0) (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {21037#(and (< 1 main_~k~0) (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:02:24,639 INFO L272 TraceCheckUtils]: 70: Hoare triple {21037#(and (< 1 main_~k~0) (= 8 (+ (- 1) main_~y~0)) (= 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)); {20819#true} is VALID [2022-04-27 12:02:24,639 INFO L290 TraceCheckUtils]: 71: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,639 INFO L290 TraceCheckUtils]: 72: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,639 INFO L290 TraceCheckUtils]: 73: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,640 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20819#true} {21037#(and (< 1 main_~k~0) (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #50#return; {21037#(and (< 1 main_~k~0) (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:02:24,640 INFO L290 TraceCheckUtils]: 75: Hoare triple {21037#(and (< 1 main_~k~0) (= 8 (+ (- 1) main_~y~0)) (= 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; {21059#(and (< 1 main_~k~0) (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 12:02:24,640 INFO L290 TraceCheckUtils]: 76: Hoare triple {21059#(and (< 1 main_~k~0) (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} assume !false; {21059#(and (< 1 main_~k~0) (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 12:02:24,641 INFO L272 TraceCheckUtils]: 77: Hoare triple {21059#(and (< 1 main_~k~0) (= 7 (+ main_~c~0 (- 3))) (= (+ (- 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)); {20819#true} is VALID [2022-04-27 12:02:24,641 INFO L290 TraceCheckUtils]: 78: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,641 INFO L290 TraceCheckUtils]: 79: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,641 INFO L290 TraceCheckUtils]: 80: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,641 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20819#true} {21059#(and (< 1 main_~k~0) (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} #50#return; {21059#(and (< 1 main_~k~0) (= 7 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-27 12:02:24,642 INFO L290 TraceCheckUtils]: 82: Hoare triple {21059#(and (< 1 main_~k~0) (= 7 (+ main_~c~0 (- 3))) (= (+ (- 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; {21081#(and (< 1 main_~k~0) (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-27 12:02:24,642 INFO L290 TraceCheckUtils]: 83: Hoare triple {21081#(and (< 1 main_~k~0) (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} assume !false; {21081#(and (< 1 main_~k~0) (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-27 12:02:24,642 INFO L272 TraceCheckUtils]: 84: Hoare triple {21081#(and (< 1 main_~k~0) (= 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)); {20819#true} is VALID [2022-04-27 12:02:24,642 INFO L290 TraceCheckUtils]: 85: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,642 INFO L290 TraceCheckUtils]: 86: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,642 INFO L290 TraceCheckUtils]: 87: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,643 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {20819#true} {21081#(and (< 1 main_~k~0) (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} #50#return; {21081#(and (< 1 main_~k~0) (= main_~c~0 11) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-27 12:02:24,643 INFO L290 TraceCheckUtils]: 89: Hoare triple {21081#(and (< 1 main_~k~0) (= 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; {21103#(and (< 1 main_~k~0) (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-27 12:02:24,643 INFO L290 TraceCheckUtils]: 90: Hoare triple {21103#(and (< 1 main_~k~0) (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} assume !false; {21103#(and (< 1 main_~k~0) (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-27 12:02:24,643 INFO L272 TraceCheckUtils]: 91: Hoare triple {21103#(and (< 1 main_~k~0) (= main_~c~0 12) (= (+ 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)); {20819#true} is VALID [2022-04-27 12:02:24,644 INFO L290 TraceCheckUtils]: 92: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,644 INFO L290 TraceCheckUtils]: 93: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,644 INFO L290 TraceCheckUtils]: 94: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,644 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {20819#true} {21103#(and (< 1 main_~k~0) (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} #50#return; {21103#(and (< 1 main_~k~0) (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-27 12:02:24,644 INFO L290 TraceCheckUtils]: 96: Hoare triple {21103#(and (< 1 main_~k~0) (= main_~c~0 12) (= (+ 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; {21125#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 12:02:24,645 INFO L290 TraceCheckUtils]: 97: Hoare triple {21125#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {21125#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 12:02:24,645 INFO L272 TraceCheckUtils]: 98: Hoare triple {21125#(and (< 1 main_~k~0) (= (+ (- 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)); {20819#true} is VALID [2022-04-27 12:02:24,645 INFO L290 TraceCheckUtils]: 99: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,645 INFO L290 TraceCheckUtils]: 100: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,645 INFO L290 TraceCheckUtils]: 101: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,646 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {20819#true} {21125#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #50#return; {21125#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 12:02:24,646 INFO L290 TraceCheckUtils]: 103: Hoare triple {21125#(and (< 1 main_~k~0) (= (+ (- 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; {21147#(and (< 1 main_~k~0) (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:02:24,646 INFO L290 TraceCheckUtils]: 104: Hoare triple {21147#(and (< 1 main_~k~0) (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {21147#(and (< 1 main_~k~0) (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:02:24,646 INFO L272 TraceCheckUtils]: 105: Hoare triple {21147#(and (< 1 main_~k~0) (= 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)); {20819#true} is VALID [2022-04-27 12:02:24,646 INFO L290 TraceCheckUtils]: 106: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,646 INFO L290 TraceCheckUtils]: 107: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,647 INFO L290 TraceCheckUtils]: 108: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,647 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {20819#true} {21147#(and (< 1 main_~k~0) (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #50#return; {21147#(and (< 1 main_~k~0) (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:02:24,647 INFO L290 TraceCheckUtils]: 110: Hoare triple {21147#(and (< 1 main_~k~0) (= 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; {21169#(and (= main_~c~0 15) (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 12:02:24,648 INFO L290 TraceCheckUtils]: 111: Hoare triple {21169#(and (= main_~c~0 15) (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 13))} assume !false; {21169#(and (= main_~c~0 15) (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 12:02:24,648 INFO L272 TraceCheckUtils]: 112: Hoare triple {21169#(and (= main_~c~0 15) (< 1 main_~k~0) (= (+ (- 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)); {20819#true} is VALID [2022-04-27 12:02:24,648 INFO L290 TraceCheckUtils]: 113: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,648 INFO L290 TraceCheckUtils]: 114: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,648 INFO L290 TraceCheckUtils]: 115: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,648 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {20819#true} {21169#(and (= main_~c~0 15) (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 13))} #50#return; {21169#(and (= main_~c~0 15) (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-27 12:02:24,649 INFO L290 TraceCheckUtils]: 117: Hoare triple {21169#(and (= main_~c~0 15) (< 1 main_~k~0) (= (+ (- 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; {21191#(and (< 1 main_~k~0) (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 12:02:24,649 INFO L290 TraceCheckUtils]: 118: Hoare triple {21191#(and (< 1 main_~k~0) (= main_~c~0 16) (= main_~y~0 16))} assume !false; {21191#(and (< 1 main_~k~0) (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 12:02:24,649 INFO L272 TraceCheckUtils]: 119: Hoare triple {21191#(and (< 1 main_~k~0) (= 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)); {20819#true} is VALID [2022-04-27 12:02:24,649 INFO L290 TraceCheckUtils]: 120: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,649 INFO L290 TraceCheckUtils]: 121: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,649 INFO L290 TraceCheckUtils]: 122: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,650 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {20819#true} {21191#(and (< 1 main_~k~0) (= main_~c~0 16) (= main_~y~0 16))} #50#return; {21191#(and (< 1 main_~k~0) (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-27 12:02:24,650 INFO L290 TraceCheckUtils]: 124: Hoare triple {21191#(and (< 1 main_~k~0) (= 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; {21213#(and (< 1 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 12:02:24,651 INFO L290 TraceCheckUtils]: 125: Hoare triple {21213#(and (< 1 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} assume !false; {21213#(and (< 1 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 12:02:24,651 INFO L272 TraceCheckUtils]: 126: Hoare triple {21213#(and (< 1 main_~k~0) (= 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)); {20819#true} is VALID [2022-04-27 12:02:24,651 INFO L290 TraceCheckUtils]: 127: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,651 INFO L290 TraceCheckUtils]: 128: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,651 INFO L290 TraceCheckUtils]: 129: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,651 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {20819#true} {21213#(and (< 1 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} #50#return; {21213#(and (< 1 main_~k~0) (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 12:02:24,652 INFO L290 TraceCheckUtils]: 131: Hoare triple {21213#(and (< 1 main_~k~0) (= 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; {21235#(and (< 1 main_~k~0) (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 12:02:24,652 INFO L290 TraceCheckUtils]: 132: Hoare triple {21235#(and (< 1 main_~k~0) (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {21235#(and (< 1 main_~k~0) (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 12:02:24,652 INFO L272 TraceCheckUtils]: 133: Hoare triple {21235#(and (< 1 main_~k~0) (= 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)); {20819#true} is VALID [2022-04-27 12:02:24,652 INFO L290 TraceCheckUtils]: 134: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,652 INFO L290 TraceCheckUtils]: 135: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,652 INFO L290 TraceCheckUtils]: 136: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,653 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {20819#true} {21235#(and (< 1 main_~k~0) (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #50#return; {21235#(and (< 1 main_~k~0) (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 12:02:24,653 INFO L290 TraceCheckUtils]: 138: Hoare triple {21235#(and (< 1 main_~k~0) (= 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; {21257#(and (< 1 main_~k~0) (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 12:02:24,654 INFO L290 TraceCheckUtils]: 139: Hoare triple {21257#(and (< 1 main_~k~0) (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {21257#(and (< 1 main_~k~0) (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 12:02:24,654 INFO L272 TraceCheckUtils]: 140: Hoare triple {21257#(and (< 1 main_~k~0) (= 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)); {20819#true} is VALID [2022-04-27 12:02:24,654 INFO L290 TraceCheckUtils]: 141: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,654 INFO L290 TraceCheckUtils]: 142: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,654 INFO L290 TraceCheckUtils]: 143: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,654 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {20819#true} {21257#(and (< 1 main_~k~0) (= 19 main_~y~0) (= 19 main_~c~0))} #50#return; {21257#(and (< 1 main_~k~0) (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-27 12:02:24,655 INFO L290 TraceCheckUtils]: 145: Hoare triple {21257#(and (< 1 main_~k~0) (= 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; {21279#(and (= 19 (+ (- 1) main_~c~0)) (< 1 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-27 12:02:24,655 INFO L290 TraceCheckUtils]: 146: Hoare triple {21279#(and (= 19 (+ (- 1) main_~c~0)) (< 1 main_~k~0) (= main_~y~0 20))} assume !false; {21279#(and (= 19 (+ (- 1) main_~c~0)) (< 1 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-27 12:02:24,655 INFO L272 TraceCheckUtils]: 147: Hoare triple {21279#(and (= 19 (+ (- 1) main_~c~0)) (< 1 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)); {20819#true} is VALID [2022-04-27 12:02:24,655 INFO L290 TraceCheckUtils]: 148: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,655 INFO L290 TraceCheckUtils]: 149: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,655 INFO L290 TraceCheckUtils]: 150: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,656 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {20819#true} {21279#(and (= 19 (+ (- 1) main_~c~0)) (< 1 main_~k~0) (= main_~y~0 20))} #50#return; {21279#(and (= 19 (+ (- 1) main_~c~0)) (< 1 main_~k~0) (= main_~y~0 20))} is VALID [2022-04-27 12:02:24,656 INFO L290 TraceCheckUtils]: 152: Hoare triple {21279#(and (= 19 (+ (- 1) main_~c~0)) (< 1 main_~k~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; {21301#(and (= main_~c~0 21) (< 1 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-27 12:02:24,657 INFO L290 TraceCheckUtils]: 153: Hoare triple {21301#(and (= main_~c~0 21) (< 1 main_~k~0) (= main_~y~0 21))} assume !false; {21301#(and (= main_~c~0 21) (< 1 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-27 12:02:24,657 INFO L272 TraceCheckUtils]: 154: Hoare triple {21301#(and (= main_~c~0 21) (< 1 main_~k~0) (= 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)); {20819#true} is VALID [2022-04-27 12:02:24,657 INFO L290 TraceCheckUtils]: 155: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,657 INFO L290 TraceCheckUtils]: 156: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,657 INFO L290 TraceCheckUtils]: 157: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,657 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {20819#true} {21301#(and (= main_~c~0 21) (< 1 main_~k~0) (= main_~y~0 21))} #50#return; {21301#(and (= main_~c~0 21) (< 1 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-27 12:02:24,658 INFO L290 TraceCheckUtils]: 159: Hoare triple {21301#(and (= main_~c~0 21) (< 1 main_~k~0) (= 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; {21323#(and (< 1 main_~k~0) (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-27 12:02:24,658 INFO L290 TraceCheckUtils]: 160: Hoare triple {21323#(and (< 1 main_~k~0) (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} assume !false; {21323#(and (< 1 main_~k~0) (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-27 12:02:24,658 INFO L272 TraceCheckUtils]: 161: Hoare triple {21323#(and (< 1 main_~k~0) (= 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)); {20819#true} is VALID [2022-04-27 12:02:24,658 INFO L290 TraceCheckUtils]: 162: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,658 INFO L290 TraceCheckUtils]: 163: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,658 INFO L290 TraceCheckUtils]: 164: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,659 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {20819#true} {21323#(and (< 1 main_~k~0) (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} #50#return; {21323#(and (< 1 main_~k~0) (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-27 12:02:24,659 INFO L290 TraceCheckUtils]: 166: Hoare triple {21323#(and (< 1 main_~k~0) (= 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; {21345#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-27 12:02:24,659 INFO L290 TraceCheckUtils]: 167: Hoare triple {21345#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !false; {21345#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-27 12:02:24,660 INFO L272 TraceCheckUtils]: 168: Hoare triple {21345#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 22) (= 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)); {20819#true} is VALID [2022-04-27 12:02:24,660 INFO L290 TraceCheckUtils]: 169: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,660 INFO L290 TraceCheckUtils]: 170: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,660 INFO L290 TraceCheckUtils]: 171: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,660 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {20819#true} {21345#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} #50#return; {21345#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-27 12:02:24,661 INFO L290 TraceCheckUtils]: 173: Hoare triple {21345#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 22) (= 23 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; {21367#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 1 main_~k~0))} is VALID [2022-04-27 12:02:24,661 INFO L290 TraceCheckUtils]: 174: Hoare triple {21367#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 1 main_~k~0))} assume !false; {21367#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 1 main_~k~0))} is VALID [2022-04-27 12:02:24,661 INFO L272 TraceCheckUtils]: 175: Hoare triple {21367#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 1 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)); {20819#true} is VALID [2022-04-27 12:02:24,661 INFO L290 TraceCheckUtils]: 176: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,661 INFO L290 TraceCheckUtils]: 177: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,661 INFO L290 TraceCheckUtils]: 178: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,662 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {20819#true} {21367#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 1 main_~k~0))} #50#return; {21367#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 1 main_~k~0))} is VALID [2022-04-27 12:02:24,662 INFO L290 TraceCheckUtils]: 180: Hoare triple {21367#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 1 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; {21389#(and (= 23 (+ (- 2) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 25))} is VALID [2022-04-27 12:02:24,663 INFO L290 TraceCheckUtils]: 181: Hoare triple {21389#(and (= 23 (+ (- 2) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 25))} assume !false; {21389#(and (= 23 (+ (- 2) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 25))} is VALID [2022-04-27 12:02:24,663 INFO L272 TraceCheckUtils]: 182: Hoare triple {21389#(and (= 23 (+ (- 2) main_~y~0)) (< 1 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)); {20819#true} is VALID [2022-04-27 12:02:24,663 INFO L290 TraceCheckUtils]: 183: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,663 INFO L290 TraceCheckUtils]: 184: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,663 INFO L290 TraceCheckUtils]: 185: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,663 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {20819#true} {21389#(and (= 23 (+ (- 2) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 25))} #50#return; {21389#(and (= 23 (+ (- 2) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 25))} is VALID [2022-04-27 12:02:24,664 INFO L290 TraceCheckUtils]: 187: Hoare triple {21389#(and (= 23 (+ (- 2) main_~y~0)) (< 1 main_~k~0) (= 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; {21411#(and (< 1 main_~k~0) (= 23 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-27 12:02:24,664 INFO L290 TraceCheckUtils]: 188: Hoare triple {21411#(and (< 1 main_~k~0) (= 23 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 25))} assume !false; {21411#(and (< 1 main_~k~0) (= 23 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-27 12:02:24,664 INFO L272 TraceCheckUtils]: 189: Hoare triple {21411#(and (< 1 main_~k~0) (= 23 (+ main_~y~0 (- 3))) (= (+ (- 1) 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)); {20819#true} is VALID [2022-04-27 12:02:24,664 INFO L290 TraceCheckUtils]: 190: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,664 INFO L290 TraceCheckUtils]: 191: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,665 INFO L290 TraceCheckUtils]: 192: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,665 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {20819#true} {21411#(and (< 1 main_~k~0) (= 23 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 25))} #50#return; {21411#(and (< 1 main_~k~0) (= 23 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-27 12:02:24,666 INFO L290 TraceCheckUtils]: 194: Hoare triple {21411#(and (< 1 main_~k~0) (= 23 (+ main_~y~0 (- 3))) (= (+ (- 1) 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; {21433#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} is VALID [2022-04-27 12:02:24,666 INFO L290 TraceCheckUtils]: 195: Hoare triple {21433#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} assume !false; {21433#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} is VALID [2022-04-27 12:02:24,666 INFO L272 TraceCheckUtils]: 196: Hoare triple {21433#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 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)); {20819#true} is VALID [2022-04-27 12:02:24,666 INFO L290 TraceCheckUtils]: 197: Hoare triple {20819#true} ~cond := #in~cond; {20819#true} is VALID [2022-04-27 12:02:24,666 INFO L290 TraceCheckUtils]: 198: Hoare triple {20819#true} assume !(0 == ~cond); {20819#true} is VALID [2022-04-27 12:02:24,666 INFO L290 TraceCheckUtils]: 199: Hoare triple {20819#true} assume true; {20819#true} is VALID [2022-04-27 12:02:24,667 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {20819#true} {21433#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} #50#return; {21433#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} is VALID [2022-04-27 12:02:24,667 INFO L290 TraceCheckUtils]: 201: Hoare triple {21433#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} assume !(~c~0 < ~k~0); {21455#(and (= main_~y~0 27) (< 26 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-27 12:02:24,668 INFO L272 TraceCheckUtils]: 202: Hoare triple {21455#(and (= main_~y~0 27) (< 26 main_~k~0) (<= main_~k~0 27))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:02:24,668 INFO L290 TraceCheckUtils]: 203: Hoare triple {21459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:02:24,669 INFO L290 TraceCheckUtils]: 204: Hoare triple {21463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20820#false} is VALID [2022-04-27 12:02:24,669 INFO L290 TraceCheckUtils]: 205: Hoare triple {20820#false} assume !false; {20820#false} is VALID [2022-04-27 12:02:24,670 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 12:02:24,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:02:29,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:02:29,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988481358] [2022-04-27 12:02:29,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:02:29,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710746995] [2022-04-27 12:02:29,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710746995] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:02:29,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:02:29,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2022-04-27 12:02:29,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095667590] [2022-04-27 12:02:29,315 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:02:29,315 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 30 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Word has length 206 [2022-04-27 12:02:29,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:02:29,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 30 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 12:02:29,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:02:29,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-27 12:02:29,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:02:29,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-27 12:02:29,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=828, Invalid=2832, Unknown=0, NotChecked=0, Total=3660 [2022-04-27 12:02:29,524 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 30 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 12:02:43,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:02:43,513 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2022-04-27 12:02:43,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-27 12:02:43,513 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 30 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Word has length 206 [2022-04-27 12:02:43,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:02:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 30 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 12:02:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 134 transitions. [2022-04-27 12:02:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 30 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 12:02:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 134 transitions. [2022-04-27 12:02:43,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 134 transitions. [2022-04-27 12:02:44,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:02:44,063 INFO L225 Difference]: With dead ends: 111 [2022-04-27 12:02:44,063 INFO L226 Difference]: Without dead ends: 106 [2022-04-27 12:02:44,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 333 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=838, Invalid=3068, Unknown=0, NotChecked=0, Total=3906 [2022-04-27 12:02:44,064 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 2646 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 2646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-27 12:02:44,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1332 Invalid, 2646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2646 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-04-27 12:02:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-27 12:02:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-27 12:02:44,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:02:44,156 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), 32 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:02:44,156 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), 32 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:02:44,156 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), 32 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:02:44,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:02:44,159 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-27 12:02:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-27 12:02:44,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:02:44,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:02:44,160 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), 32 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 106 states. [2022-04-27 12:02:44,160 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), 32 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 106 states. [2022-04-27 12:02:44,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:02:44,162 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-27 12:02:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-27 12:02:44,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:02:44,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:02:44,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:02:44,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:02:44,162 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), 32 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:02:44,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2022-04-27 12:02:44,164 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 206 [2022-04-27 12:02:44,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:02:44,165 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2022-04-27 12:02:44,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 30 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-27 12:02:44,165 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-27 12:02:44,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-04-27 12:02:44,166 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:02:44,166 INFO L195 NwaCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:02:44,178 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 12:02:44,379 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 12:02:44,380 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:02:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:02:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash 742317746, now seen corresponding path program 28 times [2022-04-27 12:02:44,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:02:44,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164521979] [2022-04-27 12:02:44,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:02:44,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:02:44,398 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:02:44,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1765259402] [2022-04-27 12:02:44,398 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 12:02:44,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:02:44,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:02:44,399 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 12:02:44,400 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 12:02:48,960 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 12:02:48,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:02:48,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 120 conjunts are in the unsatisfiable core [2022-04-27 12:02:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:02:49,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:02:50,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {22628#true} call ULTIMATE.init(); {22628#true} is VALID [2022-04-27 12:02:50,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {22628#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); {22628#true} is VALID [2022-04-27 12:02:50,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22628#true} {22628#true} #56#return; {22628#true} is VALID [2022-04-27 12:02:50,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {22628#true} call #t~ret5 := main(); {22628#true} is VALID [2022-04-27 12:02:50,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {22628#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {22648#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:02:50,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {22648#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {22648#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:02:50,296 INFO L272 TraceCheckUtils]: 7: Hoare triple {22648#(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)); {22628#true} is VALID [2022-04-27 12:02:50,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,296 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {22628#true} {22648#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {22648#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:02:50,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {22648#(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; {22670#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 12:02:50,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {22670#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {22670#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 12:02:50,297 INFO L272 TraceCheckUtils]: 14: Hoare triple {22670#(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)); {22628#true} is VALID [2022-04-27 12:02:50,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,298 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22628#true} {22670#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {22670#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 12:02:50,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {22670#(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; {22692#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 12:02:50,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {22692#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {22692#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 12:02:50,299 INFO L272 TraceCheckUtils]: 21: Hoare triple {22692#(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)); {22628#true} is VALID [2022-04-27 12:02:50,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,299 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22628#true} {22692#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {22692#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 12:02:50,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {22692#(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; {22714#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:02:50,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {22714#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {22714#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:02:50,300 INFO L272 TraceCheckUtils]: 28: Hoare triple {22714#(and (= 2 (+ (- 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)); {22628#true} is VALID [2022-04-27 12:02:50,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,301 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {22628#true} {22714#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #50#return; {22714#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:02:50,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {22714#(and (= 2 (+ (- 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; {22736#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:02:50,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {22736#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {22736#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:02:50,302 INFO L272 TraceCheckUtils]: 35: Hoare triple {22736#(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)); {22628#true} is VALID [2022-04-27 12:02:50,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,302 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22628#true} {22736#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {22736#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:02:50,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {22736#(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; {22758#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:02:50,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {22758#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {22758#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:02:50,303 INFO L272 TraceCheckUtils]: 42: Hoare triple {22758#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) 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)); {22628#true} is VALID [2022-04-27 12:02:50,303 INFO L290 TraceCheckUtils]: 43: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,303 INFO L290 TraceCheckUtils]: 44: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,303 INFO L290 TraceCheckUtils]: 45: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,304 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22628#true} {22758#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #50#return; {22758#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:02:50,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {22758#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) 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; {22780#(and (= 4 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-27 12:02:50,305 INFO L290 TraceCheckUtils]: 48: Hoare triple {22780#(and (= 4 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 4))} assume !false; {22780#(and (= 4 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-27 12:02:50,305 INFO L272 TraceCheckUtils]: 49: Hoare triple {22780#(and (= 4 (+ (- 2) main_~c~0)) (= (+ (- 2) 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)); {22628#true} is VALID [2022-04-27 12:02:50,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,305 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {22628#true} {22780#(and (= 4 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 4))} #50#return; {22780#(and (= 4 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-27 12:02:50,306 INFO L290 TraceCheckUtils]: 54: Hoare triple {22780#(and (= 4 (+ (- 2) main_~c~0)) (= (+ (- 2) 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; {22802#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:02:50,306 INFO L290 TraceCheckUtils]: 55: Hoare triple {22802#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {22802#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:02:50,306 INFO L272 TraceCheckUtils]: 56: Hoare triple {22802#(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)); {22628#true} is VALID [2022-04-27 12:02:50,306 INFO L290 TraceCheckUtils]: 57: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,306 INFO L290 TraceCheckUtils]: 58: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,306 INFO L290 TraceCheckUtils]: 59: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,307 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {22628#true} {22802#(and (= 7 main_~y~0) (= 7 main_~c~0))} #50#return; {22802#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:02:50,307 INFO L290 TraceCheckUtils]: 61: Hoare triple {22802#(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; {22824#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:02:50,307 INFO L290 TraceCheckUtils]: 62: Hoare triple {22824#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {22824#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:02:50,308 INFO L272 TraceCheckUtils]: 63: Hoare triple {22824#(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)); {22628#true} is VALID [2022-04-27 12:02:50,308 INFO L290 TraceCheckUtils]: 64: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,308 INFO L290 TraceCheckUtils]: 65: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,308 INFO L290 TraceCheckUtils]: 66: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,308 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {22628#true} {22824#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #50#return; {22824#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:02:50,308 INFO L290 TraceCheckUtils]: 68: Hoare triple {22824#(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; {22846#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 12:02:50,309 INFO L290 TraceCheckUtils]: 69: Hoare triple {22846#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {22846#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 12:02:50,309 INFO L272 TraceCheckUtils]: 70: Hoare triple {22846#(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)); {22628#true} is VALID [2022-04-27 12:02:50,309 INFO L290 TraceCheckUtils]: 71: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,309 INFO L290 TraceCheckUtils]: 72: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,309 INFO L290 TraceCheckUtils]: 73: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,309 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22628#true} {22846#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #50#return; {22846#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-27 12:02:50,310 INFO L290 TraceCheckUtils]: 75: Hoare triple {22846#(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; {22868#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 12:02:50,310 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {22868#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 12:02:50,310 INFO L272 TraceCheckUtils]: 77: Hoare triple {22868#(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)); {22628#true} is VALID [2022-04-27 12:02:50,310 INFO L290 TraceCheckUtils]: 78: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,310 INFO L290 TraceCheckUtils]: 79: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,310 INFO L290 TraceCheckUtils]: 80: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,311 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {22628#true} {22868#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #50#return; {22868#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 12:02:50,311 INFO L290 TraceCheckUtils]: 82: Hoare triple {22868#(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; {22890#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 12:02:50,312 INFO L290 TraceCheckUtils]: 83: Hoare triple {22890#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {22890#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 12:02:50,312 INFO L272 TraceCheckUtils]: 84: Hoare triple {22890#(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)); {22628#true} is VALID [2022-04-27 12:02:50,312 INFO L290 TraceCheckUtils]: 85: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,312 INFO L290 TraceCheckUtils]: 86: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,312 INFO L290 TraceCheckUtils]: 87: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,312 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {22628#true} {22890#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #50#return; {22890#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 12:02:50,313 INFO L290 TraceCheckUtils]: 89: Hoare triple {22890#(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; {22912#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 12:02:50,313 INFO L290 TraceCheckUtils]: 90: Hoare triple {22912#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {22912#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 12:02:50,313 INFO L272 TraceCheckUtils]: 91: Hoare triple {22912#(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)); {22628#true} is VALID [2022-04-27 12:02:50,313 INFO L290 TraceCheckUtils]: 92: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,313 INFO L290 TraceCheckUtils]: 93: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,313 INFO L290 TraceCheckUtils]: 94: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,314 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {22628#true} {22912#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #50#return; {22912#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-27 12:02:50,314 INFO L290 TraceCheckUtils]: 96: Hoare triple {22912#(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; {22934#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:50,314 INFO L290 TraceCheckUtils]: 97: Hoare triple {22934#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} assume !false; {22934#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:50,314 INFO L272 TraceCheckUtils]: 98: Hoare triple {22934#(and (= 11 (+ (- 2) main_~c~0)) (= 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)); {22628#true} is VALID [2022-04-27 12:02:50,315 INFO L290 TraceCheckUtils]: 99: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,315 INFO L290 TraceCheckUtils]: 100: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,331 INFO L290 TraceCheckUtils]: 101: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,332 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {22628#true} {22934#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} #50#return; {22934#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:50,332 INFO L290 TraceCheckUtils]: 103: Hoare triple {22934#(and (= 11 (+ (- 2) main_~c~0)) (= 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; {22956#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-27 12:02:50,333 INFO L290 TraceCheckUtils]: 104: Hoare triple {22956#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} assume !false; {22956#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-27 12:02:50,333 INFO L272 TraceCheckUtils]: 105: Hoare triple {22956#(and (= (+ (- 2) main_~y~0) 12) (= (+ 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)); {22628#true} is VALID [2022-04-27 12:02:50,333 INFO L290 TraceCheckUtils]: 106: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,333 INFO L290 TraceCheckUtils]: 107: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,333 INFO L290 TraceCheckUtils]: 108: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,333 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {22628#true} {22956#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} #50#return; {22956#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-27 12:02:50,334 INFO L290 TraceCheckUtils]: 110: Hoare triple {22956#(and (= (+ (- 2) main_~y~0) 12) (= (+ 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; {22978#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 12:02:50,334 INFO L290 TraceCheckUtils]: 111: Hoare triple {22978#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} assume !false; {22978#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 12:02:50,334 INFO L272 TraceCheckUtils]: 112: Hoare triple {22978#(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)); {22628#true} is VALID [2022-04-27 12:02:50,334 INFO L290 TraceCheckUtils]: 113: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,334 INFO L290 TraceCheckUtils]: 114: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,334 INFO L290 TraceCheckUtils]: 115: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,335 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {22628#true} {22978#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} #50#return; {22978#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 12:02:50,335 INFO L290 TraceCheckUtils]: 117: Hoare triple {22978#(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; {23000#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:50,335 INFO L290 TraceCheckUtils]: 118: Hoare triple {23000#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {23000#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:50,336 INFO L272 TraceCheckUtils]: 119: Hoare triple {23000#(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)); {22628#true} is VALID [2022-04-27 12:02:50,336 INFO L290 TraceCheckUtils]: 120: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,336 INFO L290 TraceCheckUtils]: 121: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,336 INFO L290 TraceCheckUtils]: 122: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,336 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {22628#true} {23000#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #50#return; {23000#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:02:50,337 INFO L290 TraceCheckUtils]: 124: Hoare triple {23000#(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; {23022#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-27 12:02:50,337 INFO L290 TraceCheckUtils]: 125: Hoare triple {23022#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !false; {23022#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-27 12:02:50,337 INFO L272 TraceCheckUtils]: 126: Hoare triple {23022#(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)); {22628#true} is VALID [2022-04-27 12:02:50,337 INFO L290 TraceCheckUtils]: 127: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,337 INFO L290 TraceCheckUtils]: 128: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,337 INFO L290 TraceCheckUtils]: 129: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,338 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {22628#true} {23022#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} #50#return; {23022#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-27 12:02:50,338 INFO L290 TraceCheckUtils]: 131: Hoare triple {23022#(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; {23044#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:02:50,338 INFO L290 TraceCheckUtils]: 132: Hoare triple {23044#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {23044#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:02:50,338 INFO L272 TraceCheckUtils]: 133: Hoare triple {23044#(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)); {22628#true} is VALID [2022-04-27 12:02:50,338 INFO L290 TraceCheckUtils]: 134: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,338 INFO L290 TraceCheckUtils]: 135: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,339 INFO L290 TraceCheckUtils]: 136: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,339 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {22628#true} {23044#(and (= main_~c~0 18) (= main_~y~0 18))} #50#return; {23044#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-27 12:02:50,339 INFO L290 TraceCheckUtils]: 138: Hoare triple {23044#(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; {23066#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 12:02:50,340 INFO L290 TraceCheckUtils]: 139: Hoare triple {23066#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} assume !false; {23066#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 12:02:50,340 INFO L272 TraceCheckUtils]: 140: Hoare triple {23066#(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)); {22628#true} is VALID [2022-04-27 12:02:50,340 INFO L290 TraceCheckUtils]: 141: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,340 INFO L290 TraceCheckUtils]: 142: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,340 INFO L290 TraceCheckUtils]: 143: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,340 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {22628#true} {23066#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} #50#return; {23066#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-27 12:02:50,341 INFO L290 TraceCheckUtils]: 145: Hoare triple {23066#(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; {23088#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-27 12:02:50,341 INFO L290 TraceCheckUtils]: 146: Hoare triple {23088#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} assume !false; {23088#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-27 12:02:50,341 INFO L272 TraceCheckUtils]: 147: Hoare triple {23088#(and (= (+ (- 2) main_~y~0) 18) (= 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)); {22628#true} is VALID [2022-04-27 12:02:50,341 INFO L290 TraceCheckUtils]: 148: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,341 INFO L290 TraceCheckUtils]: 149: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,341 INFO L290 TraceCheckUtils]: 150: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,342 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {22628#true} {23088#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} #50#return; {23088#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-27 12:02:50,342 INFO L290 TraceCheckUtils]: 152: Hoare triple {23088#(and (= (+ (- 2) main_~y~0) 18) (= 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; {23110#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 12:02:50,342 INFO L290 TraceCheckUtils]: 153: Hoare triple {23110#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {23110#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 12:02:50,343 INFO L272 TraceCheckUtils]: 154: Hoare triple {23110#(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)); {22628#true} is VALID [2022-04-27 12:02:50,343 INFO L290 TraceCheckUtils]: 155: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,343 INFO L290 TraceCheckUtils]: 156: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,343 INFO L290 TraceCheckUtils]: 157: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,343 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {22628#true} {23110#(and (= main_~c~0 21) (= main_~y~0 21))} #50#return; {23110#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 12:02:50,344 INFO L290 TraceCheckUtils]: 159: Hoare triple {23110#(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; {23132#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-27 12:02:50,344 INFO L290 TraceCheckUtils]: 160: Hoare triple {23132#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} assume !false; {23132#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-27 12:02:50,344 INFO L272 TraceCheckUtils]: 161: Hoare triple {23132#(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)); {22628#true} is VALID [2022-04-27 12:02:50,344 INFO L290 TraceCheckUtils]: 162: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,344 INFO L290 TraceCheckUtils]: 163: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,344 INFO L290 TraceCheckUtils]: 164: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,345 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {22628#true} {23132#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} #50#return; {23132#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-27 12:02:50,345 INFO L290 TraceCheckUtils]: 166: Hoare triple {23132#(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; {23154#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-27 12:02:50,345 INFO L290 TraceCheckUtils]: 167: Hoare triple {23154#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {23154#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-27 12:02:50,345 INFO L272 TraceCheckUtils]: 168: Hoare triple {23154#(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)); {22628#true} is VALID [2022-04-27 12:02:50,345 INFO L290 TraceCheckUtils]: 169: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,345 INFO L290 TraceCheckUtils]: 170: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,346 INFO L290 TraceCheckUtils]: 171: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,346 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {22628#true} {23154#(and (= 23 main_~y~0) (= 23 main_~c~0))} #50#return; {23154#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-27 12:02:50,346 INFO L290 TraceCheckUtils]: 173: Hoare triple {23154#(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; {23176#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 12:02:50,347 INFO L290 TraceCheckUtils]: 174: Hoare triple {23176#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {23176#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 12:02:50,347 INFO L272 TraceCheckUtils]: 175: Hoare triple {23176#(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)); {22628#true} is VALID [2022-04-27 12:02:50,347 INFO L290 TraceCheckUtils]: 176: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,347 INFO L290 TraceCheckUtils]: 177: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,347 INFO L290 TraceCheckUtils]: 178: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,359 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {22628#true} {23176#(and (= main_~c~0 24) (= main_~y~0 24))} #50#return; {23176#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 12:02:50,359 INFO L290 TraceCheckUtils]: 180: Hoare triple {23176#(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; {23198#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 12:02:50,360 INFO L290 TraceCheckUtils]: 181: Hoare triple {23198#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !false; {23198#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 12:02:50,360 INFO L272 TraceCheckUtils]: 182: Hoare triple {23198#(and (= main_~c~0 25) (= (+ (- 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)); {22628#true} is VALID [2022-04-27 12:02:50,360 INFO L290 TraceCheckUtils]: 183: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,360 INFO L290 TraceCheckUtils]: 184: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,360 INFO L290 TraceCheckUtils]: 185: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,360 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {22628#true} {23198#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} #50#return; {23198#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 12:02:50,361 INFO L290 TraceCheckUtils]: 187: Hoare triple {23198#(and (= main_~c~0 25) (= (+ (- 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; {23220#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-27 12:02:50,361 INFO L290 TraceCheckUtils]: 188: Hoare triple {23220#(and (= main_~c~0 26) (= main_~y~0 26))} assume !false; {23220#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-27 12:02:50,361 INFO L272 TraceCheckUtils]: 189: Hoare triple {23220#(and (= main_~c~0 26) (= 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)); {22628#true} is VALID [2022-04-27 12:02:50,361 INFO L290 TraceCheckUtils]: 190: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,361 INFO L290 TraceCheckUtils]: 191: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,361 INFO L290 TraceCheckUtils]: 192: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,362 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {22628#true} {23220#(and (= main_~c~0 26) (= main_~y~0 26))} #50#return; {23220#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-27 12:02:50,362 INFO L290 TraceCheckUtils]: 194: Hoare triple {23220#(and (= main_~c~0 26) (= 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; {23242#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-27 12:02:50,363 INFO L290 TraceCheckUtils]: 195: Hoare triple {23242#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} assume !false; {23242#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-27 12:02:50,363 INFO L272 TraceCheckUtils]: 196: Hoare triple {23242#(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)); {22628#true} is VALID [2022-04-27 12:02:50,363 INFO L290 TraceCheckUtils]: 197: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,363 INFO L290 TraceCheckUtils]: 198: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,363 INFO L290 TraceCheckUtils]: 199: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,363 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {22628#true} {23242#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} #50#return; {23242#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-27 12:02:50,364 INFO L290 TraceCheckUtils]: 201: Hoare triple {23242#(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; {23264#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-27 12:02:50,364 INFO L290 TraceCheckUtils]: 202: Hoare triple {23264#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} assume !false; {23264#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-27 12:02:50,364 INFO L272 TraceCheckUtils]: 203: Hoare triple {23264#(and (<= main_~c~0 28) (< 27 main_~k~0) (= 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)); {22628#true} is VALID [2022-04-27 12:02:50,364 INFO L290 TraceCheckUtils]: 204: Hoare triple {22628#true} ~cond := #in~cond; {22628#true} is VALID [2022-04-27 12:02:50,365 INFO L290 TraceCheckUtils]: 205: Hoare triple {22628#true} assume !(0 == ~cond); {22628#true} is VALID [2022-04-27 12:02:50,365 INFO L290 TraceCheckUtils]: 206: Hoare triple {22628#true} assume true; {22628#true} is VALID [2022-04-27 12:02:50,365 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {22628#true} {23264#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} #50#return; {23264#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-27 12:02:50,366 INFO L290 TraceCheckUtils]: 208: Hoare triple {23264#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} assume !(~c~0 < ~k~0); {23286#(and (<= main_~k~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-27 12:02:50,366 INFO L272 TraceCheckUtils]: 209: Hoare triple {23286#(and (<= main_~k~0 28) (< 27 main_~k~0) (= main_~y~0 28))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23290#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:02:50,367 INFO L290 TraceCheckUtils]: 210: Hoare triple {23290#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23294#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:02:50,367 INFO L290 TraceCheckUtils]: 211: Hoare triple {23294#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22629#false} is VALID [2022-04-27 12:02:50,367 INFO L290 TraceCheckUtils]: 212: Hoare triple {22629#false} assume !false; {22629#false} is VALID [2022-04-27 12:02:50,368 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 12:02:50,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:02:50,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:02:50,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164521979] [2022-04-27 12:02:50,969 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:02:50,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765259402] [2022-04-27 12:02:50,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765259402] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:02:50,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:02:50,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2022-04-27 12:02:50,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578540877] [2022-04-27 12:02:50,969 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:02:50,969 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 31 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Word has length 213 [2022-04-27 12:02:50,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:02:50,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 31 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:02:51,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:02:51,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-27 12:02:51,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:02:51,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-27 12:02:51,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 12:02:51,236 INFO L87 Difference]: Start difference. First operand 106 states and 133 transitions. Second operand has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 31 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:03:07,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:03:07,503 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2022-04-27 12:03:07,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-27 12:03:07,503 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 31 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Word has length 213 [2022-04-27 12:03:07,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:03:07,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 31 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:03:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 138 transitions. [2022-04-27 12:03:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 31 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:03:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 138 transitions. [2022-04-27 12:03:07,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 138 transitions. [2022-04-27 12:03:08,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:03:08,114 INFO L225 Difference]: With dead ends: 114 [2022-04-27 12:03:08,114 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 12:03:08,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2022-04-27 12:03:08,115 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 2827 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 2827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:03:08,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1407 Invalid, 2827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2827 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-04-27 12:03:08,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 12:03:08,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-27 12:03:08,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:03:08,204 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), 33 states have call successors, (33), 5 states have call predecessors, (33), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 12:03:08,204 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), 33 states have call successors, (33), 5 states have call predecessors, (33), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 12:03:08,205 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), 33 states have call successors, (33), 5 states have call predecessors, (33), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 12:03:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:03:08,206 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2022-04-27 12:03:08,207 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2022-04-27 12:03:08,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:03:08,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:03:08,207 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), 33 states have call successors, (33), 5 states have call predecessors, (33), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 109 states. [2022-04-27 12:03:08,207 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), 33 states have call successors, (33), 5 states have call predecessors, (33), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 109 states. [2022-04-27 12:03:08,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:03:08,209 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2022-04-27 12:03:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2022-04-27 12:03:08,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:03:08,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:03:08,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:03:08,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:03:08,210 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), 33 states have call successors, (33), 5 states have call predecessors, (33), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 12:03:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 137 transitions. [2022-04-27 12:03:08,212 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 137 transitions. Word has length 213 [2022-04-27 12:03:08,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:03:08,212 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 137 transitions. [2022-04-27 12:03:08,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 31 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:03:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2022-04-27 12:03:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-04-27 12:03:08,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:03:08,213 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:03:08,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-27 12:03:08,413 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 12:03:08,414 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:03:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:03:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1612769317, now seen corresponding path program 29 times [2022-04-27 12:03:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:03:08,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439497619] [2022-04-27 12:03:08,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:03:08,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:03:08,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:03:08,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [554560561] [2022-04-27 12:03:08,428 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 12:03:08,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:03:08,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:03:08,429 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 12:03:08,430 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 12:08:22,483 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2022-04-27 12:08:22,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:08:22,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 125 conjunts are in the unsatisfiable core [2022-04-27 12:08:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:08:22,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:08:24,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {23925#true} call ULTIMATE.init(); {23925#true} is VALID [2022-04-27 12:08:24,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {23925#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); {23925#true} is VALID [2022-04-27 12:08:24,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23925#true} {23925#true} #56#return; {23925#true} is VALID [2022-04-27 12:08:24,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {23925#true} call #t~ret5 := main(); {23925#true} is VALID [2022-04-27 12:08:24,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {23925#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {23945#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:24,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {23945#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {23945#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:24,413 INFO L272 TraceCheckUtils]: 7: Hoare triple {23945#(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)); {23925#true} is VALID [2022-04-27 12:08:24,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,413 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {23925#true} {23945#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {23945#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:24,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {23945#(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; {23967#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:08:24,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {23967#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {23967#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:08:24,414 INFO L272 TraceCheckUtils]: 14: Hoare triple {23967#(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)); {23925#true} is VALID [2022-04-27 12:08:24,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,415 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23925#true} {23967#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {23967#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:08:24,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {23967#(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; {23989#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 12:08:24,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {23989#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {23989#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 12:08:24,415 INFO L272 TraceCheckUtils]: 21: Hoare triple {23989#(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)); {23925#true} is VALID [2022-04-27 12:08:24,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,416 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {23925#true} {23989#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {23989#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 12:08:24,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {23989#(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; {24011#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:08:24,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {24011#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {24011#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:08:24,417 INFO L272 TraceCheckUtils]: 28: Hoare triple {24011#(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)); {23925#true} is VALID [2022-04-27 12:08:24,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,417 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23925#true} {24011#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #50#return; {24011#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:08:24,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {24011#(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; {24033#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:08:24,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {24033#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {24033#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:08:24,418 INFO L272 TraceCheckUtils]: 35: Hoare triple {24033#(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)); {23925#true} is VALID [2022-04-27 12:08:24,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,419 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23925#true} {24033#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #50#return; {24033#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:08:24,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {24033#(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; {24055#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {24055#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 4 main_~k~0))} assume !false; {24055#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,419 INFO L272 TraceCheckUtils]: 42: Hoare triple {24055#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,420 INFO L290 TraceCheckUtils]: 44: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,420 INFO L290 TraceCheckUtils]: 45: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,420 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {23925#true} {24055#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 4 main_~k~0))} #50#return; {24055#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,420 INFO L290 TraceCheckUtils]: 47: Hoare triple {24055#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 4 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; {24077#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {24077#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3) (< 4 main_~k~0))} assume !false; {24077#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,421 INFO L272 TraceCheckUtils]: 49: Hoare triple {24077#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 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)); {23925#true} is VALID [2022-04-27 12:08:24,421 INFO L290 TraceCheckUtils]: 50: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,421 INFO L290 TraceCheckUtils]: 51: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,421 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {23925#true} {24077#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3) (< 4 main_~k~0))} #50#return; {24077#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,422 INFO L290 TraceCheckUtils]: 54: Hoare triple {24077#(and (= main_~c~0 6) (= (+ main_~y~0 (- 3)) 3) (< 4 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; {24099#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 4)) 3) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,422 INFO L290 TraceCheckUtils]: 55: Hoare triple {24099#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 4)) 3) (< 4 main_~k~0))} assume !false; {24099#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 4)) 3) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,422 INFO L272 TraceCheckUtils]: 56: Hoare triple {24099#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 4)) 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)); {23925#true} is VALID [2022-04-27 12:08:24,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,422 INFO L290 TraceCheckUtils]: 58: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,423 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {23925#true} {24099#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 4)) 3) (< 4 main_~k~0))} #50#return; {24099#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 4)) 3) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {24099#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 4)) 3) (< 4 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; {24121#(and (= main_~y~0 8) (= main_~c~0 8) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,424 INFO L290 TraceCheckUtils]: 62: Hoare triple {24121#(and (= main_~y~0 8) (= main_~c~0 8) (< 4 main_~k~0))} assume !false; {24121#(and (= main_~y~0 8) (= main_~c~0 8) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,424 INFO L272 TraceCheckUtils]: 63: Hoare triple {24121#(and (= main_~y~0 8) (= main_~c~0 8) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,424 INFO L290 TraceCheckUtils]: 64: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,424 INFO L290 TraceCheckUtils]: 65: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,424 INFO L290 TraceCheckUtils]: 66: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,424 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {23925#true} {24121#(and (= main_~y~0 8) (= main_~c~0 8) (< 4 main_~k~0))} #50#return; {24121#(and (= main_~y~0 8) (= main_~c~0 8) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,425 INFO L290 TraceCheckUtils]: 68: Hoare triple {24121#(and (= main_~y~0 8) (= main_~c~0 8) (< 4 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; {24143#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,425 INFO L290 TraceCheckUtils]: 69: Hoare triple {24143#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 4 main_~k~0))} assume !false; {24143#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,425 INFO L272 TraceCheckUtils]: 70: Hoare triple {24143#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,425 INFO L290 TraceCheckUtils]: 71: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,425 INFO L290 TraceCheckUtils]: 72: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,425 INFO L290 TraceCheckUtils]: 73: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,426 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23925#true} {24143#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 4 main_~k~0))} #50#return; {24143#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,426 INFO L290 TraceCheckUtils]: 75: Hoare triple {24143#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 4 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; {24165#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,427 INFO L290 TraceCheckUtils]: 76: Hoare triple {24165#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)) (< 4 main_~k~0))} assume !false; {24165#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,427 INFO L272 TraceCheckUtils]: 77: Hoare triple {24165#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,427 INFO L290 TraceCheckUtils]: 78: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,427 INFO L290 TraceCheckUtils]: 79: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,427 INFO L290 TraceCheckUtils]: 80: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,427 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {23925#true} {24165#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)) (< 4 main_~k~0))} #50#return; {24165#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,428 INFO L290 TraceCheckUtils]: 82: Hoare triple {24165#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)) (< 4 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; {24187#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,428 INFO L290 TraceCheckUtils]: 83: Hoare triple {24187#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10) (< 4 main_~k~0))} assume !false; {24187#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,428 INFO L272 TraceCheckUtils]: 84: Hoare triple {24187#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,428 INFO L290 TraceCheckUtils]: 85: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,428 INFO L290 TraceCheckUtils]: 86: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,428 INFO L290 TraceCheckUtils]: 87: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,429 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {23925#true} {24187#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10) (< 4 main_~k~0))} #50#return; {24187#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,429 INFO L290 TraceCheckUtils]: 89: Hoare triple {24187#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10) (< 4 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; {24209#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,429 INFO L290 TraceCheckUtils]: 90: Hoare triple {24209#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12) (< 4 main_~k~0))} assume !false; {24209#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,429 INFO L272 TraceCheckUtils]: 91: Hoare triple {24209#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,429 INFO L290 TraceCheckUtils]: 92: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,429 INFO L290 TraceCheckUtils]: 93: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,430 INFO L290 TraceCheckUtils]: 94: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,430 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {23925#true} {24209#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12) (< 4 main_~k~0))} #50#return; {24209#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,430 INFO L290 TraceCheckUtils]: 96: Hoare triple {24209#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12) (< 4 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; {24231#(and (= (+ (- 1) main_~c~0) 12) (< 4 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-27 12:08:24,431 INFO L290 TraceCheckUtils]: 97: Hoare triple {24231#(and (= (+ (- 1) main_~c~0) 12) (< 4 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} assume !false; {24231#(and (= (+ (- 1) main_~c~0) 12) (< 4 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-27 12:08:24,431 INFO L272 TraceCheckUtils]: 98: Hoare triple {24231#(and (= (+ (- 1) main_~c~0) 12) (< 4 main_~k~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)); {23925#true} is VALID [2022-04-27 12:08:24,431 INFO L290 TraceCheckUtils]: 99: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,431 INFO L290 TraceCheckUtils]: 100: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,431 INFO L290 TraceCheckUtils]: 101: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,431 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {23925#true} {24231#(and (= (+ (- 1) main_~c~0) 12) (< 4 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} #50#return; {24231#(and (= (+ (- 1) main_~c~0) 12) (< 4 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-27 12:08:24,432 INFO L290 TraceCheckUtils]: 103: Hoare triple {24231#(and (= (+ (- 1) main_~c~0) 12) (< 4 main_~k~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; {24253#(and (= main_~y~0 14) (= main_~c~0 14) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,432 INFO L290 TraceCheckUtils]: 104: Hoare triple {24253#(and (= main_~y~0 14) (= main_~c~0 14) (< 4 main_~k~0))} assume !false; {24253#(and (= main_~y~0 14) (= main_~c~0 14) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,432 INFO L272 TraceCheckUtils]: 105: Hoare triple {24253#(and (= main_~y~0 14) (= main_~c~0 14) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,432 INFO L290 TraceCheckUtils]: 106: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,432 INFO L290 TraceCheckUtils]: 107: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,432 INFO L290 TraceCheckUtils]: 108: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,433 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {23925#true} {24253#(and (= main_~y~0 14) (= main_~c~0 14) (< 4 main_~k~0))} #50#return; {24253#(and (= main_~y~0 14) (= main_~c~0 14) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,433 INFO L290 TraceCheckUtils]: 110: Hoare triple {24253#(and (= main_~y~0 14) (= main_~c~0 14) (< 4 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; {24275#(and (= main_~c~0 15) (= main_~y~0 15) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,434 INFO L290 TraceCheckUtils]: 111: Hoare triple {24275#(and (= main_~c~0 15) (= main_~y~0 15) (< 4 main_~k~0))} assume !false; {24275#(and (= main_~c~0 15) (= main_~y~0 15) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,434 INFO L272 TraceCheckUtils]: 112: Hoare triple {24275#(and (= main_~c~0 15) (= main_~y~0 15) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,434 INFO L290 TraceCheckUtils]: 113: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,434 INFO L290 TraceCheckUtils]: 114: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,434 INFO L290 TraceCheckUtils]: 115: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,434 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {23925#true} {24275#(and (= main_~c~0 15) (= main_~y~0 15) (< 4 main_~k~0))} #50#return; {24275#(and (= main_~c~0 15) (= main_~y~0 15) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,435 INFO L290 TraceCheckUtils]: 117: Hoare triple {24275#(and (= main_~c~0 15) (= main_~y~0 15) (< 4 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; {24297#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,435 INFO L290 TraceCheckUtils]: 118: Hoare triple {24297#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 4 main_~k~0))} assume !false; {24297#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,435 INFO L272 TraceCheckUtils]: 119: Hoare triple {24297#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,435 INFO L290 TraceCheckUtils]: 120: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,435 INFO L290 TraceCheckUtils]: 121: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,435 INFO L290 TraceCheckUtils]: 122: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,436 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {23925#true} {24297#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 4 main_~k~0))} #50#return; {24297#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,436 INFO L290 TraceCheckUtils]: 124: Hoare triple {24297#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 4 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; {24319#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,436 INFO L290 TraceCheckUtils]: 125: Hoare triple {24319#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 4 main_~k~0))} assume !false; {24319#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,436 INFO L272 TraceCheckUtils]: 126: Hoare triple {24319#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,437 INFO L290 TraceCheckUtils]: 127: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,437 INFO L290 TraceCheckUtils]: 128: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,437 INFO L290 TraceCheckUtils]: 129: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,437 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {23925#true} {24319#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 4 main_~k~0))} #50#return; {24319#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,437 INFO L290 TraceCheckUtils]: 131: Hoare triple {24319#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 4 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; {24341#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,438 INFO L290 TraceCheckUtils]: 132: Hoare triple {24341#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17) (< 4 main_~k~0))} assume !false; {24341#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,438 INFO L272 TraceCheckUtils]: 133: Hoare triple {24341#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,438 INFO L290 TraceCheckUtils]: 134: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,438 INFO L290 TraceCheckUtils]: 135: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,438 INFO L290 TraceCheckUtils]: 136: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,439 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {23925#true} {24341#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17) (< 4 main_~k~0))} #50#return; {24341#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,439 INFO L290 TraceCheckUtils]: 138: Hoare triple {24341#(and (= (+ main_~y~0 (- 3)) 15) (= (+ (- 1) main_~c~0) 17) (< 4 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; {24363#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,439 INFO L290 TraceCheckUtils]: 139: Hoare triple {24363#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0) (< 4 main_~k~0))} assume !false; {24363#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,439 INFO L272 TraceCheckUtils]: 140: Hoare triple {24363#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,439 INFO L290 TraceCheckUtils]: 141: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,439 INFO L290 TraceCheckUtils]: 142: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,440 INFO L290 TraceCheckUtils]: 143: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,440 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {23925#true} {24363#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0) (< 4 main_~k~0))} #50#return; {24363#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,440 INFO L290 TraceCheckUtils]: 145: Hoare triple {24363#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0) (< 4 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; {24385#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,441 INFO L290 TraceCheckUtils]: 146: Hoare triple {24385#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17) (< 4 main_~k~0))} assume !false; {24385#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,441 INFO L272 TraceCheckUtils]: 147: Hoare triple {24385#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,441 INFO L290 TraceCheckUtils]: 148: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,441 INFO L290 TraceCheckUtils]: 149: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,441 INFO L290 TraceCheckUtils]: 150: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,441 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {23925#true} {24385#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17) (< 4 main_~k~0))} #50#return; {24385#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,442 INFO L290 TraceCheckUtils]: 152: Hoare triple {24385#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17) (< 4 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; {24407#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,442 INFO L290 TraceCheckUtils]: 153: Hoare triple {24407#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21) (< 4 main_~k~0))} assume !false; {24407#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,442 INFO L272 TraceCheckUtils]: 154: Hoare triple {24407#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,442 INFO L290 TraceCheckUtils]: 155: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,442 INFO L290 TraceCheckUtils]: 156: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,442 INFO L290 TraceCheckUtils]: 157: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,443 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {23925#true} {24407#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21) (< 4 main_~k~0))} #50#return; {24407#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,443 INFO L290 TraceCheckUtils]: 159: Hoare triple {24407#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21) (< 4 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; {24429#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,444 INFO L290 TraceCheckUtils]: 160: Hoare triple {24429#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 4 main_~k~0))} assume !false; {24429#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,444 INFO L272 TraceCheckUtils]: 161: Hoare triple {24429#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,444 INFO L290 TraceCheckUtils]: 162: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,444 INFO L290 TraceCheckUtils]: 163: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,444 INFO L290 TraceCheckUtils]: 164: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,444 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {23925#true} {24429#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 4 main_~k~0))} #50#return; {24429#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,445 INFO L290 TraceCheckUtils]: 166: Hoare triple {24429#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22) (< 4 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; {24451#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,445 INFO L290 TraceCheckUtils]: 167: Hoare triple {24451#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0) (< 4 main_~k~0))} assume !false; {24451#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,445 INFO L272 TraceCheckUtils]: 168: Hoare triple {24451#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,445 INFO L290 TraceCheckUtils]: 169: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,445 INFO L290 TraceCheckUtils]: 170: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,445 INFO L290 TraceCheckUtils]: 171: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,446 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {23925#true} {24451#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0) (< 4 main_~k~0))} #50#return; {24451#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,446 INFO L290 TraceCheckUtils]: 173: Hoare triple {24451#(and (= (+ (- 2) main_~y~0) 21) (= 23 main_~c~0) (< 4 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; {24473#(and (= (+ main_~y~0 (- 3)) 21) (= 23 (+ (- 1) main_~c~0)) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,446 INFO L290 TraceCheckUtils]: 174: Hoare triple {24473#(and (= (+ main_~y~0 (- 3)) 21) (= 23 (+ (- 1) main_~c~0)) (< 4 main_~k~0))} assume !false; {24473#(and (= (+ main_~y~0 (- 3)) 21) (= 23 (+ (- 1) main_~c~0)) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,446 INFO L272 TraceCheckUtils]: 175: Hoare triple {24473#(and (= (+ main_~y~0 (- 3)) 21) (= 23 (+ (- 1) main_~c~0)) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,447 INFO L290 TraceCheckUtils]: 176: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,447 INFO L290 TraceCheckUtils]: 177: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,447 INFO L290 TraceCheckUtils]: 178: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,447 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {23925#true} {24473#(and (= (+ main_~y~0 (- 3)) 21) (= 23 (+ (- 1) main_~c~0)) (< 4 main_~k~0))} #50#return; {24473#(and (= (+ main_~y~0 (- 3)) 21) (= 23 (+ (- 1) main_~c~0)) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,447 INFO L290 TraceCheckUtils]: 180: Hoare triple {24473#(and (= (+ main_~y~0 (- 3)) 21) (= 23 (+ (- 1) main_~c~0)) (< 4 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; {24495#(and (= main_~y~0 25) (= main_~c~0 25) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,448 INFO L290 TraceCheckUtils]: 181: Hoare triple {24495#(and (= main_~y~0 25) (= main_~c~0 25) (< 4 main_~k~0))} assume !false; {24495#(and (= main_~y~0 25) (= main_~c~0 25) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,448 INFO L272 TraceCheckUtils]: 182: Hoare triple {24495#(and (= main_~y~0 25) (= main_~c~0 25) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,448 INFO L290 TraceCheckUtils]: 183: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,448 INFO L290 TraceCheckUtils]: 184: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,448 INFO L290 TraceCheckUtils]: 185: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,448 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {23925#true} {24495#(and (= main_~y~0 25) (= main_~c~0 25) (< 4 main_~k~0))} #50#return; {24495#(and (= main_~y~0 25) (= main_~c~0 25) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,449 INFO L290 TraceCheckUtils]: 187: Hoare triple {24495#(and (= main_~y~0 25) (= main_~c~0 25) (< 4 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; {24517#(and (= main_~c~0 26) (< 4 main_~k~0) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-27 12:08:24,449 INFO L290 TraceCheckUtils]: 188: Hoare triple {24517#(and (= main_~c~0 26) (< 4 main_~k~0) (= (+ (- 1) main_~y~0) 25))} assume !false; {24517#(and (= main_~c~0 26) (< 4 main_~k~0) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-27 12:08:24,449 INFO L272 TraceCheckUtils]: 189: Hoare triple {24517#(and (= main_~c~0 26) (< 4 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)); {23925#true} is VALID [2022-04-27 12:08:24,449 INFO L290 TraceCheckUtils]: 190: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,449 INFO L290 TraceCheckUtils]: 191: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,449 INFO L290 TraceCheckUtils]: 192: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,450 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {23925#true} {24517#(and (= main_~c~0 26) (< 4 main_~k~0) (= (+ (- 1) main_~y~0) 25))} #50#return; {24517#(and (= main_~c~0 26) (< 4 main_~k~0) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-27 12:08:24,450 INFO L290 TraceCheckUtils]: 194: Hoare triple {24517#(and (= main_~c~0 26) (< 4 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; {24539#(and (= main_~y~0 27) (= main_~c~0 27) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,451 INFO L290 TraceCheckUtils]: 195: Hoare triple {24539#(and (= main_~y~0 27) (= main_~c~0 27) (< 4 main_~k~0))} assume !false; {24539#(and (= main_~y~0 27) (= main_~c~0 27) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,451 INFO L272 TraceCheckUtils]: 196: Hoare triple {24539#(and (= main_~y~0 27) (= main_~c~0 27) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,451 INFO L290 TraceCheckUtils]: 197: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,451 INFO L290 TraceCheckUtils]: 198: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,451 INFO L290 TraceCheckUtils]: 199: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,451 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {23925#true} {24539#(and (= main_~y~0 27) (= main_~c~0 27) (< 4 main_~k~0))} #50#return; {24539#(and (= main_~y~0 27) (= main_~c~0 27) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,452 INFO L290 TraceCheckUtils]: 201: Hoare triple {24539#(and (= main_~y~0 27) (= main_~c~0 27) (< 4 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; {24561#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,452 INFO L290 TraceCheckUtils]: 202: Hoare triple {24561#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27) (< 4 main_~k~0))} assume !false; {24561#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,452 INFO L272 TraceCheckUtils]: 203: Hoare triple {24561#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27) (< 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)); {23925#true} is VALID [2022-04-27 12:08:24,452 INFO L290 TraceCheckUtils]: 204: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,452 INFO L290 TraceCheckUtils]: 205: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,452 INFO L290 TraceCheckUtils]: 206: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,453 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {23925#true} {24561#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27) (< 4 main_~k~0))} #50#return; {24561#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27) (< 4 main_~k~0))} is VALID [2022-04-27 12:08:24,453 INFO L290 TraceCheckUtils]: 208: Hoare triple {24561#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27) (< 4 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; {24583#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} is VALID [2022-04-27 12:08:24,454 INFO L290 TraceCheckUtils]: 209: Hoare triple {24583#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} assume !false; {24583#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} is VALID [2022-04-27 12:08:24,454 INFO L272 TraceCheckUtils]: 210: Hoare triple {24583#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= 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)); {23925#true} is VALID [2022-04-27 12:08:24,454 INFO L290 TraceCheckUtils]: 211: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-27 12:08:24,454 INFO L290 TraceCheckUtils]: 212: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-27 12:08:24,454 INFO L290 TraceCheckUtils]: 213: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-27 12:08:24,454 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {23925#true} {24583#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} #50#return; {24583#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} is VALID [2022-04-27 12:08:24,457 INFO L290 TraceCheckUtils]: 215: Hoare triple {24583#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} assume !(~c~0 < ~k~0); {24605#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~k~0 29))} is VALID [2022-04-27 12:08:24,458 INFO L272 TraceCheckUtils]: 216: Hoare triple {24605#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~k~0 29))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24609#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:08:24,458 INFO L290 TraceCheckUtils]: 217: Hoare triple {24609#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24613#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:08:24,459 INFO L290 TraceCheckUtils]: 218: Hoare triple {24613#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23926#false} is VALID [2022-04-27 12:08:24,459 INFO L290 TraceCheckUtils]: 219: Hoare triple {23926#false} assume !false; {23926#false} is VALID [2022-04-27 12:08:24,460 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 12:08:24,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:08:28,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:08:28,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439497619] [2022-04-27 12:08:28,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:08:28,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554560561] [2022-04-27 12:08:28,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554560561] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:08:28,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:08:28,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2022-04-27 12:08:28,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74651948] [2022-04-27 12:08:28,532 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:08:28,533 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 32 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Word has length 220 [2022-04-27 12:08:28,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:08:28,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 32 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 12:08:28,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:08:28,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-27 12:08:28,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:08:28,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-27 12:08:28,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=853, Invalid=2929, Unknown=0, NotChecked=0, Total=3782 [2022-04-27 12:08:28,816 INFO L87 Difference]: Start difference. First operand 109 states and 137 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 32 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 12:08:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:44,013 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2022-04-27 12:08:44,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-27 12:08:44,013 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 32 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Word has length 220 [2022-04-27 12:08:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:08:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 32 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 12:08:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 142 transitions. [2022-04-27 12:08:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 32 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 12:08:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 142 transitions. [2022-04-27 12:08:44,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 142 transitions. [2022-04-27 12:08:44,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:08:44,527 INFO L225 Difference]: With dead ends: 117 [2022-04-27 12:08:44,527 INFO L226 Difference]: Without dead ends: 112 [2022-04-27 12:08:44,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=863, Invalid=3169, Unknown=0, NotChecked=0, Total=4032 [2022-04-27 12:08:44,528 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 3014 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-27 12:08:44,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1484 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3014 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-04-27 12:08:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-27 12:08:44,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-04-27 12:08:44,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:08:44,645 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), 34 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 12:08:44,656 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), 34 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 12:08:44,656 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), 34 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 12:08:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:44,663 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2022-04-27 12:08:44,663 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2022-04-27 12:08:44,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:44,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:44,663 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), 34 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 112 states. [2022-04-27 12:08:44,664 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), 34 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 112 states. [2022-04-27 12:08:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:44,666 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2022-04-27 12:08:44,666 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2022-04-27 12:08:44,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:44,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:44,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:08:44,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:08:44,666 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), 34 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 12:08:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 141 transitions. [2022-04-27 12:08:44,669 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 141 transitions. Word has length 220 [2022-04-27 12:08:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:08:44,669 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 141 transitions. [2022-04-27 12:08:44,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 32 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 12:08:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2022-04-27 12:08:44,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-04-27 12:08:44,676 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:08:44,676 INFO L195 NwaCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:08:44,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-27 12:08:44,876 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 12:08:44,876 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:08:44,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:08:44,877 INFO L85 PathProgramCache]: Analyzing trace with hash -21371054, now seen corresponding path program 30 times [2022-04-27 12:08:44,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:08:44,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198734459] [2022-04-27 12:08:44,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:08:44,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:08:44,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:08:44,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703816618] [2022-04-27 12:08:44,892 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 12:08:44,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:08:44,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:08:44,903 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 12:08:44,939 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 12:08:55,105 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-27 12:08:55,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:08:55,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 129 conjunts are in the unsatisfiable core [2022-04-27 12:08:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:08:55,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:08:56,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {25788#true} call ULTIMATE.init(); {25788#true} is VALID [2022-04-27 12:08:56,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {25788#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); {25788#true} is VALID [2022-04-27 12:08:56,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25788#true} {25788#true} #56#return; {25788#true} is VALID [2022-04-27 12:08:56,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {25788#true} call #t~ret5 := main(); {25788#true} is VALID [2022-04-27 12:08:56,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {25788#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {25808#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:56,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {25808#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {25808#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:56,902 INFO L272 TraceCheckUtils]: 7: Hoare triple {25808#(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)); {25788#true} is VALID [2022-04-27 12:08:56,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,902 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {25788#true} {25808#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {25808#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:56,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {25808#(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; {25830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 12:08:56,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {25830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {25830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 12:08:56,903 INFO L272 TraceCheckUtils]: 14: Hoare triple {25830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< 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)); {25788#true} is VALID [2022-04-27 12:08:56,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,904 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25788#true} {25830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #50#return; {25830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 12:08:56,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {25830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< 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; {25852#(and (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:08:56,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {25852#(and (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !false; {25852#(and (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:08:56,907 INFO L272 TraceCheckUtils]: 21: Hoare triple {25852#(and (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~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)); {25788#true} is VALID [2022-04-27 12:08:56,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,908 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25788#true} {25852#(and (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #50#return; {25852#(and (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:08:56,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {25852#(and (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~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; {25874#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 12:08:56,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {25874#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {25874#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 12:08:56,910 INFO L272 TraceCheckUtils]: 28: Hoare triple {25874#(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)); {25788#true} is VALID [2022-04-27 12:08:56,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,911 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25788#true} {25874#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #50#return; {25874#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 12:08:56,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {25874#(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; {25896#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {25896#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} assume !false; {25896#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,911 INFO L272 TraceCheckUtils]: 35: Hoare triple {25896#(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)); {25788#true} is VALID [2022-04-27 12:08:56,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,912 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {25788#true} {25896#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} #50#return; {25896#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {25896#(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; {25918#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {25918#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {25918#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,913 INFO L272 TraceCheckUtils]: 42: Hoare triple {25918#(and (= (+ (- 1) main_~c~0) 4) (= 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)); {25788#true} is VALID [2022-04-27 12:08:56,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,913 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {25788#true} {25918#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} #50#return; {25918#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,914 INFO L290 TraceCheckUtils]: 47: Hoare triple {25918#(and (= (+ (- 1) main_~c~0) 4) (= 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; {25940#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,914 INFO L290 TraceCheckUtils]: 48: Hoare triple {25940#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {25940#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,914 INFO L272 TraceCheckUtils]: 49: Hoare triple {25940#(and (= main_~y~0 6) (= 4 (+ (- 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)); {25788#true} is VALID [2022-04-27 12:08:56,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,914 INFO L290 TraceCheckUtils]: 51: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,914 INFO L290 TraceCheckUtils]: 52: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,915 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {25788#true} {25940#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #50#return; {25940#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {25940#(and (= main_~y~0 6) (= 4 (+ (- 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; {25962#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,916 INFO L290 TraceCheckUtils]: 55: Hoare triple {25962#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {25962#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,916 INFO L272 TraceCheckUtils]: 56: Hoare triple {25962#(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)); {25788#true} is VALID [2022-04-27 12:08:56,916 INFO L290 TraceCheckUtils]: 57: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,916 INFO L290 TraceCheckUtils]: 58: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,916 INFO L290 TraceCheckUtils]: 59: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,916 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25788#true} {25962#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #50#return; {25962#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,917 INFO L290 TraceCheckUtils]: 61: Hoare triple {25962#(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; {25984#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,917 INFO L290 TraceCheckUtils]: 62: Hoare triple {25984#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} assume !false; {25984#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,917 INFO L272 TraceCheckUtils]: 63: Hoare triple {25984#(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)); {25788#true} is VALID [2022-04-27 12:08:56,917 INFO L290 TraceCheckUtils]: 64: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,917 INFO L290 TraceCheckUtils]: 65: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,917 INFO L290 TraceCheckUtils]: 66: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,918 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {25788#true} {25984#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} #50#return; {25984#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,918 INFO L290 TraceCheckUtils]: 68: Hoare triple {25984#(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; {26006#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,919 INFO L290 TraceCheckUtils]: 69: Hoare triple {26006#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {26006#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,919 INFO L272 TraceCheckUtils]: 70: Hoare triple {26006#(and (= main_~y~0 9) (= 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)); {25788#true} is VALID [2022-04-27 12:08:56,919 INFO L290 TraceCheckUtils]: 71: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,919 INFO L290 TraceCheckUtils]: 72: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,919 INFO L290 TraceCheckUtils]: 73: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,919 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {25788#true} {26006#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} #50#return; {26006#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,920 INFO L290 TraceCheckUtils]: 75: Hoare triple {26006#(and (= main_~y~0 9) (= 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; {26028#(and (= 9 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-27 12:08:56,920 INFO L290 TraceCheckUtils]: 76: Hoare triple {26028#(and (= 9 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 10))} assume !false; {26028#(and (= 9 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-27 12:08:56,920 INFO L272 TraceCheckUtils]: 77: Hoare triple {26028#(and (= 9 (+ (- 1) main_~y~0)) (< 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)); {25788#true} is VALID [2022-04-27 12:08:56,920 INFO L290 TraceCheckUtils]: 78: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,920 INFO L290 TraceCheckUtils]: 79: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,920 INFO L290 TraceCheckUtils]: 80: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,921 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25788#true} {26028#(and (= 9 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 10))} #50#return; {26028#(and (= 9 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-27 12:08:56,921 INFO L290 TraceCheckUtils]: 82: Hoare triple {26028#(and (= 9 (+ (- 1) main_~y~0)) (< 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; {26050#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,921 INFO L290 TraceCheckUtils]: 83: Hoare triple {26050#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11) (< 0 main_~k~0))} assume !false; {26050#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,922 INFO L272 TraceCheckUtils]: 84: Hoare triple {26050#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11) (< 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)); {25788#true} is VALID [2022-04-27 12:08:56,922 INFO L290 TraceCheckUtils]: 85: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,922 INFO L290 TraceCheckUtils]: 86: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,922 INFO L290 TraceCheckUtils]: 87: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,922 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {25788#true} {26050#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11) (< 0 main_~k~0))} #50#return; {26050#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,923 INFO L290 TraceCheckUtils]: 89: Hoare triple {26050#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11) (< 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; {26072#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,923 INFO L290 TraceCheckUtils]: 90: Hoare triple {26072#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} assume !false; {26072#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,923 INFO L272 TraceCheckUtils]: 91: Hoare triple {26072#(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)); {25788#true} is VALID [2022-04-27 12:08:56,923 INFO L290 TraceCheckUtils]: 92: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,923 INFO L290 TraceCheckUtils]: 93: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,923 INFO L290 TraceCheckUtils]: 94: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,924 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {25788#true} {26072#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} #50#return; {26072#(and (= main_~y~0 12) (= main_~c~0 12) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,924 INFO L290 TraceCheckUtils]: 96: Hoare triple {26072#(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; {26094#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 12:08:56,924 INFO L290 TraceCheckUtils]: 97: Hoare triple {26094#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {26094#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 12:08:56,924 INFO L272 TraceCheckUtils]: 98: Hoare triple {26094#(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)); {25788#true} is VALID [2022-04-27 12:08:56,924 INFO L290 TraceCheckUtils]: 99: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,925 INFO L290 TraceCheckUtils]: 100: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,925 INFO L290 TraceCheckUtils]: 101: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,925 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {25788#true} {26094#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} #50#return; {26094#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-27 12:08:56,925 INFO L290 TraceCheckUtils]: 103: Hoare triple {26094#(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; {26116#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,926 INFO L290 TraceCheckUtils]: 104: Hoare triple {26116#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0))} assume !false; {26116#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,926 INFO L272 TraceCheckUtils]: 105: Hoare triple {26116#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 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)); {25788#true} is VALID [2022-04-27 12:08:56,926 INFO L290 TraceCheckUtils]: 106: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,926 INFO L290 TraceCheckUtils]: 107: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,926 INFO L290 TraceCheckUtils]: 108: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,926 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {25788#true} {26116#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0))} #50#return; {26116#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,927 INFO L290 TraceCheckUtils]: 110: Hoare triple {26116#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 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; {26138#(and (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:08:56,927 INFO L290 TraceCheckUtils]: 111: Hoare triple {26138#(and (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} assume !false; {26138#(and (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:08:56,927 INFO L272 TraceCheckUtils]: 112: Hoare triple {26138#(and (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)) (= 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)); {25788#true} is VALID [2022-04-27 12:08:56,927 INFO L290 TraceCheckUtils]: 113: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,927 INFO L290 TraceCheckUtils]: 114: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,927 INFO L290 TraceCheckUtils]: 115: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,928 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25788#true} {26138#(and (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} #50#return; {26138#(and (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:08:56,928 INFO L290 TraceCheckUtils]: 117: Hoare triple {26138#(and (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)) (= 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; {26160#(and (= (+ (- 2) main_~y~0) 14) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,929 INFO L290 TraceCheckUtils]: 118: Hoare triple {26160#(and (= (+ (- 2) main_~y~0) 14) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} assume !false; {26160#(and (= (+ (- 2) main_~y~0) 14) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,929 INFO L272 TraceCheckUtils]: 119: Hoare triple {26160#(and (= (+ (- 2) main_~y~0) 14) (= (+ main_~c~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)); {25788#true} is VALID [2022-04-27 12:08:56,929 INFO L290 TraceCheckUtils]: 120: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,929 INFO L290 TraceCheckUtils]: 121: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,929 INFO L290 TraceCheckUtils]: 122: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,929 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {25788#true} {26160#(and (= (+ (- 2) main_~y~0) 14) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} #50#return; {26160#(and (= (+ (- 2) main_~y~0) 14) (= (+ main_~c~0 (- 3)) 13) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,930 INFO L290 TraceCheckUtils]: 124: Hoare triple {26160#(and (= (+ (- 2) main_~y~0) 14) (= (+ main_~c~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; {26182#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 12:08:56,930 INFO L290 TraceCheckUtils]: 125: Hoare triple {26182#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !false; {26182#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 12:08:56,931 INFO L272 TraceCheckUtils]: 126: Hoare triple {26182#(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)); {25788#true} is VALID [2022-04-27 12:08:56,931 INFO L290 TraceCheckUtils]: 127: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,931 INFO L290 TraceCheckUtils]: 128: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,931 INFO L290 TraceCheckUtils]: 129: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,932 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25788#true} {26182#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} #50#return; {26182#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-27 12:08:56,932 INFO L290 TraceCheckUtils]: 131: Hoare triple {26182#(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; {26204#(and (= main_~c~0 18) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 12:08:56,933 INFO L290 TraceCheckUtils]: 132: Hoare triple {26204#(and (= main_~c~0 18) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 17))} assume !false; {26204#(and (= main_~c~0 18) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 12:08:56,933 INFO L272 TraceCheckUtils]: 133: Hoare triple {26204#(and (= main_~c~0 18) (< 0 main_~k~0) (= (+ (- 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)); {25788#true} is VALID [2022-04-27 12:08:56,933 INFO L290 TraceCheckUtils]: 134: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,933 INFO L290 TraceCheckUtils]: 135: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,933 INFO L290 TraceCheckUtils]: 136: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,933 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {25788#true} {26204#(and (= main_~c~0 18) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 17))} #50#return; {26204#(and (= main_~c~0 18) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 12:08:56,934 INFO L290 TraceCheckUtils]: 138: Hoare triple {26204#(and (= main_~c~0 18) (< 0 main_~k~0) (= (+ (- 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; {26226#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-27 12:08:56,934 INFO L290 TraceCheckUtils]: 139: Hoare triple {26226#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} assume !false; {26226#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-27 12:08:56,934 INFO L272 TraceCheckUtils]: 140: Hoare triple {26226#(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)); {25788#true} is VALID [2022-04-27 12:08:56,934 INFO L290 TraceCheckUtils]: 141: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,934 INFO L290 TraceCheckUtils]: 142: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,934 INFO L290 TraceCheckUtils]: 143: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,935 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {25788#true} {26226#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} #50#return; {26226#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-27 12:08:56,935 INFO L290 TraceCheckUtils]: 145: Hoare triple {26226#(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; {26248#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,935 INFO L290 TraceCheckUtils]: 146: Hoare triple {26248#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20) (< 0 main_~k~0))} assume !false; {26248#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,935 INFO L272 TraceCheckUtils]: 147: Hoare triple {26248#(and (= 19 (+ (- 1) 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)); {25788#true} is VALID [2022-04-27 12:08:56,936 INFO L290 TraceCheckUtils]: 148: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,936 INFO L290 TraceCheckUtils]: 149: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,936 INFO L290 TraceCheckUtils]: 150: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,936 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {25788#true} {26248#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20) (< 0 main_~k~0))} #50#return; {26248#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,936 INFO L290 TraceCheckUtils]: 152: Hoare triple {26248#(and (= 19 (+ (- 1) 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; {26270#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,937 INFO L290 TraceCheckUtils]: 153: Hoare triple {26270#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {26270#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,937 INFO L272 TraceCheckUtils]: 154: Hoare triple {26270#(and (= main_~c~0 21) (= 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)); {25788#true} is VALID [2022-04-27 12:08:56,937 INFO L290 TraceCheckUtils]: 155: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,937 INFO L290 TraceCheckUtils]: 156: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,937 INFO L290 TraceCheckUtils]: 157: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,938 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {25788#true} {26270#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #50#return; {26270#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,938 INFO L290 TraceCheckUtils]: 159: Hoare triple {26270#(and (= main_~c~0 21) (= 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; {26292#(and (= (+ (- 1) main_~c~0) 21) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-27 12:08:56,938 INFO L290 TraceCheckUtils]: 160: Hoare triple {26292#(and (= (+ (- 1) main_~c~0) 21) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 20))} assume !false; {26292#(and (= (+ (- 1) main_~c~0) 21) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-27 12:08:56,938 INFO L272 TraceCheckUtils]: 161: Hoare triple {26292#(and (= (+ (- 1) main_~c~0) 21) (< 0 main_~k~0) (= (+ (- 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)); {25788#true} is VALID [2022-04-27 12:08:56,938 INFO L290 TraceCheckUtils]: 162: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,938 INFO L290 TraceCheckUtils]: 163: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,939 INFO L290 TraceCheckUtils]: 164: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,939 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {25788#true} {26292#(and (= (+ (- 1) main_~c~0) 21) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 20))} #50#return; {26292#(and (= (+ (- 1) main_~c~0) 21) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-27 12:08:56,939 INFO L290 TraceCheckUtils]: 166: Hoare triple {26292#(and (= (+ (- 1) main_~c~0) 21) (< 0 main_~k~0) (= (+ (- 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; {26314#(and (= 21 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 20) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,940 INFO L290 TraceCheckUtils]: 167: Hoare triple {26314#(and (= 21 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 20) (< 0 main_~k~0))} assume !false; {26314#(and (= 21 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 20) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,940 INFO L272 TraceCheckUtils]: 168: Hoare triple {26314#(and (= 21 (+ (- 2) main_~c~0)) (= (+ 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)); {25788#true} is VALID [2022-04-27 12:08:56,940 INFO L290 TraceCheckUtils]: 169: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,940 INFO L290 TraceCheckUtils]: 170: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,940 INFO L290 TraceCheckUtils]: 171: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,940 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25788#true} {26314#(and (= 21 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 20) (< 0 main_~k~0))} #50#return; {26314#(and (= 21 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 20) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,941 INFO L290 TraceCheckUtils]: 173: Hoare triple {26314#(and (= 21 (+ (- 2) main_~c~0)) (= (+ 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; {26336#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,941 INFO L290 TraceCheckUtils]: 174: Hoare triple {26336#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24) (< 0 main_~k~0))} assume !false; {26336#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,941 INFO L272 TraceCheckUtils]: 175: Hoare triple {26336#(and (= 21 (+ main_~c~0 (- 3))) (= 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)); {25788#true} is VALID [2022-04-27 12:08:56,941 INFO L290 TraceCheckUtils]: 176: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,941 INFO L290 TraceCheckUtils]: 177: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,941 INFO L290 TraceCheckUtils]: 178: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,942 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {25788#true} {26336#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24) (< 0 main_~k~0))} #50#return; {26336#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,942 INFO L290 TraceCheckUtils]: 180: Hoare triple {26336#(and (= 21 (+ main_~c~0 (- 3))) (= 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; {26358#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,943 INFO L290 TraceCheckUtils]: 181: Hoare triple {26358#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} assume !false; {26358#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,943 INFO L272 TraceCheckUtils]: 182: Hoare triple {26358#(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)); {25788#true} is VALID [2022-04-27 12:08:56,943 INFO L290 TraceCheckUtils]: 183: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,943 INFO L290 TraceCheckUtils]: 184: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,943 INFO L290 TraceCheckUtils]: 185: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,943 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {25788#true} {26358#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} #50#return; {26358#(and (= main_~y~0 25) (= main_~c~0 25) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,944 INFO L290 TraceCheckUtils]: 187: Hoare triple {26358#(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; {26380#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-27 12:08:56,944 INFO L290 TraceCheckUtils]: 188: Hoare triple {26380#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} assume !false; {26380#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-27 12:08:56,944 INFO L272 TraceCheckUtils]: 189: Hoare triple {26380#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= (+ (- 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)); {25788#true} is VALID [2022-04-27 12:08:56,944 INFO L290 TraceCheckUtils]: 190: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,944 INFO L290 TraceCheckUtils]: 191: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,944 INFO L290 TraceCheckUtils]: 192: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,945 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {25788#true} {26380#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} #50#return; {26380#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-27 12:08:56,945 INFO L290 TraceCheckUtils]: 194: Hoare triple {26380#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= (+ (- 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; {26402#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,945 INFO L290 TraceCheckUtils]: 195: Hoare triple {26402#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} assume !false; {26402#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,946 INFO L272 TraceCheckUtils]: 196: Hoare triple {26402#(and (= main_~y~0 27) (= 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)); {25788#true} is VALID [2022-04-27 12:08:56,946 INFO L290 TraceCheckUtils]: 197: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,946 INFO L290 TraceCheckUtils]: 198: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,946 INFO L290 TraceCheckUtils]: 199: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,946 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {25788#true} {26402#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} #50#return; {26402#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-27 12:08:56,947 INFO L290 TraceCheckUtils]: 201: Hoare triple {26402#(and (= main_~y~0 27) (= 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; {26424#(and (= main_~c~0 28) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-27 12:08:56,947 INFO L290 TraceCheckUtils]: 202: Hoare triple {26424#(and (= main_~c~0 28) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 27))} assume !false; {26424#(and (= main_~c~0 28) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-27 12:08:56,947 INFO L272 TraceCheckUtils]: 203: Hoare triple {26424#(and (= main_~c~0 28) (< 0 main_~k~0) (= (+ (- 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)); {25788#true} is VALID [2022-04-27 12:08:56,947 INFO L290 TraceCheckUtils]: 204: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,947 INFO L290 TraceCheckUtils]: 205: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,947 INFO L290 TraceCheckUtils]: 206: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,948 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {25788#true} {26424#(and (= main_~c~0 28) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 27))} #50#return; {26424#(and (= main_~c~0 28) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-27 12:08:56,948 INFO L290 TraceCheckUtils]: 208: Hoare triple {26424#(and (= main_~c~0 28) (< 0 main_~k~0) (= (+ (- 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; {26446#(and (= 29 main_~y~0) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-27 12:08:56,948 INFO L290 TraceCheckUtils]: 209: Hoare triple {26446#(and (= 29 main_~y~0) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 28))} assume !false; {26446#(and (= 29 main_~y~0) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-27 12:08:56,948 INFO L272 TraceCheckUtils]: 210: Hoare triple {26446#(and (= 29 main_~y~0) (< 0 main_~k~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)); {25788#true} is VALID [2022-04-27 12:08:56,948 INFO L290 TraceCheckUtils]: 211: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,949 INFO L290 TraceCheckUtils]: 212: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,949 INFO L290 TraceCheckUtils]: 213: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,949 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {25788#true} {26446#(and (= 29 main_~y~0) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 28))} #50#return; {26446#(and (= 29 main_~y~0) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-27 12:08:56,949 INFO L290 TraceCheckUtils]: 215: Hoare triple {26446#(and (= 29 main_~y~0) (< 0 main_~k~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; {26468#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-27 12:08:56,950 INFO L290 TraceCheckUtils]: 216: Hoare triple {26468#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} assume !false; {26468#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-27 12:08:56,950 INFO L272 TraceCheckUtils]: 217: Hoare triple {26468#(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)); {25788#true} is VALID [2022-04-27 12:08:56,950 INFO L290 TraceCheckUtils]: 218: Hoare triple {25788#true} ~cond := #in~cond; {25788#true} is VALID [2022-04-27 12:08:56,950 INFO L290 TraceCheckUtils]: 219: Hoare triple {25788#true} assume !(0 == ~cond); {25788#true} is VALID [2022-04-27 12:08:56,950 INFO L290 TraceCheckUtils]: 220: Hoare triple {25788#true} assume true; {25788#true} is VALID [2022-04-27 12:08:56,950 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {25788#true} {26468#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} #50#return; {26468#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-27 12:08:56,951 INFO L290 TraceCheckUtils]: 222: Hoare triple {26468#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} assume !(~c~0 < ~k~0); {26490#(and (<= main_~k~0 30) (= 30 main_~y~0) (< 29 main_~k~0))} is VALID [2022-04-27 12:08:56,952 INFO L272 TraceCheckUtils]: 223: Hoare triple {26490#(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)); {26494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:08:56,952 INFO L290 TraceCheckUtils]: 224: Hoare triple {26494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:08:56,952 INFO L290 TraceCheckUtils]: 225: Hoare triple {26498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25789#false} is VALID [2022-04-27 12:08:56,952 INFO L290 TraceCheckUtils]: 226: Hoare triple {25789#false} assume !false; {25789#false} is VALID [2022-04-27 12:08:56,954 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 12:08:56,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:09:02,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:09:02,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198734459] [2022-04-27 12:09:02,566 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:09:02,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703816618] [2022-04-27 12:09:02,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703816618] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:09:02,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:09:02,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2022-04-27 12:09:02,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953814368] [2022-04-27 12:09:02,567 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:09:02,567 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 33 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Word has length 227 [2022-04-27 12:09:02,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:09:02,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 33 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 12:09:02,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:09:02,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-27 12:09:02,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:09:02,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-27 12:09:02,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=3516, Unknown=0, NotChecked=0, Total=4556 [2022-04-27 12:09:02,856 INFO L87 Difference]: Start difference. First operand 112 states and 141 transitions. Second operand has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 33 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 12:09:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:09:22,226 INFO L93 Difference]: Finished difference Result 120 states and 150 transitions. [2022-04-27 12:09:22,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-27 12:09:22,227 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 33 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Word has length 227 [2022-04-27 12:09:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:09:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 33 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 12:09:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 146 transitions. [2022-04-27 12:09:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 33 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 12:09:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 146 transitions. [2022-04-27 12:09:22,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 146 transitions. [2022-04-27 12:09:22,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:09:22,815 INFO L225 Difference]: With dead ends: 120 [2022-04-27 12:09:22,815 INFO L226 Difference]: Without dead ends: 115 [2022-04-27 12:09:22,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1050, Invalid=3780, Unknown=0, NotChecked=0, Total=4830 [2022-04-27 12:09:22,817 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 3207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 3207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:09:22,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1563 Invalid, 3207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3207 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2022-04-27 12:09:22,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-27 12:09:22,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-27 12:09:22,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:09:22,962 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), 35 states have call successors, (35), 5 states have call predecessors, (35), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 12:09:22,962 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), 35 states have call successors, (35), 5 states have call predecessors, (35), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 12:09:22,963 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), 35 states have call successors, (35), 5 states have call predecessors, (35), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 12:09:22,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:09:22,968 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2022-04-27 12:09:22,968 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2022-04-27 12:09:22,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:09:22,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:09:22,969 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), 35 states have call successors, (35), 5 states have call predecessors, (35), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 115 states. [2022-04-27 12:09:22,969 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), 35 states have call successors, (35), 5 states have call predecessors, (35), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 115 states. [2022-04-27 12:09:22,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:09:22,972 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2022-04-27 12:09:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2022-04-27 12:09:22,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:09:22,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:09:22,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:09:22,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:09:22,973 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), 35 states have call successors, (35), 5 states have call predecessors, (35), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 12:09:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 145 transitions. [2022-04-27 12:09:22,975 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 145 transitions. Word has length 227 [2022-04-27 12:09:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:09:22,975 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 145 transitions. [2022-04-27 12:09:22,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 33 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 12:09:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2022-04-27 12:09:22,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-04-27 12:09:22,977 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:09:22,977 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:09:22,987 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 12:09:23,187 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 12:09:23,187 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:09:23,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:09:23,188 INFO L85 PathProgramCache]: Analyzing trace with hash -748098683, now seen corresponding path program 31 times [2022-04-27 12:09:23,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:09:23,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384797993] [2022-04-27 12:09:23,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:09:23,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:09:23,211 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:09:23,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1123028848] [2022-04-27 12:09:23,211 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 12:09:23,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:09:23,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:09:23,218 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 12:09:23,220 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 12:09:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:09:24,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 132 conjunts are in the unsatisfiable core [2022-04-27 12:09:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:09:24,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:09:25,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {27799#true} call ULTIMATE.init(); {27799#true} is VALID [2022-04-27 12:09:25,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {27799#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); {27799#true} is VALID [2022-04-27 12:09:25,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27799#true} {27799#true} #56#return; {27799#true} is VALID [2022-04-27 12:09:25,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {27799#true} call #t~ret5 := main(); {27799#true} is VALID [2022-04-27 12:09:25,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {27799#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {27819#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:09:25,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {27819#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {27819#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:09:25,013 INFO L272 TraceCheckUtils]: 7: Hoare triple {27819#(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)); {27799#true} is VALID [2022-04-27 12:09:25,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,013 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {27799#true} {27819#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {27819#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:09:25,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {27819#(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; {27841#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:09:25,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {27841#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {27841#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:09:25,014 INFO L272 TraceCheckUtils]: 14: Hoare triple {27841#(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)); {27799#true} is VALID [2022-04-27 12:09:25,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,014 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {27799#true} {27841#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {27841#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:09:25,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {27841#(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; {27863#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 12:09:25,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {27863#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {27863#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 12:09:25,015 INFO L272 TraceCheckUtils]: 21: Hoare triple {27863#(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)); {27799#true} is VALID [2022-04-27 12:09:25,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,015 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {27799#true} {27863#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {27863#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 12:09:25,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {27863#(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; {27885#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:09:25,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {27885#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {27885#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:09:25,016 INFO L272 TraceCheckUtils]: 28: Hoare triple {27885#(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)); {27799#true} is VALID [2022-04-27 12:09:25,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,016 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {27799#true} {27885#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #50#return; {27885#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 12:09:25,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {27885#(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; {27907#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:09:25,017 INFO L290 TraceCheckUtils]: 34: Hoare triple {27907#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {27907#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:09:25,017 INFO L272 TraceCheckUtils]: 35: Hoare triple {27907#(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)); {27799#true} is VALID [2022-04-27 12:09:25,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,018 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {27799#true} {27907#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {27907#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 12:09:25,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {27907#(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; {27929#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 12:09:25,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {27929#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {27929#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 12:09:25,018 INFO L272 TraceCheckUtils]: 42: Hoare triple {27929#(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)); {27799#true} is VALID [2022-04-27 12:09:25,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,019 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {27799#true} {27929#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #50#return; {27929#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 12:09:25,019 INFO L290 TraceCheckUtils]: 47: Hoare triple {27929#(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; {27951#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 12:09:25,019 INFO L290 TraceCheckUtils]: 48: Hoare triple {27951#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {27951#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 12:09:25,020 INFO L272 TraceCheckUtils]: 49: Hoare triple {27951#(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)); {27799#true} is VALID [2022-04-27 12:09:25,020 INFO L290 TraceCheckUtils]: 50: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,020 INFO L290 TraceCheckUtils]: 51: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,020 INFO L290 TraceCheckUtils]: 52: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,020 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27799#true} {27951#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {27951#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 12:09:25,020 INFO L290 TraceCheckUtils]: 54: Hoare triple {27951#(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; {27973#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:09:25,021 INFO L290 TraceCheckUtils]: 55: Hoare triple {27973#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {27973#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:09:25,021 INFO L272 TraceCheckUtils]: 56: Hoare triple {27973#(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)); {27799#true} is VALID [2022-04-27 12:09:25,021 INFO L290 TraceCheckUtils]: 57: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,021 INFO L290 TraceCheckUtils]: 58: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,021 INFO L290 TraceCheckUtils]: 59: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,021 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {27799#true} {27973#(and (= 7 main_~y~0) (= 7 main_~c~0))} #50#return; {27973#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:09:25,021 INFO L290 TraceCheckUtils]: 61: Hoare triple {27973#(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; {27995#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 12:09:25,022 INFO L290 TraceCheckUtils]: 62: Hoare triple {27995#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {27995#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 12:09:25,022 INFO L272 TraceCheckUtils]: 63: Hoare triple {27995#(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)); {27799#true} is VALID [2022-04-27 12:09:25,022 INFO L290 TraceCheckUtils]: 64: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,022 INFO L290 TraceCheckUtils]: 65: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,022 INFO L290 TraceCheckUtils]: 66: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,022 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {27799#true} {27995#(and (= main_~y~0 8) (= main_~c~0 8))} #50#return; {27995#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 12:09:25,022 INFO L290 TraceCheckUtils]: 68: Hoare triple {27995#(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; {28017#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:09:25,023 INFO L290 TraceCheckUtils]: 69: Hoare triple {28017#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {28017#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:09:25,023 INFO L272 TraceCheckUtils]: 70: Hoare triple {28017#(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)); {27799#true} is VALID [2022-04-27 12:09:25,023 INFO L290 TraceCheckUtils]: 71: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,023 INFO L290 TraceCheckUtils]: 72: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,023 INFO L290 TraceCheckUtils]: 73: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,023 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27799#true} {28017#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {28017#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:09:25,023 INFO L290 TraceCheckUtils]: 75: Hoare triple {28017#(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; {28039#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 12:09:25,024 INFO L290 TraceCheckUtils]: 76: Hoare triple {28039#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {28039#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 12:09:25,024 INFO L272 TraceCheckUtils]: 77: Hoare triple {28039#(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)); {27799#true} is VALID [2022-04-27 12:09:25,024 INFO L290 TraceCheckUtils]: 78: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,024 INFO L290 TraceCheckUtils]: 79: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,024 INFO L290 TraceCheckUtils]: 80: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,024 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {27799#true} {28039#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {28039#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-27 12:09:25,024 INFO L290 TraceCheckUtils]: 82: Hoare triple {28039#(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; {28061#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 12:09:25,025 INFO L290 TraceCheckUtils]: 83: Hoare triple {28061#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {28061#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 12:09:25,025 INFO L272 TraceCheckUtils]: 84: Hoare triple {28061#(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)); {27799#true} is VALID [2022-04-27 12:09:25,025 INFO L290 TraceCheckUtils]: 85: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,025 INFO L290 TraceCheckUtils]: 86: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,025 INFO L290 TraceCheckUtils]: 87: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,025 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {27799#true} {28061#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {28061#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-27 12:09:25,025 INFO L290 TraceCheckUtils]: 89: Hoare triple {28061#(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; {28083#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 12:09:25,026 INFO L290 TraceCheckUtils]: 90: Hoare triple {28083#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {28083#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 12:09:25,026 INFO L272 TraceCheckUtils]: 91: Hoare triple {28083#(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)); {27799#true} is VALID [2022-04-27 12:09:25,026 INFO L290 TraceCheckUtils]: 92: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,026 INFO L290 TraceCheckUtils]: 93: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,026 INFO L290 TraceCheckUtils]: 94: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,026 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {27799#true} {28083#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {28083#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-27 12:09:25,026 INFO L290 TraceCheckUtils]: 96: Hoare triple {28083#(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; {28105#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:09:25,027 INFO L290 TraceCheckUtils]: 97: Hoare triple {28105#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {28105#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:09:25,027 INFO L272 TraceCheckUtils]: 98: Hoare triple {28105#(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)); {27799#true} is VALID [2022-04-27 12:09:25,027 INFO L290 TraceCheckUtils]: 99: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,027 INFO L290 TraceCheckUtils]: 100: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,027 INFO L290 TraceCheckUtils]: 101: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,027 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {27799#true} {28105#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #50#return; {28105#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:09:25,027 INFO L290 TraceCheckUtils]: 103: Hoare triple {28105#(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; {28127#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 12:09:25,028 INFO L290 TraceCheckUtils]: 104: Hoare triple {28127#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} assume !false; {28127#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 12:09:25,028 INFO L272 TraceCheckUtils]: 105: Hoare triple {28127#(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)); {27799#true} is VALID [2022-04-27 12:09:25,028 INFO L290 TraceCheckUtils]: 106: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,028 INFO L290 TraceCheckUtils]: 107: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,028 INFO L290 TraceCheckUtils]: 108: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,028 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {27799#true} {28127#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} #50#return; {28127#(and (= (+ (- 2) main_~y~0) 12) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-27 12:09:25,028 INFO L290 TraceCheckUtils]: 110: Hoare triple {28127#(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; {28149#(and (= (+ main_~y~0 (- 3)) 12) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:09:25,029 INFO L290 TraceCheckUtils]: 111: Hoare triple {28149#(and (= (+ main_~y~0 (- 3)) 12) (= 13 (+ (- 2) main_~c~0)))} assume !false; {28149#(and (= (+ main_~y~0 (- 3)) 12) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:09:25,029 INFO L272 TraceCheckUtils]: 112: Hoare triple {28149#(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)); {27799#true} is VALID [2022-04-27 12:09:25,029 INFO L290 TraceCheckUtils]: 113: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,029 INFO L290 TraceCheckUtils]: 114: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,029 INFO L290 TraceCheckUtils]: 115: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,029 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {27799#true} {28149#(and (= (+ main_~y~0 (- 3)) 12) (= 13 (+ (- 2) main_~c~0)))} #50#return; {28149#(and (= (+ main_~y~0 (- 3)) 12) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:09:25,029 INFO L290 TraceCheckUtils]: 117: Hoare triple {28149#(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; {28171#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-27 12:09:25,030 INFO L290 TraceCheckUtils]: 118: Hoare triple {28171#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} assume !false; {28171#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-27 12:09:25,030 INFO L272 TraceCheckUtils]: 119: Hoare triple {28171#(and (= main_~y~0 16) (= (+ main_~c~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)); {27799#true} is VALID [2022-04-27 12:09:25,030 INFO L290 TraceCheckUtils]: 120: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,030 INFO L290 TraceCheckUtils]: 121: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,030 INFO L290 TraceCheckUtils]: 122: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,030 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {27799#true} {28171#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} #50#return; {28171#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-27 12:09:25,030 INFO L290 TraceCheckUtils]: 124: Hoare triple {28171#(and (= main_~y~0 16) (= (+ main_~c~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; {28193#(and (= 16 (+ (- 1) main_~y~0)) (= 13 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 12:09:25,031 INFO L290 TraceCheckUtils]: 125: Hoare triple {28193#(and (= 16 (+ (- 1) main_~y~0)) (= 13 (+ main_~c~0 (- 4))))} assume !false; {28193#(and (= 16 (+ (- 1) main_~y~0)) (= 13 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 12:09:25,031 INFO L272 TraceCheckUtils]: 126: Hoare triple {28193#(and (= 16 (+ (- 1) main_~y~0)) (= 13 (+ 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)); {27799#true} is VALID [2022-04-27 12:09:25,031 INFO L290 TraceCheckUtils]: 127: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,031 INFO L290 TraceCheckUtils]: 128: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,031 INFO L290 TraceCheckUtils]: 129: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,031 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {27799#true} {28193#(and (= 16 (+ (- 1) main_~y~0)) (= 13 (+ main_~c~0 (- 4))))} #50#return; {28193#(and (= 16 (+ (- 1) main_~y~0)) (= 13 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 12:09:25,032 INFO L290 TraceCheckUtils]: 131: Hoare triple {28193#(and (= 16 (+ (- 1) main_~y~0)) (= 13 (+ 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; {28215#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-27 12:09:25,032 INFO L290 TraceCheckUtils]: 132: Hoare triple {28215#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} assume !false; {28215#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-27 12:09:25,032 INFO L272 TraceCheckUtils]: 133: Hoare triple {28215#(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)); {27799#true} is VALID [2022-04-27 12:09:25,032 INFO L290 TraceCheckUtils]: 134: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,032 INFO L290 TraceCheckUtils]: 135: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,032 INFO L290 TraceCheckUtils]: 136: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,032 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {27799#true} {28215#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} #50#return; {28215#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-27 12:09:25,033 INFO L290 TraceCheckUtils]: 138: Hoare triple {28215#(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; {28237#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-27 12:09:25,033 INFO L290 TraceCheckUtils]: 139: Hoare triple {28237#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} assume !false; {28237#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-27 12:09:25,033 INFO L272 TraceCheckUtils]: 140: Hoare triple {28237#(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)); {27799#true} is VALID [2022-04-27 12:09:25,033 INFO L290 TraceCheckUtils]: 141: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,033 INFO L290 TraceCheckUtils]: 142: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,033 INFO L290 TraceCheckUtils]: 143: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,033 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {27799#true} {28237#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} #50#return; {28237#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-27 12:09:25,034 INFO L290 TraceCheckUtils]: 145: Hoare triple {28237#(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; {28259#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-27 12:09:25,034 INFO L290 TraceCheckUtils]: 146: Hoare triple {28259#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} assume !false; {28259#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-27 12:09:25,034 INFO L272 TraceCheckUtils]: 147: Hoare triple {28259#(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)); {27799#true} is VALID [2022-04-27 12:09:25,034 INFO L290 TraceCheckUtils]: 148: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,034 INFO L290 TraceCheckUtils]: 149: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,034 INFO L290 TraceCheckUtils]: 150: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,034 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {27799#true} {28259#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} #50#return; {28259#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-27 12:09:25,035 INFO L290 TraceCheckUtils]: 152: Hoare triple {28259#(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; {28281#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 12:09:25,035 INFO L290 TraceCheckUtils]: 153: Hoare triple {28281#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {28281#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 12:09:25,035 INFO L272 TraceCheckUtils]: 154: Hoare triple {28281#(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)); {27799#true} is VALID [2022-04-27 12:09:25,035 INFO L290 TraceCheckUtils]: 155: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,035 INFO L290 TraceCheckUtils]: 156: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,035 INFO L290 TraceCheckUtils]: 157: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,035 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {27799#true} {28281#(and (= main_~c~0 21) (= main_~y~0 21))} #50#return; {28281#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-27 12:09:25,036 INFO L290 TraceCheckUtils]: 159: Hoare triple {28281#(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; {28303#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-27 12:09:25,036 INFO L290 TraceCheckUtils]: 160: Hoare triple {28303#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {28303#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-27 12:09:25,036 INFO L272 TraceCheckUtils]: 161: Hoare triple {28303#(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)); {27799#true} is VALID [2022-04-27 12:09:25,036 INFO L290 TraceCheckUtils]: 162: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,036 INFO L290 TraceCheckUtils]: 163: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,036 INFO L290 TraceCheckUtils]: 164: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,036 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {27799#true} {28303#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #50#return; {28303#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-27 12:09:25,037 INFO L290 TraceCheckUtils]: 166: Hoare triple {28303#(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; {28325#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} is VALID [2022-04-27 12:09:25,037 INFO L290 TraceCheckUtils]: 167: Hoare triple {28325#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} assume !false; {28325#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} is VALID [2022-04-27 12:09:25,037 INFO L272 TraceCheckUtils]: 168: Hoare triple {28325#(and (= 21 (+ (- 2) main_~c~0)) (= 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)); {27799#true} is VALID [2022-04-27 12:09:25,037 INFO L290 TraceCheckUtils]: 169: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,037 INFO L290 TraceCheckUtils]: 170: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,037 INFO L290 TraceCheckUtils]: 171: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,037 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {27799#true} {28325#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} #50#return; {28325#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} is VALID [2022-04-27 12:09:25,038 INFO L290 TraceCheckUtils]: 173: Hoare triple {28325#(and (= 21 (+ (- 2) main_~c~0)) (= 23 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; {28347#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 12:09:25,038 INFO L290 TraceCheckUtils]: 174: Hoare triple {28347#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {28347#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 12:09:25,038 INFO L272 TraceCheckUtils]: 175: Hoare triple {28347#(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)); {27799#true} is VALID [2022-04-27 12:09:25,038 INFO L290 TraceCheckUtils]: 176: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,038 INFO L290 TraceCheckUtils]: 177: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,038 INFO L290 TraceCheckUtils]: 178: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,038 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {27799#true} {28347#(and (= main_~c~0 24) (= main_~y~0 24))} #50#return; {28347#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 12:09:25,039 INFO L290 TraceCheckUtils]: 180: Hoare triple {28347#(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; {28369#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 12:09:25,039 INFO L290 TraceCheckUtils]: 181: Hoare triple {28369#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !false; {28369#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 12:09:25,039 INFO L272 TraceCheckUtils]: 182: Hoare triple {28369#(and (= main_~c~0 25) (= (+ (- 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)); {27799#true} is VALID [2022-04-27 12:09:25,039 INFO L290 TraceCheckUtils]: 183: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,039 INFO L290 TraceCheckUtils]: 184: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,039 INFO L290 TraceCheckUtils]: 185: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,039 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {27799#true} {28369#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} #50#return; {28369#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 12:09:25,040 INFO L290 TraceCheckUtils]: 187: Hoare triple {28369#(and (= main_~c~0 25) (= (+ (- 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; {28391#(and (= (+ (- 2) main_~y~0) 24) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-27 12:09:25,040 INFO L290 TraceCheckUtils]: 188: Hoare triple {28391#(and (= (+ (- 2) main_~y~0) 24) (= (+ (- 1) main_~c~0) 25))} assume !false; {28391#(and (= (+ (- 2) main_~y~0) 24) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-27 12:09:25,040 INFO L272 TraceCheckUtils]: 189: Hoare triple {28391#(and (= (+ (- 2) main_~y~0) 24) (= (+ (- 1) 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)); {27799#true} is VALID [2022-04-27 12:09:25,040 INFO L290 TraceCheckUtils]: 190: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,040 INFO L290 TraceCheckUtils]: 191: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,040 INFO L290 TraceCheckUtils]: 192: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,040 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {27799#true} {28391#(and (= (+ (- 2) main_~y~0) 24) (= (+ (- 1) main_~c~0) 25))} #50#return; {28391#(and (= (+ (- 2) main_~y~0) 24) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-27 12:09:25,041 INFO L290 TraceCheckUtils]: 194: Hoare triple {28391#(and (= (+ (- 2) main_~y~0) 24) (= (+ (- 1) 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; {28413#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} is VALID [2022-04-27 12:09:25,041 INFO L290 TraceCheckUtils]: 195: Hoare triple {28413#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} assume !false; {28413#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} is VALID [2022-04-27 12:09:25,041 INFO L272 TraceCheckUtils]: 196: Hoare triple {28413#(and (= 25 (+ (- 2) main_~c~0)) (= 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)); {27799#true} is VALID [2022-04-27 12:09:25,041 INFO L290 TraceCheckUtils]: 197: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,041 INFO L290 TraceCheckUtils]: 198: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,041 INFO L290 TraceCheckUtils]: 199: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,041 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {27799#true} {28413#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} #50#return; {28413#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} is VALID [2022-04-27 12:09:25,042 INFO L290 TraceCheckUtils]: 201: Hoare triple {28413#(and (= 25 (+ (- 2) main_~c~0)) (= 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; {28435#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-27 12:09:25,042 INFO L290 TraceCheckUtils]: 202: Hoare triple {28435#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} assume !false; {28435#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-27 12:09:25,042 INFO L272 TraceCheckUtils]: 203: Hoare triple {28435#(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)); {27799#true} is VALID [2022-04-27 12:09:25,042 INFO L290 TraceCheckUtils]: 204: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,042 INFO L290 TraceCheckUtils]: 205: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,042 INFO L290 TraceCheckUtils]: 206: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,042 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {27799#true} {28435#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} #50#return; {28435#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-27 12:09:25,043 INFO L290 TraceCheckUtils]: 208: Hoare triple {28435#(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; {28457#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-27 12:09:25,043 INFO L290 TraceCheckUtils]: 209: Hoare triple {28457#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} assume !false; {28457#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-27 12:09:25,043 INFO L272 TraceCheckUtils]: 210: Hoare triple {28457#(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)); {27799#true} is VALID [2022-04-27 12:09:25,043 INFO L290 TraceCheckUtils]: 211: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,043 INFO L290 TraceCheckUtils]: 212: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,043 INFO L290 TraceCheckUtils]: 213: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,043 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {27799#true} {28457#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} #50#return; {28457#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-27 12:09:25,044 INFO L290 TraceCheckUtils]: 215: Hoare triple {28457#(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; {28479#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:09:25,044 INFO L290 TraceCheckUtils]: 216: Hoare triple {28479#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} assume !false; {28479#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:09:25,044 INFO L272 TraceCheckUtils]: 217: Hoare triple {28479#(and (= 28 (+ (- 2) 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)); {27799#true} is VALID [2022-04-27 12:09:25,044 INFO L290 TraceCheckUtils]: 218: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,044 INFO L290 TraceCheckUtils]: 219: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,044 INFO L290 TraceCheckUtils]: 220: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,044 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {27799#true} {28479#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} #50#return; {28479#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:09:25,045 INFO L290 TraceCheckUtils]: 222: Hoare triple {28479#(and (= 28 (+ (- 2) 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; {28501#(and (<= main_~c~0 31) (< 30 main_~k~0) (= (+ (- 2) main_~y~0) 29))} is VALID [2022-04-27 12:09:25,045 INFO L290 TraceCheckUtils]: 223: Hoare triple {28501#(and (<= main_~c~0 31) (< 30 main_~k~0) (= (+ (- 2) main_~y~0) 29))} assume !false; {28501#(and (<= main_~c~0 31) (< 30 main_~k~0) (= (+ (- 2) main_~y~0) 29))} is VALID [2022-04-27 12:09:25,045 INFO L272 TraceCheckUtils]: 224: Hoare triple {28501#(and (<= main_~c~0 31) (< 30 main_~k~0) (= (+ (- 2) main_~y~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)); {27799#true} is VALID [2022-04-27 12:09:25,045 INFO L290 TraceCheckUtils]: 225: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-27 12:09:25,045 INFO L290 TraceCheckUtils]: 226: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-27 12:09:25,045 INFO L290 TraceCheckUtils]: 227: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-27 12:09:25,045 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {27799#true} {28501#(and (<= main_~c~0 31) (< 30 main_~k~0) (= (+ (- 2) main_~y~0) 29))} #50#return; {28501#(and (<= main_~c~0 31) (< 30 main_~k~0) (= (+ (- 2) main_~y~0) 29))} is VALID [2022-04-27 12:09:25,046 INFO L290 TraceCheckUtils]: 229: Hoare triple {28501#(and (<= main_~c~0 31) (< 30 main_~k~0) (= (+ (- 2) main_~y~0) 29))} assume !(~c~0 < ~k~0); {28523#(and (< 30 main_~k~0) (= (+ (- 2) main_~y~0) 29) (<= main_~k~0 31))} is VALID [2022-04-27 12:09:25,046 INFO L272 TraceCheckUtils]: 230: Hoare triple {28523#(and (< 30 main_~k~0) (= (+ (- 2) main_~y~0) 29) (<= main_~k~0 31))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28527#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:09:25,047 INFO L290 TraceCheckUtils]: 231: Hoare triple {28527#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28531#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:09:25,047 INFO L290 TraceCheckUtils]: 232: Hoare triple {28531#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27800#false} is VALID [2022-04-27 12:09:25,047 INFO L290 TraceCheckUtils]: 233: Hoare triple {27800#false} assume !false; {27800#false} is VALID [2022-04-27 12:09:25,048 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 12:09:25,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:09:25,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:09:25,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384797993] [2022-04-27 12:09:25,426 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:09:25,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123028848] [2022-04-27 12:09:25,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123028848] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:09:25,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:09:25,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2022-04-27 12:09:25,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855103112] [2022-04-27 12:09:25,426 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:09:25,427 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 34 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Word has length 234 [2022-04-27 12:09:25,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:09:25,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 34 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 12:09:25,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:09:25,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-27 12:09:25,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:09:25,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-27 12:09:25,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 12:09:25,892 INFO L87 Difference]: Start difference. First operand 115 states and 145 transitions. Second operand has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 34 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 12:09:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:09:48,935 INFO L93 Difference]: Finished difference Result 123 states and 154 transitions. [2022-04-27 12:09:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-27 12:09:48,936 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 34 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Word has length 234 [2022-04-27 12:09:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:09:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 34 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 12:09:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 150 transitions. [2022-04-27 12:09:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 34 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 12:09:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 150 transitions. [2022-04-27 12:09:48,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 150 transitions. [2022-04-27 12:09:49,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:09:49,506 INFO L225 Difference]: With dead ends: 123 [2022-04-27 12:09:49,506 INFO L226 Difference]: Without dead ends: 118 [2022-04-27 12:09:49,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=1598, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 12:09:49,506 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 3406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 3406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:09:49,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1644 Invalid, 3406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3406 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2022-04-27 12:09:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-27 12:09:49,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-27 12:09:49,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:09:49,635 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), 36 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 12:09:49,635 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), 36 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 12:09:49,635 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), 36 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 12:09:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:09:49,638 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2022-04-27 12:09:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2022-04-27 12:09:49,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:09:49,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:09:49,638 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), 36 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 118 states. [2022-04-27 12:09:49,639 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), 36 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 118 states. [2022-04-27 12:09:49,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:09:49,641 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2022-04-27 12:09:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2022-04-27 12:09:49,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:09:49,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:09:49,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:09:49,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:09:49,642 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), 36 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 12:09:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2022-04-27 12:09:49,645 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 234 [2022-04-27 12:09:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:09:49,645 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2022-04-27 12:09:49,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 34 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 12:09:49,645 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2022-04-27 12:09:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-04-27 12:09:49,646 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:09:49,646 INFO L195 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:09:49,654 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 12:09:49,852 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 12:09:49,853 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:09:49,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:09:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1651070962, now seen corresponding path program 32 times [2022-04-27 12:09:49,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:09:49,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256159840] [2022-04-27 12:09:49,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:09:49,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:09:49,867 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:09:49,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [999287886] [2022-04-27 12:09:49,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:09:49,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:09:49,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:09:49,868 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 12:09:49,869 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 12:09:50,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:09:50,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:09:50,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 136 conjunts are in the unsatisfiable core [2022-04-27 12:09:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:09:50,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:09:52,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {29210#true} call ULTIMATE.init(); {29210#true} is VALID [2022-04-27 12:09:52,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {29210#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); {29210#true} is VALID [2022-04-27 12:09:52,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29210#true} {29210#true} #56#return; {29210#true} is VALID [2022-04-27 12:09:52,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {29210#true} call #t~ret5 := main(); {29210#true} is VALID [2022-04-27 12:09:52,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {29210#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {29230#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:09:52,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {29230#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {29230#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:09:52,293 INFO L272 TraceCheckUtils]: 7: Hoare triple {29230#(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)); {29210#true} is VALID [2022-04-27 12:09:52,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,294 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {29210#true} {29230#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {29230#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:09:52,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {29230#(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; {29252#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:09:52,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {29252#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {29252#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:09:52,295 INFO L272 TraceCheckUtils]: 14: Hoare triple {29252#(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)); {29210#true} is VALID [2022-04-27 12:09:52,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,295 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29210#true} {29252#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {29252#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 12:09:52,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {29252#(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; {29274#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:09:52,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {29274#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {29274#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:09:52,296 INFO L272 TraceCheckUtils]: 21: Hoare triple {29274#(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)); {29210#true} is VALID [2022-04-27 12:09:52,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,297 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29210#true} {29274#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #50#return; {29274#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:09:52,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {29274#(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; {29296#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:09:52,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {29296#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {29296#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:09:52,298 INFO L272 TraceCheckUtils]: 28: Hoare triple {29296#(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)); {29210#true} is VALID [2022-04-27 12:09:52,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,298 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {29210#true} {29296#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {29296#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 12:09:52,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {29296#(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; {29318#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:09:52,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {29318#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {29318#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:09:52,299 INFO L272 TraceCheckUtils]: 35: Hoare triple {29318#(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)); {29210#true} is VALID [2022-04-27 12:09:52,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,300 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {29210#true} {29318#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #50#return; {29318#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:09:52,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {29318#(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; {29340#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 12:09:52,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {29340#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {29340#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 12:09:52,300 INFO L272 TraceCheckUtils]: 42: Hoare triple {29340#(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)); {29210#true} is VALID [2022-04-27 12:09:52,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,301 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29210#true} {29340#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #50#return; {29340#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 12:09:52,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {29340#(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; {29362#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 12:09:52,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {29362#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {29362#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 12:09:52,302 INFO L272 TraceCheckUtils]: 49: Hoare triple {29362#(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)); {29210#true} is VALID [2022-04-27 12:09:52,302 INFO L290 TraceCheckUtils]: 50: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,302 INFO L290 TraceCheckUtils]: 51: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,302 INFO L290 TraceCheckUtils]: 52: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,302 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29210#true} {29362#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {29362#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 12:09:52,303 INFO L290 TraceCheckUtils]: 54: Hoare triple {29362#(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; {29384#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:09:52,303 INFO L290 TraceCheckUtils]: 55: Hoare triple {29384#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {29384#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:09:52,303 INFO L272 TraceCheckUtils]: 56: Hoare triple {29384#(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)); {29210#true} is VALID [2022-04-27 12:09:52,303 INFO L290 TraceCheckUtils]: 57: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,303 INFO L290 TraceCheckUtils]: 59: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,304 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {29210#true} {29384#(and (= 7 main_~y~0) (= 7 main_~c~0))} #50#return; {29384#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 12:09:52,304 INFO L290 TraceCheckUtils]: 61: Hoare triple {29384#(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; {29406#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:09:52,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {29406#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {29406#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:09:52,304 INFO L272 TraceCheckUtils]: 63: Hoare triple {29406#(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)); {29210#true} is VALID [2022-04-27 12:09:52,305 INFO L290 TraceCheckUtils]: 64: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,305 INFO L290 TraceCheckUtils]: 65: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,305 INFO L290 TraceCheckUtils]: 66: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,305 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {29210#true} {29406#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #50#return; {29406#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-27 12:09:52,306 INFO L290 TraceCheckUtils]: 68: Hoare triple {29406#(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; {29428#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:09:52,306 INFO L290 TraceCheckUtils]: 69: Hoare triple {29428#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {29428#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:09:52,306 INFO L272 TraceCheckUtils]: 70: Hoare triple {29428#(and (= 7 (+ (- 2) main_~y~0)) (= 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)); {29210#true} is VALID [2022-04-27 12:09:52,306 INFO L290 TraceCheckUtils]: 71: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,306 INFO L290 TraceCheckUtils]: 72: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,306 INFO L290 TraceCheckUtils]: 73: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,307 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29210#true} {29428#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #50#return; {29428#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:09:52,307 INFO L290 TraceCheckUtils]: 75: Hoare triple {29428#(and (= 7 (+ (- 2) main_~y~0)) (= 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; {29450#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 12:09:52,308 INFO L290 TraceCheckUtils]: 76: Hoare triple {29450#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} assume !false; {29450#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 12:09:52,308 INFO L272 TraceCheckUtils]: 77: Hoare triple {29450#(and (= main_~y~0 10) (= 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)); {29210#true} is VALID [2022-04-27 12:09:52,308 INFO L290 TraceCheckUtils]: 78: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,308 INFO L290 TraceCheckUtils]: 79: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,308 INFO L290 TraceCheckUtils]: 80: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,309 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {29210#true} {29450#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} #50#return; {29450#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 12:09:52,309 INFO L290 TraceCheckUtils]: 82: Hoare triple {29450#(and (= main_~y~0 10) (= 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; {29472#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 12:09:52,309 INFO L290 TraceCheckUtils]: 83: Hoare triple {29472#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {29472#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 12:09:52,309 INFO L272 TraceCheckUtils]: 84: Hoare triple {29472#(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)); {29210#true} is VALID [2022-04-27 12:09:52,310 INFO L290 TraceCheckUtils]: 85: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,310 INFO L290 TraceCheckUtils]: 86: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,310 INFO L290 TraceCheckUtils]: 87: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,310 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {29210#true} {29472#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #50#return; {29472#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-27 12:09:52,311 INFO L290 TraceCheckUtils]: 89: Hoare triple {29472#(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; {29494#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-27 12:09:52,311 INFO L290 TraceCheckUtils]: 90: Hoare triple {29494#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} assume !false; {29494#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-27 12:09:52,311 INFO L272 TraceCheckUtils]: 91: Hoare triple {29494#(and (= (+ (- 2) main_~y~0) 10) (= 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)); {29210#true} is VALID [2022-04-27 12:09:52,311 INFO L290 TraceCheckUtils]: 92: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,311 INFO L290 TraceCheckUtils]: 93: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,311 INFO L290 TraceCheckUtils]: 94: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,312 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {29210#true} {29494#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} #50#return; {29494#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-27 12:09:52,312 INFO L290 TraceCheckUtils]: 96: Hoare triple {29494#(and (= (+ (- 2) main_~y~0) 10) (= 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; {29516#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 12:09:52,313 INFO L290 TraceCheckUtils]: 97: Hoare triple {29516#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {29516#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 12:09:52,313 INFO L272 TraceCheckUtils]: 98: Hoare triple {29516#(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)); {29210#true} is VALID [2022-04-27 12:09:52,313 INFO L290 TraceCheckUtils]: 99: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,313 INFO L290 TraceCheckUtils]: 100: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,313 INFO L290 TraceCheckUtils]: 101: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,314 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {29210#true} {29516#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #50#return; {29516#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-27 12:09:52,314 INFO L290 TraceCheckUtils]: 103: Hoare triple {29516#(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; {29538#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:09:52,315 INFO L290 TraceCheckUtils]: 104: Hoare triple {29538#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} assume !false; {29538#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:09:52,315 INFO L272 TraceCheckUtils]: 105: Hoare triple {29538#(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)); {29210#true} is VALID [2022-04-27 12:09:52,315 INFO L290 TraceCheckUtils]: 106: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,315 INFO L290 TraceCheckUtils]: 107: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,315 INFO L290 TraceCheckUtils]: 108: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,315 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {29210#true} {29538#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} #50#return; {29538#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:09:52,316 INFO L290 TraceCheckUtils]: 110: Hoare triple {29538#(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; {29560#(and (= (+ (- 2) main_~y~0) 13) (= (+ main_~c~0 (- 3)) 12))} is VALID [2022-04-27 12:09:52,316 INFO L290 TraceCheckUtils]: 111: Hoare triple {29560#(and (= (+ (- 2) main_~y~0) 13) (= (+ main_~c~0 (- 3)) 12))} assume !false; {29560#(and (= (+ (- 2) main_~y~0) 13) (= (+ main_~c~0 (- 3)) 12))} is VALID [2022-04-27 12:09:52,316 INFO L272 TraceCheckUtils]: 112: Hoare triple {29560#(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)); {29210#true} is VALID [2022-04-27 12:09:52,317 INFO L290 TraceCheckUtils]: 113: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,317 INFO L290 TraceCheckUtils]: 114: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,317 INFO L290 TraceCheckUtils]: 115: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,317 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {29210#true} {29560#(and (= (+ (- 2) main_~y~0) 13) (= (+ main_~c~0 (- 3)) 12))} #50#return; {29560#(and (= (+ (- 2) main_~y~0) 13) (= (+ main_~c~0 (- 3)) 12))} is VALID [2022-04-27 12:09:52,318 INFO L290 TraceCheckUtils]: 117: Hoare triple {29560#(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; {29582#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 12:09:52,318 INFO L290 TraceCheckUtils]: 118: Hoare triple {29582#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} assume !false; {29582#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 12:09:52,318 INFO L272 TraceCheckUtils]: 119: Hoare triple {29582#(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)); {29210#true} is VALID [2022-04-27 12:09:52,318 INFO L290 TraceCheckUtils]: 120: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,318 INFO L290 TraceCheckUtils]: 121: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,318 INFO L290 TraceCheckUtils]: 122: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,319 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {29210#true} {29582#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} #50#return; {29582#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 12:09:52,319 INFO L290 TraceCheckUtils]: 124: Hoare triple {29582#(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; {29604#(and (= (+ main_~y~0 (- 4)) 13) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 12:09:52,320 INFO L290 TraceCheckUtils]: 125: Hoare triple {29604#(and (= (+ main_~y~0 (- 4)) 13) (= (+ (- 1) main_~c~0) 16))} assume !false; {29604#(and (= (+ main_~y~0 (- 4)) 13) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 12:09:52,320 INFO L272 TraceCheckUtils]: 126: Hoare triple {29604#(and (= (+ main_~y~0 (- 4)) 13) (= (+ (- 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)); {29210#true} is VALID [2022-04-27 12:09:52,320 INFO L290 TraceCheckUtils]: 127: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,320 INFO L290 TraceCheckUtils]: 128: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,320 INFO L290 TraceCheckUtils]: 129: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,320 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29210#true} {29604#(and (= (+ main_~y~0 (- 4)) 13) (= (+ (- 1) main_~c~0) 16))} #50#return; {29604#(and (= (+ main_~y~0 (- 4)) 13) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-27 12:09:52,321 INFO L290 TraceCheckUtils]: 131: Hoare triple {29604#(and (= (+ main_~y~0 (- 4)) 13) (= (+ (- 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; {29626#(and (= (+ main_~y~0 (- 5)) 13) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:09:52,321 INFO L290 TraceCheckUtils]: 132: Hoare triple {29626#(and (= (+ main_~y~0 (- 5)) 13) (= 16 (+ (- 2) main_~c~0)))} assume !false; {29626#(and (= (+ main_~y~0 (- 5)) 13) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:09:52,321 INFO L272 TraceCheckUtils]: 133: Hoare triple {29626#(and (= (+ main_~y~0 (- 5)) 13) (= 16 (+ (- 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)); {29210#true} is VALID [2022-04-27 12:09:52,321 INFO L290 TraceCheckUtils]: 134: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,321 INFO L290 TraceCheckUtils]: 135: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,322 INFO L290 TraceCheckUtils]: 136: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,322 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {29210#true} {29626#(and (= (+ main_~y~0 (- 5)) 13) (= 16 (+ (- 2) main_~c~0)))} #50#return; {29626#(and (= (+ main_~y~0 (- 5)) 13) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:09:52,322 INFO L290 TraceCheckUtils]: 138: Hoare triple {29626#(and (= (+ main_~y~0 (- 5)) 13) (= 16 (+ (- 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; {29648#(and (= 16 (+ main_~c~0 (- 3))) (= 19 main_~y~0))} is VALID [2022-04-27 12:09:52,323 INFO L290 TraceCheckUtils]: 139: Hoare triple {29648#(and (= 16 (+ main_~c~0 (- 3))) (= 19 main_~y~0))} assume !false; {29648#(and (= 16 (+ main_~c~0 (- 3))) (= 19 main_~y~0))} is VALID [2022-04-27 12:09:52,323 INFO L272 TraceCheckUtils]: 140: Hoare triple {29648#(and (= 16 (+ main_~c~0 (- 3))) (= 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)); {29210#true} is VALID [2022-04-27 12:09:52,323 INFO L290 TraceCheckUtils]: 141: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,323 INFO L290 TraceCheckUtils]: 142: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,323 INFO L290 TraceCheckUtils]: 143: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,323 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {29210#true} {29648#(and (= 16 (+ main_~c~0 (- 3))) (= 19 main_~y~0))} #50#return; {29648#(and (= 16 (+ main_~c~0 (- 3))) (= 19 main_~y~0))} is VALID [2022-04-27 12:09:52,324 INFO L290 TraceCheckUtils]: 145: Hoare triple {29648#(and (= 16 (+ main_~c~0 (- 3))) (= 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; {29670#(and (= 19 (+ (- 1) main_~y~0)) (= 16 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 12:09:52,324 INFO L290 TraceCheckUtils]: 146: Hoare triple {29670#(and (= 19 (+ (- 1) main_~y~0)) (= 16 (+ main_~c~0 (- 4))))} assume !false; {29670#(and (= 19 (+ (- 1) main_~y~0)) (= 16 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 12:09:52,324 INFO L272 TraceCheckUtils]: 147: Hoare triple {29670#(and (= 19 (+ (- 1) main_~y~0)) (= 16 (+ 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)); {29210#true} is VALID [2022-04-27 12:09:52,324 INFO L290 TraceCheckUtils]: 148: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,324 INFO L290 TraceCheckUtils]: 149: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,324 INFO L290 TraceCheckUtils]: 150: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,325 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {29210#true} {29670#(and (= 19 (+ (- 1) main_~y~0)) (= 16 (+ main_~c~0 (- 4))))} #50#return; {29670#(and (= 19 (+ (- 1) main_~y~0)) (= 16 (+ main_~c~0 (- 4))))} is VALID [2022-04-27 12:09:52,325 INFO L290 TraceCheckUtils]: 152: Hoare triple {29670#(and (= 19 (+ (- 1) main_~y~0)) (= 16 (+ 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; {29692#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 12:09:52,326 INFO L290 TraceCheckUtils]: 153: Hoare triple {29692#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !false; {29692#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 12:09:52,326 INFO L272 TraceCheckUtils]: 154: Hoare triple {29692#(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)); {29210#true} is VALID [2022-04-27 12:09:52,326 INFO L290 TraceCheckUtils]: 155: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,326 INFO L290 TraceCheckUtils]: 156: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,326 INFO L290 TraceCheckUtils]: 157: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,326 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {29210#true} {29692#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} #50#return; {29692#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-27 12:09:52,327 INFO L290 TraceCheckUtils]: 159: Hoare triple {29692#(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; {29714#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-27 12:09:52,327 INFO L290 TraceCheckUtils]: 160: Hoare triple {29714#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} assume !false; {29714#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-27 12:09:52,327 INFO L272 TraceCheckUtils]: 161: Hoare triple {29714#(and (= 19 (+ main_~y~0 (- 3))) (= 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)); {29210#true} is VALID [2022-04-27 12:09:52,327 INFO L290 TraceCheckUtils]: 162: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,327 INFO L290 TraceCheckUtils]: 163: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,327 INFO L290 TraceCheckUtils]: 164: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,328 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {29210#true} {29714#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} #50#return; {29714#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-27 12:09:52,328 INFO L290 TraceCheckUtils]: 166: Hoare triple {29714#(and (= 19 (+ main_~y~0 (- 3))) (= 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; {29736#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-27 12:09:52,329 INFO L290 TraceCheckUtils]: 167: Hoare triple {29736#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {29736#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-27 12:09:52,329 INFO L272 TraceCheckUtils]: 168: Hoare triple {29736#(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)); {29210#true} is VALID [2022-04-27 12:09:52,329 INFO L290 TraceCheckUtils]: 169: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,329 INFO L290 TraceCheckUtils]: 170: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,329 INFO L290 TraceCheckUtils]: 171: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,330 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {29210#true} {29736#(and (= 23 main_~y~0) (= 23 main_~c~0))} #50#return; {29736#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-27 12:09:52,330 INFO L290 TraceCheckUtils]: 173: Hoare triple {29736#(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; {29758#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 12:09:52,331 INFO L290 TraceCheckUtils]: 174: Hoare triple {29758#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {29758#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 12:09:52,331 INFO L272 TraceCheckUtils]: 175: Hoare triple {29758#(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)); {29210#true} is VALID [2022-04-27 12:09:52,331 INFO L290 TraceCheckUtils]: 176: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,331 INFO L290 TraceCheckUtils]: 177: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,331 INFO L290 TraceCheckUtils]: 178: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,331 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {29210#true} {29758#(and (= main_~c~0 24) (= main_~y~0 24))} #50#return; {29758#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 12:09:52,332 INFO L290 TraceCheckUtils]: 180: Hoare triple {29758#(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; {29780#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-27 12:09:52,332 INFO L290 TraceCheckUtils]: 181: Hoare triple {29780#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} assume !false; {29780#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-27 12:09:52,332 INFO L272 TraceCheckUtils]: 182: Hoare triple {29780#(and (= main_~y~0 25) (= (+ (- 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)); {29210#true} is VALID [2022-04-27 12:09:52,332 INFO L290 TraceCheckUtils]: 183: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,333 INFO L290 TraceCheckUtils]: 184: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,333 INFO L290 TraceCheckUtils]: 185: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,333 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {29210#true} {29780#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} #50#return; {29780#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-27 12:09:52,333 INFO L290 TraceCheckUtils]: 187: Hoare triple {29780#(and (= main_~y~0 25) (= (+ (- 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; {29802#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-27 12:09:52,334 INFO L290 TraceCheckUtils]: 188: Hoare triple {29802#(and (= main_~c~0 26) (= main_~y~0 26))} assume !false; {29802#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-27 12:09:52,334 INFO L272 TraceCheckUtils]: 189: Hoare triple {29802#(and (= main_~c~0 26) (= 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)); {29210#true} is VALID [2022-04-27 12:09:52,334 INFO L290 TraceCheckUtils]: 190: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,334 INFO L290 TraceCheckUtils]: 191: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,334 INFO L290 TraceCheckUtils]: 192: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,335 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {29210#true} {29802#(and (= main_~c~0 26) (= main_~y~0 26))} #50#return; {29802#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-27 12:09:52,335 INFO L290 TraceCheckUtils]: 194: Hoare triple {29802#(and (= main_~c~0 26) (= 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; {29824#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-27 12:09:52,336 INFO L290 TraceCheckUtils]: 195: Hoare triple {29824#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {29824#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-27 12:09:52,336 INFO L272 TraceCheckUtils]: 196: Hoare triple {29824#(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)); {29210#true} is VALID [2022-04-27 12:09:52,336 INFO L290 TraceCheckUtils]: 197: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,336 INFO L290 TraceCheckUtils]: 198: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,336 INFO L290 TraceCheckUtils]: 199: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,336 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {29210#true} {29824#(and (= main_~y~0 27) (= main_~c~0 27))} #50#return; {29824#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-27 12:09:52,337 INFO L290 TraceCheckUtils]: 201: Hoare triple {29824#(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; {29846#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-27 12:09:52,337 INFO L290 TraceCheckUtils]: 202: Hoare triple {29846#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} assume !false; {29846#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-27 12:09:52,337 INFO L272 TraceCheckUtils]: 203: Hoare triple {29846#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 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)); {29210#true} is VALID [2022-04-27 12:09:52,337 INFO L290 TraceCheckUtils]: 204: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,337 INFO L290 TraceCheckUtils]: 205: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,337 INFO L290 TraceCheckUtils]: 206: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,338 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {29210#true} {29846#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} #50#return; {29846#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-27 12:09:52,338 INFO L290 TraceCheckUtils]: 208: Hoare triple {29846#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 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; {29868#(and (= (+ (- 2) main_~y~0) 27) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:09:52,339 INFO L290 TraceCheckUtils]: 209: Hoare triple {29868#(and (= (+ (- 2) main_~y~0) 27) (= 27 (+ (- 2) main_~c~0)))} assume !false; {29868#(and (= (+ (- 2) main_~y~0) 27) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:09:52,339 INFO L272 TraceCheckUtils]: 210: Hoare triple {29868#(and (= (+ (- 2) main_~y~0) 27) (= 27 (+ (- 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)); {29210#true} is VALID [2022-04-27 12:09:52,339 INFO L290 TraceCheckUtils]: 211: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,339 INFO L290 TraceCheckUtils]: 212: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,339 INFO L290 TraceCheckUtils]: 213: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,339 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {29210#true} {29868#(and (= (+ (- 2) main_~y~0) 27) (= 27 (+ (- 2) main_~c~0)))} #50#return; {29868#(and (= (+ (- 2) main_~y~0) 27) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 12:09:52,340 INFO L290 TraceCheckUtils]: 215: Hoare triple {29868#(and (= (+ (- 2) main_~y~0) 27) (= 27 (+ (- 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; {29890#(and (= 30 main_~y~0) (= (+ main_~c~0 (- 3)) 27))} is VALID [2022-04-27 12:09:52,340 INFO L290 TraceCheckUtils]: 216: Hoare triple {29890#(and (= 30 main_~y~0) (= (+ main_~c~0 (- 3)) 27))} assume !false; {29890#(and (= 30 main_~y~0) (= (+ main_~c~0 (- 3)) 27))} is VALID [2022-04-27 12:09:52,340 INFO L272 TraceCheckUtils]: 217: Hoare triple {29890#(and (= 30 main_~y~0) (= (+ main_~c~0 (- 3)) 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)); {29210#true} is VALID [2022-04-27 12:09:52,340 INFO L290 TraceCheckUtils]: 218: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,340 INFO L290 TraceCheckUtils]: 219: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,341 INFO L290 TraceCheckUtils]: 220: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,341 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {29210#true} {29890#(and (= 30 main_~y~0) (= (+ main_~c~0 (- 3)) 27))} #50#return; {29890#(and (= 30 main_~y~0) (= (+ main_~c~0 (- 3)) 27))} is VALID [2022-04-27 12:09:52,341 INFO L290 TraceCheckUtils]: 222: Hoare triple {29890#(and (= 30 main_~y~0) (= (+ main_~c~0 (- 3)) 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; {29912#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} is VALID [2022-04-27 12:09:52,342 INFO L290 TraceCheckUtils]: 223: Hoare triple {29912#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} assume !false; {29912#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} is VALID [2022-04-27 12:09:52,342 INFO L272 TraceCheckUtils]: 224: Hoare triple {29912#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29210#true} is VALID [2022-04-27 12:09:52,342 INFO L290 TraceCheckUtils]: 225: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,342 INFO L290 TraceCheckUtils]: 226: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,342 INFO L290 TraceCheckUtils]: 227: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,343 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {29210#true} {29912#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} #50#return; {29912#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} is VALID [2022-04-27 12:09:52,343 INFO L290 TraceCheckUtils]: 229: Hoare triple {29912#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29934#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-27 12:09:52,343 INFO L290 TraceCheckUtils]: 230: Hoare triple {29934#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} assume !false; {29934#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-27 12:09:52,344 INFO L272 TraceCheckUtils]: 231: Hoare triple {29934#(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)); {29210#true} is VALID [2022-04-27 12:09:52,344 INFO L290 TraceCheckUtils]: 232: Hoare triple {29210#true} ~cond := #in~cond; {29210#true} is VALID [2022-04-27 12:09:52,344 INFO L290 TraceCheckUtils]: 233: Hoare triple {29210#true} assume !(0 == ~cond); {29210#true} is VALID [2022-04-27 12:09:52,344 INFO L290 TraceCheckUtils]: 234: Hoare triple {29210#true} assume true; {29210#true} is VALID [2022-04-27 12:09:52,344 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {29210#true} {29934#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} #50#return; {29934#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-27 12:09:52,348 INFO L290 TraceCheckUtils]: 236: Hoare triple {29934#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} assume !(~c~0 < ~k~0); {29956#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~k~0 32))} is VALID [2022-04-27 12:09:52,349 INFO L272 TraceCheckUtils]: 237: Hoare triple {29956#(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)); {29960#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:09:52,350 INFO L290 TraceCheckUtils]: 238: Hoare triple {29960#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29964#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:09:52,350 INFO L290 TraceCheckUtils]: 239: Hoare triple {29964#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29211#false} is VALID [2022-04-27 12:09:52,350 INFO L290 TraceCheckUtils]: 240: Hoare triple {29211#false} assume !false; {29211#false} is VALID [2022-04-27 12:09:52,352 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 12:09:52,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:09:52,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:09:52,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256159840] [2022-04-27 12:09:52,796 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:09:52,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999287886] [2022-04-27 12:09:52,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999287886] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:09:52,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:09:52,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2022-04-27 12:09:52,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740302944] [2022-04-27 12:09:52,796 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:09:52,797 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 35 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Word has length 241 [2022-04-27 12:09:52,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:09:52,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 35 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 12:09:53,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:09:53,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-27 12:09:53,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:09:53,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-27 12:09:53,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 12:09:53,350 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 35 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 12:10:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:10:24,131 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2022-04-27 12:10:24,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-27 12:10:24,131 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 35 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Word has length 241 [2022-04-27 12:10:24,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:10:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 35 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 12:10:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 154 transitions. [2022-04-27 12:10:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 35 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 12:10:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 154 transitions. [2022-04-27 12:10:24,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 154 transitions. [2022-04-27 12:10:24,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:10:24,832 INFO L225 Difference]: With dead ends: 126 [2022-04-27 12:10:24,833 INFO L226 Difference]: Without dead ends: 121 [2022-04-27 12:10:24,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=1679, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 12:10:24,833 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 3611 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 3611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:10:24,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1727 Invalid, 3611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3611 Invalid, 0 Unknown, 0 Unchecked, 15.8s Time] [2022-04-27 12:10:24,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-27 12:10:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-04-27 12:10:24,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:10:24,978 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), 37 states have call successors, (37), 5 states have call predecessors, (37), 3 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 12:10:24,978 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), 37 states have call successors, (37), 5 states have call predecessors, (37), 3 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 12:10:24,979 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), 37 states have call successors, (37), 5 states have call predecessors, (37), 3 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 12:10:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:10:24,981 INFO L93 Difference]: Finished difference Result 121 states and 153 transitions. [2022-04-27 12:10:24,981 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2022-04-27 12:10:24,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:10:24,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:10:24,981 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), 37 states have call successors, (37), 5 states have call predecessors, (37), 3 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 121 states. [2022-04-27 12:10:24,981 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), 37 states have call successors, (37), 5 states have call predecessors, (37), 3 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 121 states. [2022-04-27 12:10:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:10:24,983 INFO L93 Difference]: Finished difference Result 121 states and 153 transitions. [2022-04-27 12:10:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2022-04-27 12:10:24,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:10:24,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:10:24,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:10:24,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:10:24,984 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), 37 states have call successors, (37), 5 states have call predecessors, (37), 3 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 12:10:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2022-04-27 12:10:24,986 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 241 [2022-04-27 12:10:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:10:24,986 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2022-04-27 12:10:24,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 35 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 12:10:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2022-04-27 12:10:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-04-27 12:10:24,987 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:10:24,987 INFO L195 NwaCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:10:25,004 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 12:10:25,194 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 12:10:25,194 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:10:25,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:10:25,194 INFO L85 PathProgramCache]: Analyzing trace with hash 758613733, now seen corresponding path program 33 times [2022-04-27 12:10:25,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:10:25,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513465217] [2022-04-27 12:10:25,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:10:25,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:10:25,211 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:10:25,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628728140] [2022-04-27 12:10:25,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:10:25,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:10:25,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:10:25,212 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 12:10:25,215 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 12:10:33,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2022-04-27 12:10:33,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:10:33,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 140 conjunts are in the unsatisfiable core [2022-04-27 12:10:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:10:33,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:10:34,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {30659#true} call ULTIMATE.init(); {30659#true} is VALID [2022-04-27 12:10:34,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {30659#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); {30659#true} is VALID [2022-04-27 12:10:34,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30659#true} {30659#true} #56#return; {30659#true} is VALID [2022-04-27 12:10:34,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {30659#true} call #t~ret5 := main(); {30659#true} is VALID [2022-04-27 12:10:34,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {30659#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {30679#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:10:34,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {30679#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {30679#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:10:34,529 INFO L272 TraceCheckUtils]: 7: Hoare triple {30679#(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)); {30659#true} is VALID [2022-04-27 12:10:34,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,529 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {30659#true} {30679#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {30679#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:10:34,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {30679#(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; {30701#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:10:34,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {30701#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {30701#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:10:34,530 INFO L272 TraceCheckUtils]: 14: Hoare triple {30701#(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)); {30659#true} is VALID [2022-04-27 12:10:34,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,531 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {30659#true} {30701#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {30701#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 12:10:34,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {30701#(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; {30723#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 12:10:34,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {30723#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {30723#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 12:10:34,532 INFO L272 TraceCheckUtils]: 21: Hoare triple {30723#(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)); {30659#true} is VALID [2022-04-27 12:10:34,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,532 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {30659#true} {30723#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {30723#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 12:10:34,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {30723#(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; {30745#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 12:10:34,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {30745#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {30745#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 12:10:34,533 INFO L272 TraceCheckUtils]: 28: Hoare triple {30745#(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)); {30659#true} is VALID [2022-04-27 12:10:34,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,534 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {30659#true} {30745#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #50#return; {30745#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 12:10:34,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {30745#(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; {30767#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:10:34,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {30767#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {30767#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:10:34,534 INFO L272 TraceCheckUtils]: 35: Hoare triple {30767#(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)); {30659#true} is VALID [2022-04-27 12:10:34,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,534 INFO L290 TraceCheckUtils]: 37: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,535 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30659#true} {30767#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #50#return; {30767#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 12:10:34,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {30767#(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; {30789#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:10:34,536 INFO L290 TraceCheckUtils]: 41: Hoare triple {30789#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {30789#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:10:34,536 INFO L272 TraceCheckUtils]: 42: Hoare triple {30789#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) 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)); {30659#true} is VALID [2022-04-27 12:10:34,536 INFO L290 TraceCheckUtils]: 43: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,536 INFO L290 TraceCheckUtils]: 44: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,536 INFO L290 TraceCheckUtils]: 45: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,536 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {30659#true} {30789#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #50#return; {30789#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 12:10:34,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {30789#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) 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; {30811#(and (= 4 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 12:10:34,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {30811#(and (= 4 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 3))} assume !false; {30811#(and (= 4 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 12:10:34,537 INFO L272 TraceCheckUtils]: 49: Hoare triple {30811#(and (= 4 (+ (- 2) main_~c~0)) (= (+ 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)); {30659#true} is VALID [2022-04-27 12:10:34,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,538 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {30659#true} {30811#(and (= 4 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 3))} #50#return; {30811#(and (= 4 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-27 12:10:34,538 INFO L290 TraceCheckUtils]: 54: Hoare triple {30811#(and (= 4 (+ (- 2) main_~c~0)) (= (+ 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; {30833#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 12:10:34,538 INFO L290 TraceCheckUtils]: 55: Hoare triple {30833#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !false; {30833#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 12:10:34,539 INFO L272 TraceCheckUtils]: 56: Hoare triple {30833#(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)); {30659#true} is VALID [2022-04-27 12:10:34,539 INFO L290 TraceCheckUtils]: 57: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,539 INFO L290 TraceCheckUtils]: 58: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,539 INFO L290 TraceCheckUtils]: 59: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,539 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {30659#true} {30833#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} #50#return; {30833#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-27 12:10:34,539 INFO L290 TraceCheckUtils]: 61: Hoare triple {30833#(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; {30855#(and (= 3 (+ main_~y~0 (- 5))) (= main_~c~0 8))} is VALID [2022-04-27 12:10:34,540 INFO L290 TraceCheckUtils]: 62: Hoare triple {30855#(and (= 3 (+ main_~y~0 (- 5))) (= main_~c~0 8))} assume !false; {30855#(and (= 3 (+ main_~y~0 (- 5))) (= main_~c~0 8))} is VALID [2022-04-27 12:10:34,540 INFO L272 TraceCheckUtils]: 63: Hoare triple {30855#(and (= 3 (+ main_~y~0 (- 5))) (= 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)); {30659#true} is VALID [2022-04-27 12:10:34,540 INFO L290 TraceCheckUtils]: 64: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,540 INFO L290 TraceCheckUtils]: 65: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,540 INFO L290 TraceCheckUtils]: 66: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,540 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {30659#true} {30855#(and (= 3 (+ main_~y~0 (- 5))) (= main_~c~0 8))} #50#return; {30855#(and (= 3 (+ main_~y~0 (- 5))) (= main_~c~0 8))} is VALID [2022-04-27 12:10:34,541 INFO L290 TraceCheckUtils]: 68: Hoare triple {30855#(and (= 3 (+ main_~y~0 (- 5))) (= 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; {30877#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:10:34,541 INFO L290 TraceCheckUtils]: 69: Hoare triple {30877#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {30877#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:10:34,541 INFO L272 TraceCheckUtils]: 70: Hoare triple {30877#(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)); {30659#true} is VALID [2022-04-27 12:10:34,541 INFO L290 TraceCheckUtils]: 71: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,541 INFO L290 TraceCheckUtils]: 72: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,541 INFO L290 TraceCheckUtils]: 73: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,542 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {30659#true} {30877#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {30877#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 12:10:34,542 INFO L290 TraceCheckUtils]: 75: Hoare triple {30877#(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; {30899#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 12:10:34,543 INFO L290 TraceCheckUtils]: 76: Hoare triple {30899#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {30899#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 12:10:34,543 INFO L272 TraceCheckUtils]: 77: Hoare triple {30899#(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)); {30659#true} is VALID [2022-04-27 12:10:34,543 INFO L290 TraceCheckUtils]: 78: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,543 INFO L290 TraceCheckUtils]: 79: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,543 INFO L290 TraceCheckUtils]: 80: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,543 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {30659#true} {30899#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #50#return; {30899#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-27 12:10:34,544 INFO L290 TraceCheckUtils]: 82: Hoare triple {30899#(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; {30921#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:10:34,544 INFO L290 TraceCheckUtils]: 83: Hoare triple {30921#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {30921#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:10:34,544 INFO L272 TraceCheckUtils]: 84: Hoare triple {30921#(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)); {30659#true} is VALID [2022-04-27 12:10:34,544 INFO L290 TraceCheckUtils]: 85: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,544 INFO L290 TraceCheckUtils]: 86: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,544 INFO L290 TraceCheckUtils]: 87: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,545 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {30659#true} {30921#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {30921#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-27 12:10:34,545 INFO L290 TraceCheckUtils]: 89: Hoare triple {30921#(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; {30943#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 12:10:34,545 INFO L290 TraceCheckUtils]: 90: Hoare triple {30943#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} assume !false; {30943#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 12:10:34,545 INFO L272 TraceCheckUtils]: 91: Hoare triple {30943#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 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)); {30659#true} is VALID [2022-04-27 12:10:34,545 INFO L290 TraceCheckUtils]: 92: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,545 INFO L290 TraceCheckUtils]: 93: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,546 INFO L290 TraceCheckUtils]: 94: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,546 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {30659#true} {30943#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} #50#return; {30943#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-27 12:10:34,546 INFO L290 TraceCheckUtils]: 96: Hoare triple {30943#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 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; {30965#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-27 12:10:34,547 INFO L290 TraceCheckUtils]: 97: Hoare triple {30965#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} assume !false; {30965#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-27 12:10:34,547 INFO L272 TraceCheckUtils]: 98: Hoare triple {30965#(and (= (+ main_~c~0 (- 3)) 10) (= 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)); {30659#true} is VALID [2022-04-27 12:10:34,547 INFO L290 TraceCheckUtils]: 99: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,547 INFO L290 TraceCheckUtils]: 100: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,547 INFO L290 TraceCheckUtils]: 101: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,547 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {30659#true} {30965#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} #50#return; {30965#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-27 12:10:34,548 INFO L290 TraceCheckUtils]: 103: Hoare triple {30965#(and (= (+ main_~c~0 (- 3)) 10) (= 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; {30987#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:10:34,548 INFO L290 TraceCheckUtils]: 104: Hoare triple {30987#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {30987#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:10:34,548 INFO L272 TraceCheckUtils]: 105: Hoare triple {30987#(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)); {30659#true} is VALID [2022-04-27 12:10:34,548 INFO L290 TraceCheckUtils]: 106: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,548 INFO L290 TraceCheckUtils]: 107: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,548 INFO L290 TraceCheckUtils]: 108: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,549 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {30659#true} {30987#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #50#return; {30987#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-27 12:10:34,549 INFO L290 TraceCheckUtils]: 110: Hoare triple {30987#(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; {31009#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 12:10:34,549 INFO L290 TraceCheckUtils]: 111: Hoare triple {31009#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} assume !false; {31009#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 12:10:34,549 INFO L272 TraceCheckUtils]: 112: Hoare triple {31009#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 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)); {30659#true} is VALID [2022-04-27 12:10:34,550 INFO L290 TraceCheckUtils]: 113: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,550 INFO L290 TraceCheckUtils]: 114: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,550 INFO L290 TraceCheckUtils]: 115: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,550 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {30659#true} {31009#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} #50#return; {31009#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-27 12:10:34,550 INFO L290 TraceCheckUtils]: 117: Hoare triple {31009#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 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; {31031#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 12:10:34,551 INFO L290 TraceCheckUtils]: 118: Hoare triple {31031#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} assume !false; {31031#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 12:10:34,551 INFO L272 TraceCheckUtils]: 119: Hoare triple {31031#(and (= 14 (+ (- 2) main_~c~0)) (= (+ 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)); {30659#true} is VALID [2022-04-27 12:10:34,551 INFO L290 TraceCheckUtils]: 120: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,551 INFO L290 TraceCheckUtils]: 121: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,551 INFO L290 TraceCheckUtils]: 122: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,551 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {30659#true} {31031#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} #50#return; {31031#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-27 12:10:34,552 INFO L290 TraceCheckUtils]: 124: Hoare triple {31031#(and (= 14 (+ (- 2) main_~c~0)) (= (+ 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; {31053#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 12:10:34,552 INFO L290 TraceCheckUtils]: 125: Hoare triple {31053#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {31053#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 12:10:34,552 INFO L272 TraceCheckUtils]: 126: Hoare triple {31053#(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)); {30659#true} is VALID [2022-04-27 12:10:34,552 INFO L290 TraceCheckUtils]: 127: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,552 INFO L290 TraceCheckUtils]: 128: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,552 INFO L290 TraceCheckUtils]: 129: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,553 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {30659#true} {31053#(and (= main_~c~0 17) (= main_~y~0 17))} #50#return; {31053#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-27 12:10:34,553 INFO L290 TraceCheckUtils]: 131: Hoare triple {31053#(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; {31075#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 12:10:34,554 INFO L290 TraceCheckUtils]: 132: Hoare triple {31075#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} assume !false; {31075#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 12:10:34,554 INFO L272 TraceCheckUtils]: 133: Hoare triple {31075#(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)); {30659#true} is VALID [2022-04-27 12:10:34,554 INFO L290 TraceCheckUtils]: 134: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,554 INFO L290 TraceCheckUtils]: 135: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,554 INFO L290 TraceCheckUtils]: 136: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,554 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {30659#true} {31075#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} #50#return; {31075#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-27 12:10:34,555 INFO L290 TraceCheckUtils]: 138: Hoare triple {31075#(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; {31097#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-27 12:10:34,555 INFO L290 TraceCheckUtils]: 139: Hoare triple {31097#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !false; {31097#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-27 12:10:34,555 INFO L272 TraceCheckUtils]: 140: Hoare triple {31097#(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)); {30659#true} is VALID [2022-04-27 12:10:34,555 INFO L290 TraceCheckUtils]: 141: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,555 INFO L290 TraceCheckUtils]: 142: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,555 INFO L290 TraceCheckUtils]: 143: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,556 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {30659#true} {31097#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} #50#return; {31097#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-27 12:10:34,556 INFO L290 TraceCheckUtils]: 145: Hoare triple {31097#(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; {31119#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-27 12:10:34,556 INFO L290 TraceCheckUtils]: 146: Hoare triple {31119#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !false; {31119#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-27 12:10:34,556 INFO L272 TraceCheckUtils]: 147: Hoare triple {31119#(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)); {30659#true} is VALID [2022-04-27 12:10:34,556 INFO L290 TraceCheckUtils]: 148: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,556 INFO L290 TraceCheckUtils]: 149: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,557 INFO L290 TraceCheckUtils]: 150: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,557 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {30659#true} {31119#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} #50#return; {31119#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-27 12:10:34,557 INFO L290 TraceCheckUtils]: 152: Hoare triple {31119#(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; {31141#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:10:34,558 INFO L290 TraceCheckUtils]: 153: Hoare triple {31141#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} assume !false; {31141#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:10:34,558 INFO L272 TraceCheckUtils]: 154: Hoare triple {31141#(and (= 19 (+ (- 2) main_~c~0)) (= 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)); {30659#true} is VALID [2022-04-27 12:10:34,558 INFO L290 TraceCheckUtils]: 155: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,558 INFO L290 TraceCheckUtils]: 156: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,558 INFO L290 TraceCheckUtils]: 157: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,558 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {30659#true} {31141#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} #50#return; {31141#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:10:34,559 INFO L290 TraceCheckUtils]: 159: Hoare triple {31141#(and (= 19 (+ (- 2) main_~c~0)) (= 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; {31163#(and (= main_~y~0 22) (= 19 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 12:10:34,559 INFO L290 TraceCheckUtils]: 160: Hoare triple {31163#(and (= main_~y~0 22) (= 19 (+ main_~c~0 (- 3))))} assume !false; {31163#(and (= main_~y~0 22) (= 19 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 12:10:34,559 INFO L272 TraceCheckUtils]: 161: Hoare triple {31163#(and (= main_~y~0 22) (= 19 (+ 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)); {30659#true} is VALID [2022-04-27 12:10:34,559 INFO L290 TraceCheckUtils]: 162: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,559 INFO L290 TraceCheckUtils]: 163: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,559 INFO L290 TraceCheckUtils]: 164: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,560 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {30659#true} {31163#(and (= main_~y~0 22) (= 19 (+ main_~c~0 (- 3))))} #50#return; {31163#(and (= main_~y~0 22) (= 19 (+ main_~c~0 (- 3))))} is VALID [2022-04-27 12:10:34,560 INFO L290 TraceCheckUtils]: 166: Hoare triple {31163#(and (= main_~y~0 22) (= 19 (+ 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; {31185#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-27 12:10:34,560 INFO L290 TraceCheckUtils]: 167: Hoare triple {31185#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {31185#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-27 12:10:34,560 INFO L272 TraceCheckUtils]: 168: Hoare triple {31185#(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)); {30659#true} is VALID [2022-04-27 12:10:34,560 INFO L290 TraceCheckUtils]: 169: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,561 INFO L290 TraceCheckUtils]: 170: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,561 INFO L290 TraceCheckUtils]: 171: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,561 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {30659#true} {31185#(and (= 23 main_~y~0) (= 23 main_~c~0))} #50#return; {31185#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-27 12:10:34,561 INFO L290 TraceCheckUtils]: 173: Hoare triple {31185#(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; {31207#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 12:10:34,562 INFO L290 TraceCheckUtils]: 174: Hoare triple {31207#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {31207#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 12:10:34,562 INFO L272 TraceCheckUtils]: 175: Hoare triple {31207#(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)); {30659#true} is VALID [2022-04-27 12:10:34,562 INFO L290 TraceCheckUtils]: 176: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,562 INFO L290 TraceCheckUtils]: 177: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,562 INFO L290 TraceCheckUtils]: 178: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,562 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {30659#true} {31207#(and (= main_~c~0 24) (= main_~y~0 24))} #50#return; {31207#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-27 12:10:34,563 INFO L290 TraceCheckUtils]: 180: Hoare triple {31207#(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; {31229#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 12:10:34,563 INFO L290 TraceCheckUtils]: 181: Hoare triple {31229#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !false; {31229#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 12:10:34,563 INFO L272 TraceCheckUtils]: 182: Hoare triple {31229#(and (= main_~c~0 25) (= (+ (- 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)); {30659#true} is VALID [2022-04-27 12:10:34,563 INFO L290 TraceCheckUtils]: 183: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,563 INFO L290 TraceCheckUtils]: 184: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,563 INFO L290 TraceCheckUtils]: 185: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,564 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {30659#true} {31229#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} #50#return; {31229#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-27 12:10:34,564 INFO L290 TraceCheckUtils]: 187: Hoare triple {31229#(and (= main_~c~0 25) (= (+ (- 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; {31251#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-27 12:10:34,564 INFO L290 TraceCheckUtils]: 188: Hoare triple {31251#(and (= main_~c~0 26) (= main_~y~0 26))} assume !false; {31251#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-27 12:10:34,564 INFO L272 TraceCheckUtils]: 189: Hoare triple {31251#(and (= main_~c~0 26) (= 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)); {30659#true} is VALID [2022-04-27 12:10:34,565 INFO L290 TraceCheckUtils]: 190: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,565 INFO L290 TraceCheckUtils]: 191: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,565 INFO L290 TraceCheckUtils]: 192: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,565 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {30659#true} {31251#(and (= main_~c~0 26) (= main_~y~0 26))} #50#return; {31251#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-27 12:10:34,565 INFO L290 TraceCheckUtils]: 194: Hoare triple {31251#(and (= main_~c~0 26) (= 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; {31273#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-27 12:10:34,566 INFO L290 TraceCheckUtils]: 195: Hoare triple {31273#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} assume !false; {31273#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-27 12:10:34,566 INFO L272 TraceCheckUtils]: 196: Hoare triple {31273#(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)); {30659#true} is VALID [2022-04-27 12:10:34,566 INFO L290 TraceCheckUtils]: 197: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,566 INFO L290 TraceCheckUtils]: 198: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,566 INFO L290 TraceCheckUtils]: 199: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,566 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {30659#true} {31273#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} #50#return; {31273#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-27 12:10:34,567 INFO L290 TraceCheckUtils]: 201: Hoare triple {31273#(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; {31295#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-27 12:10:34,567 INFO L290 TraceCheckUtils]: 202: Hoare triple {31295#(and (= main_~c~0 28) (= main_~y~0 28))} assume !false; {31295#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-27 12:10:34,567 INFO L272 TraceCheckUtils]: 203: Hoare triple {31295#(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)); {30659#true} is VALID [2022-04-27 12:10:34,567 INFO L290 TraceCheckUtils]: 204: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,567 INFO L290 TraceCheckUtils]: 205: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,567 INFO L290 TraceCheckUtils]: 206: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,568 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {30659#true} {31295#(and (= main_~c~0 28) (= main_~y~0 28))} #50#return; {31295#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-27 12:10:34,568 INFO L290 TraceCheckUtils]: 208: Hoare triple {31295#(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; {31317#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} is VALID [2022-04-27 12:10:34,569 INFO L290 TraceCheckUtils]: 209: Hoare triple {31317#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} assume !false; {31317#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} is VALID [2022-04-27 12:10:34,569 INFO L272 TraceCheckUtils]: 210: Hoare triple {31317#(and (= 28 (+ (- 1) 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)); {30659#true} is VALID [2022-04-27 12:10:34,569 INFO L290 TraceCheckUtils]: 211: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,569 INFO L290 TraceCheckUtils]: 212: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,569 INFO L290 TraceCheckUtils]: 213: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,569 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {30659#true} {31317#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} #50#return; {31317#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} is VALID [2022-04-27 12:10:34,570 INFO L290 TraceCheckUtils]: 215: Hoare triple {31317#(and (= 28 (+ (- 1) 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; {31339#(and (= (+ (- 1) main_~c~0) 29) (= (+ (- 2) main_~y~0) 28))} is VALID [2022-04-27 12:10:34,570 INFO L290 TraceCheckUtils]: 216: Hoare triple {31339#(and (= (+ (- 1) main_~c~0) 29) (= (+ (- 2) main_~y~0) 28))} assume !false; {31339#(and (= (+ (- 1) main_~c~0) 29) (= (+ (- 2) main_~y~0) 28))} is VALID [2022-04-27 12:10:34,570 INFO L272 TraceCheckUtils]: 217: Hoare triple {31339#(and (= (+ (- 1) main_~c~0) 29) (= (+ (- 2) 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)); {30659#true} is VALID [2022-04-27 12:10:34,570 INFO L290 TraceCheckUtils]: 218: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,570 INFO L290 TraceCheckUtils]: 219: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,570 INFO L290 TraceCheckUtils]: 220: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,571 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {30659#true} {31339#(and (= (+ (- 1) main_~c~0) 29) (= (+ (- 2) main_~y~0) 28))} #50#return; {31339#(and (= (+ (- 1) main_~c~0) 29) (= (+ (- 2) main_~y~0) 28))} is VALID [2022-04-27 12:10:34,571 INFO L290 TraceCheckUtils]: 222: Hoare triple {31339#(and (= (+ (- 1) main_~c~0) 29) (= (+ (- 2) 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; {31361#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-27 12:10:34,572 INFO L290 TraceCheckUtils]: 223: Hoare triple {31361#(and (= main_~y~0 31) (= main_~c~0 31))} assume !false; {31361#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-27 12:10:34,572 INFO L272 TraceCheckUtils]: 224: Hoare triple {31361#(and (= main_~y~0 31) (= main_~c~0 31))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {30659#true} is VALID [2022-04-27 12:10:34,572 INFO L290 TraceCheckUtils]: 225: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,572 INFO L290 TraceCheckUtils]: 226: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,572 INFO L290 TraceCheckUtils]: 227: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,572 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {30659#true} {31361#(and (= main_~y~0 31) (= main_~c~0 31))} #50#return; {31361#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-27 12:10:34,573 INFO L290 TraceCheckUtils]: 229: Hoare triple {31361#(and (= main_~y~0 31) (= main_~c~0 31))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31383#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:10:34,573 INFO L290 TraceCheckUtils]: 230: Hoare triple {31383#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} assume !false; {31383#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:10:34,573 INFO L272 TraceCheckUtils]: 231: Hoare triple {31383#(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)); {30659#true} is VALID [2022-04-27 12:10:34,573 INFO L290 TraceCheckUtils]: 232: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,573 INFO L290 TraceCheckUtils]: 233: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,574 INFO L290 TraceCheckUtils]: 234: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,574 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {30659#true} {31383#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} #50#return; {31383#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 12:10:34,574 INFO L290 TraceCheckUtils]: 236: Hoare triple {31383#(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; {31405#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-27 12:10:34,575 INFO L290 TraceCheckUtils]: 237: Hoare triple {31405#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} assume !false; {31405#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-27 12:10:34,575 INFO L272 TraceCheckUtils]: 238: Hoare triple {31405#(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)); {30659#true} is VALID [2022-04-27 12:10:34,575 INFO L290 TraceCheckUtils]: 239: Hoare triple {30659#true} ~cond := #in~cond; {30659#true} is VALID [2022-04-27 12:10:34,575 INFO L290 TraceCheckUtils]: 240: Hoare triple {30659#true} assume !(0 == ~cond); {30659#true} is VALID [2022-04-27 12:10:34,575 INFO L290 TraceCheckUtils]: 241: Hoare triple {30659#true} assume true; {30659#true} is VALID [2022-04-27 12:10:34,576 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {30659#true} {31405#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} #50#return; {31405#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-27 12:10:34,578 INFO L290 TraceCheckUtils]: 243: Hoare triple {31405#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} assume !(~c~0 < ~k~0); {31427#(and (= (+ (- 2) main_~y~0) 31) (<= main_~k~0 33) (< 32 main_~k~0))} is VALID [2022-04-27 12:10:34,578 INFO L272 TraceCheckUtils]: 244: Hoare triple {31427#(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)); {31431#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:10:34,579 INFO L290 TraceCheckUtils]: 245: Hoare triple {31431#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31435#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:10:34,579 INFO L290 TraceCheckUtils]: 246: Hoare triple {31435#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {30660#false} is VALID [2022-04-27 12:10:34,579 INFO L290 TraceCheckUtils]: 247: Hoare triple {30660#false} assume !false; {30660#false} is VALID [2022-04-27 12:10:34,580 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 12:10:34,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:10:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:10:35,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513465217] [2022-04-27 12:10:35,026 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:10:35,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628728140] [2022-04-27 12:10:35,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628728140] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:10:35,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:10:35,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2022-04-27 12:10:35,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94910124] [2022-04-27 12:10:35,027 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:10:35,027 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 36 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Word has length 248 [2022-04-27 12:10:35,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:10:35,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 36 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 12:10:35,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:10:35,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-27 12:10:35,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:10:35,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-27 12:10:35,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 12:10:35,648 INFO L87 Difference]: Start difference. First operand 121 states and 153 transitions. Second operand has 39 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 36 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35)