/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/ps4-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:33:13,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:33:13,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:33:13,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:33:13,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:33:13,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:33:13,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:33:13,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:33:13,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:33:13,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:33:13,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:33:13,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:33:13,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:33:13,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:33:13,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:33:13,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:33:13,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:33:13,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:33:13,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:33:13,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:33:13,343 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:33:13,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:33:13,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:33:13,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:33:13,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:33:13,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:33:13,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:33:13,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:33:13,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:33:13,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:33:13,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:33:13,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:33:13,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:33:13,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:33:13,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:33:13,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:33:13,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:33:13,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:33:13,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:33:13,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:33:13,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:33:13,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:33:13,363 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:33:13,373 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:33:13,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:33:13,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:33:13,374 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:33:13,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:33:13,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:33:13,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:33:13,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:33:13,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:33:13,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:33:13,376 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:33:13,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:33:13,376 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:33:13,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:33:13,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:33:13,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:33:13,377 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:33:13,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:33:13,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:33:13,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:33:13,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:33:13,377 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:33:13,377 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:33:13,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:33:13,378 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:33:13,378 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 04:33:13,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:33:13,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:33:13,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:33:13,639 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:33:13,641 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:33:13,642 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-08 04:33:13,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d281b56/89250bf9c87b4aed965e16cebe839c87/FLAG441771085 [2022-04-08 04:33:14,098 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:33:14,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps4-ll.c [2022-04-08 04:33:14,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d281b56/89250bf9c87b4aed965e16cebe839c87/FLAG441771085 [2022-04-08 04:33:14,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d281b56/89250bf9c87b4aed965e16cebe839c87 [2022-04-08 04:33:14,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:33:14,128 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:33:14,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:33:14,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:33:14,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:33:14,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:33:14" (1/1) ... [2022-04-08 04:33:14,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@114f14c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:14, skipping insertion in model container [2022-04-08 04:33:14,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:33:14" (1/1) ... [2022-04-08 04:33:14,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:33:14,181 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:33:14,310 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-08 04:33:14,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:33:14,332 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:33:14,341 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-08 04:33:14,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:33:14,358 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:33:14,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:14 WrapperNode [2022-04-08 04:33:14,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:33:14,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:33:14,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:33:14,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:33:14,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:14" (1/1) ... [2022-04-08 04:33:14,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:14" (1/1) ... [2022-04-08 04:33:14,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:14" (1/1) ... [2022-04-08 04:33:14,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:14" (1/1) ... [2022-04-08 04:33:14,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:14" (1/1) ... [2022-04-08 04:33:14,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:14" (1/1) ... [2022-04-08 04:33:14,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:14" (1/1) ... [2022-04-08 04:33:14,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:33:14,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:33:14,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:33:14,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:33:14,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:14" (1/1) ... [2022-04-08 04:33:14,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:33:14,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:14,416 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-08 04:33:14,418 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-08 04:33:14,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:33:14,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:33:14,454 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:33:14,455 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:33:14,455 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:33:14,455 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:33:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:33:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:33:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:33:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:33:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 04:33:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:33:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:33:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:33:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:33:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:33:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:33:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:33:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:33:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:33:14,510 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:33:14,513 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:33:14,674 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:33:14,686 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:33:14,686 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:33:14,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:33:14 BoogieIcfgContainer [2022-04-08 04:33:14,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:33:14,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:33:14,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:33:14,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:33:14,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:33:14" (1/3) ... [2022-04-08 04:33:14,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2422f612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:33:14, skipping insertion in model container [2022-04-08 04:33:14,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:14" (2/3) ... [2022-04-08 04:33:14,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2422f612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:33:14, skipping insertion in model container [2022-04-08 04:33:14,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:33:14" (3/3) ... [2022-04-08 04:33:14,708 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll.c [2022-04-08 04:33:14,712 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:33:14,726 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:33:14,791 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:33:14,796 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 04:33:14,796 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:33:14,838 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-08 04:33:14,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 04:33:14,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:14,845 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:14,845 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:14,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:14,855 INFO L85 PathProgramCache]: Analyzing trace with hash -973133132, now seen corresponding path program 1 times [2022-04-08 04:33:14,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:14,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1922978455] [2022-04-08 04:33:14,872 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:33:14,873 INFO L85 PathProgramCache]: Analyzing trace with hash -973133132, now seen corresponding path program 2 times [2022-04-08 04:33:14,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:14,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031025718] [2022-04-08 04:33:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:14,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:33:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:15,083 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-08 04:33:15,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 04:33:15,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-08 04:33:15,085 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-08 04:33:15,086 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-08 04:33:15,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 04:33:15,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-08 04:33:15,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-08 04:33:15,087 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-08 04:33:15,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume false; {26#false} is VALID [2022-04-08 04:33:15,089 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-08 04:33:15,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-08 04:33:15,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-08 04:33:15,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-08 04:33:15,090 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-08 04:33:15,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:15,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031025718] [2022-04-08 04:33:15,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031025718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:15,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:15,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:33:15,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:15,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1922978455] [2022-04-08 04:33:15,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1922978455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:15,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:15,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:33:15,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654261343] [2022-04-08 04:33:15,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:15,102 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-08 04:33:15,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:15,106 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-08 04:33:15,126 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-08 04:33:15,126 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:33:15,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:15,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:33:15,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:33:15,157 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-08 04:33:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:15,309 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-04-08 04:33:15,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:33:15,310 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-08 04:33:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:15,314 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-08 04:33:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-08 04:33:15,326 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-08 04:33:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-08 04:33:15,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-04-08 04:33:15,418 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-08 04:33:15,427 INFO L225 Difference]: With dead ends: 38 [2022-04-08 04:33:15,428 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 04:33:15,432 INFO L912 BasicCegarLoop]: 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-08 04:33:15,437 INFO L913 BasicCegarLoop]: 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-08 04:33:15,438 INFO L914 BasicCegarLoop]: 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-08 04:33:15,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 04:33:15,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 04:33:15,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:15,480 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-08 04:33:15,481 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-08 04:33:15,481 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-08 04:33:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:15,484 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 04:33:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 04:33:15,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:15,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:15,485 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-08 04:33:15,485 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-08 04:33:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:15,488 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 04:33:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 04:33:15,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:15,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:15,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:15,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:15,489 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-08 04:33:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-08 04:33:15,496 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-08 04:33:15,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:15,497 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-08 04:33:15,497 INFO L479 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-08 04:33:15,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-08 04:33:15,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:33:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 04:33:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 04:33:15,534 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:15,534 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:15,534 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:33:15,534 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:15,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:15,535 INFO L85 PathProgramCache]: Analyzing trace with hash -971345672, now seen corresponding path program 1 times [2022-04-08 04:33:15,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:15,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [765525273] [2022-04-08 04:33:15,538 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:33:15,538 INFO L85 PathProgramCache]: Analyzing trace with hash -971345672, now seen corresponding path program 2 times [2022-04-08 04:33:15,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:15,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49437494] [2022-04-08 04:33:15,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:15,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:15,552 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:33:15,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1900602886] [2022-04-08 04:33:15,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:33:15,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:33:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:15,555 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-08 04:33:15,556 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-08 04:33:15,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:33:15,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:33:15,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 04:33:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:15,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:33:15,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {177#true} call ULTIMATE.init(); {177#true} is VALID [2022-04-08 04:33:15,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#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); {177#true} is VALID [2022-04-08 04:33:15,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#true} assume true; {177#true} is VALID [2022-04-08 04:33:15,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} #56#return; {177#true} is VALID [2022-04-08 04:33:15,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {177#true} call #t~ret5 := main(); {177#true} is VALID [2022-04-08 04:33:15,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#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; {197#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:15,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {197#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {197#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:15,710 INFO L272 TraceCheckUtils]: 7: Hoare triple {197#(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)); {204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:15,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:15,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {178#false} is VALID [2022-04-08 04:33:15,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {178#false} assume !false; {178#false} is VALID [2022-04-08 04:33:15,711 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-08 04:33:15,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:33:15,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:15,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49437494] [2022-04-08 04:33:15,712 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:33:15,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900602886] [2022-04-08 04:33:15,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900602886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:15,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:15,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:33:15,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:15,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [765525273] [2022-04-08 04:33:15,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [765525273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:15,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:15,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:33:15,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503442342] [2022-04-08 04:33:15,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:15,715 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-08 04:33:15,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:15,715 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-08 04:33:15,725 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-08 04:33:15,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:33:15,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:15,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:33:15,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:33:15,726 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-08 04:33:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:34,115 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-08 04:33:34,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:33:34,116 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-08 04:33:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:34,116 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-08 04:33:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 04:33:34,118 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-08 04:33:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 04:33:34,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 04:33:34,157 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-08 04:33:34,159 INFO L225 Difference]: With dead ends: 28 [2022-04-08 04:33:34,159 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 04:33:34,160 INFO L912 BasicCegarLoop]: 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-08 04:33:34,162 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:33:34,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 54 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:33:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 04:33:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 04:33:34,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:34,184 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-08 04:33:34,185 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-08 04:33:34,185 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-08 04:33:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:34,192 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-08 04:33:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-08 04:33:34,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:34,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:34,193 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-08 04:33:34,195 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-08 04:33:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:34,197 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-08 04:33:34,197 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-08 04:33:34,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:34,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:34,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:34,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:34,198 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-08 04:33:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-08 04:33:34,199 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 11 [2022-04-08 04:33:34,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:34,199 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-08 04:33:34,200 INFO L479 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-08 04:33:34,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-08 04:33:34,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:33:34,232 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-08 04:33:34,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 04:33:34,233 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:34,234 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:34,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 04:33:34,439 WARN L460 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-08 04:33:34,440 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:34,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:34,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1679137237, now seen corresponding path program 1 times [2022-04-08 04:33:34,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:34,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1106981802] [2022-04-08 04:33:34,629 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:33:34,630 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:33:34,630 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:33:34,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1679137237, now seen corresponding path program 2 times [2022-04-08 04:33:34,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:34,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098925804] [2022-04-08 04:33:34,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:34,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:34,640 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:33:34,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [341078860] [2022-04-08 04:33:34,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:33:34,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:33:34,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:34,642 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-08 04:33:34,643 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-08 04:33:34,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:33:34,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:33:34,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 04:33:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:34,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:33:34,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {368#true} is VALID [2022-04-08 04:33:34,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#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); {368#true} is VALID [2022-04-08 04:33:34,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-08 04:33:34,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {368#true} {368#true} #56#return; {368#true} is VALID [2022-04-08 04:33:34,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {368#true} call #t~ret5 := main(); {368#true} is VALID [2022-04-08 04:33:34,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#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; {388#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:34,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {388#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {388#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:34,812 INFO L272 TraceCheckUtils]: 7: Hoare triple {388#(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)); {368#true} is VALID [2022-04-08 04:33:34,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {368#true} ~cond := #in~cond; {368#true} is VALID [2022-04-08 04:33:34,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#true} assume !(0 == ~cond); {368#true} is VALID [2022-04-08 04:33:34,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-08 04:33:34,813 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {368#true} {388#(and (= main_~x~0 0) (= main_~y~0 0))} #50#return; {388#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:34,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {388#(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; {410#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 04:33:34,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {410#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {410#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 04:33:34,816 INFO L272 TraceCheckUtils]: 14: Hoare triple {410#(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)); {417#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:34,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {417#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {421#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:34,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {421#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {369#false} is VALID [2022-04-08 04:33:34,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {369#false} assume !false; {369#false} is VALID [2022-04-08 04:33:34,818 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-08 04:33:34,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:33:35,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {369#false} assume !false; {369#false} is VALID [2022-04-08 04:33:35,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {421#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {369#false} is VALID [2022-04-08 04:33:35,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {417#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {421#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:35,132 INFO L272 TraceCheckUtils]: 14: Hoare triple {437#(= (+ (* 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)); {417#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:35,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {437#(= (+ (* 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; {437#(= (+ (* 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-08 04:33:35,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {437#(= (+ (* 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; {437#(= (+ (* 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-08 04:33:35,147 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {368#true} {437#(= (+ (* 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; {437#(= (+ (* 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-08 04:33:35,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-08 04:33:35,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#true} assume !(0 == ~cond); {368#true} is VALID [2022-04-08 04:33:35,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {368#true} ~cond := #in~cond; {368#true} is VALID [2022-04-08 04:33:35,148 INFO L272 TraceCheckUtils]: 7: Hoare triple {437#(= (+ (* 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)); {368#true} is VALID [2022-04-08 04:33:35,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#(= (+ (* 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; {437#(= (+ (* 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-08 04:33:35,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#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; {437#(= (+ (* 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-08 04:33:35,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {368#true} call #t~ret5 := main(); {368#true} is VALID [2022-04-08 04:33:35,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {368#true} {368#true} #56#return; {368#true} is VALID [2022-04-08 04:33:35,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-08 04:33:35,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#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); {368#true} is VALID [2022-04-08 04:33:35,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {368#true} is VALID [2022-04-08 04:33:35,152 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-08 04:33:35,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:35,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098925804] [2022-04-08 04:33:35,152 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:33:35,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341078860] [2022-04-08 04:33:35,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341078860] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 04:33:35,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:33:35,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 04:33:35,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:35,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1106981802] [2022-04-08 04:33:35,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1106981802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:35,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:35,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:33:35,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185508801] [2022-04-08 04:33:35,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:35,154 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-08 04:33:35,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:35,155 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-08 04:33:35,181 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-08 04:33:35,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:33:35,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:35,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:33:35,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 04:33:35,182 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-08 04:33:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:35,295 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-08 04:33:35,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:33:35,295 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-08 04:33:35,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:35,296 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-08 04:33:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-08 04:33:35,299 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-08 04:33:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-08 04:33:35,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-08 04:33:35,334 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-08 04:33:35,336 INFO L225 Difference]: With dead ends: 30 [2022-04-08 04:33:35,336 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 04:33:35,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 04:33:35,337 INFO L913 BasicCegarLoop]: 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-08 04:33:35,337 INFO L914 BasicCegarLoop]: 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-08 04:33:35,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 04:33:35,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 04:33:35,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:35,355 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-08 04:33:35,356 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-08 04:33:35,357 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-08 04:33:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:35,362 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 04:33:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 04:33:35,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:35,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:35,363 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-08 04:33:35,363 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-08 04:33:35,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:35,366 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 04:33:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 04:33:35,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:35,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:35,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:35,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:35,368 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-08 04:33:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-08 04:33:35,370 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 18 [2022-04-08 04:33:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:35,370 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-08 04:33:35,370 INFO L479 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-08 04:33:35,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-08 04:33:35,421 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-08 04:33:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 04:33:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 04:33:35,422 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:35,423 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:35,443 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-08 04:33:35,631 WARN L460 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-08 04:33:35,632 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:35,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1991962395, now seen corresponding path program 1 times [2022-04-08 04:33:35,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:35,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1915170561] [2022-04-08 04:33:35,766 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:33:35,766 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:33:35,766 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:33:35,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1991962395, now seen corresponding path program 2 times [2022-04-08 04:33:35,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:35,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111495154] [2022-04-08 04:33:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:35,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:35,799 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:33:35,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1666597051] [2022-04-08 04:33:35,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:33:35,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:33:35,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:35,804 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-08 04:33:35,815 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-08 04:33:35,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:33:35,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:33:35,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 04:33:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:35,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:33:36,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2022-04-08 04:33:36,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {644#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); {644#true} is VALID [2022-04-08 04:33:36,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2022-04-08 04:33:36,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #56#return; {644#true} is VALID [2022-04-08 04:33:36,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret5 := main(); {644#true} is VALID [2022-04-08 04:33:36,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {644#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; {664#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:36,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {664#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {664#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:36,120 INFO L272 TraceCheckUtils]: 7: Hoare triple {664#(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)); {644#true} is VALID [2022-04-08 04:33:36,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {644#true} ~cond := #in~cond; {644#true} is VALID [2022-04-08 04:33:36,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {644#true} assume !(0 == ~cond); {644#true} is VALID [2022-04-08 04:33:36,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {644#true} assume true; {644#true} is VALID [2022-04-08 04:33:36,120 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {644#true} {664#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {664#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:36,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {664#(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; {686#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 04:33:36,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {686#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {686#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 04:33:36,121 INFO L272 TraceCheckUtils]: 14: Hoare triple {686#(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)); {644#true} is VALID [2022-04-08 04:33:36,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {644#true} ~cond := #in~cond; {644#true} is VALID [2022-04-08 04:33:36,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {644#true} assume !(0 == ~cond); {644#true} is VALID [2022-04-08 04:33:36,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {644#true} assume true; {644#true} is VALID [2022-04-08 04:33:36,122 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {644#true} {686#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} #50#return; {686#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 04:33:36,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {686#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {708#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 04:33:36,124 INFO L272 TraceCheckUtils]: 20: Hoare triple {708#(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)); {712#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:36,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {712#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {716#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:36,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {716#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {645#false} is VALID [2022-04-08 04:33:36,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {645#false} assume !false; {645#false} is VALID [2022-04-08 04:33:36,125 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-08 04:33:36,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:33:36,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:36,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111495154] [2022-04-08 04:33:36,513 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:33:36,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666597051] [2022-04-08 04:33:36,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666597051] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:33:36,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:33:36,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 04:33:36,513 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:36,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1915170561] [2022-04-08 04:33:36,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1915170561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:36,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:36,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 04:33:36,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382182888] [2022-04-08 04:33:36,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:36,514 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-08 04:33:36,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:36,515 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-08 04:33:36,545 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-08 04:33:36,546 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 04:33:36,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:36,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 04:33:36,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 04:33:36,547 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-08 04:33:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:36,731 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-08 04:33:36,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 04:33:36,732 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-08 04:33:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:36,732 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-08 04:33:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-08 04:33:36,733 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-08 04:33:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-08 04:33:36,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2022-04-08 04:33:36,760 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-08 04:33:36,762 INFO L225 Difference]: With dead ends: 33 [2022-04-08 04:33:36,762 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 04:33:36,763 INFO L912 BasicCegarLoop]: 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-08 04:33:36,763 INFO L913 BasicCegarLoop]: 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-08 04:33:36,764 INFO L914 BasicCegarLoop]: 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-08 04:33:36,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 04:33:36,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 04:33:36,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:36,787 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-08 04:33:36,787 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-08 04:33:36,788 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-08 04:33:36,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:36,789 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-04-08 04:33:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-08 04:33:36,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:36,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:36,790 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-08 04:33:36,790 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-08 04:33:36,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:36,791 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-04-08 04:33:36,791 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-08 04:33:36,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:36,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:36,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:36,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:36,792 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-08 04:33:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-04-08 04:33:36,793 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2022-04-08 04:33:36,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:36,818 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-04-08 04:33:36,819 INFO L479 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-08 04:33:36,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2022-04-08 04:33:36,865 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-08 04:33:36,865 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-08 04:33:36,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 04:33:36,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:36,866 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:36,882 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-08 04:33:37,067 WARN L460 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-08 04:33:37,067 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:37,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:37,067 INFO L85 PathProgramCache]: Analyzing trace with hash 486172306, now seen corresponding path program 3 times [2022-04-08 04:33:37,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:37,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1795845751] [2022-04-08 04:33:37,195 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:33:37,195 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:33:37,195 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:33:37,195 INFO L85 PathProgramCache]: Analyzing trace with hash 486172306, now seen corresponding path program 4 times [2022-04-08 04:33:37,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:37,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557756759] [2022-04-08 04:33:37,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:37,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:37,205 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:33:37,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1121402190] [2022-04-08 04:33:37,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:33:37,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:33:37,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:37,207 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-08 04:33:37,223 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-08 04:33:37,258 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:33:37,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:33:37,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 04:33:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:37,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:33:37,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {946#true} call ULTIMATE.init(); {946#true} is VALID [2022-04-08 04:33:37,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {946#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); {946#true} is VALID [2022-04-08 04:33:37,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {946#true} assume true; {946#true} is VALID [2022-04-08 04:33:37,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {946#true} {946#true} #56#return; {946#true} is VALID [2022-04-08 04:33:37,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {946#true} call #t~ret5 := main(); {946#true} is VALID [2022-04-08 04:33:37,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {946#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; {966#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:37,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {966#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {966#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:37,582 INFO L272 TraceCheckUtils]: 7: Hoare triple {966#(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)); {946#true} is VALID [2022-04-08 04:33:37,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {946#true} ~cond := #in~cond; {946#true} is VALID [2022-04-08 04:33:37,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {946#true} assume !(0 == ~cond); {946#true} is VALID [2022-04-08 04:33:37,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {946#true} assume true; {946#true} is VALID [2022-04-08 04:33:37,583 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {946#true} {966#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {966#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:37,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {966#(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; {988#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:33:37,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {988#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {988#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:33:37,585 INFO L272 TraceCheckUtils]: 14: Hoare triple {988#(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)); {946#true} is VALID [2022-04-08 04:33:37,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {946#true} ~cond := #in~cond; {946#true} is VALID [2022-04-08 04:33:37,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {946#true} assume !(0 == ~cond); {946#true} is VALID [2022-04-08 04:33:37,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {946#true} assume true; {946#true} is VALID [2022-04-08 04:33:37,586 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {946#true} {988#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {988#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:33:37,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {988#(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; {1010#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 04:33:37,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {1010#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !false; {1010#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 04:33:37,587 INFO L272 TraceCheckUtils]: 21: Hoare triple {1010#(and (= main_~y~0 2) (< 1 main_~k~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)); {946#true} is VALID [2022-04-08 04:33:37,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#true} ~cond := #in~cond; {946#true} is VALID [2022-04-08 04:33:37,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {946#true} assume !(0 == ~cond); {946#true} is VALID [2022-04-08 04:33:37,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {946#true} assume true; {946#true} is VALID [2022-04-08 04:33:37,588 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {946#true} {1010#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #50#return; {1010#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 04:33:37,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {1010#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1032#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 04:33:37,589 INFO L272 TraceCheckUtils]: 27: Hoare triple {1032#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:37,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {1036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:37,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {1040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {947#false} is VALID [2022-04-08 04:33:37,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {947#false} assume !false; {947#false} is VALID [2022-04-08 04:33:37,591 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-08 04:33:37,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:33:37,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:37,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557756759] [2022-04-08 04:33:37,922 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:33:37,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121402190] [2022-04-08 04:33:37,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121402190] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:33:37,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:33:37,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 04:33:37,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:37,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1795845751] [2022-04-08 04:33:37,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1795845751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:37,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:37,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:33:37,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051293029] [2022-04-08 04:33:37,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:37,924 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-08 04:33:37,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:37,925 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-08 04:33:37,948 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-08 04:33:37,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 04:33:37,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:37,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 04:33:37,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 04:33:37,949 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-08 04:33:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:38,341 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 04:33:38,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 04:33:38,342 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-08 04:33:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:38,342 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-08 04:33:38,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-04-08 04:33:38,343 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-08 04:33:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-04-08 04:33:38,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 34 transitions. [2022-04-08 04:33:38,375 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-08 04:33:38,376 INFO L225 Difference]: With dead ends: 36 [2022-04-08 04:33:38,376 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 04:33:38,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-08 04:33:38,377 INFO L913 BasicCegarLoop]: 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-08 04:33:38,378 INFO L914 BasicCegarLoop]: 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-08 04:33:38,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 04:33:38,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 04:33:38,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:38,400 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-08 04:33:38,400 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-08 04:33:38,400 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-08 04:33:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:38,402 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-08 04:33:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 04:33:38,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:38,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:38,402 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-08 04:33:38,403 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-08 04:33:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:38,404 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-08 04:33:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 04:33:38,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:38,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:38,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:38,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:38,405 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-08 04:33:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-08 04:33:38,406 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 31 [2022-04-08 04:33:38,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:38,407 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-08 04:33:38,407 INFO L479 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-08 04:33:38,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-08 04:33:38,510 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-08 04:33:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 04:33:38,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 04:33:38,511 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:38,511 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:38,532 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-08 04:33:38,711 WARN L460 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-08 04:33:38,712 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:38,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:38,712 INFO L85 PathProgramCache]: Analyzing trace with hash -625556411, now seen corresponding path program 5 times [2022-04-08 04:33:38,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:38,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1100884292] [2022-04-08 04:33:38,819 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:33:38,820 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:33:38,820 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:33:38,820 INFO L85 PathProgramCache]: Analyzing trace with hash -625556411, now seen corresponding path program 6 times [2022-04-08 04:33:38,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:38,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462059672] [2022-04-08 04:33:38,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:38,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:38,831 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:33:38,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [615668870] [2022-04-08 04:33:38,832 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:33:38,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:33:38,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:38,833 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-08 04:33:38,856 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-08 04:33:38,950 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 04:33:38,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:33:38,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 04:33:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:38,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:33:39,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {1288#true} call ULTIMATE.init(); {1288#true} is VALID [2022-04-08 04:33:39,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {1288#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); {1288#true} is VALID [2022-04-08 04:33:39,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {1288#true} assume true; {1288#true} is VALID [2022-04-08 04:33:39,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1288#true} {1288#true} #56#return; {1288#true} is VALID [2022-04-08 04:33:39,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {1288#true} call #t~ret5 := main(); {1288#true} is VALID [2022-04-08 04:33:39,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {1288#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; {1308#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:39,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {1308#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1308#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:39,318 INFO L272 TraceCheckUtils]: 7: Hoare triple {1308#(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)); {1288#true} is VALID [2022-04-08 04:33:39,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {1288#true} ~cond := #in~cond; {1288#true} is VALID [2022-04-08 04:33:39,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {1288#true} assume !(0 == ~cond); {1288#true} is VALID [2022-04-08 04:33:39,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {1288#true} assume true; {1288#true} is VALID [2022-04-08 04:33:39,320 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1288#true} {1308#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {1308#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:39,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {1308#(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; {1330#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:33:39,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {1330#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {1330#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:33:39,321 INFO L272 TraceCheckUtils]: 14: Hoare triple {1330#(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)); {1288#true} is VALID [2022-04-08 04:33:39,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {1288#true} ~cond := #in~cond; {1288#true} is VALID [2022-04-08 04:33:39,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {1288#true} assume !(0 == ~cond); {1288#true} is VALID [2022-04-08 04:33:39,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {1288#true} assume true; {1288#true} is VALID [2022-04-08 04:33:39,321 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1288#true} {1330#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {1330#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:33:39,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {1330#(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; {1352#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:33:39,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {1352#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {1352#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:33:39,322 INFO L272 TraceCheckUtils]: 21: Hoare triple {1352#(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)); {1288#true} is VALID [2022-04-08 04:33:39,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {1288#true} ~cond := #in~cond; {1288#true} is VALID [2022-04-08 04:33:39,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {1288#true} assume !(0 == ~cond); {1288#true} is VALID [2022-04-08 04:33:39,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {1288#true} assume true; {1288#true} is VALID [2022-04-08 04:33:39,323 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1288#true} {1352#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {1352#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:33:39,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {1352#(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; {1374#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 04:33:39,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {1374#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1374#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 04:33:39,324 INFO L272 TraceCheckUtils]: 28: Hoare triple {1374#(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)); {1288#true} is VALID [2022-04-08 04:33:39,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {1288#true} ~cond := #in~cond; {1288#true} is VALID [2022-04-08 04:33:39,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {1288#true} assume !(0 == ~cond); {1288#true} is VALID [2022-04-08 04:33:39,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {1288#true} assume true; {1288#true} is VALID [2022-04-08 04:33:39,325 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1288#true} {1374#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #50#return; {1374#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 04:33:39,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {1374#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1396#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 04:33:39,327 INFO L272 TraceCheckUtils]: 34: Hoare triple {1396#(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)); {1400#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:39,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {1400#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1404#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:39,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {1404#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1289#false} is VALID [2022-04-08 04:33:39,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {1289#false} assume !false; {1289#false} is VALID [2022-04-08 04:33:39,328 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-08 04:33:39,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:33:39,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:39,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462059672] [2022-04-08 04:33:39,628 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:33:39,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615668870] [2022-04-08 04:33:39,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615668870] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:33:39,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:33:39,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 04:33:39,628 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:39,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1100884292] [2022-04-08 04:33:39,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1100884292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:39,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:39,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 04:33:39,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839980135] [2022-04-08 04:33:39,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:39,629 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-08 04:33:39,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:39,630 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-08 04:33:39,656 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-08 04:33:39,656 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 04:33:39,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:39,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 04:33:39,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 04:33:39,658 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-08 04:33:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:39,970 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-08 04:33:39,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 04:33:39,970 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-08 04:33:39,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:39,971 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-08 04:33:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-08 04:33:39,972 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-08 04:33:39,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-08 04:33:39,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2022-04-08 04:33:40,007 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-08 04:33:40,008 INFO L225 Difference]: With dead ends: 39 [2022-04-08 04:33:40,008 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 04:33:40,008 INFO L912 BasicCegarLoop]: 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-08 04:33:40,009 INFO L913 BasicCegarLoop]: 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-08 04:33:40,009 INFO L914 BasicCegarLoop]: 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-08 04:33:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 04:33:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 04:33:40,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:40,034 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-08 04:33:40,034 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-08 04:33:40,034 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-08 04:33:40,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:40,036 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 04:33:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 04:33:40,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:40,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:40,036 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-08 04:33:40,037 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-08 04:33:40,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:40,038 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 04:33:40,038 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 04:33:40,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:40,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:40,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:40,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:40,039 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-08 04:33:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-08 04:33:40,040 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 38 [2022-04-08 04:33:40,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:40,041 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-08 04:33:40,041 INFO L479 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-08 04:33:40,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-08 04:33:40,097 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-08 04:33:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 04:33:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 04:33:40,098 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:40,098 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:40,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 04:33:40,299 WARN L460 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-08 04:33:40,299 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:40,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:40,299 INFO L85 PathProgramCache]: Analyzing trace with hash -516282574, now seen corresponding path program 7 times [2022-04-08 04:33:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:40,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [85298468] [2022-04-08 04:33:40,404 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:33:40,404 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:33:40,404 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:33:40,404 INFO L85 PathProgramCache]: Analyzing trace with hash -516282574, now seen corresponding path program 8 times [2022-04-08 04:33:40,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:40,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860767797] [2022-04-08 04:33:40,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:40,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:40,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:33:40,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1491265104] [2022-04-08 04:33:40,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:33:40,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:33:40,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:40,422 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-08 04:33:40,430 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-08 04:33:40,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:33:40,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:33:40,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 04:33:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:40,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:33:40,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {1670#true} call ULTIMATE.init(); {1670#true} is VALID [2022-04-08 04:33:40,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {1670#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); {1670#true} is VALID [2022-04-08 04:33:40,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-08 04:33:40,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1670#true} {1670#true} #56#return; {1670#true} is VALID [2022-04-08 04:33:40,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {1670#true} call #t~ret5 := main(); {1670#true} is VALID [2022-04-08 04:33:40,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {1670#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; {1690#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:40,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {1690#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1690#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:40,917 INFO L272 TraceCheckUtils]: 7: Hoare triple {1690#(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)); {1670#true} is VALID [2022-04-08 04:33:40,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {1670#true} ~cond := #in~cond; {1670#true} is VALID [2022-04-08 04:33:40,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {1670#true} assume !(0 == ~cond); {1670#true} is VALID [2022-04-08 04:33:40,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-08 04:33:40,918 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1670#true} {1690#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {1690#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:40,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {1690#(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; {1712#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:33:40,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1712#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:33:40,924 INFO L272 TraceCheckUtils]: 14: Hoare triple {1712#(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)); {1670#true} is VALID [2022-04-08 04:33:40,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {1670#true} ~cond := #in~cond; {1670#true} is VALID [2022-04-08 04:33:40,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {1670#true} assume !(0 == ~cond); {1670#true} is VALID [2022-04-08 04:33:40,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-08 04:33:40,925 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1670#true} {1712#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {1712#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:33:40,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {1712#(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; {1734#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:33:40,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {1734#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {1734#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:33:40,926 INFO L272 TraceCheckUtils]: 21: Hoare triple {1734#(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)); {1670#true} is VALID [2022-04-08 04:33:40,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {1670#true} ~cond := #in~cond; {1670#true} is VALID [2022-04-08 04:33:40,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {1670#true} assume !(0 == ~cond); {1670#true} is VALID [2022-04-08 04:33:40,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-08 04:33:40,927 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1670#true} {1734#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {1734#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:33:40,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {1734#(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; {1756#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 04:33:40,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {1756#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !false; {1756#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 04:33:40,928 INFO L272 TraceCheckUtils]: 28: Hoare triple {1756#(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)); {1670#true} is VALID [2022-04-08 04:33:40,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {1670#true} ~cond := #in~cond; {1670#true} is VALID [2022-04-08 04:33:40,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {1670#true} assume !(0 == ~cond); {1670#true} is VALID [2022-04-08 04:33:40,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-08 04:33:40,929 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1670#true} {1756#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #50#return; {1756#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 04:33:40,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {1756#(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; {1778#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-08 04:33:40,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {1778#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !false; {1778#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-08 04:33:40,930 INFO L272 TraceCheckUtils]: 35: Hoare triple {1778#(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)); {1670#true} is VALID [2022-04-08 04:33:40,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {1670#true} ~cond := #in~cond; {1670#true} is VALID [2022-04-08 04:33:40,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {1670#true} assume !(0 == ~cond); {1670#true} is VALID [2022-04-08 04:33:40,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-08 04:33:40,931 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1670#true} {1778#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} #50#return; {1778#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-08 04:33:40,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {1778#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {1800#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:33:40,932 INFO L272 TraceCheckUtils]: 41: Hoare triple {1800#(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)); {1804#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:40,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {1804#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1808#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:40,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {1808#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1671#false} is VALID [2022-04-08 04:33:40,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {1671#false} assume !false; {1671#false} is VALID [2022-04-08 04:33:40,934 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-08 04:33:40,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:33:41,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:41,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860767797] [2022-04-08 04:33:41,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:33:41,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491265104] [2022-04-08 04:33:41,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491265104] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:33:41,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:33:41,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 04:33:41,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:41,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [85298468] [2022-04-08 04:33:41,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [85298468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:41,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:41,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 04:33:41,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126036663] [2022-04-08 04:33:41,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:41,221 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-08 04:33:41,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:41,222 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-08 04:33:41,253 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-08 04:33:41,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 04:33:41,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:41,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 04:33:41,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 04:33:41,255 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-08 04:33:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:41,651 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 04:33:41,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 04:33:41,651 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-08 04:33:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:41,652 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-08 04:33:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-08 04:33:41,653 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-08 04:33:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-08 04:33:41,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-08 04:33:41,689 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-08 04:33:41,690 INFO L225 Difference]: With dead ends: 42 [2022-04-08 04:33:41,691 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 04:33:41,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-08 04:33:41,692 INFO L913 BasicCegarLoop]: 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-08 04:33:41,692 INFO L914 BasicCegarLoop]: 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-08 04:33:41,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 04:33:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 04:33:41,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:41,720 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-08 04:33:41,721 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-08 04:33:41,721 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-08 04:33:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:41,722 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-08 04:33:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-08 04:33:41,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:41,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:41,723 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-08 04:33:41,723 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-08 04:33:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:41,725 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-08 04:33:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-08 04:33:41,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:41,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:41,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:41,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:41,726 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-08 04:33:41,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-04-08 04:33:41,727 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 45 [2022-04-08 04:33:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:41,727 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-04-08 04:33:41,727 INFO L479 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-08 04:33:41,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2022-04-08 04:33:41,787 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-08 04:33:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-08 04:33:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 04:33:41,788 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:41,788 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:41,794 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-08 04:33:41,993 WARN L460 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-08 04:33:41,993 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:41,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:41,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1878724517, now seen corresponding path program 9 times [2022-04-08 04:33:41,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:41,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1993916914] [2022-04-08 04:33:42,111 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:33:42,111 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:33:42,111 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:33:42,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1878724517, now seen corresponding path program 10 times [2022-04-08 04:33:42,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:42,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369699744] [2022-04-08 04:33:42,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:42,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:42,133 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:33:42,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401125217] [2022-04-08 04:33:42,133 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:33:42,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:33:42,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:42,134 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-08 04:33:42,136 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-08 04:33:42,244 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:33:42,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:33:42,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 04:33:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:42,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:33:42,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {2092#true} call ULTIMATE.init(); {2092#true} is VALID [2022-04-08 04:33:42,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {2092#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); {2092#true} is VALID [2022-04-08 04:33:42,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-04-08 04:33:42,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2092#true} {2092#true} #56#return; {2092#true} is VALID [2022-04-08 04:33:42,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {2092#true} call #t~ret5 := main(); {2092#true} is VALID [2022-04-08 04:33:42,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {2092#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; {2112#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:42,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {2112#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2112#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:42,742 INFO L272 TraceCheckUtils]: 7: Hoare triple {2112#(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)); {2092#true} is VALID [2022-04-08 04:33:42,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {2092#true} ~cond := #in~cond; {2092#true} is VALID [2022-04-08 04:33:42,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {2092#true} assume !(0 == ~cond); {2092#true} is VALID [2022-04-08 04:33:42,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-04-08 04:33:42,743 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2092#true} {2112#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {2112#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:42,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {2112#(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; {2134#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:33:42,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {2134#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2134#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:33:42,744 INFO L272 TraceCheckUtils]: 14: Hoare triple {2134#(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)); {2092#true} is VALID [2022-04-08 04:33:42,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {2092#true} ~cond := #in~cond; {2092#true} is VALID [2022-04-08 04:33:42,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {2092#true} assume !(0 == ~cond); {2092#true} is VALID [2022-04-08 04:33:42,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-04-08 04:33:42,744 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2092#true} {2134#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {2134#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:33:42,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {2134#(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; {2156#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:33:42,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {2156#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2156#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:33:42,745 INFO L272 TraceCheckUtils]: 21: Hoare triple {2156#(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)); {2092#true} is VALID [2022-04-08 04:33:42,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {2092#true} ~cond := #in~cond; {2092#true} is VALID [2022-04-08 04:33:42,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {2092#true} assume !(0 == ~cond); {2092#true} is VALID [2022-04-08 04:33:42,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-04-08 04:33:42,746 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2092#true} {2156#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #50#return; {2156#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:33:42,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {2156#(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; {2178#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 04:33:42,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {2178#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {2178#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 04:33:42,747 INFO L272 TraceCheckUtils]: 28: Hoare triple {2178#(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)); {2092#true} is VALID [2022-04-08 04:33:42,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {2092#true} ~cond := #in~cond; {2092#true} is VALID [2022-04-08 04:33:42,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {2092#true} assume !(0 == ~cond); {2092#true} is VALID [2022-04-08 04:33:42,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-04-08 04:33:42,748 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2092#true} {2178#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #50#return; {2178#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 04:33:42,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {2178#(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; {2200#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:33:42,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {2200#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {2200#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:33:42,749 INFO L272 TraceCheckUtils]: 35: Hoare triple {2200#(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)); {2092#true} is VALID [2022-04-08 04:33:42,750 INFO L290 TraceCheckUtils]: 36: Hoare triple {2092#true} ~cond := #in~cond; {2092#true} is VALID [2022-04-08 04:33:42,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {2092#true} assume !(0 == ~cond); {2092#true} is VALID [2022-04-08 04:33:42,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-04-08 04:33:42,750 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2092#true} {2200#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {2200#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:33:42,757 INFO L290 TraceCheckUtils]: 40: Hoare triple {2200#(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; {2222#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 04:33:42,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {2222#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2222#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 04:33:42,758 INFO L272 TraceCheckUtils]: 42: Hoare triple {2222#(and (<= main_~c~0 5) (= 5 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)); {2092#true} is VALID [2022-04-08 04:33:42,759 INFO L290 TraceCheckUtils]: 43: Hoare triple {2092#true} ~cond := #in~cond; {2092#true} is VALID [2022-04-08 04:33:42,762 INFO L290 TraceCheckUtils]: 44: Hoare triple {2092#true} assume !(0 == ~cond); {2092#true} is VALID [2022-04-08 04:33:42,762 INFO L290 TraceCheckUtils]: 45: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-04-08 04:33:42,764 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2092#true} {2222#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #50#return; {2222#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 04:33:42,765 INFO L290 TraceCheckUtils]: 47: Hoare triple {2222#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2244#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 04:33:42,765 INFO L272 TraceCheckUtils]: 48: Hoare triple {2244#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2248#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:42,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {2248#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2252#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:42,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {2252#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2093#false} is VALID [2022-04-08 04:33:42,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {2093#false} assume !false; {2093#false} is VALID [2022-04-08 04:33:42,768 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-08 04:33:42,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:33:43,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:43,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369699744] [2022-04-08 04:33:43,037 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:33:43,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401125217] [2022-04-08 04:33:43,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401125217] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:33:43,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:33:43,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 04:33:43,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:43,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1993916914] [2022-04-08 04:33:43,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1993916914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:43,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:43,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 04:33:43,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4945115] [2022-04-08 04:33:43,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:43,039 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-08 04:33:43,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:43,039 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-08 04:33:43,076 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-08 04:33:43,076 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 04:33:43,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:43,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 04:33:43,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 04:33:43,077 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-08 04:33:43,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:43,590 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 04:33:43,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 04:33:43,590 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-08 04:33:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:43,591 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-08 04:33:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-08 04:33:43,592 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-08 04:33:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-08 04:33:43,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 46 transitions. [2022-04-08 04:33:43,638 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-08 04:33:43,639 INFO L225 Difference]: With dead ends: 45 [2022-04-08 04:33:43,639 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 04:33:43,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 04:33:43,640 INFO L913 BasicCegarLoop]: 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-08 04:33:43,641 INFO L914 BasicCegarLoop]: 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-08 04:33:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 04:33:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-08 04:33:43,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:43,671 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-08 04:33:43,671 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-08 04:33:43,671 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-08 04:33:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:43,673 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-08 04:33:43,673 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-04-08 04:33:43,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:43,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:43,674 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-08 04:33:43,674 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-08 04:33:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:43,676 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-08 04:33:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-04-08 04:33:43,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:43,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:43,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:43,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:43,676 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-08 04:33:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-04-08 04:33:43,678 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 52 [2022-04-08 04:33:43,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:43,678 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-04-08 04:33:43,678 INFO L479 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-08 04:33:43,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 45 transitions. [2022-04-08 04:33:43,734 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-08 04:33:43,734 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-04-08 04:33:43,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 04:33:43,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:43,735 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:43,752 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-08 04:33:43,939 WARN L460 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-08 04:33:43,940 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:43,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:43,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2079567918, now seen corresponding path program 11 times [2022-04-08 04:33:43,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:43,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1807505874] [2022-04-08 04:33:44,035 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:33:44,035 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:33:44,035 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:33:44,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2079567918, now seen corresponding path program 12 times [2022-04-08 04:33:44,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:44,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187877788] [2022-04-08 04:33:44,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:44,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:44,045 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:33:44,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [497199775] [2022-04-08 04:33:44,045 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:33:44,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:33:44,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:44,050 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-08 04:33:44,075 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-08 04:33:44,277 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 04:33:44,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:33:44,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 04:33:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:44,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:33:44,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {2554#true} call ULTIMATE.init(); {2554#true} is VALID [2022-04-08 04:33:44,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {2554#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); {2554#true} is VALID [2022-04-08 04:33:44,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 04:33:44,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2554#true} {2554#true} #56#return; {2554#true} is VALID [2022-04-08 04:33:44,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {2554#true} call #t~ret5 := main(); {2554#true} is VALID [2022-04-08 04:33:44,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {2554#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; {2574#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:44,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {2574#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2574#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:44,813 INFO L272 TraceCheckUtils]: 7: Hoare triple {2574#(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)); {2554#true} is VALID [2022-04-08 04:33:44,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {2554#true} ~cond := #in~cond; {2554#true} is VALID [2022-04-08 04:33:44,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {2554#true} assume !(0 == ~cond); {2554#true} is VALID [2022-04-08 04:33:44,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 04:33:44,814 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2554#true} {2574#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {2574#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:44,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {2574#(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; {2596#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:33:44,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {2596#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {2596#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:33:44,815 INFO L272 TraceCheckUtils]: 14: Hoare triple {2596#(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)); {2554#true} is VALID [2022-04-08 04:33:44,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {2554#true} ~cond := #in~cond; {2554#true} is VALID [2022-04-08 04:33:44,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {2554#true} assume !(0 == ~cond); {2554#true} is VALID [2022-04-08 04:33:44,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 04:33:44,816 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2554#true} {2596#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {2596#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:33:44,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {2596#(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; {2618#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 04:33:44,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {2618#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {2618#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 04:33:44,817 INFO L272 TraceCheckUtils]: 21: Hoare triple {2618#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) 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)); {2554#true} is VALID [2022-04-08 04:33:44,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {2554#true} ~cond := #in~cond; {2554#true} is VALID [2022-04-08 04:33:44,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {2554#true} assume !(0 == ~cond); {2554#true} is VALID [2022-04-08 04:33:44,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 04:33:44,817 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2554#true} {2618#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 1)))} #50#return; {2618#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 04:33:44,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {2618#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) 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; {2640#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 04:33:44,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {2640#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {2640#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 04:33:44,819 INFO L272 TraceCheckUtils]: 28: Hoare triple {2640#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2554#true} is VALID [2022-04-08 04:33:44,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {2554#true} ~cond := #in~cond; {2554#true} is VALID [2022-04-08 04:33:44,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {2554#true} assume !(0 == ~cond); {2554#true} is VALID [2022-04-08 04:33:44,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 04:33:44,820 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2554#true} {2640#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #50#return; {2640#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 04:33:44,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {2640#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2662#(and (= (+ main_~y~0 (- 3)) 1) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-08 04:33:44,821 INFO L290 TraceCheckUtils]: 34: Hoare triple {2662#(and (= (+ main_~y~0 (- 3)) 1) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 3))} assume !false; {2662#(and (= (+ main_~y~0 (- 3)) 1) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-08 04:33:44,821 INFO L272 TraceCheckUtils]: 35: Hoare triple {2662#(and (= (+ main_~y~0 (- 3)) 1) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2554#true} is VALID [2022-04-08 04:33:44,821 INFO L290 TraceCheckUtils]: 36: Hoare triple {2554#true} ~cond := #in~cond; {2554#true} is VALID [2022-04-08 04:33:44,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {2554#true} assume !(0 == ~cond); {2554#true} is VALID [2022-04-08 04:33:44,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 04:33:44,822 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2554#true} {2662#(and (= (+ main_~y~0 (- 3)) 1) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 3))} #50#return; {2662#(and (= (+ main_~y~0 (- 3)) 1) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-08 04:33:44,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {2662#(and (= (+ main_~y~0 (- 3)) 1) (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2684#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:33:44,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {2684#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {2684#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:33:44,823 INFO L272 TraceCheckUtils]: 42: Hoare triple {2684#(and (< 1 main_~k~0) (= 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)); {2554#true} is VALID [2022-04-08 04:33:44,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {2554#true} ~cond := #in~cond; {2554#true} is VALID [2022-04-08 04:33:44,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {2554#true} assume !(0 == ~cond); {2554#true} is VALID [2022-04-08 04:33:44,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 04:33:44,824 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2554#true} {2684#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {2684#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:33:44,824 INFO L290 TraceCheckUtils]: 47: Hoare triple {2684#(and (< 1 main_~k~0) (= 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; {2706#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 04:33:44,825 INFO L290 TraceCheckUtils]: 48: Hoare triple {2706#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {2706#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 04:33:44,825 INFO L272 TraceCheckUtils]: 49: Hoare triple {2706#(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)); {2554#true} is VALID [2022-04-08 04:33:44,825 INFO L290 TraceCheckUtils]: 50: Hoare triple {2554#true} ~cond := #in~cond; {2554#true} is VALID [2022-04-08 04:33:44,825 INFO L290 TraceCheckUtils]: 51: Hoare triple {2554#true} assume !(0 == ~cond); {2554#true} is VALID [2022-04-08 04:33:44,825 INFO L290 TraceCheckUtils]: 52: Hoare triple {2554#true} assume true; {2554#true} is VALID [2022-04-08 04:33:44,827 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2554#true} {2706#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #50#return; {2706#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 04:33:44,828 INFO L290 TraceCheckUtils]: 54: Hoare triple {2706#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {2728#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 04:33:44,828 INFO L272 TraceCheckUtils]: 55: Hoare triple {2728#(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)); {2732#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:44,829 INFO L290 TraceCheckUtils]: 56: Hoare triple {2732#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2736#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:44,829 INFO L290 TraceCheckUtils]: 57: Hoare triple {2736#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2555#false} is VALID [2022-04-08 04:33:44,829 INFO L290 TraceCheckUtils]: 58: Hoare triple {2555#false} assume !false; {2555#false} is VALID [2022-04-08 04:33:44,830 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-08 04:33:44,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:33:45,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:45,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187877788] [2022-04-08 04:33:45,567 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:33:45,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497199775] [2022-04-08 04:33:45,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497199775] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:33:45,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:33:45,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 04:33:45,570 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:45,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1807505874] [2022-04-08 04:33:45,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1807505874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:45,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:45,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 04:33:45,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586637717] [2022-04-08 04:33:45,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:45,573 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-08 04:33:45,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:45,573 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-08 04:33:45,602 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-08 04:33:45,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 04:33:45,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:45,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 04:33:45,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-08 04:33:45,603 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-08 04:33:46,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:46,171 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-08 04:33:46,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 04:33:46,171 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-08 04:33:46,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:46,172 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-08 04:33:46,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2022-04-08 04:33:46,173 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-08 04:33:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2022-04-08 04:33:46,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 50 transitions. [2022-04-08 04:33:46,218 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-08 04:33:46,222 INFO L225 Difference]: With dead ends: 48 [2022-04-08 04:33:46,222 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 04:33:46,222 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-08 04:33:46,224 INFO L913 BasicCegarLoop]: 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-08 04:33:46,224 INFO L914 BasicCegarLoop]: 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-08 04:33:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 04:33:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-08 04:33:46,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:46,269 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-08 04:33:46,272 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-08 04:33:46,273 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-08 04:33:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:46,280 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-08 04:33:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-08 04:33:46,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:46,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:46,281 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-08 04:33:46,282 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-08 04:33:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:46,285 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-08 04:33:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-08 04:33:46,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:46,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:46,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:46,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:46,287 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-08 04:33:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-04-08 04:33:46,292 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 59 [2022-04-08 04:33:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:46,292 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-04-08 04:33:46,293 INFO L479 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-08 04:33:46,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 49 transitions. [2022-04-08 04:33:46,367 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-08 04:33:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-08 04:33:46,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 04:33:46,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:46,368 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:46,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 04:33:46,568 WARN L460 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-08 04:33:46,568 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:46,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:46,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2024272645, now seen corresponding path program 13 times [2022-04-08 04:33:46,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:46,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1106608422] [2022-04-08 04:33:46,681 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:33:46,681 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:33:46,681 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:33:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2024272645, now seen corresponding path program 14 times [2022-04-08 04:33:46,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:46,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672614550] [2022-04-08 04:33:46,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:46,692 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:33:46,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1415021145] [2022-04-08 04:33:46,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:33:46,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:33:46,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:46,693 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-08 04:33:46,711 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-08 04:33:47,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:33:47,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:33:47,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 04:33:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:47,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:33:47,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {3144#true} call ULTIMATE.init(); {3144#true} is VALID [2022-04-08 04:33:47,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {3144#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); {3144#true} is VALID [2022-04-08 04:33:47,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 04:33:47,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3144#true} {3144#true} #56#return; {3144#true} is VALID [2022-04-08 04:33:47,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {3144#true} call #t~ret5 := main(); {3144#true} is VALID [2022-04-08 04:33:47,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {3144#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; {3164#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:47,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {3164#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3164#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:47,700 INFO L272 TraceCheckUtils]: 7: Hoare triple {3164#(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)); {3144#true} is VALID [2022-04-08 04:33:47,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 04:33:47,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 04:33:47,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 04:33:47,701 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3144#true} {3164#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {3164#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:47,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {3164#(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; {3186#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:33:47,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {3186#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {3186#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:33:47,702 INFO L272 TraceCheckUtils]: 14: Hoare triple {3186#(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)); {3144#true} is VALID [2022-04-08 04:33:47,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 04:33:47,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 04:33:47,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 04:33:47,703 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3144#true} {3186#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {3186#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:33:47,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {3186#(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; {3208#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:33:47,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {3208#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {3208#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:33:47,704 INFO L272 TraceCheckUtils]: 21: Hoare triple {3208#(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)); {3144#true} is VALID [2022-04-08 04:33:47,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 04:33:47,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 04:33:47,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 04:33:47,704 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3144#true} {3208#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {3208#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:33:47,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {3208#(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; {3230#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:33:47,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {3230#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {3230#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:33:47,705 INFO L272 TraceCheckUtils]: 28: Hoare triple {3230#(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)); {3144#true} is VALID [2022-04-08 04:33:47,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 04:33:47,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 04:33:47,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 04:33:47,706 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3144#true} {3230#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #50#return; {3230#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:33:47,707 INFO L290 TraceCheckUtils]: 33: Hoare triple {3230#(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; {3252#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:33:47,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {3252#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {3252#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:33:47,707 INFO L272 TraceCheckUtils]: 35: Hoare triple {3252#(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)); {3144#true} is VALID [2022-04-08 04:33:47,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 04:33:47,708 INFO L290 TraceCheckUtils]: 37: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 04:33:47,708 INFO L290 TraceCheckUtils]: 38: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 04:33:47,708 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3144#true} {3252#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #50#return; {3252#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:33:47,709 INFO L290 TraceCheckUtils]: 40: Hoare triple {3252#(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; {3274#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:33:47,709 INFO L290 TraceCheckUtils]: 41: Hoare triple {3274#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3274#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:33:47,709 INFO L272 TraceCheckUtils]: 42: Hoare triple {3274#(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)); {3144#true} is VALID [2022-04-08 04:33:47,709 INFO L290 TraceCheckUtils]: 43: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 04:33:47,709 INFO L290 TraceCheckUtils]: 44: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 04:33:47,709 INFO L290 TraceCheckUtils]: 45: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 04:33:47,710 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3144#true} {3274#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {3274#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:33:47,710 INFO L290 TraceCheckUtils]: 47: Hoare triple {3274#(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; {3296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:33:47,711 INFO L290 TraceCheckUtils]: 48: Hoare triple {3296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {3296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:33:47,711 INFO L272 TraceCheckUtils]: 49: Hoare triple {3296#(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)); {3144#true} is VALID [2022-04-08 04:33:47,711 INFO L290 TraceCheckUtils]: 50: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 04:33:47,711 INFO L290 TraceCheckUtils]: 51: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 04:33:47,711 INFO L290 TraceCheckUtils]: 52: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 04:33:47,712 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3144#true} {3296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #50#return; {3296#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:33:47,712 INFO L290 TraceCheckUtils]: 54: Hoare triple {3296#(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; {3318#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 04:33:47,713 INFO L290 TraceCheckUtils]: 55: Hoare triple {3318#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {3318#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 04:33:47,713 INFO L272 TraceCheckUtils]: 56: Hoare triple {3318#(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)); {3144#true} is VALID [2022-04-08 04:33:47,713 INFO L290 TraceCheckUtils]: 57: Hoare triple {3144#true} ~cond := #in~cond; {3144#true} is VALID [2022-04-08 04:33:47,713 INFO L290 TraceCheckUtils]: 58: Hoare triple {3144#true} assume !(0 == ~cond); {3144#true} is VALID [2022-04-08 04:33:47,713 INFO L290 TraceCheckUtils]: 59: Hoare triple {3144#true} assume true; {3144#true} is VALID [2022-04-08 04:33:47,714 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3144#true} {3318#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #50#return; {3318#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 04:33:47,715 INFO L290 TraceCheckUtils]: 61: Hoare triple {3318#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3340#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 04:33:47,716 INFO L272 TraceCheckUtils]: 62: Hoare triple {3340#(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)); {3344#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:47,716 INFO L290 TraceCheckUtils]: 63: Hoare triple {3344#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3348#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:47,716 INFO L290 TraceCheckUtils]: 64: Hoare triple {3348#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3145#false} is VALID [2022-04-08 04:33:47,716 INFO L290 TraceCheckUtils]: 65: Hoare triple {3145#false} assume !false; {3145#false} is VALID [2022-04-08 04:33:47,717 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-08 04:33:47,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:33:48,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:48,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672614550] [2022-04-08 04:33:48,053 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:33:48,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415021145] [2022-04-08 04:33:48,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415021145] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:33:48,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:33:48,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 04:33:48,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:48,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1106608422] [2022-04-08 04:33:48,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1106608422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:48,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:48,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 04:33:48,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460357034] [2022-04-08 04:33:48,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:48,055 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-08 04:33:48,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:48,055 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-08 04:33:48,116 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-08 04:33:48,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 04:33:48,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:48,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 04:33:48,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 04:33:48,117 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-08 04:33:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:48,767 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-08 04:33:48,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 04:33:48,767 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-08 04:33:48,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:48,768 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-08 04:33:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-08 04:33:48,769 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-08 04:33:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-08 04:33:48,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2022-04-08 04:33:48,818 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-08 04:33:48,819 INFO L225 Difference]: With dead ends: 51 [2022-04-08 04:33:48,820 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 04:33:48,820 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 04:33:48,820 INFO L913 BasicCegarLoop]: 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-08 04:33:48,821 INFO L914 BasicCegarLoop]: 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-08 04:33:48,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 04:33:48,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 04:33:48,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:48,857 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-08 04:33:48,857 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-08 04:33:48,857 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-08 04:33:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:48,859 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-08 04:33:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-04-08 04:33:48,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:48,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:48,859 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-08 04:33:48,860 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-08 04:33:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:48,861 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-08 04:33:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-04-08 04:33:48,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:48,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:48,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:48,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:48,862 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-08 04:33:48,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-04-08 04:33:48,863 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 66 [2022-04-08 04:33:48,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:48,863 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-04-08 04:33:48,863 INFO L479 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-08 04:33:48,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 53 transitions. [2022-04-08 04:33:48,933 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-08 04:33:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-04-08 04:33:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 04:33:48,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:48,934 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:48,946 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-08 04:33:49,144 WARN L460 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-08 04:33:49,144 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:49,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1092280434, now seen corresponding path program 15 times [2022-04-08 04:33:49,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:49,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [926710442] [2022-04-08 04:33:49,228 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:33:49,228 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:33:49,228 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:33:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1092280434, now seen corresponding path program 16 times [2022-04-08 04:33:49,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:49,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602077413] [2022-04-08 04:33:49,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:49,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:49,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:33:49,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867456632] [2022-04-08 04:33:49,240 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:33:49,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:33:49,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:49,241 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-08 04:33:49,244 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-08 04:33:49,918 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:33:49,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:33:49,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 04:33:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:49,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:33:50,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {3686#true} call ULTIMATE.init(); {3686#true} is VALID [2022-04-08 04:33:50,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {3686#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); {3686#true} is VALID [2022-04-08 04:33:50,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 04:33:50,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3686#true} {3686#true} #56#return; {3686#true} is VALID [2022-04-08 04:33:50,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {3686#true} call #t~ret5 := main(); {3686#true} is VALID [2022-04-08 04:33:50,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {3686#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; {3706#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:50,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {3706#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3706#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:50,395 INFO L272 TraceCheckUtils]: 7: Hoare triple {3706#(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)); {3686#true} is VALID [2022-04-08 04:33:50,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 04:33:50,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 04:33:50,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 04:33:50,399 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3686#true} {3706#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {3706#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:50,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {3706#(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; {3728#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:33:50,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {3728#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3728#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:33:50,401 INFO L272 TraceCheckUtils]: 14: Hoare triple {3728#(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)); {3686#true} is VALID [2022-04-08 04:33:50,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 04:33:50,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 04:33:50,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 04:33:50,401 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3686#true} {3728#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {3728#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:33:50,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {3728#(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; {3750#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:33:50,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {3750#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {3750#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:33:50,402 INFO L272 TraceCheckUtils]: 21: Hoare triple {3750#(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)); {3686#true} is VALID [2022-04-08 04:33:50,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 04:33:50,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 04:33:50,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 04:33:50,405 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3686#true} {3750#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #50#return; {3750#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:33:50,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {3750#(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; {3772#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 04:33:50,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {3772#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {3772#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 04:33:50,406 INFO L272 TraceCheckUtils]: 28: Hoare triple {3772#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3686#true} is VALID [2022-04-08 04:33:50,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 04:33:50,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 04:33:50,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 04:33:50,407 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3686#true} {3772#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #50#return; {3772#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 04:33:50,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {3772#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3794#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 04:33:50,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {3794#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} assume !false; {3794#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 04:33:50,408 INFO L272 TraceCheckUtils]: 35: Hoare triple {3794#(and (= (+ main_~y~0 (- 3)) 1) (= (+ 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)); {3686#true} is VALID [2022-04-08 04:33:50,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 04:33:50,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 04:33:50,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 04:33:50,408 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3686#true} {3794#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} #50#return; {3794#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 04:33:50,409 INFO L290 TraceCheckUtils]: 40: Hoare triple {3794#(and (= (+ main_~y~0 (- 3)) 1) (= (+ 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; {3816#(and (= (+ main_~c~0 (- 5)) 0) (= 5 main_~y~0))} is VALID [2022-04-08 04:33:50,409 INFO L290 TraceCheckUtils]: 41: Hoare triple {3816#(and (= (+ main_~c~0 (- 5)) 0) (= 5 main_~y~0))} assume !false; {3816#(and (= (+ main_~c~0 (- 5)) 0) (= 5 main_~y~0))} is VALID [2022-04-08 04:33:50,409 INFO L272 TraceCheckUtils]: 42: Hoare triple {3816#(and (= (+ main_~c~0 (- 5)) 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)); {3686#true} is VALID [2022-04-08 04:33:50,409 INFO L290 TraceCheckUtils]: 43: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 04:33:50,409 INFO L290 TraceCheckUtils]: 44: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 04:33:50,409 INFO L290 TraceCheckUtils]: 45: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 04:33:50,410 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3686#true} {3816#(and (= (+ main_~c~0 (- 5)) 0) (= 5 main_~y~0))} #50#return; {3816#(and (= (+ main_~c~0 (- 5)) 0) (= 5 main_~y~0))} is VALID [2022-04-08 04:33:50,410 INFO L290 TraceCheckUtils]: 47: Hoare triple {3816#(and (= (+ main_~c~0 (- 5)) 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; {3838#(and (= (+ main_~c~0 (- 6)) 0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:33:50,410 INFO L290 TraceCheckUtils]: 48: Hoare triple {3838#(and (= (+ main_~c~0 (- 6)) 0) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3838#(and (= (+ main_~c~0 (- 6)) 0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:33:50,410 INFO L272 TraceCheckUtils]: 49: Hoare triple {3838#(and (= (+ main_~c~0 (- 6)) 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)); {3686#true} is VALID [2022-04-08 04:33:50,410 INFO L290 TraceCheckUtils]: 50: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 04:33:50,411 INFO L290 TraceCheckUtils]: 51: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 04:33:50,411 INFO L290 TraceCheckUtils]: 52: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 04:33:50,411 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3686#true} {3838#(and (= (+ main_~c~0 (- 6)) 0) (= 5 (+ (- 1) main_~y~0)))} #50#return; {3838#(and (= (+ main_~c~0 (- 6)) 0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:33:50,411 INFO L290 TraceCheckUtils]: 54: Hoare triple {3838#(and (= (+ main_~c~0 (- 6)) 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; {3860#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} is VALID [2022-04-08 04:33:50,412 INFO L290 TraceCheckUtils]: 55: Hoare triple {3860#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} assume !false; {3860#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} is VALID [2022-04-08 04:33:50,412 INFO L272 TraceCheckUtils]: 56: Hoare triple {3860#(and (= (+ main_~c~0 (- 7)) 0) (= 7 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)); {3686#true} is VALID [2022-04-08 04:33:50,412 INFO L290 TraceCheckUtils]: 57: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 04:33:50,412 INFO L290 TraceCheckUtils]: 58: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 04:33:50,412 INFO L290 TraceCheckUtils]: 59: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 04:33:50,413 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3686#true} {3860#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} #50#return; {3860#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0))} is VALID [2022-04-08 04:33:50,413 INFO L290 TraceCheckUtils]: 61: Hoare triple {3860#(and (= (+ main_~c~0 (- 7)) 0) (= 7 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; {3882#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 04:33:50,413 INFO L290 TraceCheckUtils]: 62: Hoare triple {3882#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !false; {3882#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 04:33:50,413 INFO L272 TraceCheckUtils]: 63: Hoare triple {3882#(and (< 7 main_~k~0) (= 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)); {3686#true} is VALID [2022-04-08 04:33:50,413 INFO L290 TraceCheckUtils]: 64: Hoare triple {3686#true} ~cond := #in~cond; {3686#true} is VALID [2022-04-08 04:33:50,413 INFO L290 TraceCheckUtils]: 65: Hoare triple {3686#true} assume !(0 == ~cond); {3686#true} is VALID [2022-04-08 04:33:50,414 INFO L290 TraceCheckUtils]: 66: Hoare triple {3686#true} assume true; {3686#true} is VALID [2022-04-08 04:33:50,414 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {3686#true} {3882#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #50#return; {3882#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 04:33:50,415 INFO L290 TraceCheckUtils]: 68: Hoare triple {3882#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {3904#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-08 04:33:50,415 INFO L272 TraceCheckUtils]: 69: Hoare triple {3904#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:50,415 INFO L290 TraceCheckUtils]: 70: Hoare triple {3908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:50,416 INFO L290 TraceCheckUtils]: 71: Hoare triple {3912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3687#false} is VALID [2022-04-08 04:33:50,416 INFO L290 TraceCheckUtils]: 72: Hoare triple {3687#false} assume !false; {3687#false} is VALID [2022-04-08 04:33:50,416 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-08 04:33:50,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:33:50,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:50,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602077413] [2022-04-08 04:33:50,751 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:33:50,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867456632] [2022-04-08 04:33:50,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867456632] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:33:50,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:33:50,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 04:33:50,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:50,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [926710442] [2022-04-08 04:33:50,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [926710442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:50,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:50,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 04:33:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350172685] [2022-04-08 04:33:50,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:50,752 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-08 04:33:50,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:50,752 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-08 04:33:50,789 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-08 04:33:50,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 04:33:50,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:50,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 04:33:50,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 04:33:50,790 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-08 04:33:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:51,719 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 04:33:51,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 04:33:51,720 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-08 04:33:51,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:51,720 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-08 04:33:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-04-08 04:33:51,722 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-08 04:33:51,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-04-08 04:33:51,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 58 transitions. [2022-04-08 04:33:51,788 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-08 04:33:51,789 INFO L225 Difference]: With dead ends: 54 [2022-04-08 04:33:51,789 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 04:33:51,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-08 04:33:51,790 INFO L913 BasicCegarLoop]: 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-08 04:33:51,790 INFO L914 BasicCegarLoop]: 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-08 04:33:51,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 04:33:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-08 04:33:51,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:51,832 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-08 04:33:51,832 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-08 04:33:51,832 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-08 04:33:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:51,833 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-08 04:33:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-08 04:33:51,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:51,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:51,834 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-08 04:33:51,834 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-08 04:33:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:51,836 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-08 04:33:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-08 04:33:51,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:51,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:51,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:51,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:51,836 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-08 04:33:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-04-08 04:33:51,838 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 73 [2022-04-08 04:33:51,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:51,838 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-04-08 04:33:51,838 INFO L479 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-08 04:33:51,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 57 transitions. [2022-04-08 04:33:51,911 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-08 04:33:51,911 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-08 04:33:51,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 04:33:51,912 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:51,912 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:51,916 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-08 04:33:52,115 WARN L460 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-08 04:33:52,115 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:52,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:52,116 INFO L85 PathProgramCache]: Analyzing trace with hash 634613349, now seen corresponding path program 17 times [2022-04-08 04:33:52,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:52,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [813299619] [2022-04-08 04:33:52,190 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:33:52,190 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:33:52,190 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:33:52,190 INFO L85 PathProgramCache]: Analyzing trace with hash 634613349, now seen corresponding path program 18 times [2022-04-08 04:33:52,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:52,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32583754] [2022-04-08 04:33:52,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:52,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:52,201 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:33:52,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368374365] [2022-04-08 04:33:52,201 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:33:52,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:33:52,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:52,202 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-08 04:33:52,211 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-08 04:33:52,678 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 04:33:52,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:33:52,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 04:33:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:52,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:33:53,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {4268#true} call ULTIMATE.init(); {4268#true} is VALID [2022-04-08 04:33:53,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {4268#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); {4268#true} is VALID [2022-04-08 04:33:53,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 04:33:53,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4268#true} {4268#true} #56#return; {4268#true} is VALID [2022-04-08 04:33:53,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {4268#true} call #t~ret5 := main(); {4268#true} is VALID [2022-04-08 04:33:53,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {4268#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; {4288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:53,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {4288#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:53,133 INFO L272 TraceCheckUtils]: 7: Hoare triple {4288#(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)); {4268#true} is VALID [2022-04-08 04:33:53,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 04:33:53,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 04:33:53,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 04:33:53,134 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4268#true} {4288#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {4288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:53,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {4288#(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; {4310#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:33:53,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {4310#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {4310#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:33:53,134 INFO L272 TraceCheckUtils]: 14: Hoare triple {4310#(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)); {4268#true} is VALID [2022-04-08 04:33:53,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 04:33:53,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 04:33:53,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 04:33:53,139 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4268#true} {4310#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {4310#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:33:53,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {4310#(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; {4332#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:33:53,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {4332#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {4332#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:33:53,140 INFO L272 TraceCheckUtils]: 21: Hoare triple {4332#(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)); {4268#true} is VALID [2022-04-08 04:33:53,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 04:33:53,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 04:33:53,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 04:33:53,141 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4268#true} {4332#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #50#return; {4332#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:33:53,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {4332#(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; {4354#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 04:33:53,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {4354#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {4354#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 04:33:53,142 INFO L272 TraceCheckUtils]: 28: Hoare triple {4354#(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)); {4268#true} is VALID [2022-04-08 04:33:53,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 04:33:53,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 04:33:53,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 04:33:53,142 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4268#true} {4354#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #50#return; {4354#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 04:33:53,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {4354#(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; {4376#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 04:33:53,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {4376#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {4376#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 04:33:53,143 INFO L272 TraceCheckUtils]: 35: Hoare triple {4376#(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)); {4268#true} is VALID [2022-04-08 04:33:53,143 INFO L290 TraceCheckUtils]: 36: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 04:33:53,143 INFO L290 TraceCheckUtils]: 37: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 04:33:53,143 INFO L290 TraceCheckUtils]: 38: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 04:33:53,144 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4268#true} {4376#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #50#return; {4376#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 04:33:53,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {4376#(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; {4398#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:33:53,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {4398#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {4398#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:33:53,144 INFO L272 TraceCheckUtils]: 42: Hoare triple {4398#(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)); {4268#true} is VALID [2022-04-08 04:33:53,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 04:33:53,144 INFO L290 TraceCheckUtils]: 44: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 04:33:53,145 INFO L290 TraceCheckUtils]: 45: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 04:33:53,145 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4268#true} {4398#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {4398#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:33:53,145 INFO L290 TraceCheckUtils]: 47: Hoare triple {4398#(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; {4420#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:33:53,146 INFO L290 TraceCheckUtils]: 48: Hoare triple {4420#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {4420#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:33:53,146 INFO L272 TraceCheckUtils]: 49: Hoare triple {4420#(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)); {4268#true} is VALID [2022-04-08 04:33:53,146 INFO L290 TraceCheckUtils]: 50: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 04:33:53,146 INFO L290 TraceCheckUtils]: 51: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 04:33:53,146 INFO L290 TraceCheckUtils]: 52: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 04:33:53,147 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4268#true} {4420#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #50#return; {4420#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:33:53,147 INFO L290 TraceCheckUtils]: 54: Hoare triple {4420#(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; {4442#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:33:53,147 INFO L290 TraceCheckUtils]: 55: Hoare triple {4442#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !false; {4442#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:33:53,148 INFO L272 TraceCheckUtils]: 56: Hoare triple {4442#(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)); {4268#true} is VALID [2022-04-08 04:33:53,148 INFO L290 TraceCheckUtils]: 57: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 04:33:53,148 INFO L290 TraceCheckUtils]: 58: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 04:33:53,148 INFO L290 TraceCheckUtils]: 59: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 04:33:53,148 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4268#true} {4442#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #50#return; {4442#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:33:53,149 INFO L290 TraceCheckUtils]: 61: Hoare triple {4442#(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; {4464#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:33:53,149 INFO L290 TraceCheckUtils]: 62: Hoare triple {4464#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} assume !false; {4464#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:33:53,149 INFO L272 TraceCheckUtils]: 63: Hoare triple {4464#(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)); {4268#true} is VALID [2022-04-08 04:33:53,149 INFO L290 TraceCheckUtils]: 64: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 04:33:53,149 INFO L290 TraceCheckUtils]: 65: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 04:33:53,149 INFO L290 TraceCheckUtils]: 66: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 04:33:53,150 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {4268#true} {4464#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} #50#return; {4464#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:33:53,150 INFO L290 TraceCheckUtils]: 68: Hoare triple {4464#(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; {4486#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 04:33:53,150 INFO L290 TraceCheckUtils]: 69: Hoare triple {4486#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {4486#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 04:33:53,150 INFO L272 TraceCheckUtils]: 70: Hoare triple {4486#(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)); {4268#true} is VALID [2022-04-08 04:33:53,150 INFO L290 TraceCheckUtils]: 71: Hoare triple {4268#true} ~cond := #in~cond; {4268#true} is VALID [2022-04-08 04:33:53,150 INFO L290 TraceCheckUtils]: 72: Hoare triple {4268#true} assume !(0 == ~cond); {4268#true} is VALID [2022-04-08 04:33:53,150 INFO L290 TraceCheckUtils]: 73: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-08 04:33:53,151 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {4268#true} {4486#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #50#return; {4486#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 04:33:53,152 INFO L290 TraceCheckUtils]: 75: Hoare triple {4486#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {4508#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 04:33:53,152 INFO L272 TraceCheckUtils]: 76: Hoare triple {4508#(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)); {4512#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:53,152 INFO L290 TraceCheckUtils]: 77: Hoare triple {4512#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4516#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:53,153 INFO L290 TraceCheckUtils]: 78: Hoare triple {4516#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4269#false} is VALID [2022-04-08 04:33:53,153 INFO L290 TraceCheckUtils]: 79: Hoare triple {4269#false} assume !false; {4269#false} is VALID [2022-04-08 04:33:53,153 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-08 04:33:53,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:33:53,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:53,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32583754] [2022-04-08 04:33:53,430 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:33:53,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368374365] [2022-04-08 04:33:53,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368374365] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:33:53,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:33:53,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 04:33:53,430 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:53,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [813299619] [2022-04-08 04:33:53,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [813299619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:53,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:53,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 04:33:53,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964494971] [2022-04-08 04:33:53,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:53,431 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-08 04:33:53,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:53,431 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-08 04:33:53,472 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-08 04:33:53,472 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 04:33:53,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:53,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 04:33:53,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-08 04:33:53,473 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-08 04:33:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:54,417 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-08 04:33:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 04:33:54,417 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-08 04:33:54,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:54,418 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-08 04:33:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-08 04:33:54,420 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-08 04:33:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-08 04:33:54,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 62 transitions. [2022-04-08 04:33:54,478 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-08 04:33:54,480 INFO L225 Difference]: With dead ends: 57 [2022-04-08 04:33:54,480 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 04:33:54,480 INFO L912 BasicCegarLoop]: 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-08 04:33:54,481 INFO L913 BasicCegarLoop]: 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-08 04:33:54,481 INFO L914 BasicCegarLoop]: 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-08 04:33:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 04:33:54,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 04:33:54,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:54,528 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-08 04:33:54,528 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-08 04:33:54,528 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-08 04:33:54,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:54,530 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-08 04:33:54,530 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-08 04:33:54,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:54,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:54,532 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-08 04:33:54,532 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-08 04:33:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:54,535 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-08 04:33:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-08 04:33:54,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:54,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:54,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:54,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:54,536 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-08 04:33:54,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-04-08 04:33:54,539 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 80 [2022-04-08 04:33:54,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:54,539 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-04-08 04:33:54,539 INFO L479 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-08 04:33:54,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 61 transitions. [2022-04-08 04:33:54,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:33:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-08 04:33:54,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 04:33:54,627 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:54,627 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:54,632 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-08 04:33:54,828 WARN L460 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-08 04:33:54,828 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:54,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:54,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1567631086, now seen corresponding path program 19 times [2022-04-08 04:33:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:54,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2049583934] [2022-04-08 04:33:54,934 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:33:54,935 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:33:54,935 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:33:54,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1567631086, now seen corresponding path program 20 times [2022-04-08 04:33:54,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:54,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923085558] [2022-04-08 04:33:54,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:54,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:54,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:33:54,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575971327] [2022-04-08 04:33:54,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:33:54,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:33:54,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:54,991 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-08 04:33:55,027 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-08 04:33:55,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:33:55,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:33:55,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 04:33:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:55,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:33:56,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {4890#true} call ULTIMATE.init(); {4890#true} is VALID [2022-04-08 04:33:56,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {4890#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); {4890#true} is VALID [2022-04-08 04:33:56,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 04:33:56,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4890#true} {4890#true} #56#return; {4890#true} is VALID [2022-04-08 04:33:56,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {4890#true} call #t~ret5 := main(); {4890#true} is VALID [2022-04-08 04:33:56,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {4890#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; {4910#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:56,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {4910#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4910#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:56,318 INFO L272 TraceCheckUtils]: 7: Hoare triple {4910#(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)); {4890#true} is VALID [2022-04-08 04:33:56,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 04:33:56,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 04:33:56,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 04:33:56,319 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4890#true} {4910#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {4910#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:56,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {4910#(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; {4932#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:33:56,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {4932#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {4932#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:33:56,319 INFO L272 TraceCheckUtils]: 14: Hoare triple {4932#(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)); {4890#true} is VALID [2022-04-08 04:33:56,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 04:33:56,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 04:33:56,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 04:33:56,320 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4890#true} {4932#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {4932#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:33:56,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {4932#(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; {4954#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:33:56,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {4954#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {4954#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:33:56,321 INFO L272 TraceCheckUtils]: 21: Hoare triple {4954#(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)); {4890#true} is VALID [2022-04-08 04:33:56,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 04:33:56,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 04:33:56,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 04:33:56,321 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4890#true} {4954#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {4954#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:33:56,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {4954#(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; {4976#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:33:56,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {4976#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4976#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:33:56,322 INFO L272 TraceCheckUtils]: 28: Hoare triple {4976#(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)); {4890#true} is VALID [2022-04-08 04:33:56,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 04:33:56,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 04:33:56,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 04:33:56,325 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4890#true} {4976#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {4976#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:33:56,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {4976#(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; {4998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 04:33:56,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {4998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {4998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 04:33:56,326 INFO L272 TraceCheckUtils]: 35: Hoare triple {4998#(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)); {4890#true} is VALID [2022-04-08 04:33:56,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 04:33:56,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 04:33:56,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 04:33:56,327 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4890#true} {4998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #50#return; {4998#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 04:33:56,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {4998#(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; {5020#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 04:33:56,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {5020#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {5020#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 04:33:56,327 INFO L272 TraceCheckUtils]: 42: Hoare triple {5020#(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)); {4890#true} is VALID [2022-04-08 04:33:56,327 INFO L290 TraceCheckUtils]: 43: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 04:33:56,327 INFO L290 TraceCheckUtils]: 44: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 04:33:56,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 04:33:56,335 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4890#true} {5020#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #50#return; {5020#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 04:33:56,336 INFO L290 TraceCheckUtils]: 47: Hoare triple {5020#(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; {5042#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:33:56,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {5042#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {5042#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:33:56,336 INFO L272 TraceCheckUtils]: 49: Hoare triple {5042#(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)); {4890#true} is VALID [2022-04-08 04:33:56,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 04:33:56,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 04:33:56,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 04:33:56,337 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4890#true} {5042#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {5042#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:33:56,337 INFO L290 TraceCheckUtils]: 54: Hoare triple {5042#(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; {5064#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:33:56,338 INFO L290 TraceCheckUtils]: 55: Hoare triple {5064#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {5064#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:33:56,338 INFO L272 TraceCheckUtils]: 56: Hoare triple {5064#(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)); {4890#true} is VALID [2022-04-08 04:33:56,338 INFO L290 TraceCheckUtils]: 57: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 04:33:56,338 INFO L290 TraceCheckUtils]: 58: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 04:33:56,338 INFO L290 TraceCheckUtils]: 59: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 04:33:56,339 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4890#true} {5064#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {5064#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:33:56,339 INFO L290 TraceCheckUtils]: 61: Hoare triple {5064#(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; {5086#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 04:33:56,340 INFO L290 TraceCheckUtils]: 62: Hoare triple {5086#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {5086#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 04:33:56,340 INFO L272 TraceCheckUtils]: 63: Hoare triple {5086#(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)); {4890#true} is VALID [2022-04-08 04:33:56,340 INFO L290 TraceCheckUtils]: 64: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 04:33:56,340 INFO L290 TraceCheckUtils]: 65: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 04:33:56,340 INFO L290 TraceCheckUtils]: 66: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 04:33:56,341 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {4890#true} {5086#(and (= main_~y~0 8) (= main_~c~0 8))} #50#return; {5086#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 04:33:56,342 INFO L290 TraceCheckUtils]: 68: Hoare triple {5086#(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; {5108#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 04:33:56,342 INFO L290 TraceCheckUtils]: 69: Hoare triple {5108#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {5108#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 04:33:56,342 INFO L272 TraceCheckUtils]: 70: Hoare triple {5108#(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)); {4890#true} is VALID [2022-04-08 04:33:56,342 INFO L290 TraceCheckUtils]: 71: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 04:33:56,342 INFO L290 TraceCheckUtils]: 72: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 04:33:56,342 INFO L290 TraceCheckUtils]: 73: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 04:33:56,343 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {4890#true} {5108#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #50#return; {5108#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 04:33:56,343 INFO L290 TraceCheckUtils]: 75: Hoare triple {5108#(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; {5130#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-08 04:33:56,344 INFO L290 TraceCheckUtils]: 76: Hoare triple {5130#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} assume !false; {5130#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-08 04:33:56,344 INFO L272 TraceCheckUtils]: 77: Hoare triple {5130#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 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)); {4890#true} is VALID [2022-04-08 04:33:56,344 INFO L290 TraceCheckUtils]: 78: Hoare triple {4890#true} ~cond := #in~cond; {4890#true} is VALID [2022-04-08 04:33:56,344 INFO L290 TraceCheckUtils]: 79: Hoare triple {4890#true} assume !(0 == ~cond); {4890#true} is VALID [2022-04-08 04:33:56,344 INFO L290 TraceCheckUtils]: 80: Hoare triple {4890#true} assume true; {4890#true} is VALID [2022-04-08 04:33:56,345 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {4890#true} {5130#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} #50#return; {5130#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-08 04:33:56,345 INFO L290 TraceCheckUtils]: 82: Hoare triple {5130#(and (<= main_~c~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {5152#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} is VALID [2022-04-08 04:33:56,346 INFO L272 TraceCheckUtils]: 83: Hoare triple {5152#(and (<= main_~k~0 10) (= (+ (- 2) main_~y~0) 8) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5156#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:56,347 INFO L290 TraceCheckUtils]: 84: Hoare triple {5156#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5160#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:56,347 INFO L290 TraceCheckUtils]: 85: Hoare triple {5160#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4891#false} is VALID [2022-04-08 04:33:56,347 INFO L290 TraceCheckUtils]: 86: Hoare triple {4891#false} assume !false; {4891#false} is VALID [2022-04-08 04:33:56,347 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-08 04:33:56,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:33:56,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:56,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923085558] [2022-04-08 04:33:56,609 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:33:56,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575971327] [2022-04-08 04:33:56,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575971327] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:33:56,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:33:56,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-08 04:33:56,610 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:56,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2049583934] [2022-04-08 04:33:56,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2049583934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:56,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:56,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 04:33:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624762670] [2022-04-08 04:33:56,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:56,610 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-08 04:33:56,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:56,611 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-08 04:33:56,652 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-08 04:33:56,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 04:33:56,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:56,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 04:33:56,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-08 04:33:56,653 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-08 04:33:57,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:57,752 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-08 04:33:57,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 04:33:57,752 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-08 04:33:57,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:57,752 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-08 04:33:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 66 transitions. [2022-04-08 04:33:57,754 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-08 04:33:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 66 transitions. [2022-04-08 04:33:57,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 66 transitions. [2022-04-08 04:33:57,804 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-08 04:33:57,805 INFO L225 Difference]: With dead ends: 60 [2022-04-08 04:33:57,805 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 04:33:57,805 INFO L912 BasicCegarLoop]: 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-08 04:33:57,806 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:33:57,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 363 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 04:33:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 04:33:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-08 04:33:57,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:57,866 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-08 04:33:57,866 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-08 04:33:57,867 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-08 04:33:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:57,868 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-08 04:33:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-04-08 04:33:57,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:57,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:57,869 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-08 04:33:57,869 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-08 04:33:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:57,870 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-08 04:33:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-04-08 04:33:57,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:57,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:57,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:57,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:57,871 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-08 04:33:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2022-04-08 04:33:57,872 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 87 [2022-04-08 04:33:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:57,873 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2022-04-08 04:33:57,873 INFO L479 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-08 04:33:57,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 65 transitions. [2022-04-08 04:33:57,984 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-08 04:33:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-04-08 04:33:57,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-08 04:33:57,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:57,986 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:57,997 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-08 04:33:58,186 WARN L460 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-08 04:33:58,187 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:58,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:58,187 INFO L85 PathProgramCache]: Analyzing trace with hash 169050565, now seen corresponding path program 21 times [2022-04-08 04:33:58,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:58,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [128550378] [2022-04-08 04:33:58,258 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:33:58,259 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:33:58,259 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:33:58,259 INFO L85 PathProgramCache]: Analyzing trace with hash 169050565, now seen corresponding path program 22 times [2022-04-08 04:33:58,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:58,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067247550] [2022-04-08 04:33:58,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:58,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:58,270 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:33:58,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1088226581] [2022-04-08 04:33:58,270 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:33:58,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:33:58,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:58,271 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-08 04:33:58,296 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-08 04:33:59,448 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:33:59,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:33:59,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 04:33:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:59,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:34:00,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {5552#true} call ULTIMATE.init(); {5552#true} is VALID [2022-04-08 04:34:00,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {5552#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); {5552#true} is VALID [2022-04-08 04:34:00,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 04:34:00,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5552#true} {5552#true} #56#return; {5552#true} is VALID [2022-04-08 04:34:00,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {5552#true} call #t~ret5 := main(); {5552#true} is VALID [2022-04-08 04:34:00,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {5552#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; {5572#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:00,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {5572#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5572#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:00,032 INFO L272 TraceCheckUtils]: 7: Hoare triple {5572#(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)); {5552#true} is VALID [2022-04-08 04:34:00,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 04:34:00,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 04:34:00,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 04:34:00,033 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5552#true} {5572#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {5572#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:00,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {5572#(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; {5594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:34:00,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {5594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {5594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:34:00,034 INFO L272 TraceCheckUtils]: 14: Hoare triple {5594#(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)); {5552#true} is VALID [2022-04-08 04:34:00,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 04:34:00,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 04:34:00,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 04:34:00,034 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5552#true} {5594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {5594#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:34:00,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {5594#(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; {5616#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:00,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {5616#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {5616#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:00,035 INFO L272 TraceCheckUtils]: 21: Hoare triple {5616#(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)); {5552#true} is VALID [2022-04-08 04:34:00,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 04:34:00,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 04:34:00,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 04:34:00,037 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5552#true} {5616#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #50#return; {5616#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:00,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {5616#(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; {5638#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 04:34:00,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {5638#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {5638#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 04:34:00,038 INFO L272 TraceCheckUtils]: 28: Hoare triple {5638#(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)); {5552#true} is VALID [2022-04-08 04:34:00,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 04:34:00,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 04:34:00,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 04:34:00,039 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5552#true} {5638#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #50#return; {5638#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 04:34:00,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {5638#(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; {5660#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 04:34:00,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {5660#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {5660#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 04:34:00,040 INFO L272 TraceCheckUtils]: 35: Hoare triple {5660#(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)); {5552#true} is VALID [2022-04-08 04:34:00,040 INFO L290 TraceCheckUtils]: 36: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 04:34:00,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 04:34:00,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 04:34:00,040 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5552#true} {5660#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #50#return; {5660#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 04:34:00,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {5660#(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; {5682#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 04:34:00,041 INFO L290 TraceCheckUtils]: 41: Hoare triple {5682#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {5682#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 04:34:00,041 INFO L272 TraceCheckUtils]: 42: Hoare triple {5682#(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)); {5552#true} is VALID [2022-04-08 04:34:00,041 INFO L290 TraceCheckUtils]: 43: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 04:34:00,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 04:34:00,041 INFO L290 TraceCheckUtils]: 45: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 04:34:00,042 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5552#true} {5682#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #50#return; {5682#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 04:34:00,042 INFO L290 TraceCheckUtils]: 47: Hoare triple {5682#(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; {5704#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:34:00,042 INFO L290 TraceCheckUtils]: 48: Hoare triple {5704#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {5704#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:34:00,043 INFO L272 TraceCheckUtils]: 49: Hoare triple {5704#(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)); {5552#true} is VALID [2022-04-08 04:34:00,043 INFO L290 TraceCheckUtils]: 50: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 04:34:00,043 INFO L290 TraceCheckUtils]: 51: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 04:34:00,043 INFO L290 TraceCheckUtils]: 52: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 04:34:00,043 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5552#true} {5704#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #50#return; {5704#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:34:00,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {5704#(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; {5726#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:00,044 INFO L290 TraceCheckUtils]: 55: Hoare triple {5726#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {5726#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:00,044 INFO L272 TraceCheckUtils]: 56: Hoare triple {5726#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 04:34:00,044 INFO L290 TraceCheckUtils]: 57: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 04:34:00,044 INFO L290 TraceCheckUtils]: 58: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 04:34:00,044 INFO L290 TraceCheckUtils]: 59: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 04:34:00,045 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5552#true} {5726#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #50#return; {5726#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:00,045 INFO L290 TraceCheckUtils]: 61: Hoare triple {5726#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5748#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:34:00,045 INFO L290 TraceCheckUtils]: 62: Hoare triple {5748#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} assume !false; {5748#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:34:00,045 INFO L272 TraceCheckUtils]: 63: Hoare triple {5748#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 04:34:00,045 INFO L290 TraceCheckUtils]: 64: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 04:34:00,045 INFO L290 TraceCheckUtils]: 65: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 04:34:00,046 INFO L290 TraceCheckUtils]: 66: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 04:34:00,046 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {5552#true} {5748#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} #50#return; {5748#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:34:00,046 INFO L290 TraceCheckUtils]: 68: Hoare triple {5748#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5770#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 04:34:00,047 INFO L290 TraceCheckUtils]: 69: Hoare triple {5770#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {5770#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 04:34:00,047 INFO L272 TraceCheckUtils]: 70: Hoare triple {5770#(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)); {5552#true} is VALID [2022-04-08 04:34:00,047 INFO L290 TraceCheckUtils]: 71: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 04:34:00,047 INFO L290 TraceCheckUtils]: 72: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 04:34:00,047 INFO L290 TraceCheckUtils]: 73: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 04:34:00,047 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {5552#true} {5770#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #50#return; {5770#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 04:34:00,048 INFO L290 TraceCheckUtils]: 75: Hoare triple {5770#(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; {5792#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 04:34:00,048 INFO L290 TraceCheckUtils]: 76: Hoare triple {5792#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !false; {5792#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 04:34:00,048 INFO L272 TraceCheckUtils]: 77: Hoare triple {5792#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 04:34:00,048 INFO L290 TraceCheckUtils]: 78: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 04:34:00,048 INFO L290 TraceCheckUtils]: 79: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 04:34:00,048 INFO L290 TraceCheckUtils]: 80: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 04:34:00,049 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {5552#true} {5792#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} #50#return; {5792#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 04:34:00,049 INFO L290 TraceCheckUtils]: 82: Hoare triple {5792#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5814#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-08 04:34:00,050 INFO L290 TraceCheckUtils]: 83: Hoare triple {5814#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !false; {5814#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-08 04:34:00,050 INFO L272 TraceCheckUtils]: 84: Hoare triple {5814#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5552#true} is VALID [2022-04-08 04:34:00,050 INFO L290 TraceCheckUtils]: 85: Hoare triple {5552#true} ~cond := #in~cond; {5552#true} is VALID [2022-04-08 04:34:00,050 INFO L290 TraceCheckUtils]: 86: Hoare triple {5552#true} assume !(0 == ~cond); {5552#true} is VALID [2022-04-08 04:34:00,050 INFO L290 TraceCheckUtils]: 87: Hoare triple {5552#true} assume true; {5552#true} is VALID [2022-04-08 04:34:00,050 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {5552#true} {5814#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} #50#return; {5814#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-08 04:34:00,051 INFO L290 TraceCheckUtils]: 89: Hoare triple {5814#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !(~c~0 < ~k~0); {5836#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} is VALID [2022-04-08 04:34:00,054 INFO L272 TraceCheckUtils]: 90: Hoare triple {5836#(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)); {5840#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:34:00,055 INFO L290 TraceCheckUtils]: 91: Hoare triple {5840#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5844#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:34:00,055 INFO L290 TraceCheckUtils]: 92: Hoare triple {5844#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5553#false} is VALID [2022-04-08 04:34:00,055 INFO L290 TraceCheckUtils]: 93: Hoare triple {5553#false} assume !false; {5553#false} is VALID [2022-04-08 04:34:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 04:34:00,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:34:00,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:34:00,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067247550] [2022-04-08 04:34:00,356 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:34:00,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088226581] [2022-04-08 04:34:00,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088226581] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:34:00,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:34:00,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-08 04:34:00,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:34:00,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [128550378] [2022-04-08 04:34:00,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [128550378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:34:00,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:34:00,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 04:34:00,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905520283] [2022-04-08 04:34:00,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:34:00,359 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 94 [2022-04-08 04:34:00,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:34:00,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:34:00,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:34:00,457 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 04:34:00,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:00,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 04:34:00,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-08 04:34:00,458 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:34:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:01,684 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-08 04:34:01,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 04:34:01,684 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 94 [2022-04-08 04:34:01,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:34:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:34:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2022-04-08 04:34:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:34:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2022-04-08 04:34:01,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 70 transitions. [2022-04-08 04:34:01,746 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-08 04:34:01,747 INFO L225 Difference]: With dead ends: 63 [2022-04-08 04:34:01,747 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 04:34:01,747 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-08 04:34:01,748 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 04:34:01,748 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 404 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 04:34:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 04:34:01,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-08 04:34:01,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:34:01,795 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-08 04:34:01,795 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-08 04:34:01,795 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-08 04:34:01,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:01,796 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-08 04:34:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-08 04:34:01,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:01,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:01,797 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-08 04:34:01,797 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-08 04:34:01,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:01,799 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-08 04:34:01,799 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-08 04:34:01,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:01,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:01,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:34:01,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:34:01,800 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-08 04:34:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2022-04-08 04:34:01,801 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 94 [2022-04-08 04:34:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:34:01,801 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2022-04-08 04:34:01,801 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:34:01,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 69 transitions. [2022-04-08 04:34:01,892 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-08 04:34:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-08 04:34:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 04:34:01,893 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:34:01,893 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:34:01,898 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-08 04:34:02,093 WARN L460 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-08 04:34:02,094 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:34:02,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:34:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash 555039154, now seen corresponding path program 23 times [2022-04-08 04:34:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:02,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [564848977] [2022-04-08 04:34:02,184 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:34:02,184 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:34:02,184 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:34:02,184 INFO L85 PathProgramCache]: Analyzing trace with hash 555039154, now seen corresponding path program 24 times [2022-04-08 04:34:02,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:34:02,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498185771] [2022-04-08 04:34:02,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:34:02,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:34:02,196 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:34:02,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717008780] [2022-04-08 04:34:02,197 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:34:02,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:34:02,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:34:02,202 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-08 04:34:02,214 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-08 04:34:02,833 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 04:34:02,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:34:02,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-08 04:34:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:34:02,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:34:03,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {6254#true} call ULTIMATE.init(); {6254#true} is VALID [2022-04-08 04:34:03,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {6254#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); {6254#true} is VALID [2022-04-08 04:34:03,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 04:34:03,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6254#true} {6254#true} #56#return; {6254#true} is VALID [2022-04-08 04:34:03,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {6254#true} call #t~ret5 := main(); {6254#true} is VALID [2022-04-08 04:34:03,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {6254#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; {6274#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:03,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {6274#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6274#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:03,452 INFO L272 TraceCheckUtils]: 7: Hoare triple {6274#(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)); {6254#true} is VALID [2022-04-08 04:34:03,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 04:34:03,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 04:34:03,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 04:34:03,452 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6254#true} {6274#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {6274#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:03,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {6274#(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; {6296#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:34:03,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {6296#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {6296#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:34:03,453 INFO L272 TraceCheckUtils]: 14: Hoare triple {6296#(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)); {6254#true} is VALID [2022-04-08 04:34:03,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 04:34:03,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 04:34:03,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 04:34:03,454 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6254#true} {6296#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {6296#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:34:03,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {6296#(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; {6318#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:34:03,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {6318#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {6318#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:34:03,455 INFO L272 TraceCheckUtils]: 21: Hoare triple {6318#(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)); {6254#true} is VALID [2022-04-08 04:34:03,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 04:34:03,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 04:34:03,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 04:34:03,455 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6254#true} {6318#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {6318#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:34:03,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {6318#(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; {6340#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:34:03,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {6340#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {6340#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:34:03,457 INFO L272 TraceCheckUtils]: 28: Hoare triple {6340#(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)); {6254#true} is VALID [2022-04-08 04:34:03,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 04:34:03,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 04:34:03,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 04:34:03,458 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6254#true} {6340#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {6340#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:34:03,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {6340#(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; {6362#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:03,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {6362#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {6362#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:03,459 INFO L272 TraceCheckUtils]: 35: Hoare triple {6362#(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)); {6254#true} is VALID [2022-04-08 04:34:03,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 04:34:03,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 04:34:03,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 04:34:03,459 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6254#true} {6362#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #50#return; {6362#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:03,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {6362#(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; {6384#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:03,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {6384#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !false; {6384#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:03,460 INFO L272 TraceCheckUtils]: 42: Hoare triple {6384#(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)); {6254#true} is VALID [2022-04-08 04:34:03,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 04:34:03,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 04:34:03,460 INFO L290 TraceCheckUtils]: 45: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 04:34:03,461 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6254#true} {6384#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #50#return; {6384#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:03,461 INFO L290 TraceCheckUtils]: 47: Hoare triple {6384#(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; {6406#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:03,462 INFO L290 TraceCheckUtils]: 48: Hoare triple {6406#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} assume !false; {6406#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:03,462 INFO L272 TraceCheckUtils]: 49: Hoare triple {6406#(and (= (+ main_~c~0 (- 3)) 3) (= 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)); {6254#true} is VALID [2022-04-08 04:34:03,462 INFO L290 TraceCheckUtils]: 50: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 04:34:03,462 INFO L290 TraceCheckUtils]: 51: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 04:34:03,462 INFO L290 TraceCheckUtils]: 52: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 04:34:03,463 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6254#true} {6406#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} #50#return; {6406#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:03,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {6406#(and (= (+ main_~c~0 (- 3)) 3) (= 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; {6428#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 04:34:03,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {6428#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {6428#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 04:34:03,465 INFO L272 TraceCheckUtils]: 56: Hoare triple {6428#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6254#true} is VALID [2022-04-08 04:34:03,465 INFO L290 TraceCheckUtils]: 57: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 04:34:03,465 INFO L290 TraceCheckUtils]: 58: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 04:34:03,465 INFO L290 TraceCheckUtils]: 59: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 04:34:03,465 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6254#true} {6428#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #50#return; {6428#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 04:34:03,466 INFO L290 TraceCheckUtils]: 61: Hoare triple {6428#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6450#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:34:03,466 INFO L290 TraceCheckUtils]: 62: Hoare triple {6450#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !false; {6450#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:34:03,467 INFO L272 TraceCheckUtils]: 63: Hoare triple {6450#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6254#true} is VALID [2022-04-08 04:34:03,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 04:34:03,467 INFO L290 TraceCheckUtils]: 65: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 04:34:03,467 INFO L290 TraceCheckUtils]: 66: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 04:34:03,467 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {6254#true} {6450#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} #50#return; {6450#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:34:03,468 INFO L290 TraceCheckUtils]: 68: Hoare triple {6450#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6472#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:03,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {6472#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {6472#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:03,469 INFO L272 TraceCheckUtils]: 70: Hoare triple {6472#(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)); {6254#true} is VALID [2022-04-08 04:34:03,469 INFO L290 TraceCheckUtils]: 71: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 04:34:03,469 INFO L290 TraceCheckUtils]: 72: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 04:34:03,469 INFO L290 TraceCheckUtils]: 73: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 04:34:03,469 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6254#true} {6472#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #50#return; {6472#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:03,470 INFO L290 TraceCheckUtils]: 75: Hoare triple {6472#(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; {6494#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:03,470 INFO L290 TraceCheckUtils]: 76: Hoare triple {6494#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {6494#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:03,470 INFO L272 TraceCheckUtils]: 77: Hoare triple {6494#(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)); {6254#true} is VALID [2022-04-08 04:34:03,471 INFO L290 TraceCheckUtils]: 78: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 04:34:03,471 INFO L290 TraceCheckUtils]: 79: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 04:34:03,471 INFO L290 TraceCheckUtils]: 80: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 04:34:03,471 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6254#true} {6494#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {6494#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:03,472 INFO L290 TraceCheckUtils]: 82: Hoare triple {6494#(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; {6516#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:34:03,472 INFO L290 TraceCheckUtils]: 83: Hoare triple {6516#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {6516#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:34:03,472 INFO L272 TraceCheckUtils]: 84: Hoare triple {6516#(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)); {6254#true} is VALID [2022-04-08 04:34:03,472 INFO L290 TraceCheckUtils]: 85: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 04:34:03,473 INFO L290 TraceCheckUtils]: 86: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 04:34:03,473 INFO L290 TraceCheckUtils]: 87: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 04:34:03,473 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6254#true} {6516#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {6516#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:34:03,474 INFO L290 TraceCheckUtils]: 89: Hoare triple {6516#(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; {6538#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} is VALID [2022-04-08 04:34:03,474 INFO L290 TraceCheckUtils]: 90: Hoare triple {6538#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} assume !false; {6538#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} is VALID [2022-04-08 04:34:03,474 INFO L272 TraceCheckUtils]: 91: Hoare triple {6538#(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)); {6254#true} is VALID [2022-04-08 04:34:03,474 INFO L290 TraceCheckUtils]: 92: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-04-08 04:34:03,475 INFO L290 TraceCheckUtils]: 93: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-04-08 04:34:03,475 INFO L290 TraceCheckUtils]: 94: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-04-08 04:34:03,475 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {6254#true} {6538#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} #50#return; {6538#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} is VALID [2022-04-08 04:34:03,476 INFO L290 TraceCheckUtils]: 96: Hoare triple {6538#(and (<= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {6560#(and (= (+ (- 1) main_~y~0) 11) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-08 04:34:03,477 INFO L272 TraceCheckUtils]: 97: Hoare triple {6560#(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)); {6564#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:34:03,477 INFO L290 TraceCheckUtils]: 98: Hoare triple {6564#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6568#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:34:03,477 INFO L290 TraceCheckUtils]: 99: Hoare triple {6568#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6255#false} is VALID [2022-04-08 04:34:03,477 INFO L290 TraceCheckUtils]: 100: Hoare triple {6255#false} assume !false; {6255#false} is VALID [2022-04-08 04:34:03,478 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-08 04:34:03,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:34:03,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:34:03,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498185771] [2022-04-08 04:34:03,770 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:34:03,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717008780] [2022-04-08 04:34:03,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717008780] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:34:03,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:34:03,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-08 04:34:03,775 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:34:03,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [564848977] [2022-04-08 04:34:03,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [564848977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:34:03,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:34:03,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 04:34:03,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90138533] [2022-04-08 04:34:03,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:34:03,777 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-08 04:34:03,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:34:03,778 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-08 04:34:03,825 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-08 04:34:03,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 04:34:03,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:03,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 04:34:03,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-08 04:34:03,826 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-08 04:34:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:05,326 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-08 04:34:05,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 04:34:05,326 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-08 04:34:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:34:05,327 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-08 04:34:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-08 04:34:05,329 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-08 04:34:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-08 04:34:05,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 74 transitions. [2022-04-08 04:34:05,394 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-08 04:34:05,395 INFO L225 Difference]: With dead ends: 66 [2022-04-08 04:34:05,395 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 04:34:05,395 INFO L912 BasicCegarLoop]: 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-08 04:34:05,396 INFO L913 BasicCegarLoop]: 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-08 04:34:05,396 INFO L914 BasicCegarLoop]: 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-08 04:34:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 04:34:05,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-08 04:34:05,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:34:05,457 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-08 04:34:05,457 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-08 04:34:05,457 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-08 04:34:05,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:05,459 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-08 04:34:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-08 04:34:05,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:05,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:05,459 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-08 04:34:05,460 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-08 04:34:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:05,462 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-08 04:34:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-08 04:34:05,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:05,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:05,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:34:05,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:34:05,462 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-08 04:34:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-04-08 04:34:05,464 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 101 [2022-04-08 04:34:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:34:05,464 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-04-08 04:34:05,464 INFO L479 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-08 04:34:05,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 73 transitions. [2022-04-08 04:34:05,585 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-08 04:34:05,585 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-08 04:34:05,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-08 04:34:05,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:34:05,587 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:34:05,595 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-08 04:34:05,787 WARN L460 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-08 04:34:05,787 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:34:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:34:05,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2038312229, now seen corresponding path program 25 times [2022-04-08 04:34:05,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:05,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [954985315] [2022-04-08 04:34:05,858 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:34:05,858 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:34:05,858 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:34:05,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2038312229, now seen corresponding path program 26 times [2022-04-08 04:34:05,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:34:05,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016243625] [2022-04-08 04:34:05,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:34:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:34:05,870 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:34:05,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1267224267] [2022-04-08 04:34:05,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:34:05,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:34:05,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:34:05,872 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-08 04:34:05,883 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-08 04:34:06,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:34:06,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:34:06,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-08 04:34:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:34:06,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:34:07,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {6996#true} call ULTIMATE.init(); {6996#true} is VALID [2022-04-08 04:34:07,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {6996#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); {6996#true} is VALID [2022-04-08 04:34:07,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 04:34:07,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6996#true} {6996#true} #56#return; {6996#true} is VALID [2022-04-08 04:34:07,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {6996#true} call #t~ret5 := main(); {6996#true} is VALID [2022-04-08 04:34:07,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {6996#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; {7016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:07,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {7016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:07,099 INFO L272 TraceCheckUtils]: 7: Hoare triple {7016#(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)); {6996#true} is VALID [2022-04-08 04:34:07,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 04:34:07,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 04:34:07,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 04:34:07,099 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6996#true} {7016#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {7016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:07,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {7016#(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; {7038#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:34:07,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {7038#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7038#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:34:07,100 INFO L272 TraceCheckUtils]: 14: Hoare triple {7038#(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)); {6996#true} is VALID [2022-04-08 04:34:07,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 04:34:07,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 04:34:07,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 04:34:07,103 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6996#true} {7038#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {7038#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:34:07,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {7038#(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; {7060#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 04:34:07,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {7060#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {7060#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 04:34:07,104 INFO L272 TraceCheckUtils]: 21: Hoare triple {7060#(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)); {6996#true} is VALID [2022-04-08 04:34:07,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 04:34:07,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 04:34:07,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 04:34:07,105 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6996#true} {7060#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #50#return; {7060#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 04:34:07,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {7060#(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; {7082#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 04:34:07,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {7082#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {7082#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 04:34:07,106 INFO L272 TraceCheckUtils]: 28: Hoare triple {7082#(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)); {6996#true} is VALID [2022-04-08 04:34:07,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 04:34:07,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 04:34:07,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 04:34:07,107 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6996#true} {7082#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #50#return; {7082#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 04:34:07,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {7082#(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; {7104#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:34:07,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {7104#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {7104#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:34:07,108 INFO L272 TraceCheckUtils]: 35: Hoare triple {7104#(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)); {6996#true} is VALID [2022-04-08 04:34:07,108 INFO L290 TraceCheckUtils]: 36: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 04:34:07,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 04:34:07,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 04:34:07,109 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6996#true} {7104#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {7104#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:34:07,109 INFO L290 TraceCheckUtils]: 40: Hoare triple {7104#(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; {7126#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 04:34:07,110 INFO L290 TraceCheckUtils]: 41: Hoare triple {7126#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {7126#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 04:34:07,110 INFO L272 TraceCheckUtils]: 42: Hoare triple {7126#(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)); {6996#true} is VALID [2022-04-08 04:34:07,110 INFO L290 TraceCheckUtils]: 43: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 04:34:07,110 INFO L290 TraceCheckUtils]: 44: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 04:34:07,110 INFO L290 TraceCheckUtils]: 45: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 04:34:07,111 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6996#true} {7126#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #50#return; {7126#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 04:34:07,111 INFO L290 TraceCheckUtils]: 47: Hoare triple {7126#(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; {7148#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 04:34:07,112 INFO L290 TraceCheckUtils]: 48: Hoare triple {7148#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !false; {7148#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 04:34:07,112 INFO L272 TraceCheckUtils]: 49: Hoare triple {7148#(and (= main_~c~0 6) (= (+ (- 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)); {6996#true} is VALID [2022-04-08 04:34:07,112 INFO L290 TraceCheckUtils]: 50: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 04:34:07,112 INFO L290 TraceCheckUtils]: 51: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 04:34:07,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 04:34:07,112 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6996#true} {7148#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} #50#return; {7148#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 04:34:07,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {7148#(and (= main_~c~0 6) (= (+ (- 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; {7170#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:34:07,113 INFO L290 TraceCheckUtils]: 55: Hoare triple {7170#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {7170#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:34:07,113 INFO L272 TraceCheckUtils]: 56: Hoare triple {7170#(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)); {6996#true} is VALID [2022-04-08 04:34:07,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 04:34:07,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 04:34:07,114 INFO L290 TraceCheckUtils]: 59: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 04:34:07,114 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6996#true} {7170#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {7170#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:34:07,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {7170#(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; {7192#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 04:34:07,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {7192#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {7192#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 04:34:07,115 INFO L272 TraceCheckUtils]: 63: Hoare triple {7192#(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)); {6996#true} is VALID [2022-04-08 04:34:07,115 INFO L290 TraceCheckUtils]: 64: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 04:34:07,115 INFO L290 TraceCheckUtils]: 65: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 04:34:07,115 INFO L290 TraceCheckUtils]: 66: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 04:34:07,116 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {6996#true} {7192#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #50#return; {7192#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 04:34:07,116 INFO L290 TraceCheckUtils]: 68: Hoare triple {7192#(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; {7214#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 04:34:07,117 INFO L290 TraceCheckUtils]: 69: Hoare triple {7214#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {7214#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 04:34:07,117 INFO L272 TraceCheckUtils]: 70: Hoare triple {7214#(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)); {6996#true} is VALID [2022-04-08 04:34:07,117 INFO L290 TraceCheckUtils]: 71: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 04:34:07,117 INFO L290 TraceCheckUtils]: 72: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 04:34:07,117 INFO L290 TraceCheckUtils]: 73: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 04:34:07,118 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6996#true} {7214#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {7214#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 04:34:07,118 INFO L290 TraceCheckUtils]: 75: Hoare triple {7214#(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; {7236#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:07,119 INFO L290 TraceCheckUtils]: 76: Hoare triple {7236#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {7236#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:07,119 INFO L272 TraceCheckUtils]: 77: Hoare triple {7236#(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)); {6996#true} is VALID [2022-04-08 04:34:07,119 INFO L290 TraceCheckUtils]: 78: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 04:34:07,119 INFO L290 TraceCheckUtils]: 79: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 04:34:07,119 INFO L290 TraceCheckUtils]: 80: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 04:34:07,119 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6996#true} {7236#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {7236#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:07,120 INFO L290 TraceCheckUtils]: 82: Hoare triple {7236#(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; {7258#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 04:34:07,120 INFO L290 TraceCheckUtils]: 83: Hoare triple {7258#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !false; {7258#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 04:34:07,120 INFO L272 TraceCheckUtils]: 84: Hoare triple {7258#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 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)); {6996#true} is VALID [2022-04-08 04:34:07,121 INFO L290 TraceCheckUtils]: 85: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 04:34:07,121 INFO L290 TraceCheckUtils]: 86: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 04:34:07,121 INFO L290 TraceCheckUtils]: 87: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 04:34:07,121 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6996#true} {7258#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #50#return; {7258#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 04:34:07,122 INFO L290 TraceCheckUtils]: 89: Hoare triple {7258#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 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; {7280#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:34:07,122 INFO L290 TraceCheckUtils]: 90: Hoare triple {7280#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {7280#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:34:07,122 INFO L272 TraceCheckUtils]: 91: Hoare triple {7280#(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)); {6996#true} is VALID [2022-04-08 04:34:07,122 INFO L290 TraceCheckUtils]: 92: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 04:34:07,122 INFO L290 TraceCheckUtils]: 93: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 04:34:07,123 INFO L290 TraceCheckUtils]: 94: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 04:34:07,123 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {6996#true} {7280#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {7280#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:34:07,124 INFO L290 TraceCheckUtils]: 96: Hoare triple {7280#(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; {7302#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:34:07,124 INFO L290 TraceCheckUtils]: 97: Hoare triple {7302#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !false; {7302#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:34:07,124 INFO L272 TraceCheckUtils]: 98: Hoare triple {7302#(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)); {6996#true} is VALID [2022-04-08 04:34:07,124 INFO L290 TraceCheckUtils]: 99: Hoare triple {6996#true} ~cond := #in~cond; {6996#true} is VALID [2022-04-08 04:34:07,124 INFO L290 TraceCheckUtils]: 100: Hoare triple {6996#true} assume !(0 == ~cond); {6996#true} is VALID [2022-04-08 04:34:07,124 INFO L290 TraceCheckUtils]: 101: Hoare triple {6996#true} assume true; {6996#true} is VALID [2022-04-08 04:34:07,125 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {6996#true} {7302#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #50#return; {7302#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:34:07,126 INFO L290 TraceCheckUtils]: 103: Hoare triple {7302#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {7324#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:34:07,126 INFO L272 TraceCheckUtils]: 104: Hoare triple {7324#(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)); {7328#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:34:07,127 INFO L290 TraceCheckUtils]: 105: Hoare triple {7328#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7332#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:34:07,127 INFO L290 TraceCheckUtils]: 106: Hoare triple {7332#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6997#false} is VALID [2022-04-08 04:34:07,127 INFO L290 TraceCheckUtils]: 107: Hoare triple {6997#false} assume !false; {6997#false} is VALID [2022-04-08 04:34:07,128 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-08 04:34:07,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:34:07,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:34:07,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016243625] [2022-04-08 04:34:07,392 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:34:07,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267224267] [2022-04-08 04:34:07,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267224267] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:34:07,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:34:07,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-08 04:34:07,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:34:07,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [954985315] [2022-04-08 04:34:07,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [954985315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:34:07,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:34:07,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 04:34:07,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893437983] [2022-04-08 04:34:07,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:34:07,393 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-08 04:34:07,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:34:07,393 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-08 04:34:07,448 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-08 04:34:07,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 04:34:07,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:07,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 04:34:07,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-08 04:34:07,449 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-08 04:34:09,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:09,448 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-08 04:34:09,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 04:34:09,448 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-08 04:34:09,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:34:09,449 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-08 04:34:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 78 transitions. [2022-04-08 04:34:09,450 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-08 04:34:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 78 transitions. [2022-04-08 04:34:09,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 78 transitions. [2022-04-08 04:34:09,517 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-08 04:34:09,518 INFO L225 Difference]: With dead ends: 69 [2022-04-08 04:34:09,518 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 04:34:09,518 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-04-08 04:34:09,519 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 04:34:09,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 492 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 04:34:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 04:34:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-08 04:34:09,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:34:09,582 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-08 04:34:09,582 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-08 04:34:09,583 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-08 04:34:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:09,585 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-08 04:34:09,585 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-08 04:34:09,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:09,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:09,585 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-08 04:34:09,585 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-08 04:34:09,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:09,587 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-08 04:34:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-08 04:34:09,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:09,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:09,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:34:09,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:34:09,588 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-08 04:34:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2022-04-08 04:34:09,590 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 108 [2022-04-08 04:34:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:34:09,590 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2022-04-08 04:34:09,590 INFO L479 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-08 04:34:09,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 77 transitions. [2022-04-08 04:34:09,703 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-08 04:34:09,703 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-08 04:34:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-08 04:34:09,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:34:09,704 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:34:09,715 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-08 04:34:09,910 WARN L460 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-08 04:34:09,910 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:34:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:34:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1009450414, now seen corresponding path program 27 times [2022-04-08 04:34:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:09,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [567443175] [2022-04-08 04:34:09,983 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:34:09,984 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:34:09,984 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:34:09,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1009450414, now seen corresponding path program 28 times [2022-04-08 04:34:09,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:34:09,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991913706] [2022-04-08 04:34:09,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:34:09,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:34:09,994 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:34:09,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145875540] [2022-04-08 04:34:09,995 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:34:09,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:34:09,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:34:09,996 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-08 04:34:09,999 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-08 04:34:11,075 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:34:11,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:34:11,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-08 04:34:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:34:11,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:34:11,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {7778#true} call ULTIMATE.init(); {7778#true} is VALID [2022-04-08 04:34:11,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {7778#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); {7778#true} is VALID [2022-04-08 04:34:11,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7778#true} {7778#true} #56#return; {7778#true} is VALID [2022-04-08 04:34:11,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {7778#true} call #t~ret5 := main(); {7778#true} is VALID [2022-04-08 04:34:11,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {7778#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; {7798#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:11,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {7798#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7798#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:11,708 INFO L272 TraceCheckUtils]: 7: Hoare triple {7798#(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)); {7778#true} is VALID [2022-04-08 04:34:11,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 04:34:11,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 04:34:11,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,709 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7778#true} {7798#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {7798#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:11,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {7798#(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; {7820#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:34:11,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {7820#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {7820#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:34:11,709 INFO L272 TraceCheckUtils]: 14: Hoare triple {7820#(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)); {7778#true} is VALID [2022-04-08 04:34:11,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 04:34:11,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 04:34:11,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,710 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7778#true} {7820#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {7820#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:34:11,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {7820#(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; {7842#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:34:11,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {7842#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {7842#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:34:11,711 INFO L272 TraceCheckUtils]: 21: Hoare triple {7842#(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)); {7778#true} is VALID [2022-04-08 04:34:11,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 04:34:11,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 04:34:11,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,711 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7778#true} {7842#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {7842#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:34:11,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {7842#(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; {7864#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:34:11,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {7864#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {7864#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:34:11,712 INFO L272 TraceCheckUtils]: 28: Hoare triple {7864#(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)); {7778#true} is VALID [2022-04-08 04:34:11,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 04:34:11,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 04:34:11,712 INFO L290 TraceCheckUtils]: 31: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,713 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7778#true} {7864#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #50#return; {7864#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:34:11,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {7864#(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; {7886#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 04:34:11,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {7886#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {7886#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 04:34:11,713 INFO L272 TraceCheckUtils]: 35: Hoare triple {7886#(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)); {7778#true} is VALID [2022-04-08 04:34:11,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 04:34:11,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 04:34:11,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,714 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7778#true} {7886#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #50#return; {7886#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 04:34:11,714 INFO L290 TraceCheckUtils]: 40: Hoare triple {7886#(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; {7908#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:11,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {7908#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {7908#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:11,715 INFO L272 TraceCheckUtils]: 42: Hoare triple {7908#(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)); {7778#true} is VALID [2022-04-08 04:34:11,715 INFO L290 TraceCheckUtils]: 43: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 04:34:11,715 INFO L290 TraceCheckUtils]: 44: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 04:34:11,715 INFO L290 TraceCheckUtils]: 45: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,715 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7778#true} {7908#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {7908#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:11,716 INFO L290 TraceCheckUtils]: 47: Hoare triple {7908#(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; {7930#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:11,716 INFO L290 TraceCheckUtils]: 48: Hoare triple {7930#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {7930#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:11,716 INFO L272 TraceCheckUtils]: 49: Hoare triple {7930#(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)); {7778#true} is VALID [2022-04-08 04:34:11,716 INFO L290 TraceCheckUtils]: 50: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 04:34:11,716 INFO L290 TraceCheckUtils]: 51: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 04:34:11,716 INFO L290 TraceCheckUtils]: 52: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,717 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {7778#true} {7930#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #50#return; {7930#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:11,717 INFO L290 TraceCheckUtils]: 54: Hoare triple {7930#(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; {7952#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 04:34:11,717 INFO L290 TraceCheckUtils]: 55: Hoare triple {7952#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {7952#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 04:34:11,717 INFO L272 TraceCheckUtils]: 56: Hoare triple {7952#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 04:34:11,718 INFO L290 TraceCheckUtils]: 57: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 04:34:11,718 INFO L290 TraceCheckUtils]: 58: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 04:34:11,718 INFO L290 TraceCheckUtils]: 59: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,718 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7778#true} {7952#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #50#return; {7952#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 04:34:11,718 INFO L290 TraceCheckUtils]: 61: Hoare triple {7952#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7974#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 04:34:11,719 INFO L290 TraceCheckUtils]: 62: Hoare triple {7974#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !false; {7974#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 04:34:11,719 INFO L272 TraceCheckUtils]: 63: Hoare triple {7974#(and (= (+ main_~y~0 (- 3)) 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)); {7778#true} is VALID [2022-04-08 04:34:11,719 INFO L290 TraceCheckUtils]: 64: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 04:34:11,719 INFO L290 TraceCheckUtils]: 65: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 04:34:11,719 INFO L290 TraceCheckUtils]: 66: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,719 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7778#true} {7974#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #50#return; {7974#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 04:34:11,720 INFO L290 TraceCheckUtils]: 68: Hoare triple {7974#(and (= (+ main_~y~0 (- 3)) 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; {7996#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:34:11,720 INFO L290 TraceCheckUtils]: 69: Hoare triple {7996#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {7996#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:34:11,720 INFO L272 TraceCheckUtils]: 70: Hoare triple {7996#(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)); {7778#true} is VALID [2022-04-08 04:34:11,720 INFO L290 TraceCheckUtils]: 71: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 04:34:11,720 INFO L290 TraceCheckUtils]: 72: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 04:34:11,720 INFO L290 TraceCheckUtils]: 73: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,721 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {7778#true} {7996#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #50#return; {7996#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:34:11,721 INFO L290 TraceCheckUtils]: 75: Hoare triple {7996#(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; {8018#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:11,721 INFO L290 TraceCheckUtils]: 76: Hoare triple {8018#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {8018#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:11,721 INFO L272 TraceCheckUtils]: 77: Hoare triple {8018#(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)); {7778#true} is VALID [2022-04-08 04:34:11,722 INFO L290 TraceCheckUtils]: 78: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 04:34:11,722 INFO L290 TraceCheckUtils]: 79: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 04:34:11,722 INFO L290 TraceCheckUtils]: 80: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,723 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {7778#true} {8018#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {8018#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:11,724 INFO L290 TraceCheckUtils]: 82: Hoare triple {8018#(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; {8040#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 04:34:11,724 INFO L290 TraceCheckUtils]: 83: Hoare triple {8040#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {8040#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 04:34:11,724 INFO L272 TraceCheckUtils]: 84: Hoare triple {8040#(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)); {7778#true} is VALID [2022-04-08 04:34:11,724 INFO L290 TraceCheckUtils]: 85: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 04:34:11,724 INFO L290 TraceCheckUtils]: 86: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 04:34:11,725 INFO L290 TraceCheckUtils]: 87: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,725 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7778#true} {8040#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #50#return; {8040#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 04:34:11,726 INFO L290 TraceCheckUtils]: 89: Hoare triple {8040#(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; {8062#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:34:11,726 INFO L290 TraceCheckUtils]: 90: Hoare triple {8062#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {8062#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:34:11,726 INFO L272 TraceCheckUtils]: 91: Hoare triple {8062#(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)); {7778#true} is VALID [2022-04-08 04:34:11,726 INFO L290 TraceCheckUtils]: 92: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 04:34:11,726 INFO L290 TraceCheckUtils]: 93: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 04:34:11,726 INFO L290 TraceCheckUtils]: 94: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,727 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7778#true} {8062#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {8062#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:34:11,727 INFO L290 TraceCheckUtils]: 96: Hoare triple {8062#(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; {8084#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:11,728 INFO L290 TraceCheckUtils]: 97: Hoare triple {8084#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !false; {8084#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:11,728 INFO L272 TraceCheckUtils]: 98: Hoare triple {8084#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 04:34:11,728 INFO L290 TraceCheckUtils]: 99: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 04:34:11,728 INFO L290 TraceCheckUtils]: 100: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 04:34:11,728 INFO L290 TraceCheckUtils]: 101: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,729 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {7778#true} {8084#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} #50#return; {8084#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:11,729 INFO L290 TraceCheckUtils]: 103: Hoare triple {8084#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8106#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 04:34:11,730 INFO L290 TraceCheckUtils]: 104: Hoare triple {8106#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !false; {8106#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 04:34:11,730 INFO L272 TraceCheckUtils]: 105: Hoare triple {8106#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7778#true} is VALID [2022-04-08 04:34:11,730 INFO L290 TraceCheckUtils]: 106: Hoare triple {7778#true} ~cond := #in~cond; {7778#true} is VALID [2022-04-08 04:34:11,730 INFO L290 TraceCheckUtils]: 107: Hoare triple {7778#true} assume !(0 == ~cond); {7778#true} is VALID [2022-04-08 04:34:11,730 INFO L290 TraceCheckUtils]: 108: Hoare triple {7778#true} assume true; {7778#true} is VALID [2022-04-08 04:34:11,731 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {7778#true} {8106#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} #50#return; {8106#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 04:34:11,731 INFO L290 TraceCheckUtils]: 110: Hoare triple {8106#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {8128#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-08 04:34:11,732 INFO L272 TraceCheckUtils]: 111: Hoare triple {8128#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8132#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:34:11,733 INFO L290 TraceCheckUtils]: 112: Hoare triple {8132#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8136#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:34:11,733 INFO L290 TraceCheckUtils]: 113: Hoare triple {8136#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7779#false} is VALID [2022-04-08 04:34:11,733 INFO L290 TraceCheckUtils]: 114: Hoare triple {7779#false} assume !false; {7779#false} is VALID [2022-04-08 04:34:11,734 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-08 04:34:11,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:34:12,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:34:12,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991913706] [2022-04-08 04:34:12,068 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:34:12,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145875540] [2022-04-08 04:34:12,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145875540] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:34:12,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:34:12,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-08 04:34:12,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:34:12,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [567443175] [2022-04-08 04:34:12,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [567443175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:34:12,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:34:12,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 04:34:12,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862475020] [2022-04-08 04:34:12,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:34:12,069 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-08 04:34:12,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:34:12,070 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-08 04:34:12,124 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-08 04:34:12,124 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 04:34:12,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:12,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 04:34:12,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-08 04:34:12,125 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-08 04:34:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:14,221 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-04-08 04:34:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 04:34:14,221 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-08 04:34:14,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:34:14,221 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-08 04:34:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 82 transitions. [2022-04-08 04:34:14,223 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-08 04:34:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 82 transitions. [2022-04-08 04:34:14,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 82 transitions. [2022-04-08 04:34:14,307 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-08 04:34:14,308 INFO L225 Difference]: With dead ends: 72 [2022-04-08 04:34:14,308 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 04:34:14,309 INFO L912 BasicCegarLoop]: 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-08 04:34:14,309 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:34:14,309 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 539 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 04:34:14,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 04:34:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-08 04:34:14,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:34:14,371 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-08 04:34:14,371 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-08 04:34:14,371 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-08 04:34:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:14,373 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2022-04-08 04:34:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-04-08 04:34:14,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:14,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:14,374 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-08 04:34:14,374 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-08 04:34:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:14,376 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2022-04-08 04:34:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-04-08 04:34:14,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:14,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:14,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:34:14,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:34:14,376 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-08 04:34:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-04-08 04:34:14,378 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 115 [2022-04-08 04:34:14,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:34:14,379 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2022-04-08 04:34:14,379 INFO L479 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-08 04:34:14,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 81 transitions. [2022-04-08 04:34:14,486 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-08 04:34:14,486 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-04-08 04:34:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 04:34:14,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:34:14,489 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:34:14,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 04:34:14,695 WARN L460 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-08 04:34:14,695 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:34:14,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:34:14,696 INFO L85 PathProgramCache]: Analyzing trace with hash -374771579, now seen corresponding path program 29 times [2022-04-08 04:34:14,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:14,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1507488212] [2022-04-08 04:34:14,770 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:34:14,770 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:34:14,770 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:34:14,770 INFO L85 PathProgramCache]: Analyzing trace with hash -374771579, now seen corresponding path program 30 times [2022-04-08 04:34:14,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:34:14,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228618818] [2022-04-08 04:34:14,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:34:14,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:34:14,792 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:34:14,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119150896] [2022-04-08 04:34:14,793 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:34:14,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:34:14,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:34:14,794 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-08 04:34:14,807 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-08 04:34:15,270 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-08 04:34:15,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:34:15,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-08 04:34:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:34:15,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:34:15,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {8600#true} call ULTIMATE.init(); {8600#true} is VALID [2022-04-08 04:34:15,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {8600#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); {8600#true} is VALID [2022-04-08 04:34:15,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8600#true} {8600#true} #56#return; {8600#true} is VALID [2022-04-08 04:34:15,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {8600#true} call #t~ret5 := main(); {8600#true} is VALID [2022-04-08 04:34:15,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {8600#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; {8620#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:15,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {8620#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8620#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:15,942 INFO L272 TraceCheckUtils]: 7: Hoare triple {8620#(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)); {8600#true} is VALID [2022-04-08 04:34:15,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,943 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {8600#true} {8620#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {8620#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:15,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {8620#(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; {8642#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:34:15,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {8642#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {8642#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:34:15,944 INFO L272 TraceCheckUtils]: 14: Hoare triple {8642#(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)); {8600#true} is VALID [2022-04-08 04:34:15,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,944 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8600#true} {8642#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {8642#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:34:15,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {8642#(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; {8664#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 04:34:15,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {8664#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {8664#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 04:34:15,945 INFO L272 TraceCheckUtils]: 21: Hoare triple {8664#(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)); {8600#true} is VALID [2022-04-08 04:34:15,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,946 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8600#true} {8664#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #50#return; {8664#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 04:34:15,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {8664#(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; {8686#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:34:15,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {8686#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !false; {8686#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:34:15,947 INFO L272 TraceCheckUtils]: 28: Hoare triple {8686#(and (= (+ main_~y~0 (- 3)) 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)); {8600#true} is VALID [2022-04-08 04:34:15,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,947 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8600#true} {8686#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #50#return; {8686#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:34:15,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {8686#(and (= (+ main_~y~0 (- 3)) 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; {8708#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-08 04:34:15,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {8708#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !false; {8708#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-08 04:34:15,948 INFO L272 TraceCheckUtils]: 35: Hoare triple {8708#(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)); {8600#true} is VALID [2022-04-08 04:34:15,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,948 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8600#true} {8708#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} #50#return; {8708#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-08 04:34:15,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {8708#(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; {8730#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:15,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {8730#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {8730#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:15,949 INFO L272 TraceCheckUtils]: 42: Hoare triple {8730#(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)); {8600#true} is VALID [2022-04-08 04:34:15,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,950 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8600#true} {8730#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #50#return; {8730#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:15,955 INFO L290 TraceCheckUtils]: 47: Hoare triple {8730#(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; {8752#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:15,956 INFO L290 TraceCheckUtils]: 48: Hoare triple {8752#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !false; {8752#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:15,956 INFO L272 TraceCheckUtils]: 49: Hoare triple {8752#(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)); {8600#true} is VALID [2022-04-08 04:34:15,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,956 INFO L290 TraceCheckUtils]: 52: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,957 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8600#true} {8752#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #50#return; {8752#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:15,957 INFO L290 TraceCheckUtils]: 54: Hoare triple {8752#(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; {8774#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 04:34:15,958 INFO L290 TraceCheckUtils]: 55: Hoare triple {8774#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !false; {8774#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 04:34:15,958 INFO L272 TraceCheckUtils]: 56: Hoare triple {8774#(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)); {8600#true} is VALID [2022-04-08 04:34:15,958 INFO L290 TraceCheckUtils]: 57: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,958 INFO L290 TraceCheckUtils]: 58: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,958 INFO L290 TraceCheckUtils]: 59: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,958 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8600#true} {8774#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #50#return; {8774#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 04:34:15,959 INFO L290 TraceCheckUtils]: 61: Hoare triple {8774#(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; {8796#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:34:15,959 INFO L290 TraceCheckUtils]: 62: Hoare triple {8796#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} assume !false; {8796#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:34:15,959 INFO L272 TraceCheckUtils]: 63: Hoare triple {8796#(and (= 7 (+ (- 1) 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)); {8600#true} is VALID [2022-04-08 04:34:15,960 INFO L290 TraceCheckUtils]: 64: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,960 INFO L290 TraceCheckUtils]: 65: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,960 INFO L290 TraceCheckUtils]: 66: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,960 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {8600#true} {8796#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} #50#return; {8796#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:34:15,961 INFO L290 TraceCheckUtils]: 68: Hoare triple {8796#(and (= 7 (+ (- 1) 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; {8818#(and (= main_~y~0 9) (= (+ main_~c~0 (- 5)) 4))} is VALID [2022-04-08 04:34:15,961 INFO L290 TraceCheckUtils]: 69: Hoare triple {8818#(and (= main_~y~0 9) (= (+ main_~c~0 (- 5)) 4))} assume !false; {8818#(and (= main_~y~0 9) (= (+ main_~c~0 (- 5)) 4))} is VALID [2022-04-08 04:34:15,961 INFO L272 TraceCheckUtils]: 70: Hoare triple {8818#(and (= main_~y~0 9) (= (+ main_~c~0 (- 5)) 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)); {8600#true} is VALID [2022-04-08 04:34:15,961 INFO L290 TraceCheckUtils]: 71: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,961 INFO L290 TraceCheckUtils]: 72: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,961 INFO L290 TraceCheckUtils]: 73: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,962 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8600#true} {8818#(and (= main_~y~0 9) (= (+ main_~c~0 (- 5)) 4))} #50#return; {8818#(and (= main_~y~0 9) (= (+ main_~c~0 (- 5)) 4))} is VALID [2022-04-08 04:34:15,962 INFO L290 TraceCheckUtils]: 75: Hoare triple {8818#(and (= main_~y~0 9) (= (+ main_~c~0 (- 5)) 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; {8840#(and (= 9 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 6)) 4))} is VALID [2022-04-08 04:34:15,963 INFO L290 TraceCheckUtils]: 76: Hoare triple {8840#(and (= 9 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 6)) 4))} assume !false; {8840#(and (= 9 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 6)) 4))} is VALID [2022-04-08 04:34:15,963 INFO L272 TraceCheckUtils]: 77: Hoare triple {8840#(and (= 9 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 6)) 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)); {8600#true} is VALID [2022-04-08 04:34:15,963 INFO L290 TraceCheckUtils]: 78: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,963 INFO L290 TraceCheckUtils]: 79: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,963 INFO L290 TraceCheckUtils]: 80: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,964 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8600#true} {8840#(and (= 9 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 6)) 4))} #50#return; {8840#(and (= 9 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 6)) 4))} is VALID [2022-04-08 04:34:15,964 INFO L290 TraceCheckUtils]: 82: Hoare triple {8840#(and (= 9 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 6)) 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; {8862#(and (= (+ main_~c~0 (- 7)) 4) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 04:34:15,965 INFO L290 TraceCheckUtils]: 83: Hoare triple {8862#(and (= (+ main_~c~0 (- 7)) 4) (= (+ (- 2) main_~y~0) 9))} assume !false; {8862#(and (= (+ main_~c~0 (- 7)) 4) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 04:34:15,965 INFO L272 TraceCheckUtils]: 84: Hoare triple {8862#(and (= (+ main_~c~0 (- 7)) 4) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8600#true} is VALID [2022-04-08 04:34:15,965 INFO L290 TraceCheckUtils]: 85: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,965 INFO L290 TraceCheckUtils]: 86: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,965 INFO L290 TraceCheckUtils]: 87: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,966 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8600#true} {8862#(and (= (+ main_~c~0 (- 7)) 4) (= (+ (- 2) main_~y~0) 9))} #50#return; {8862#(and (= (+ main_~c~0 (- 7)) 4) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 04:34:15,966 INFO L290 TraceCheckUtils]: 89: Hoare triple {8862#(and (= (+ main_~c~0 (- 7)) 4) (= (+ (- 2) main_~y~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8884#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:34:15,967 INFO L290 TraceCheckUtils]: 90: Hoare triple {8884#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {8884#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:34:15,967 INFO L272 TraceCheckUtils]: 91: Hoare triple {8884#(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)); {8600#true} is VALID [2022-04-08 04:34:15,967 INFO L290 TraceCheckUtils]: 92: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,967 INFO L290 TraceCheckUtils]: 93: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,967 INFO L290 TraceCheckUtils]: 94: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,967 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8600#true} {8884#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {8884#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:34:15,968 INFO L290 TraceCheckUtils]: 96: Hoare triple {8884#(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; {8906#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 04:34:15,968 INFO L290 TraceCheckUtils]: 97: Hoare triple {8906#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {8906#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 04:34:15,968 INFO L272 TraceCheckUtils]: 98: Hoare triple {8906#(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)); {8600#true} is VALID [2022-04-08 04:34:15,968 INFO L290 TraceCheckUtils]: 99: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,969 INFO L290 TraceCheckUtils]: 100: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,969 INFO L290 TraceCheckUtils]: 101: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,969 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {8600#true} {8906#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #50#return; {8906#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 04:34:15,970 INFO L290 TraceCheckUtils]: 103: Hoare triple {8906#(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; {8928#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:34:15,970 INFO L290 TraceCheckUtils]: 104: Hoare triple {8928#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {8928#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:34:15,970 INFO L272 TraceCheckUtils]: 105: Hoare triple {8928#(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)); {8600#true} is VALID [2022-04-08 04:34:15,970 INFO L290 TraceCheckUtils]: 106: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,970 INFO L290 TraceCheckUtils]: 107: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,970 INFO L290 TraceCheckUtils]: 108: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,971 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {8600#true} {8928#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #50#return; {8928#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:34:15,971 INFO L290 TraceCheckUtils]: 110: Hoare triple {8928#(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; {8950#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} is VALID [2022-04-08 04:34:15,972 INFO L290 TraceCheckUtils]: 111: Hoare triple {8950#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} assume !false; {8950#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} is VALID [2022-04-08 04:34:15,972 INFO L272 TraceCheckUtils]: 112: Hoare triple {8950#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= 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)); {8600#true} is VALID [2022-04-08 04:34:15,972 INFO L290 TraceCheckUtils]: 113: Hoare triple {8600#true} ~cond := #in~cond; {8600#true} is VALID [2022-04-08 04:34:15,972 INFO L290 TraceCheckUtils]: 114: Hoare triple {8600#true} assume !(0 == ~cond); {8600#true} is VALID [2022-04-08 04:34:15,972 INFO L290 TraceCheckUtils]: 115: Hoare triple {8600#true} assume true; {8600#true} is VALID [2022-04-08 04:34:15,973 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {8600#true} {8950#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} #50#return; {8950#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} is VALID [2022-04-08 04:34:15,973 INFO L290 TraceCheckUtils]: 117: Hoare triple {8950#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {8972#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~k~0 15))} is VALID [2022-04-08 04:34:15,974 INFO L272 TraceCheckUtils]: 118: Hoare triple {8972#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~k~0 15))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8976#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:34:15,974 INFO L290 TraceCheckUtils]: 119: Hoare triple {8976#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8980#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:34:15,975 INFO L290 TraceCheckUtils]: 120: Hoare triple {8980#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8601#false} is VALID [2022-04-08 04:34:15,975 INFO L290 TraceCheckUtils]: 121: Hoare triple {8601#false} assume !false; {8601#false} is VALID [2022-04-08 04:34:15,976 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-08 04:34:15,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:34:16,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:34:16,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228618818] [2022-04-08 04:34:16,283 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:34:16,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119150896] [2022-04-08 04:34:16,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119150896] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:34:16,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:34:16,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-08 04:34:16,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:34:16,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1507488212] [2022-04-08 04:34:16,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1507488212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:34:16,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:34:16,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 04:34:16,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936602818] [2022-04-08 04:34:16,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:34:16,284 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-08 04:34:16,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:34:16,286 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-08 04:34:16,359 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-08 04:34:16,360 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 04:34:16,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:16,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 04:34:16,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-04-08 04:34:16,361 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-08 04:34:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:18,646 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-08 04:34:18,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 04:34:18,647 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-08 04:34:18,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:34:18,647 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-08 04:34:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 86 transitions. [2022-04-08 04:34:18,649 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-08 04:34:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 86 transitions. [2022-04-08 04:34:18,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 86 transitions. [2022-04-08 04:34:18,735 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-08 04:34:18,736 INFO L225 Difference]: With dead ends: 75 [2022-04-08 04:34:18,736 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 04:34:18,737 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2022-04-08 04:34:18,737 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:34:18,737 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 588 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 04:34:18,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 04:34:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 04:34:18,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:34:18,809 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-08 04:34:18,809 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-08 04:34:18,810 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-08 04:34:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:18,813 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-08 04:34:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-08 04:34:18,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:18,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:18,813 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-08 04:34:18,814 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-08 04:34:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:18,815 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-08 04:34:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-08 04:34:18,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:18,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:18,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:34:18,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:34:18,816 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-08 04:34:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-04-08 04:34:18,818 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 122 [2022-04-08 04:34:18,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:34:18,818 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-04-08 04:34:18,819 INFO L479 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-08 04:34:18,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 85 transitions. [2022-04-08 04:34:18,960 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-08 04:34:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-08 04:34:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-08 04:34:18,961 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:34:18,961 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:34:18,969 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-08 04:34:19,168 WARN L460 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-08 04:34:19,168 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:34:19,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:34:19,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1065798926, now seen corresponding path program 31 times [2022-04-08 04:34:19,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:19,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1307433702] [2022-04-08 04:34:19,247 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:34:19,247 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:34:19,247 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:34:19,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1065798926, now seen corresponding path program 32 times [2022-04-08 04:34:19,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:34:19,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944996850] [2022-04-08 04:34:19,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:34:19,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:34:19,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:34:19,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1031802995] [2022-04-08 04:34:19,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:34:19,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:34:19,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:34:19,261 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-08 04:34:19,269 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-08 04:34:19,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:34:19,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:34:19,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-08 04:34:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:34:19,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:34:20,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {9462#true} call ULTIMATE.init(); {9462#true} is VALID [2022-04-08 04:34:20,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {9462#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); {9462#true} is VALID [2022-04-08 04:34:20,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9462#true} {9462#true} #56#return; {9462#true} is VALID [2022-04-08 04:34:20,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {9462#true} call #t~ret5 := main(); {9462#true} is VALID [2022-04-08 04:34:20,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {9462#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; {9482#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:20,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {9482#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {9482#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:20,751 INFO L272 TraceCheckUtils]: 7: Hoare triple {9482#(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)); {9462#true} is VALID [2022-04-08 04:34:20,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,751 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {9462#true} {9482#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {9482#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:20,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {9482#(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; {9504#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:34:20,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {9504#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {9504#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:34:20,752 INFO L272 TraceCheckUtils]: 14: Hoare triple {9504#(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)); {9462#true} is VALID [2022-04-08 04:34:20,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,753 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9462#true} {9504#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {9504#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:34:20,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {9504#(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; {9526#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 04:34:20,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {9526#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {9526#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 04:34:20,754 INFO L272 TraceCheckUtils]: 21: Hoare triple {9526#(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)); {9462#true} is VALID [2022-04-08 04:34:20,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,755 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {9462#true} {9526#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #50#return; {9526#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 04:34:20,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {9526#(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; {9548#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:34:20,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {9548#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !false; {9548#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:34:20,756 INFO L272 TraceCheckUtils]: 28: Hoare triple {9548#(and (= (+ main_~y~0 (- 3)) 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)); {9462#true} is VALID [2022-04-08 04:34:20,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,756 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9462#true} {9548#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #50#return; {9548#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:34:20,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {9548#(and (= (+ main_~y~0 (- 3)) 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; {9570#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:34:20,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {9570#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {9570#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:34:20,757 INFO L272 TraceCheckUtils]: 35: Hoare triple {9570#(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)); {9462#true} is VALID [2022-04-08 04:34:20,758 INFO L290 TraceCheckUtils]: 36: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,758 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9462#true} {9570#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {9570#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:34:20,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {9570#(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; {9592#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:20,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {9592#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {9592#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:20,759 INFO L272 TraceCheckUtils]: 42: Hoare triple {9592#(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)); {9462#true} is VALID [2022-04-08 04:34:20,759 INFO L290 TraceCheckUtils]: 43: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,759 INFO L290 TraceCheckUtils]: 44: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,759 INFO L290 TraceCheckUtils]: 45: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,760 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {9462#true} {9592#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {9592#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:20,760 INFO L290 TraceCheckUtils]: 47: Hoare triple {9592#(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; {9614#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:20,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {9614#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {9614#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:20,761 INFO L272 TraceCheckUtils]: 49: Hoare triple {9614#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 04:34:20,761 INFO L290 TraceCheckUtils]: 50: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,761 INFO L290 TraceCheckUtils]: 51: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,761 INFO L290 TraceCheckUtils]: 52: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,762 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9462#true} {9614#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #50#return; {9614#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:20,762 INFO L290 TraceCheckUtils]: 54: Hoare triple {9614#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9636#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 04:34:20,762 INFO L290 TraceCheckUtils]: 55: Hoare triple {9636#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {9636#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 04:34:20,763 INFO L272 TraceCheckUtils]: 56: Hoare triple {9636#(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)); {9462#true} is VALID [2022-04-08 04:34:20,763 INFO L290 TraceCheckUtils]: 57: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,763 INFO L290 TraceCheckUtils]: 58: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,763 INFO L290 TraceCheckUtils]: 59: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,763 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9462#true} {9636#(and (= 7 main_~y~0) (= 7 main_~c~0))} #50#return; {9636#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 04:34:20,764 INFO L290 TraceCheckUtils]: 61: Hoare triple {9636#(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; {9658#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:34:20,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {9658#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {9658#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:34:20,764 INFO L272 TraceCheckUtils]: 63: Hoare triple {9658#(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)); {9462#true} is VALID [2022-04-08 04:34:20,764 INFO L290 TraceCheckUtils]: 64: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,764 INFO L290 TraceCheckUtils]: 65: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,764 INFO L290 TraceCheckUtils]: 66: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,765 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {9462#true} {9658#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #50#return; {9658#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:34:20,765 INFO L290 TraceCheckUtils]: 68: Hoare triple {9658#(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; {9680#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:20,766 INFO L290 TraceCheckUtils]: 69: Hoare triple {9680#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {9680#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:20,766 INFO L272 TraceCheckUtils]: 70: Hoare triple {9680#(and (= 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)); {9462#true} is VALID [2022-04-08 04:34:20,766 INFO L290 TraceCheckUtils]: 71: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,766 INFO L290 TraceCheckUtils]: 72: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,766 INFO L290 TraceCheckUtils]: 73: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,767 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9462#true} {9680#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #50#return; {9680#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:20,767 INFO L290 TraceCheckUtils]: 75: Hoare triple {9680#(and (= 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; {9702#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:20,768 INFO L290 TraceCheckUtils]: 76: Hoare triple {9702#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {9702#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:20,768 INFO L272 TraceCheckUtils]: 77: Hoare triple {9702#(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)); {9462#true} is VALID [2022-04-08 04:34:20,768 INFO L290 TraceCheckUtils]: 78: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,768 INFO L290 TraceCheckUtils]: 79: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,768 INFO L290 TraceCheckUtils]: 80: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,768 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9462#true} {9702#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {9702#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:20,769 INFO L290 TraceCheckUtils]: 82: Hoare triple {9702#(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; {9724#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:34:20,769 INFO L290 TraceCheckUtils]: 83: Hoare triple {9724#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {9724#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:34:20,769 INFO L272 TraceCheckUtils]: 84: Hoare triple {9724#(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)); {9462#true} is VALID [2022-04-08 04:34:20,769 INFO L290 TraceCheckUtils]: 85: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,769 INFO L290 TraceCheckUtils]: 86: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,770 INFO L290 TraceCheckUtils]: 87: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,770 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9462#true} {9724#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {9724#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:34:20,771 INFO L290 TraceCheckUtils]: 89: Hoare triple {9724#(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; {9746#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:34:20,771 INFO L290 TraceCheckUtils]: 90: Hoare triple {9746#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {9746#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:34:20,771 INFO L272 TraceCheckUtils]: 91: Hoare triple {9746#(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)); {9462#true} is VALID [2022-04-08 04:34:20,771 INFO L290 TraceCheckUtils]: 92: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,771 INFO L290 TraceCheckUtils]: 93: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,771 INFO L290 TraceCheckUtils]: 94: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,772 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {9462#true} {9746#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {9746#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:34:20,772 INFO L290 TraceCheckUtils]: 96: Hoare triple {9746#(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; {9768#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:20,773 INFO L290 TraceCheckUtils]: 97: Hoare triple {9768#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !false; {9768#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:20,773 INFO L272 TraceCheckUtils]: 98: Hoare triple {9768#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9462#true} is VALID [2022-04-08 04:34:20,773 INFO L290 TraceCheckUtils]: 99: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,773 INFO L290 TraceCheckUtils]: 100: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,773 INFO L290 TraceCheckUtils]: 101: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,773 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {9462#true} {9768#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} #50#return; {9768#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:20,774 INFO L290 TraceCheckUtils]: 103: Hoare triple {9768#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9790#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:20,774 INFO L290 TraceCheckUtils]: 104: Hoare triple {9790#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} assume !false; {9790#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:20,775 INFO L272 TraceCheckUtils]: 105: Hoare triple {9790#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 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)); {9462#true} is VALID [2022-04-08 04:34:20,775 INFO L290 TraceCheckUtils]: 106: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,775 INFO L290 TraceCheckUtils]: 107: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,775 INFO L290 TraceCheckUtils]: 108: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,775 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {9462#true} {9790#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} #50#return; {9790#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:20,776 INFO L290 TraceCheckUtils]: 110: Hoare triple {9790#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 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; {9812#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 04:34:20,776 INFO L290 TraceCheckUtils]: 111: Hoare triple {9812#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} assume !false; {9812#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 04:34:20,776 INFO L272 TraceCheckUtils]: 112: Hoare triple {9812#(and (= (+ main_~c~0 (- 3)) 12) (= (+ 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)); {9462#true} is VALID [2022-04-08 04:34:20,776 INFO L290 TraceCheckUtils]: 113: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,776 INFO L290 TraceCheckUtils]: 114: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,776 INFO L290 TraceCheckUtils]: 115: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,777 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {9462#true} {9812#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} #50#return; {9812#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 04:34:20,778 INFO L290 TraceCheckUtils]: 117: Hoare triple {9812#(and (= (+ main_~c~0 (- 3)) 12) (= (+ 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; {9834#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 04:34:20,778 INFO L290 TraceCheckUtils]: 118: Hoare triple {9834#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !false; {9834#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 04:34:20,778 INFO L272 TraceCheckUtils]: 119: Hoare triple {9834#(and (= main_~y~0 16) (< 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)); {9462#true} is VALID [2022-04-08 04:34:20,778 INFO L290 TraceCheckUtils]: 120: Hoare triple {9462#true} ~cond := #in~cond; {9462#true} is VALID [2022-04-08 04:34:20,778 INFO L290 TraceCheckUtils]: 121: Hoare triple {9462#true} assume !(0 == ~cond); {9462#true} is VALID [2022-04-08 04:34:20,778 INFO L290 TraceCheckUtils]: 122: Hoare triple {9462#true} assume true; {9462#true} is VALID [2022-04-08 04:34:20,779 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {9462#true} {9834#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} #50#return; {9834#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 04:34:20,780 INFO L290 TraceCheckUtils]: 124: Hoare triple {9834#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {9856#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} is VALID [2022-04-08 04:34:20,781 INFO L272 TraceCheckUtils]: 125: Hoare triple {9856#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9860#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:34:20,781 INFO L290 TraceCheckUtils]: 126: Hoare triple {9860#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9864#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:34:20,782 INFO L290 TraceCheckUtils]: 127: Hoare triple {9864#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9463#false} is VALID [2022-04-08 04:34:20,782 INFO L290 TraceCheckUtils]: 128: Hoare triple {9463#false} assume !false; {9463#false} is VALID [2022-04-08 04:34:20,783 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-08 04:34:20,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:34:21,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:34:21,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944996850] [2022-04-08 04:34:21,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:34:21,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031802995] [2022-04-08 04:34:21,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031802995] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:34:21,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:34:21,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-08 04:34:21,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:34:21,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1307433702] [2022-04-08 04:34:21,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1307433702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:34:21,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:34:21,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 04:34:21,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209687252] [2022-04-08 04:34:21,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:34:21,395 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-08 04:34:21,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:34:21,395 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-08 04:34:21,460 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-08 04:34:21,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 04:34:21,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:21,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 04:34:21,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-08 04:34:21,461 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-08 04:34:23,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:23,977 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2022-04-08 04:34:23,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 04:34:23,978 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-08 04:34:23,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:34:23,978 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-08 04:34:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 90 transitions. [2022-04-08 04:34:23,979 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-08 04:34:23,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 90 transitions. [2022-04-08 04:34:23,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 90 transitions. [2022-04-08 04:34:24,060 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-08 04:34:24,062 INFO L225 Difference]: With dead ends: 78 [2022-04-08 04:34:24,062 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 04:34:24,062 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-04-08 04:34:24,063 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:34:24,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 639 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 04:34:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 04:34:24,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-08 04:34:24,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:34:24,122 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-08 04:34:24,123 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-08 04:34:24,123 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-08 04:34:24,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:24,125 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-08 04:34:24,125 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-08 04:34:24,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:24,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:24,125 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-08 04:34:24,126 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-08 04:34:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:24,127 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-08 04:34:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-08 04:34:24,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:24,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:24,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:34:24,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:34:24,128 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-08 04:34:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2022-04-08 04:34:24,130 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 129 [2022-04-08 04:34:24,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:34:24,130 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2022-04-08 04:34:24,130 INFO L479 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-08 04:34:24,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 89 transitions. [2022-04-08 04:34:24,269 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-08 04:34:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-08 04:34:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-08 04:34:24,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:34:24,270 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:34:24,277 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-08 04:34:24,470 WARN L460 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-08 04:34:24,471 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:34:24,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:34:24,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1370180581, now seen corresponding path program 33 times [2022-04-08 04:34:24,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:24,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [496674396] [2022-04-08 04:34:24,545 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:34:24,545 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:34:24,545 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:34:24,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1370180581, now seen corresponding path program 34 times [2022-04-08 04:34:24,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:34:24,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858925946] [2022-04-08 04:34:24,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:34:24,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:34:24,557 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:34:24,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023342669] [2022-04-08 04:34:24,557 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:34:24,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:34:24,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:34:24,558 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-08 04:34:24,567 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-08 04:34:25,737 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:34:25,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:34:25,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-08 04:34:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:34:25,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:34:26,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {10364#true} call ULTIMATE.init(); {10364#true} is VALID [2022-04-08 04:34:26,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {10364#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); {10364#true} is VALID [2022-04-08 04:34:26,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10364#true} {10364#true} #56#return; {10364#true} is VALID [2022-04-08 04:34:26,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {10364#true} call #t~ret5 := main(); {10364#true} is VALID [2022-04-08 04:34:26,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {10364#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; {10384#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:26,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {10384#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {10384#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:26,534 INFO L272 TraceCheckUtils]: 7: Hoare triple {10384#(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)); {10364#true} is VALID [2022-04-08 04:34:26,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,535 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {10364#true} {10384#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {10384#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:26,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {10384#(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; {10406#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:34:26,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {10406#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {10406#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:34:26,535 INFO L272 TraceCheckUtils]: 14: Hoare triple {10406#(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)); {10364#true} is VALID [2022-04-08 04:34:26,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,536 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10364#true} {10406#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {10406#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:34:26,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {10406#(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; {10428#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 04:34:26,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {10428#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {10428#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 04:34:26,537 INFO L272 TraceCheckUtils]: 21: Hoare triple {10428#(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)); {10364#true} is VALID [2022-04-08 04:34:26,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,537 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10364#true} {10428#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #50#return; {10428#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 04:34:26,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {10428#(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; {10450#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 04:34:26,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {10450#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {10450#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 04:34:26,538 INFO L272 TraceCheckUtils]: 28: Hoare triple {10450#(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)); {10364#true} is VALID [2022-04-08 04:34:26,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,538 INFO L290 TraceCheckUtils]: 31: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,539 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10364#true} {10450#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #50#return; {10450#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 04:34:26,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {10450#(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; {10472#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 04:34:26,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {10472#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {10472#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 04:34:26,539 INFO L272 TraceCheckUtils]: 35: Hoare triple {10472#(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)); {10364#true} is VALID [2022-04-08 04:34:26,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,540 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10364#true} {10472#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #50#return; {10472#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 04:34:26,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {10472#(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; {10494#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 04:34:26,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {10494#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {10494#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 04:34:26,541 INFO L272 TraceCheckUtils]: 42: Hoare triple {10494#(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)); {10364#true} is VALID [2022-04-08 04:34:26,541 INFO L290 TraceCheckUtils]: 43: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,541 INFO L290 TraceCheckUtils]: 44: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,541 INFO L290 TraceCheckUtils]: 45: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,541 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10364#true} {10494#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #50#return; {10494#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 04:34:26,542 INFO L290 TraceCheckUtils]: 47: Hoare triple {10494#(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; {10516#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:34:26,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {10516#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {10516#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:34:26,542 INFO L272 TraceCheckUtils]: 49: Hoare triple {10516#(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)); {10364#true} is VALID [2022-04-08 04:34:26,542 INFO L290 TraceCheckUtils]: 50: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,542 INFO L290 TraceCheckUtils]: 51: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,542 INFO L290 TraceCheckUtils]: 52: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,543 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10364#true} {10516#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {10516#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:34:26,543 INFO L290 TraceCheckUtils]: 54: Hoare triple {10516#(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; {10538#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:26,543 INFO L290 TraceCheckUtils]: 55: Hoare triple {10538#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {10538#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:26,543 INFO L272 TraceCheckUtils]: 56: Hoare triple {10538#(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)); {10364#true} is VALID [2022-04-08 04:34:26,543 INFO L290 TraceCheckUtils]: 57: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,544 INFO L290 TraceCheckUtils]: 58: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,544 INFO L290 TraceCheckUtils]: 59: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,544 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10364#true} {10538#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #50#return; {10538#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:26,544 INFO L290 TraceCheckUtils]: 61: Hoare triple {10538#(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; {10560#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 04:34:26,545 INFO L290 TraceCheckUtils]: 62: Hoare triple {10560#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {10560#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 04:34:26,545 INFO L272 TraceCheckUtils]: 63: Hoare triple {10560#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 04:34:26,545 INFO L290 TraceCheckUtils]: 64: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,545 INFO L290 TraceCheckUtils]: 65: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,545 INFO L290 TraceCheckUtils]: 66: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,545 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {10364#true} {10560#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #50#return; {10560#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 04:34:26,546 INFO L290 TraceCheckUtils]: 68: Hoare triple {10560#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10582#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-08 04:34:26,546 INFO L290 TraceCheckUtils]: 69: Hoare triple {10582#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !false; {10582#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-08 04:34:26,546 INFO L272 TraceCheckUtils]: 70: Hoare triple {10582#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 04:34:26,546 INFO L290 TraceCheckUtils]: 71: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,546 INFO L290 TraceCheckUtils]: 72: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,546 INFO L290 TraceCheckUtils]: 73: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,547 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10364#true} {10582#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} #50#return; {10582#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-08 04:34:26,547 INFO L290 TraceCheckUtils]: 75: Hoare triple {10582#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10604#(and (= 9 (+ (- 1) main_~y~0)) (= 6 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:34:26,547 INFO L290 TraceCheckUtils]: 76: Hoare triple {10604#(and (= 9 (+ (- 1) main_~y~0)) (= 6 (+ main_~c~0 (- 4))))} assume !false; {10604#(and (= 9 (+ (- 1) main_~y~0)) (= 6 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:34:26,547 INFO L272 TraceCheckUtils]: 77: Hoare triple {10604#(and (= 9 (+ (- 1) main_~y~0)) (= 6 (+ 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)); {10364#true} is VALID [2022-04-08 04:34:26,548 INFO L290 TraceCheckUtils]: 78: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,548 INFO L290 TraceCheckUtils]: 79: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,551 INFO L290 TraceCheckUtils]: 80: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,555 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10364#true} {10604#(and (= 9 (+ (- 1) main_~y~0)) (= 6 (+ main_~c~0 (- 4))))} #50#return; {10604#(and (= 9 (+ (- 1) main_~y~0)) (= 6 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:34:26,556 INFO L290 TraceCheckUtils]: 82: Hoare triple {10604#(and (= 9 (+ (- 1) main_~y~0)) (= 6 (+ 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; {10626#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:34:26,556 INFO L290 TraceCheckUtils]: 83: Hoare triple {10626#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {10626#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:34:26,556 INFO L272 TraceCheckUtils]: 84: Hoare triple {10626#(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)); {10364#true} is VALID [2022-04-08 04:34:26,557 INFO L290 TraceCheckUtils]: 85: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,557 INFO L290 TraceCheckUtils]: 86: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,557 INFO L290 TraceCheckUtils]: 87: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,557 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10364#true} {10626#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {10626#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:34:26,558 INFO L290 TraceCheckUtils]: 89: Hoare triple {10626#(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; {10648#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:34:26,558 INFO L290 TraceCheckUtils]: 90: Hoare triple {10648#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {10648#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:34:26,558 INFO L272 TraceCheckUtils]: 91: Hoare triple {10648#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10364#true} is VALID [2022-04-08 04:34:26,558 INFO L290 TraceCheckUtils]: 92: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,558 INFO L290 TraceCheckUtils]: 93: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,559 INFO L290 TraceCheckUtils]: 94: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,559 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {10364#true} {10648#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #50#return; {10648#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:34:26,560 INFO L290 TraceCheckUtils]: 96: Hoare triple {10648#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10670#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 04:34:26,560 INFO L290 TraceCheckUtils]: 97: Hoare triple {10670#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !false; {10670#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 04:34:26,560 INFO L272 TraceCheckUtils]: 98: Hoare triple {10670#(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)); {10364#true} is VALID [2022-04-08 04:34:26,560 INFO L290 TraceCheckUtils]: 99: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,560 INFO L290 TraceCheckUtils]: 100: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,560 INFO L290 TraceCheckUtils]: 101: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,561 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {10364#true} {10670#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} #50#return; {10670#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 04:34:26,562 INFO L290 TraceCheckUtils]: 103: Hoare triple {10670#(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; {10692#(and (= (+ main_~c~0 (- 3)) 11) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:34:26,562 INFO L290 TraceCheckUtils]: 104: Hoare triple {10692#(and (= (+ main_~c~0 (- 3)) 11) (= (+ (- 1) main_~y~0) 13))} assume !false; {10692#(and (= (+ main_~c~0 (- 3)) 11) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:34:26,562 INFO L272 TraceCheckUtils]: 105: Hoare triple {10692#(and (= (+ main_~c~0 (- 3)) 11) (= (+ (- 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)); {10364#true} is VALID [2022-04-08 04:34:26,562 INFO L290 TraceCheckUtils]: 106: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,562 INFO L290 TraceCheckUtils]: 107: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,562 INFO L290 TraceCheckUtils]: 108: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,563 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {10364#true} {10692#(and (= (+ main_~c~0 (- 3)) 11) (= (+ (- 1) main_~y~0) 13))} #50#return; {10692#(and (= (+ main_~c~0 (- 3)) 11) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:34:26,564 INFO L290 TraceCheckUtils]: 110: Hoare triple {10692#(and (= (+ main_~c~0 (- 3)) 11) (= (+ (- 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; {10714#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:34:26,564 INFO L290 TraceCheckUtils]: 111: Hoare triple {10714#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} assume !false; {10714#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:34:26,564 INFO L272 TraceCheckUtils]: 112: Hoare triple {10714#(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)); {10364#true} is VALID [2022-04-08 04:34:26,564 INFO L290 TraceCheckUtils]: 113: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,564 INFO L290 TraceCheckUtils]: 114: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,564 INFO L290 TraceCheckUtils]: 115: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,565 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10364#true} {10714#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} #50#return; {10714#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:34:26,565 INFO L290 TraceCheckUtils]: 117: Hoare triple {10714#(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; {10736#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:26,566 INFO L290 TraceCheckUtils]: 118: Hoare triple {10736#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {10736#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:26,566 INFO L272 TraceCheckUtils]: 119: Hoare triple {10736#(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)); {10364#true} is VALID [2022-04-08 04:34:26,566 INFO L290 TraceCheckUtils]: 120: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,566 INFO L290 TraceCheckUtils]: 121: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,566 INFO L290 TraceCheckUtils]: 122: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,566 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {10364#true} {10736#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #50#return; {10736#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:26,567 INFO L290 TraceCheckUtils]: 124: Hoare triple {10736#(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; {10758#(and (<= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 16 main_~k~0))} is VALID [2022-04-08 04:34:26,567 INFO L290 TraceCheckUtils]: 125: Hoare triple {10758#(and (<= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 16 main_~k~0))} assume !false; {10758#(and (<= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 16 main_~k~0))} is VALID [2022-04-08 04:34:26,567 INFO L272 TraceCheckUtils]: 126: Hoare triple {10758#(and (<= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 16 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)); {10364#true} is VALID [2022-04-08 04:34:26,567 INFO L290 TraceCheckUtils]: 127: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2022-04-08 04:34:26,567 INFO L290 TraceCheckUtils]: 128: Hoare triple {10364#true} assume !(0 == ~cond); {10364#true} is VALID [2022-04-08 04:34:26,567 INFO L290 TraceCheckUtils]: 129: Hoare triple {10364#true} assume true; {10364#true} is VALID [2022-04-08 04:34:26,568 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {10364#true} {10758#(and (<= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 16 main_~k~0))} #50#return; {10758#(and (<= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 16 main_~k~0))} is VALID [2022-04-08 04:34:26,569 INFO L290 TraceCheckUtils]: 131: Hoare triple {10758#(and (<= main_~c~0 17) (= (+ (- 2) main_~y~0) 15) (< 16 main_~k~0))} assume !(~c~0 < ~k~0); {10780#(and (= (+ (- 2) main_~y~0) 15) (<= main_~k~0 17) (< 16 main_~k~0))} is VALID [2022-04-08 04:34:26,569 INFO L272 TraceCheckUtils]: 132: Hoare triple {10780#(and (= (+ (- 2) main_~y~0) 15) (<= main_~k~0 17) (< 16 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10784#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:34:26,570 INFO L290 TraceCheckUtils]: 133: Hoare triple {10784#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10788#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:34:26,570 INFO L290 TraceCheckUtils]: 134: Hoare triple {10788#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10365#false} is VALID [2022-04-08 04:34:26,570 INFO L290 TraceCheckUtils]: 135: Hoare triple {10365#false} assume !false; {10365#false} is VALID [2022-04-08 04:34:26,571 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-08 04:34:26,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:34:26,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:34:26,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858925946] [2022-04-08 04:34:26,853 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:34:26,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023342669] [2022-04-08 04:34:26,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023342669] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:34:26,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:34:26,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-08 04:34:26,854 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:34:26,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [496674396] [2022-04-08 04:34:26,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [496674396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:34:26,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:34:26,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 04:34:26,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550449751] [2022-04-08 04:34:26,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:34:26,854 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-08 04:34:26,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:34:26,855 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-08 04:34:26,926 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-08 04:34:26,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 04:34:26,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:26,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 04:34:26,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-08 04:34:26,927 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-08 04:34:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:29,696 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2022-04-08 04:34:29,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 04:34:29,697 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-08 04:34:29,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:34:29,697 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-08 04:34:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2022-04-08 04:34:29,701 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-08 04:34:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2022-04-08 04:34:29,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 94 transitions. [2022-04-08 04:34:29,794 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-08 04:34:29,795 INFO L225 Difference]: With dead ends: 81 [2022-04-08 04:34:29,796 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 04:34:29,796 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2022-04-08 04:34:29,797 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 04:34:29,797 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 692 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 04:34:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 04:34:29,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-08 04:34:29,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:34:29,871 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-08 04:34:29,872 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-08 04:34:29,872 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-08 04:34:29,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:29,874 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-08 04:34:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-08 04:34:29,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:29,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:29,875 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-08 04:34:29,875 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-08 04:34:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:29,877 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-08 04:34:29,877 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-08 04:34:29,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:29,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:29,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:34:29,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:34:29,878 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-08 04:34:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2022-04-08 04:34:29,880 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 136 [2022-04-08 04:34:29,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:34:29,881 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2022-04-08 04:34:29,881 INFO L479 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-08 04:34:29,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 93 transitions. [2022-04-08 04:34:30,016 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-08 04:34:30,016 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-08 04:34:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-08 04:34:30,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:34:30,017 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:34:30,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 04:34:30,218 WARN L460 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-08 04:34:30,218 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:34:30,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:34:30,218 INFO L85 PathProgramCache]: Analyzing trace with hash 455854994, now seen corresponding path program 35 times [2022-04-08 04:34:30,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:30,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [88266549] [2022-04-08 04:34:30,289 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:34:30,289 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:34:30,289 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:34:30,290 INFO L85 PathProgramCache]: Analyzing trace with hash 455854994, now seen corresponding path program 36 times [2022-04-08 04:34:30,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:34:30,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801305198] [2022-04-08 04:34:30,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:34:30,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:34:30,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:34:30,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [342955948] [2022-04-08 04:34:30,309 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:34:30,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:34:30,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:34:30,310 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-08 04:34:30,319 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-08 04:34:32,153 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-08 04:34:32,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:34:32,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-08 04:34:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:34:32,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:34:33,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {11306#true} call ULTIMATE.init(); {11306#true} is VALID [2022-04-08 04:34:33,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {11306#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); {11306#true} is VALID [2022-04-08 04:34:33,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11306#true} {11306#true} #56#return; {11306#true} is VALID [2022-04-08 04:34:33,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {11306#true} call #t~ret5 := main(); {11306#true} is VALID [2022-04-08 04:34:33,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {11306#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; {11326#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:33,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {11326#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {11326#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:33,031 INFO L272 TraceCheckUtils]: 7: Hoare triple {11326#(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)); {11306#true} is VALID [2022-04-08 04:34:33,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,032 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {11306#true} {11326#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {11326#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:33,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {11326#(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; {11348#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:34:33,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {11348#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {11348#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:34:33,033 INFO L272 TraceCheckUtils]: 14: Hoare triple {11348#(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)); {11306#true} is VALID [2022-04-08 04:34:33,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,033 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11306#true} {11348#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {11348#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:34:33,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {11348#(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; {11370#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 04:34:33,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {11370#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {11370#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 04:34:33,034 INFO L272 TraceCheckUtils]: 21: Hoare triple {11370#(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)); {11306#true} is VALID [2022-04-08 04:34:33,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,035 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11306#true} {11370#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #50#return; {11370#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 04:34:33,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {11370#(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; {11392#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 04:34:33,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {11392#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {11392#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 04:34:33,036 INFO L272 TraceCheckUtils]: 28: Hoare triple {11392#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 04:34:33,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,036 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11306#true} {11392#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #50#return; {11392#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 04:34:33,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {11392#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11414#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 04:34:33,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {11414#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !false; {11414#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 04:34:33,037 INFO L272 TraceCheckUtils]: 35: Hoare triple {11414#(and (= (+ 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)); {11306#true} is VALID [2022-04-08 04:34:33,037 INFO L290 TraceCheckUtils]: 36: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,037 INFO L290 TraceCheckUtils]: 37: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,037 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11306#true} {11414#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #50#return; {11414#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 04:34:33,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {11414#(and (= (+ 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; {11436#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 04:34:33,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {11436#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} assume !false; {11436#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 04:34:33,038 INFO L272 TraceCheckUtils]: 42: Hoare triple {11436#(and (= (+ main_~y~0 (- 4)) 1) (= 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)); {11306#true} is VALID [2022-04-08 04:34:33,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,038 INFO L290 TraceCheckUtils]: 44: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,038 INFO L290 TraceCheckUtils]: 45: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,039 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11306#true} {11436#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} #50#return; {11436#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 04:34:33,039 INFO L290 TraceCheckUtils]: 47: Hoare triple {11436#(and (= (+ main_~y~0 (- 4)) 1) (= 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; {11458#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:34:33,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {11458#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {11458#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:34:33,040 INFO L272 TraceCheckUtils]: 49: Hoare triple {11458#(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)); {11306#true} is VALID [2022-04-08 04:34:33,040 INFO L290 TraceCheckUtils]: 50: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,040 INFO L290 TraceCheckUtils]: 51: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,040 INFO L290 TraceCheckUtils]: 52: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,040 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {11306#true} {11458#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {11458#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:34:33,041 INFO L290 TraceCheckUtils]: 54: Hoare triple {11458#(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; {11480#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:33,041 INFO L290 TraceCheckUtils]: 55: Hoare triple {11480#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {11480#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:33,041 INFO L272 TraceCheckUtils]: 56: Hoare triple {11480#(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)); {11306#true} is VALID [2022-04-08 04:34:33,041 INFO L290 TraceCheckUtils]: 57: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,041 INFO L290 TraceCheckUtils]: 58: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,041 INFO L290 TraceCheckUtils]: 59: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,042 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11306#true} {11480#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #50#return; {11480#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:33,042 INFO L290 TraceCheckUtils]: 61: Hoare triple {11480#(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; {11502#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 04:34:33,042 INFO L290 TraceCheckUtils]: 62: Hoare triple {11502#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {11502#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 04:34:33,042 INFO L272 TraceCheckUtils]: 63: Hoare triple {11502#(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)); {11306#true} is VALID [2022-04-08 04:34:33,042 INFO L290 TraceCheckUtils]: 64: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,042 INFO L290 TraceCheckUtils]: 65: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,042 INFO L290 TraceCheckUtils]: 66: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,043 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {11306#true} {11502#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #50#return; {11502#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 04:34:33,043 INFO L290 TraceCheckUtils]: 68: Hoare triple {11502#(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; {11524#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:34:33,044 INFO L290 TraceCheckUtils]: 69: Hoare triple {11524#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} assume !false; {11524#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:34:33,044 INFO L272 TraceCheckUtils]: 70: Hoare triple {11524#(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)); {11306#true} is VALID [2022-04-08 04:34:33,044 INFO L290 TraceCheckUtils]: 71: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,044 INFO L290 TraceCheckUtils]: 72: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,044 INFO L290 TraceCheckUtils]: 73: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,044 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11306#true} {11524#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} #50#return; {11524#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:34:33,045 INFO L290 TraceCheckUtils]: 75: Hoare triple {11524#(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; {11546#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:33,045 INFO L290 TraceCheckUtils]: 76: Hoare triple {11546#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {11546#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:33,045 INFO L272 TraceCheckUtils]: 77: Hoare triple {11546#(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)); {11306#true} is VALID [2022-04-08 04:34:33,045 INFO L290 TraceCheckUtils]: 78: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,045 INFO L290 TraceCheckUtils]: 79: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,045 INFO L290 TraceCheckUtils]: 80: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,046 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {11306#true} {11546#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {11546#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:33,046 INFO L290 TraceCheckUtils]: 82: Hoare triple {11546#(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; {11568#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:34:33,046 INFO L290 TraceCheckUtils]: 83: Hoare triple {11568#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {11568#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:34:33,046 INFO L272 TraceCheckUtils]: 84: Hoare triple {11568#(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)); {11306#true} is VALID [2022-04-08 04:34:33,046 INFO L290 TraceCheckUtils]: 85: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,047 INFO L290 TraceCheckUtils]: 86: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,047 INFO L290 TraceCheckUtils]: 87: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,047 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11306#true} {11568#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {11568#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:34:33,047 INFO L290 TraceCheckUtils]: 89: Hoare triple {11568#(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; {11590#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:34:33,048 INFO L290 TraceCheckUtils]: 90: Hoare triple {11590#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {11590#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:34:33,048 INFO L272 TraceCheckUtils]: 91: Hoare triple {11590#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 04:34:33,048 INFO L290 TraceCheckUtils]: 92: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,048 INFO L290 TraceCheckUtils]: 93: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,048 INFO L290 TraceCheckUtils]: 94: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,048 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {11306#true} {11590#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #50#return; {11590#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:34:33,049 INFO L290 TraceCheckUtils]: 96: Hoare triple {11590#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11612#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 04:34:33,049 INFO L290 TraceCheckUtils]: 97: Hoare triple {11612#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !false; {11612#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 04:34:33,049 INFO L272 TraceCheckUtils]: 98: Hoare triple {11612#(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)); {11306#true} is VALID [2022-04-08 04:34:33,049 INFO L290 TraceCheckUtils]: 99: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,049 INFO L290 TraceCheckUtils]: 100: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,049 INFO L290 TraceCheckUtils]: 101: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,050 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {11306#true} {11612#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} #50#return; {11612#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 04:34:33,050 INFO L290 TraceCheckUtils]: 103: Hoare triple {11612#(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; {11634#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 04:34:33,050 INFO L290 TraceCheckUtils]: 104: Hoare triple {11634#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} assume !false; {11634#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 04:34:33,051 INFO L272 TraceCheckUtils]: 105: Hoare triple {11634#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 04:34:33,051 INFO L290 TraceCheckUtils]: 106: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,051 INFO L290 TraceCheckUtils]: 107: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,051 INFO L290 TraceCheckUtils]: 108: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,051 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {11306#true} {11634#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} #50#return; {11634#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 04:34:33,052 INFO L290 TraceCheckUtils]: 110: Hoare triple {11634#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11656#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:34:33,052 INFO L290 TraceCheckUtils]: 111: Hoare triple {11656#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {11656#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:34:33,052 INFO L272 TraceCheckUtils]: 112: Hoare triple {11656#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11306#true} is VALID [2022-04-08 04:34:33,052 INFO L290 TraceCheckUtils]: 113: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,052 INFO L290 TraceCheckUtils]: 114: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,052 INFO L290 TraceCheckUtils]: 115: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,052 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11306#true} {11656#(and (= main_~c~0 15) (= main_~y~0 15))} #50#return; {11656#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:34:33,053 INFO L290 TraceCheckUtils]: 117: Hoare triple {11656#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11678#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 04:34:33,053 INFO L290 TraceCheckUtils]: 118: Hoare triple {11678#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !false; {11678#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 04:34:33,053 INFO L272 TraceCheckUtils]: 119: Hoare triple {11678#(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)); {11306#true} is VALID [2022-04-08 04:34:33,053 INFO L290 TraceCheckUtils]: 120: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,053 INFO L290 TraceCheckUtils]: 121: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,053 INFO L290 TraceCheckUtils]: 122: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,054 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {11306#true} {11678#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} #50#return; {11678#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 04:34:33,054 INFO L290 TraceCheckUtils]: 124: Hoare triple {11678#(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; {11700#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:33,055 INFO L290 TraceCheckUtils]: 125: Hoare triple {11700#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} assume !false; {11700#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:33,055 INFO L272 TraceCheckUtils]: 126: Hoare triple {11700#(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)); {11306#true} is VALID [2022-04-08 04:34:33,055 INFO L290 TraceCheckUtils]: 127: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,055 INFO L290 TraceCheckUtils]: 128: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,055 INFO L290 TraceCheckUtils]: 129: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,055 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {11306#true} {11700#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} #50#return; {11700#(and (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:33,056 INFO L290 TraceCheckUtils]: 131: Hoare triple {11700#(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; {11722#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:34:33,056 INFO L290 TraceCheckUtils]: 132: Hoare triple {11722#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !false; {11722#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:34:33,056 INFO L272 TraceCheckUtils]: 133: Hoare triple {11722#(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)); {11306#true} is VALID [2022-04-08 04:34:33,056 INFO L290 TraceCheckUtils]: 134: Hoare triple {11306#true} ~cond := #in~cond; {11306#true} is VALID [2022-04-08 04:34:33,056 INFO L290 TraceCheckUtils]: 135: Hoare triple {11306#true} assume !(0 == ~cond); {11306#true} is VALID [2022-04-08 04:34:33,056 INFO L290 TraceCheckUtils]: 136: Hoare triple {11306#true} assume true; {11306#true} is VALID [2022-04-08 04:34:33,057 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {11306#true} {11722#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} #50#return; {11722#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:34:33,058 INFO L290 TraceCheckUtils]: 138: Hoare triple {11722#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !(~c~0 < ~k~0); {11744#(and (< 17 main_~k~0) (<= main_~k~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:34:33,059 INFO L272 TraceCheckUtils]: 139: Hoare triple {11744#(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)); {11748#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:34:33,059 INFO L290 TraceCheckUtils]: 140: Hoare triple {11748#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11752#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:34:33,060 INFO L290 TraceCheckUtils]: 141: Hoare triple {11752#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11307#false} is VALID [2022-04-08 04:34:33,060 INFO L290 TraceCheckUtils]: 142: Hoare triple {11307#false} assume !false; {11307#false} is VALID [2022-04-08 04:34:33,060 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-08 04:34:33,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:34:33,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:34:33,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801305198] [2022-04-08 04:34:33,379 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:34:33,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342955948] [2022-04-08 04:34:33,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342955948] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:34:33,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:34:33,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-04-08 04:34:33,380 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:34:33,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [88266549] [2022-04-08 04:34:33,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [88266549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:34:33,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:34:33,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 04:34:33,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110340347] [2022-04-08 04:34:33,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:34:33,381 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-08 04:34:33,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:34:33,381 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-08 04:34:33,456 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-08 04:34:33,456 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 04:34:33,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:33,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 04:34:33,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-04-08 04:34:33,457 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-08 04:34:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:36,766 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2022-04-08 04:34:36,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 04:34:36,767 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-08 04:34:36,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:34:36,768 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-08 04:34:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 98 transitions. [2022-04-08 04:34:36,770 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-08 04:34:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 98 transitions. [2022-04-08 04:34:36,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 98 transitions. [2022-04-08 04:34:36,870 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-08 04:34:36,875 INFO L225 Difference]: With dead ends: 84 [2022-04-08 04:34:36,875 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 04:34:36,875 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2022-04-08 04:34:36,876 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-08 04:34:36,876 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 747 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-08 04:34:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 04:34:36,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-08 04:34:36,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:34:36,958 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-08 04:34:36,958 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-08 04:34:36,959 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-08 04:34:36,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:36,960 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2022-04-08 04:34:36,961 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-08 04:34:36,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:36,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:36,961 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-08 04:34:36,961 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-08 04:34:36,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:36,963 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2022-04-08 04:34:36,963 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-08 04:34:36,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:36,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:36,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:34:36,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:34:36,964 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-08 04:34:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2022-04-08 04:34:36,966 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 143 [2022-04-08 04:34:36,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:34:36,966 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-04-08 04:34:36,966 INFO L479 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-08 04:34:36,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 97 transitions. [2022-04-08 04:34:37,115 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-08 04:34:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-08 04:34:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-08 04:34:37,120 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:34:37,120 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:34:37,128 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-08 04:34:37,327 WARN L460 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-08 04:34:37,327 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:34:37,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:34:37,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1978024123, now seen corresponding path program 37 times [2022-04-08 04:34:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:37,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [94088219] [2022-04-08 04:34:37,401 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:34:37,401 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:34:37,401 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:34:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1978024123, now seen corresponding path program 38 times [2022-04-08 04:34:37,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:34:37,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83641644] [2022-04-08 04:34:37,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:34:37,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:34:37,429 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:34:37,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [604295784] [2022-04-08 04:34:37,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:34:37,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:34:37,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:34:37,430 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-08 04:34:37,453 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-08 04:34:37,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:34:37,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:34:37,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-08 04:34:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:34:37,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:34:38,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {12288#true} call ULTIMATE.init(); {12288#true} is VALID [2022-04-08 04:34:38,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {12288#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); {12288#true} is VALID [2022-04-08 04:34:38,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12288#true} {12288#true} #56#return; {12288#true} is VALID [2022-04-08 04:34:38,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {12288#true} call #t~ret5 := main(); {12288#true} is VALID [2022-04-08 04:34:38,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {12288#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; {12308#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:38,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {12308#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {12308#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:38,864 INFO L272 TraceCheckUtils]: 7: Hoare triple {12308#(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)); {12288#true} is VALID [2022-04-08 04:34:38,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,865 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {12288#true} {12308#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {12308#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:38,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {12308#(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; {12330#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:34:38,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {12330#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {12330#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:34:38,865 INFO L272 TraceCheckUtils]: 14: Hoare triple {12330#(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)); {12288#true} is VALID [2022-04-08 04:34:38,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,866 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12288#true} {12330#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {12330#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:34:38,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {12330#(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; {12352#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:34:38,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {12352#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {12352#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:34:38,867 INFO L272 TraceCheckUtils]: 21: Hoare triple {12352#(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)); {12288#true} is VALID [2022-04-08 04:34:38,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,868 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12288#true} {12352#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {12352#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:34:38,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {12352#(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; {12374#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:34:38,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {12374#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {12374#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:34:38,869 INFO L272 TraceCheckUtils]: 28: Hoare triple {12374#(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)); {12288#true} is VALID [2022-04-08 04:34:38,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,869 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12288#true} {12374#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {12374#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:34:38,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {12374#(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; {12396#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 04:34:38,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {12396#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {12396#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 04:34:38,870 INFO L272 TraceCheckUtils]: 35: Hoare triple {12396#(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)); {12288#true} is VALID [2022-04-08 04:34:38,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,871 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12288#true} {12396#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #50#return; {12396#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 04:34:38,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {12396#(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; {12418#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:38,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {12418#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {12418#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:38,872 INFO L272 TraceCheckUtils]: 42: Hoare triple {12418#(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)); {12288#true} is VALID [2022-04-08 04:34:38,872 INFO L290 TraceCheckUtils]: 43: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,873 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12288#true} {12418#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {12418#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:38,873 INFO L290 TraceCheckUtils]: 47: Hoare triple {12418#(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; {12440#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:34:38,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {12440#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {12440#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:34:38,873 INFO L272 TraceCheckUtils]: 49: Hoare triple {12440#(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)); {12288#true} is VALID [2022-04-08 04:34:38,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,874 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12288#true} {12440#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #50#return; {12440#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:34:38,874 INFO L290 TraceCheckUtils]: 54: Hoare triple {12440#(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; {12462#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:38,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {12462#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {12462#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:38,875 INFO L272 TraceCheckUtils]: 56: Hoare triple {12462#(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)); {12288#true} is VALID [2022-04-08 04:34:38,875 INFO L290 TraceCheckUtils]: 57: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,875 INFO L290 TraceCheckUtils]: 58: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,875 INFO L290 TraceCheckUtils]: 59: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,875 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12288#true} {12462#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #50#return; {12462#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:38,876 INFO L290 TraceCheckUtils]: 61: Hoare triple {12462#(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; {12484#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 04:34:38,876 INFO L290 TraceCheckUtils]: 62: Hoare triple {12484#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {12484#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 04:34:38,876 INFO L272 TraceCheckUtils]: 63: Hoare triple {12484#(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)); {12288#true} is VALID [2022-04-08 04:34:38,876 INFO L290 TraceCheckUtils]: 64: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,876 INFO L290 TraceCheckUtils]: 65: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,876 INFO L290 TraceCheckUtils]: 66: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,877 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {12288#true} {12484#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #50#return; {12484#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 04:34:38,877 INFO L290 TraceCheckUtils]: 68: Hoare triple {12484#(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; {12506#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:38,877 INFO L290 TraceCheckUtils]: 69: Hoare triple {12506#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} assume !false; {12506#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:38,877 INFO L272 TraceCheckUtils]: 70: Hoare triple {12506#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12288#true} is VALID [2022-04-08 04:34:38,877 INFO L290 TraceCheckUtils]: 71: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,878 INFO L290 TraceCheckUtils]: 72: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,878 INFO L290 TraceCheckUtils]: 73: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,878 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12288#true} {12506#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} #50#return; {12506#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:38,878 INFO L290 TraceCheckUtils]: 75: Hoare triple {12506#(and (= (+ main_~y~0 (- 3)) 6) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {12528#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:38,879 INFO L290 TraceCheckUtils]: 76: Hoare triple {12528#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {12528#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:38,879 INFO L272 TraceCheckUtils]: 77: Hoare triple {12528#(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)); {12288#true} is VALID [2022-04-08 04:34:38,879 INFO L290 TraceCheckUtils]: 78: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,879 INFO L290 TraceCheckUtils]: 79: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,879 INFO L290 TraceCheckUtils]: 80: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,879 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {12288#true} {12528#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {12528#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:34:38,880 INFO L290 TraceCheckUtils]: 82: Hoare triple {12528#(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; {12550#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:34:38,880 INFO L290 TraceCheckUtils]: 83: Hoare triple {12550#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {12550#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:34:38,880 INFO L272 TraceCheckUtils]: 84: Hoare triple {12550#(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)); {12288#true} is VALID [2022-04-08 04:34:38,880 INFO L290 TraceCheckUtils]: 85: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,880 INFO L290 TraceCheckUtils]: 86: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,880 INFO L290 TraceCheckUtils]: 87: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,881 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12288#true} {12550#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {12550#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:34:38,881 INFO L290 TraceCheckUtils]: 89: Hoare triple {12550#(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; {12572#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:34:38,881 INFO L290 TraceCheckUtils]: 90: Hoare triple {12572#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {12572#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:34:38,881 INFO L272 TraceCheckUtils]: 91: Hoare triple {12572#(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)); {12288#true} is VALID [2022-04-08 04:34:38,882 INFO L290 TraceCheckUtils]: 92: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,882 INFO L290 TraceCheckUtils]: 93: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,882 INFO L290 TraceCheckUtils]: 94: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,882 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {12288#true} {12572#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #50#return; {12572#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:34:38,882 INFO L290 TraceCheckUtils]: 96: Hoare triple {12572#(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; {12594#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 04:34:38,883 INFO L290 TraceCheckUtils]: 97: Hoare triple {12594#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {12594#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 04:34:38,883 INFO L272 TraceCheckUtils]: 98: Hoare triple {12594#(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)); {12288#true} is VALID [2022-04-08 04:34:38,883 INFO L290 TraceCheckUtils]: 99: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,883 INFO L290 TraceCheckUtils]: 100: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,883 INFO L290 TraceCheckUtils]: 101: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,883 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {12288#true} {12594#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #50#return; {12594#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 04:34:38,884 INFO L290 TraceCheckUtils]: 103: Hoare triple {12594#(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; {12616#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:34:38,884 INFO L290 TraceCheckUtils]: 104: Hoare triple {12616#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {12616#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:34:38,884 INFO L272 TraceCheckUtils]: 105: Hoare triple {12616#(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)); {12288#true} is VALID [2022-04-08 04:34:38,884 INFO L290 TraceCheckUtils]: 106: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,884 INFO L290 TraceCheckUtils]: 107: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,884 INFO L290 TraceCheckUtils]: 108: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,885 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {12288#true} {12616#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #50#return; {12616#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:34:38,885 INFO L290 TraceCheckUtils]: 110: Hoare triple {12616#(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; {12638#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 04:34:38,885 INFO L290 TraceCheckUtils]: 111: Hoare triple {12638#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {12638#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 04:34:38,886 INFO L272 TraceCheckUtils]: 112: Hoare triple {12638#(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)); {12288#true} is VALID [2022-04-08 04:34:38,886 INFO L290 TraceCheckUtils]: 113: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,886 INFO L290 TraceCheckUtils]: 114: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,886 INFO L290 TraceCheckUtils]: 115: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,886 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {12288#true} {12638#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #50#return; {12638#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 04:34:38,886 INFO L290 TraceCheckUtils]: 117: Hoare triple {12638#(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; {12660#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:34:38,887 INFO L290 TraceCheckUtils]: 118: Hoare triple {12660#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {12660#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:34:38,887 INFO L272 TraceCheckUtils]: 119: Hoare triple {12660#(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)); {12288#true} is VALID [2022-04-08 04:34:38,887 INFO L290 TraceCheckUtils]: 120: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,887 INFO L290 TraceCheckUtils]: 121: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,887 INFO L290 TraceCheckUtils]: 122: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,887 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {12288#true} {12660#(and (= main_~c~0 16) (= main_~y~0 16))} #50#return; {12660#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:34:38,888 INFO L290 TraceCheckUtils]: 124: Hoare triple {12660#(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; {12682#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:38,888 INFO L290 TraceCheckUtils]: 125: Hoare triple {12682#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {12682#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:38,888 INFO L272 TraceCheckUtils]: 126: Hoare triple {12682#(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)); {12288#true} is VALID [2022-04-08 04:34:38,888 INFO L290 TraceCheckUtils]: 127: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,888 INFO L290 TraceCheckUtils]: 128: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,888 INFO L290 TraceCheckUtils]: 129: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,889 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {12288#true} {12682#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #50#return; {12682#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:38,889 INFO L290 TraceCheckUtils]: 131: Hoare triple {12682#(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; {12704#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 04:34:38,890 INFO L290 TraceCheckUtils]: 132: Hoare triple {12704#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !false; {12704#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 04:34:38,890 INFO L272 TraceCheckUtils]: 133: Hoare triple {12704#(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)); {12288#true} is VALID [2022-04-08 04:34:38,890 INFO L290 TraceCheckUtils]: 134: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,890 INFO L290 TraceCheckUtils]: 135: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,890 INFO L290 TraceCheckUtils]: 136: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,890 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {12288#true} {12704#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} #50#return; {12704#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 04:34:38,891 INFO L290 TraceCheckUtils]: 138: Hoare triple {12704#(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; {12726#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~c~0 19))} is VALID [2022-04-08 04:34:38,891 INFO L290 TraceCheckUtils]: 139: Hoare triple {12726#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~c~0 19))} assume !false; {12726#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~c~0 19))} is VALID [2022-04-08 04:34:38,891 INFO L272 TraceCheckUtils]: 140: Hoare triple {12726#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= 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)); {12288#true} is VALID [2022-04-08 04:34:38,891 INFO L290 TraceCheckUtils]: 141: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-08 04:34:38,891 INFO L290 TraceCheckUtils]: 142: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-08 04:34:38,891 INFO L290 TraceCheckUtils]: 143: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-08 04:34:38,892 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {12288#true} {12726#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~c~0 19))} #50#return; {12726#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~c~0 19))} is VALID [2022-04-08 04:34:38,893 INFO L290 TraceCheckUtils]: 145: Hoare triple {12726#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~c~0 19))} assume !(~c~0 < ~k~0); {12748#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~k~0 19))} is VALID [2022-04-08 04:34:38,894 INFO L272 TraceCheckUtils]: 146: Hoare triple {12748#(and (< 18 main_~k~0) (= (+ main_~y~0 (- 3)) 16) (<= main_~k~0 19))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12752#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:34:38,894 INFO L290 TraceCheckUtils]: 147: Hoare triple {12752#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12756#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:34:38,894 INFO L290 TraceCheckUtils]: 148: Hoare triple {12756#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12289#false} is VALID [2022-04-08 04:34:38,894 INFO L290 TraceCheckUtils]: 149: Hoare triple {12289#false} assume !false; {12289#false} is VALID [2022-04-08 04:34:38,895 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-08 04:34:38,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:34:39,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:34:39,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83641644] [2022-04-08 04:34:39,212 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:34:39,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604295784] [2022-04-08 04:34:39,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604295784] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:34:39,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:34:39,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-04-08 04:34:39,213 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:34:39,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [94088219] [2022-04-08 04:34:39,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [94088219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:34:39,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:34:39,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 04:34:39,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585766275] [2022-04-08 04:34:39,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:34:39,213 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-08 04:34:39,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:34:39,214 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-08 04:34:39,305 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-08 04:34:39,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 04:34:39,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:39,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 04:34:39,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-04-08 04:34:39,306 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-08 04:34:43,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:43,136 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2022-04-08 04:34:43,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 04:34:43,137 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-08 04:34:43,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:34:43,137 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-08 04:34:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 102 transitions. [2022-04-08 04:34:43,139 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-08 04:34:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 102 transitions. [2022-04-08 04:34:43,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 102 transitions. [2022-04-08 04:34:43,248 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-08 04:34:43,250 INFO L225 Difference]: With dead ends: 87 [2022-04-08 04:34:43,250 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 04:34:43,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2022-04-08 04:34:43,251 INFO L913 BasicCegarLoop]: 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-08 04:34:43,251 INFO L914 BasicCegarLoop]: 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-08 04:34:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 04:34:43,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-08 04:34:43,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:34:43,333 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-08 04:34:43,334 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-08 04:34:43,334 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-08 04:34:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:43,336 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-08 04:34:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 04:34:43,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:43,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:43,337 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-08 04:34:43,337 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-08 04:34:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:43,339 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-08 04:34:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 04:34:43,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:43,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:43,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:34:43,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:34:43,340 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-08 04:34:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-08 04:34:43,342 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 150 [2022-04-08 04:34:43,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:34:43,342 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-08 04:34:43,342 INFO L479 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-08 04:34:43,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-08 04:34:43,511 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-08 04:34:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 04:34:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-08 04:34:43,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:34:43,513 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:34:43,523 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-08 04:34:43,718 WARN L460 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-08 04:34:43,719 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:34:43,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:34:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1184287794, now seen corresponding path program 39 times [2022-04-08 04:34:43,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:43,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2019844444] [2022-04-08 04:34:43,789 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:34:43,789 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:34:43,789 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:34:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1184287794, now seen corresponding path program 40 times [2022-04-08 04:34:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:34:43,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169471375] [2022-04-08 04:34:43,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:34:43,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:34:43,807 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:34:43,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299929566] [2022-04-08 04:34:43,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:34:43,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:34:43,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:34:43,809 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-08 04:34:43,810 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-08 04:34:45,265 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:34:45,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:34:45,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-08 04:34:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:34:45,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:34:46,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {13310#true} call ULTIMATE.init(); {13310#true} is VALID [2022-04-08 04:34:46,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {13310#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); {13310#true} is VALID [2022-04-08 04:34:46,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13310#true} {13310#true} #56#return; {13310#true} is VALID [2022-04-08 04:34:46,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {13310#true} call #t~ret5 := main(); {13310#true} is VALID [2022-04-08 04:34:46,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {13310#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; {13330#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:46,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {13330#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {13330#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:46,283 INFO L272 TraceCheckUtils]: 7: Hoare triple {13330#(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)); {13310#true} is VALID [2022-04-08 04:34:46,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,283 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {13310#true} {13330#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {13330#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:46,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {13330#(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; {13352#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:34:46,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {13352#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {13352#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:34:46,284 INFO L272 TraceCheckUtils]: 14: Hoare triple {13352#(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)); {13310#true} is VALID [2022-04-08 04:34:46,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,285 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13310#true} {13352#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {13352#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:34:46,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {13352#(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; {13374#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 04:34:46,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {13374#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {13374#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 04:34:46,286 INFO L272 TraceCheckUtils]: 21: Hoare triple {13374#(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)); {13310#true} is VALID [2022-04-08 04:34:46,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,286 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13310#true} {13374#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #50#return; {13374#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 04:34:46,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {13374#(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; {13396#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 04:34:46,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {13396#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} assume !false; {13396#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 04:34:46,287 INFO L272 TraceCheckUtils]: 28: Hoare triple {13396#(and (= (+ (- 2) main_~c~0) 1) (= (+ 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)); {13310#true} is VALID [2022-04-08 04:34:46,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,292 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13310#true} {13396#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} #50#return; {13396#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 04:34:46,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {13396#(and (= (+ (- 2) main_~c~0) 1) (= (+ 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; {13418#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-08 04:34:46,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {13418#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} assume !false; {13418#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-08 04:34:46,293 INFO L272 TraceCheckUtils]: 35: Hoare triple {13418#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~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)); {13310#true} is VALID [2022-04-08 04:34:46,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,293 INFO L290 TraceCheckUtils]: 38: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,294 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13310#true} {13418#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} #50#return; {13418#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-08 04:34:46,294 INFO L290 TraceCheckUtils]: 40: Hoare triple {13418#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~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; {13440#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:46,294 INFO L290 TraceCheckUtils]: 41: Hoare triple {13440#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {13440#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:46,294 INFO L272 TraceCheckUtils]: 42: Hoare triple {13440#(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)); {13310#true} is VALID [2022-04-08 04:34:46,294 INFO L290 TraceCheckUtils]: 43: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,295 INFO L290 TraceCheckUtils]: 44: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,295 INFO L290 TraceCheckUtils]: 45: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,295 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13310#true} {13440#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {13440#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:46,296 INFO L290 TraceCheckUtils]: 47: Hoare triple {13440#(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; {13462#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:46,296 INFO L290 TraceCheckUtils]: 48: Hoare triple {13462#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {13462#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:46,296 INFO L272 TraceCheckUtils]: 49: Hoare triple {13462#(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)); {13310#true} is VALID [2022-04-08 04:34:46,296 INFO L290 TraceCheckUtils]: 50: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,296 INFO L290 TraceCheckUtils]: 51: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,296 INFO L290 TraceCheckUtils]: 52: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,296 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {13310#true} {13462#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #50#return; {13462#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:46,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {13462#(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; {13484#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:34:46,297 INFO L290 TraceCheckUtils]: 55: Hoare triple {13484#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {13484#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:34:46,297 INFO L272 TraceCheckUtils]: 56: Hoare triple {13484#(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)); {13310#true} is VALID [2022-04-08 04:34:46,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,297 INFO L290 TraceCheckUtils]: 58: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,297 INFO L290 TraceCheckUtils]: 59: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,298 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13310#true} {13484#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {13484#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:34:46,298 INFO L290 TraceCheckUtils]: 61: Hoare triple {13484#(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; {13506#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 04:34:46,299 INFO L290 TraceCheckUtils]: 62: Hoare triple {13506#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {13506#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 04:34:46,299 INFO L272 TraceCheckUtils]: 63: Hoare triple {13506#(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)); {13310#true} is VALID [2022-04-08 04:34:46,299 INFO L290 TraceCheckUtils]: 64: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,299 INFO L290 TraceCheckUtils]: 65: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,299 INFO L290 TraceCheckUtils]: 66: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,299 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {13310#true} {13506#(and (= main_~y~0 8) (= main_~c~0 8))} #50#return; {13506#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 04:34:46,300 INFO L290 TraceCheckUtils]: 68: Hoare triple {13506#(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; {13528#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 04:34:46,300 INFO L290 TraceCheckUtils]: 69: Hoare triple {13528#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {13528#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 04:34:46,300 INFO L272 TraceCheckUtils]: 70: Hoare triple {13528#(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)); {13310#true} is VALID [2022-04-08 04:34:46,300 INFO L290 TraceCheckUtils]: 71: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,300 INFO L290 TraceCheckUtils]: 72: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,300 INFO L290 TraceCheckUtils]: 73: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,300 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13310#true} {13528#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {13528#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 04:34:46,301 INFO L290 TraceCheckUtils]: 75: Hoare triple {13528#(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; {13550#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:34:46,301 INFO L290 TraceCheckUtils]: 76: Hoare triple {13550#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {13550#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:34:46,301 INFO L272 TraceCheckUtils]: 77: Hoare triple {13550#(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)); {13310#true} is VALID [2022-04-08 04:34:46,301 INFO L290 TraceCheckUtils]: 78: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,301 INFO L290 TraceCheckUtils]: 79: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,301 INFO L290 TraceCheckUtils]: 80: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,302 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13310#true} {13550#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #50#return; {13550#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:34:46,302 INFO L290 TraceCheckUtils]: 82: Hoare triple {13550#(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; {13572#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:34:46,302 INFO L290 TraceCheckUtils]: 83: Hoare triple {13572#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {13572#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:34:46,303 INFO L272 TraceCheckUtils]: 84: Hoare triple {13572#(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)); {13310#true} is VALID [2022-04-08 04:34:46,303 INFO L290 TraceCheckUtils]: 85: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,303 INFO L290 TraceCheckUtils]: 86: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,303 INFO L290 TraceCheckUtils]: 87: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,303 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13310#true} {13572#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {13572#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:34:46,303 INFO L290 TraceCheckUtils]: 89: Hoare triple {13572#(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; {13594#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:34:46,304 INFO L290 TraceCheckUtils]: 90: Hoare triple {13594#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {13594#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:34:46,304 INFO L272 TraceCheckUtils]: 91: Hoare triple {13594#(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)); {13310#true} is VALID [2022-04-08 04:34:46,304 INFO L290 TraceCheckUtils]: 92: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,304 INFO L290 TraceCheckUtils]: 93: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,304 INFO L290 TraceCheckUtils]: 94: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,304 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {13310#true} {13594#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #50#return; {13594#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:34:46,305 INFO L290 TraceCheckUtils]: 96: Hoare triple {13594#(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; {13616#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 04:34:46,305 INFO L290 TraceCheckUtils]: 97: Hoare triple {13616#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !false; {13616#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 04:34:46,305 INFO L272 TraceCheckUtils]: 98: Hoare triple {13616#(and (= (+ (- 2) main_~y~0) 11) (= 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)); {13310#true} is VALID [2022-04-08 04:34:46,305 INFO L290 TraceCheckUtils]: 99: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,305 INFO L290 TraceCheckUtils]: 100: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,305 INFO L290 TraceCheckUtils]: 101: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,306 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {13310#true} {13616#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #50#return; {13616#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 04:34:46,306 INFO L290 TraceCheckUtils]: 103: Hoare triple {13616#(and (= (+ (- 2) main_~y~0) 11) (= 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; {13638#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 04:34:46,306 INFO L290 TraceCheckUtils]: 104: Hoare triple {13638#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} assume !false; {13638#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 04:34:46,307 INFO L272 TraceCheckUtils]: 105: Hoare triple {13638#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 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)); {13310#true} is VALID [2022-04-08 04:34:46,307 INFO L290 TraceCheckUtils]: 106: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,307 INFO L290 TraceCheckUtils]: 107: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,307 INFO L290 TraceCheckUtils]: 108: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,307 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {13310#true} {13638#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} #50#return; {13638#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 04:34:46,307 INFO L290 TraceCheckUtils]: 110: Hoare triple {13638#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 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; {13660#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:46,308 INFO L290 TraceCheckUtils]: 111: Hoare triple {13660#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !false; {13660#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:46,308 INFO L272 TraceCheckUtils]: 112: Hoare triple {13660#(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)); {13310#true} is VALID [2022-04-08 04:34:46,308 INFO L290 TraceCheckUtils]: 113: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,308 INFO L290 TraceCheckUtils]: 114: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,308 INFO L290 TraceCheckUtils]: 115: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,308 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13310#true} {13660#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} #50#return; {13660#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:46,309 INFO L290 TraceCheckUtils]: 117: Hoare triple {13660#(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; {13682#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-08 04:34:46,309 INFO L290 TraceCheckUtils]: 118: Hoare triple {13682#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} assume !false; {13682#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-08 04:34:46,309 INFO L272 TraceCheckUtils]: 119: Hoare triple {13682#(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)); {13310#true} is VALID [2022-04-08 04:34:46,309 INFO L290 TraceCheckUtils]: 120: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,309 INFO L290 TraceCheckUtils]: 121: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,309 INFO L290 TraceCheckUtils]: 122: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,310 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {13310#true} {13682#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} #50#return; {13682#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-08 04:34:46,310 INFO L290 TraceCheckUtils]: 124: Hoare triple {13682#(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; {13704#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:46,310 INFO L290 TraceCheckUtils]: 125: Hoare triple {13704#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {13704#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:46,311 INFO L272 TraceCheckUtils]: 126: Hoare triple {13704#(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)); {13310#true} is VALID [2022-04-08 04:34:46,311 INFO L290 TraceCheckUtils]: 127: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,311 INFO L290 TraceCheckUtils]: 128: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,311 INFO L290 TraceCheckUtils]: 129: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,311 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {13310#true} {13704#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #50#return; {13704#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:46,311 INFO L290 TraceCheckUtils]: 131: Hoare triple {13704#(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; {13726#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-08 04:34:46,312 INFO L290 TraceCheckUtils]: 132: Hoare triple {13726#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} assume !false; {13726#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-08 04:34:46,312 INFO L272 TraceCheckUtils]: 133: Hoare triple {13726#(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)); {13310#true} is VALID [2022-04-08 04:34:46,312 INFO L290 TraceCheckUtils]: 134: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,312 INFO L290 TraceCheckUtils]: 135: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,312 INFO L290 TraceCheckUtils]: 136: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,312 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {13310#true} {13726#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} #50#return; {13726#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-08 04:34:46,313 INFO L290 TraceCheckUtils]: 138: Hoare triple {13726#(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; {13748#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:34:46,313 INFO L290 TraceCheckUtils]: 139: Hoare triple {13748#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {13748#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:34:46,313 INFO L272 TraceCheckUtils]: 140: Hoare triple {13748#(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)); {13310#true} is VALID [2022-04-08 04:34:46,313 INFO L290 TraceCheckUtils]: 141: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,313 INFO L290 TraceCheckUtils]: 142: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,313 INFO L290 TraceCheckUtils]: 143: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,314 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {13310#true} {13748#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #50#return; {13748#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:34:46,315 INFO L290 TraceCheckUtils]: 145: Hoare triple {13748#(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; {13770#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} is VALID [2022-04-08 04:34:46,315 INFO L290 TraceCheckUtils]: 146: Hoare triple {13770#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} assume !false; {13770#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} is VALID [2022-04-08 04:34:46,315 INFO L272 TraceCheckUtils]: 147: Hoare triple {13770#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 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)); {13310#true} is VALID [2022-04-08 04:34:46,315 INFO L290 TraceCheckUtils]: 148: Hoare triple {13310#true} ~cond := #in~cond; {13310#true} is VALID [2022-04-08 04:34:46,315 INFO L290 TraceCheckUtils]: 149: Hoare triple {13310#true} assume !(0 == ~cond); {13310#true} is VALID [2022-04-08 04:34:46,316 INFO L290 TraceCheckUtils]: 150: Hoare triple {13310#true} assume true; {13310#true} is VALID [2022-04-08 04:34:46,316 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {13310#true} {13770#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} #50#return; {13770#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} is VALID [2022-04-08 04:34:46,317 INFO L290 TraceCheckUtils]: 152: Hoare triple {13770#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} assume !(~c~0 < ~k~0); {13792#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~k~0 20) (< 19 main_~k~0))} is VALID [2022-04-08 04:34:46,317 INFO L272 TraceCheckUtils]: 153: Hoare triple {13792#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~k~0 20) (< 19 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {13796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:34:46,318 INFO L290 TraceCheckUtils]: 154: Hoare triple {13796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:34:46,318 INFO L290 TraceCheckUtils]: 155: Hoare triple {13800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13311#false} is VALID [2022-04-08 04:34:46,318 INFO L290 TraceCheckUtils]: 156: Hoare triple {13311#false} assume !false; {13311#false} is VALID [2022-04-08 04:34:46,319 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-08 04:34:46,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:34:46,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:34:46,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169471375] [2022-04-08 04:34:46,635 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:34:46,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299929566] [2022-04-08 04:34:46,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299929566] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:34:46,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:34:46,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-08 04:34:46,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:34:46,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2019844444] [2022-04-08 04:34:46,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2019844444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:34:46,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:34:46,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 04:34:46,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440502833] [2022-04-08 04:34:46,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:34:46,636 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-08 04:34:46,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:34:46,637 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-08 04:34:46,743 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-08 04:34:46,743 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 04:34:46,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:46,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 04:34:46,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-08 04:34:46,744 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-08 04:34:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:51,095 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-04-08 04:34:51,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 04:34:51,096 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-08 04:34:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:34:51,096 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-08 04:34:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-08 04:34:51,098 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-08 04:34:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-08 04:34:51,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 106 transitions. [2022-04-08 04:34:51,209 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-08 04:34:51,210 INFO L225 Difference]: With dead ends: 90 [2022-04-08 04:34:51,210 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 04:34:51,210 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2022-04-08 04:34:51,211 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:34:51,211 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 863 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 04:34:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 04:34:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-08 04:34:51,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:34:51,294 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-08 04:34:51,294 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-08 04:34:51,294 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-08 04:34:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:51,296 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2022-04-08 04:34:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2022-04-08 04:34:51,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:51,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:51,296 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-08 04:34:51,296 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-08 04:34:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:51,299 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2022-04-08 04:34:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2022-04-08 04:34:51,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:51,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:51,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:34:51,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:34:51,299 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-08 04:34:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2022-04-08 04:34:51,302 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 157 [2022-04-08 04:34:51,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:34:51,302 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2022-04-08 04:34:51,302 INFO L479 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-08 04:34:51,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 105 transitions. [2022-04-08 04:34:51,506 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-08 04:34:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2022-04-08 04:34:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-08 04:34:51,507 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:34:51,507 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:34:51,513 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-08 04:34:51,711 WARN L460 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-08 04:34:51,712 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:34:51,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:34:51,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1391801691, now seen corresponding path program 41 times [2022-04-08 04:34:51,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:51,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [743534025] [2022-04-08 04:34:51,805 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:34:51,805 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:34:51,805 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:34:51,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1391801691, now seen corresponding path program 42 times [2022-04-08 04:34:51,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:34:51,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254359370] [2022-04-08 04:34:51,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:34:51,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:34:51,821 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:34:51,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1957715711] [2022-04-08 04:34:51,821 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:34:51,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:34:51,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:34:51,822 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-08 04:34:51,829 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-08 04:34:52,992 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-08 04:34:52,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:34:52,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-08 04:34:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:34:53,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:34:53,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {14372#true} call ULTIMATE.init(); {14372#true} is VALID [2022-04-08 04:34:53,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {14372#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); {14372#true} is VALID [2022-04-08 04:34:53,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14372#true} {14372#true} #56#return; {14372#true} is VALID [2022-04-08 04:34:53,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {14372#true} call #t~ret5 := main(); {14372#true} is VALID [2022-04-08 04:34:53,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {14372#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; {14392#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:53,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {14392#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {14392#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:53,973 INFO L272 TraceCheckUtils]: 7: Hoare triple {14392#(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)); {14372#true} is VALID [2022-04-08 04:34:53,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,974 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {14372#true} {14392#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {14392#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:34:53,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {14392#(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; {14414#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:34:53,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {14414#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {14414#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:34:53,975 INFO L272 TraceCheckUtils]: 14: Hoare triple {14414#(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)); {14372#true} is VALID [2022-04-08 04:34:53,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,975 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14372#true} {14414#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #50#return; {14414#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:34:53,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {14414#(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; {14436#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:53,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {14436#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {14436#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:53,976 INFO L272 TraceCheckUtils]: 21: Hoare triple {14436#(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)); {14372#true} is VALID [2022-04-08 04:34:53,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,977 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14372#true} {14436#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #50#return; {14436#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:53,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {14436#(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; {14458#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:34:53,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {14458#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {14458#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:34:53,977 INFO L272 TraceCheckUtils]: 28: Hoare triple {14458#(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)); {14372#true} is VALID [2022-04-08 04:34:53,978 INFO L290 TraceCheckUtils]: 29: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,978 INFO L290 TraceCheckUtils]: 30: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,978 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14372#true} {14458#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #50#return; {14458#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:34:53,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {14458#(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; {14480#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:34:53,979 INFO L290 TraceCheckUtils]: 34: Hoare triple {14480#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {14480#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:34:53,979 INFO L272 TraceCheckUtils]: 35: Hoare triple {14480#(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)); {14372#true} is VALID [2022-04-08 04:34:53,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,979 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14372#true} {14480#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #50#return; {14480#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:34:53,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {14480#(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; {14502#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:53,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {14502#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {14502#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:53,980 INFO L272 TraceCheckUtils]: 42: Hoare triple {14502#(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)); {14372#true} is VALID [2022-04-08 04:34:53,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,980 INFO L290 TraceCheckUtils]: 45: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,981 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14372#true} {14502#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {14502#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:34:53,981 INFO L290 TraceCheckUtils]: 47: Hoare triple {14502#(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; {14524#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:53,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {14524#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {14524#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:53,982 INFO L272 TraceCheckUtils]: 49: Hoare triple {14524#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 04:34:53,982 INFO L290 TraceCheckUtils]: 50: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,982 INFO L290 TraceCheckUtils]: 52: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,982 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {14372#true} {14524#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #50#return; {14524#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:53,983 INFO L290 TraceCheckUtils]: 54: Hoare triple {14524#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14546#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:53,983 INFO L290 TraceCheckUtils]: 55: Hoare triple {14546#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {14546#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:53,983 INFO L272 TraceCheckUtils]: 56: Hoare triple {14546#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 04:34:53,983 INFO L290 TraceCheckUtils]: 57: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,983 INFO L290 TraceCheckUtils]: 58: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,983 INFO L290 TraceCheckUtils]: 59: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,984 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14372#true} {14546#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #50#return; {14546#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:53,984 INFO L290 TraceCheckUtils]: 61: Hoare triple {14546#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14568#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 04:34:53,984 INFO L290 TraceCheckUtils]: 62: Hoare triple {14568#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {14568#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 04:34:53,984 INFO L272 TraceCheckUtils]: 63: Hoare triple {14568#(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)); {14372#true} is VALID [2022-04-08 04:34:53,984 INFO L290 TraceCheckUtils]: 64: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,984 INFO L290 TraceCheckUtils]: 65: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,985 INFO L290 TraceCheckUtils]: 66: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,985 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {14372#true} {14568#(and (= main_~y~0 8) (= main_~c~0 8))} #50#return; {14568#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 04:34:53,985 INFO L290 TraceCheckUtils]: 68: Hoare triple {14568#(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; {14590#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:34:53,986 INFO L290 TraceCheckUtils]: 69: Hoare triple {14590#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {14590#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:34:53,986 INFO L272 TraceCheckUtils]: 70: Hoare triple {14590#(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)); {14372#true} is VALID [2022-04-08 04:34:53,986 INFO L290 TraceCheckUtils]: 71: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,986 INFO L290 TraceCheckUtils]: 72: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,986 INFO L290 TraceCheckUtils]: 73: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,986 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14372#true} {14590#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #50#return; {14590#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:34:53,987 INFO L290 TraceCheckUtils]: 75: Hoare triple {14590#(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; {14612#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:53,987 INFO L290 TraceCheckUtils]: 76: Hoare triple {14612#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} assume !false; {14612#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:53,987 INFO L272 TraceCheckUtils]: 77: Hoare triple {14612#(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)); {14372#true} is VALID [2022-04-08 04:34:53,987 INFO L290 TraceCheckUtils]: 78: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,987 INFO L290 TraceCheckUtils]: 79: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,987 INFO L290 TraceCheckUtils]: 80: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,988 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14372#true} {14612#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} #50#return; {14612#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:34:53,988 INFO L290 TraceCheckUtils]: 82: Hoare triple {14612#(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; {14634#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} is VALID [2022-04-08 04:34:53,991 INFO L290 TraceCheckUtils]: 83: Hoare triple {14634#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} assume !false; {14634#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} is VALID [2022-04-08 04:34:53,992 INFO L272 TraceCheckUtils]: 84: Hoare triple {14634#(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)); {14372#true} is VALID [2022-04-08 04:34:53,992 INFO L290 TraceCheckUtils]: 85: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,992 INFO L290 TraceCheckUtils]: 86: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,992 INFO L290 TraceCheckUtils]: 87: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,992 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {14372#true} {14634#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} #50#return; {14634#(and (= (+ (- 2) main_~y~0) 9) (= (+ main_~c~0 (- 3)) 8))} is VALID [2022-04-08 04:34:53,993 INFO L290 TraceCheckUtils]: 89: Hoare triple {14634#(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; {14656#(and (= 8 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 04:34:53,993 INFO L290 TraceCheckUtils]: 90: Hoare triple {14656#(and (= 8 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 9))} assume !false; {14656#(and (= 8 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 04:34:53,994 INFO L272 TraceCheckUtils]: 91: Hoare triple {14656#(and (= 8 (+ main_~c~0 (- 4))) (= (+ 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)); {14372#true} is VALID [2022-04-08 04:34:53,994 INFO L290 TraceCheckUtils]: 92: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,994 INFO L290 TraceCheckUtils]: 93: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,994 INFO L290 TraceCheckUtils]: 94: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,994 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {14372#true} {14656#(and (= 8 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 9))} #50#return; {14656#(and (= 8 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 04:34:53,995 INFO L290 TraceCheckUtils]: 96: Hoare triple {14656#(and (= 8 (+ main_~c~0 (- 4))) (= (+ 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; {14678#(and (= (+ main_~c~0 (- 5)) 8) (= main_~y~0 13))} is VALID [2022-04-08 04:34:53,995 INFO L290 TraceCheckUtils]: 97: Hoare triple {14678#(and (= (+ main_~c~0 (- 5)) 8) (= main_~y~0 13))} assume !false; {14678#(and (= (+ main_~c~0 (- 5)) 8) (= main_~y~0 13))} is VALID [2022-04-08 04:34:53,995 INFO L272 TraceCheckUtils]: 98: Hoare triple {14678#(and (= (+ main_~c~0 (- 5)) 8) (= 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)); {14372#true} is VALID [2022-04-08 04:34:53,995 INFO L290 TraceCheckUtils]: 99: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,996 INFO L290 TraceCheckUtils]: 100: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,996 INFO L290 TraceCheckUtils]: 101: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,996 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {14372#true} {14678#(and (= (+ main_~c~0 (- 5)) 8) (= main_~y~0 13))} #50#return; {14678#(and (= (+ main_~c~0 (- 5)) 8) (= main_~y~0 13))} is VALID [2022-04-08 04:34:53,997 INFO L290 TraceCheckUtils]: 103: Hoare triple {14678#(and (= (+ main_~c~0 (- 5)) 8) (= 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; {14700#(and (= (+ main_~c~0 (- 6)) 8) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:34:53,997 INFO L290 TraceCheckUtils]: 104: Hoare triple {14700#(and (= (+ main_~c~0 (- 6)) 8) (= (+ (- 1) main_~y~0) 13))} assume !false; {14700#(and (= (+ main_~c~0 (- 6)) 8) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:34:53,997 INFO L272 TraceCheckUtils]: 105: Hoare triple {14700#(and (= (+ main_~c~0 (- 6)) 8) (= (+ (- 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)); {14372#true} is VALID [2022-04-08 04:34:53,997 INFO L290 TraceCheckUtils]: 106: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,997 INFO L290 TraceCheckUtils]: 107: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,997 INFO L290 TraceCheckUtils]: 108: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:53,998 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {14372#true} {14700#(and (= (+ main_~c~0 (- 6)) 8) (= (+ (- 1) main_~y~0) 13))} #50#return; {14700#(and (= (+ main_~c~0 (- 6)) 8) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:34:53,999 INFO L290 TraceCheckUtils]: 110: Hoare triple {14700#(and (= (+ main_~c~0 (- 6)) 8) (= (+ (- 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; {14722#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:34:53,999 INFO L290 TraceCheckUtils]: 111: Hoare triple {14722#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {14722#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:34:53,999 INFO L272 TraceCheckUtils]: 112: Hoare triple {14722#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 04:34:53,999 INFO L290 TraceCheckUtils]: 113: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:53,999 INFO L290 TraceCheckUtils]: 114: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:53,999 INFO L290 TraceCheckUtils]: 115: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:54,000 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {14372#true} {14722#(and (= main_~c~0 15) (= main_~y~0 15))} #50#return; {14722#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:34:54,001 INFO L290 TraceCheckUtils]: 117: Hoare triple {14722#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14744#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:34:54,001 INFO L290 TraceCheckUtils]: 118: Hoare triple {14744#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {14744#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:34:54,001 INFO L272 TraceCheckUtils]: 119: Hoare triple {14744#(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)); {14372#true} is VALID [2022-04-08 04:34:54,001 INFO L290 TraceCheckUtils]: 120: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:54,001 INFO L290 TraceCheckUtils]: 121: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:54,001 INFO L290 TraceCheckUtils]: 122: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:54,002 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {14372#true} {14744#(and (= main_~c~0 16) (= main_~y~0 16))} #50#return; {14744#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:34:54,002 INFO L290 TraceCheckUtils]: 124: Hoare triple {14744#(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; {14766#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:54,003 INFO L290 TraceCheckUtils]: 125: Hoare triple {14766#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {14766#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:54,003 INFO L272 TraceCheckUtils]: 126: Hoare triple {14766#(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)); {14372#true} is VALID [2022-04-08 04:34:54,003 INFO L290 TraceCheckUtils]: 127: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:54,003 INFO L290 TraceCheckUtils]: 128: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:54,003 INFO L290 TraceCheckUtils]: 129: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:54,004 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {14372#true} {14766#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #50#return; {14766#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:34:54,004 INFO L290 TraceCheckUtils]: 131: Hoare triple {14766#(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; {14788#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 04:34:54,005 INFO L290 TraceCheckUtils]: 132: Hoare triple {14788#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !false; {14788#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 04:34:54,005 INFO L272 TraceCheckUtils]: 133: Hoare triple {14788#(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)); {14372#true} is VALID [2022-04-08 04:34:54,005 INFO L290 TraceCheckUtils]: 134: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:54,005 INFO L290 TraceCheckUtils]: 135: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:54,005 INFO L290 TraceCheckUtils]: 136: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:54,006 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {14372#true} {14788#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} #50#return; {14788#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 04:34:54,006 INFO L290 TraceCheckUtils]: 138: Hoare triple {14788#(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; {14810#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 04:34:54,007 INFO L290 TraceCheckUtils]: 139: Hoare triple {14810#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !false; {14810#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 04:34:54,007 INFO L272 TraceCheckUtils]: 140: Hoare triple {14810#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14372#true} is VALID [2022-04-08 04:34:54,007 INFO L290 TraceCheckUtils]: 141: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:54,007 INFO L290 TraceCheckUtils]: 142: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:54,007 INFO L290 TraceCheckUtils]: 143: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:54,008 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {14372#true} {14810#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} #50#return; {14810#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 04:34:54,008 INFO L290 TraceCheckUtils]: 145: Hoare triple {14810#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14832#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} is VALID [2022-04-08 04:34:54,009 INFO L290 TraceCheckUtils]: 146: Hoare triple {14832#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} assume !false; {14832#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} is VALID [2022-04-08 04:34:54,009 INFO L272 TraceCheckUtils]: 147: Hoare triple {14832#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 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)); {14372#true} is VALID [2022-04-08 04:34:54,009 INFO L290 TraceCheckUtils]: 148: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:54,009 INFO L290 TraceCheckUtils]: 149: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:54,009 INFO L290 TraceCheckUtils]: 150: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:54,009 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {14372#true} {14832#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} #50#return; {14832#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} is VALID [2022-04-08 04:34:54,010 INFO L290 TraceCheckUtils]: 152: Hoare triple {14832#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 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; {14854#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-08 04:34:54,010 INFO L290 TraceCheckUtils]: 153: Hoare triple {14854#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} assume !false; {14854#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-08 04:34:54,010 INFO L272 TraceCheckUtils]: 154: Hoare triple {14854#(and (<= main_~c~0 21) (< 20 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)); {14372#true} is VALID [2022-04-08 04:34:54,010 INFO L290 TraceCheckUtils]: 155: Hoare triple {14372#true} ~cond := #in~cond; {14372#true} is VALID [2022-04-08 04:34:54,010 INFO L290 TraceCheckUtils]: 156: Hoare triple {14372#true} assume !(0 == ~cond); {14372#true} is VALID [2022-04-08 04:34:54,010 INFO L290 TraceCheckUtils]: 157: Hoare triple {14372#true} assume true; {14372#true} is VALID [2022-04-08 04:34:54,011 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {14372#true} {14854#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} #50#return; {14854#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-08 04:34:54,013 INFO L290 TraceCheckUtils]: 159: Hoare triple {14854#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} assume !(~c~0 < ~k~0); {14876#(and (< 20 main_~k~0) (= main_~y~0 21) (<= main_~k~0 21))} is VALID [2022-04-08 04:34:54,013 INFO L272 TraceCheckUtils]: 160: Hoare triple {14876#(and (< 20 main_~k~0) (= main_~y~0 21) (<= main_~k~0 21))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14880#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:34:54,014 INFO L290 TraceCheckUtils]: 161: Hoare triple {14880#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14884#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:34:54,014 INFO L290 TraceCheckUtils]: 162: Hoare triple {14884#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14373#false} is VALID [2022-04-08 04:34:54,014 INFO L290 TraceCheckUtils]: 163: Hoare triple {14373#false} assume !false; {14373#false} is VALID [2022-04-08 04:34:54,015 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-08 04:34:54,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:34:54,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:34:54,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254359370] [2022-04-08 04:34:54,386 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:34:54,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957715711] [2022-04-08 04:34:54,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957715711] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:34:54,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:34:54,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-04-08 04:34:54,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:34:54,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [743534025] [2022-04-08 04:34:54,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [743534025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:34:54,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:34:54,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 04:34:54,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247876206] [2022-04-08 04:34:54,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:34:54,388 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-08 04:34:54,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:34:54,388 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-08 04:34:54,530 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-08 04:34:54,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 04:34:54,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:34:54,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 04:34:54,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-04-08 04:34:54,532 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-08 04:34:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:59,692 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2022-04-08 04:34:59,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 04:34:59,693 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-08 04:34:59,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:34:59,693 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-08 04:34:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 110 transitions. [2022-04-08 04:34:59,695 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-08 04:34:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 110 transitions. [2022-04-08 04:34:59,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 110 transitions. [2022-04-08 04:34:59,855 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-08 04:34:59,859 INFO L225 Difference]: With dead ends: 93 [2022-04-08 04:34:59,859 INFO L226 Difference]: Without dead ends: 88 [2022-04-08 04:34:59,859 INFO L912 BasicCegarLoop]: 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-08 04:34:59,859 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:34:59,860 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 924 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1686 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 04:34:59,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-08 04:34:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-08 04:34:59,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:34:59,935 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-08 04:34:59,936 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-08 04:34:59,936 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-08 04:34:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:59,938 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2022-04-08 04:34:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-04-08 04:34:59,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:59,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:59,939 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-08 04:34:59,939 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-08 04:34:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:34:59,941 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2022-04-08 04:34:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-04-08 04:34:59,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:34:59,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:34:59,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:34:59,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:34:59,942 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-08 04:34:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-04-08 04:34:59,944 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 164 [2022-04-08 04:34:59,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:34:59,945 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-04-08 04:34:59,945 INFO L479 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-08 04:34:59,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 109 transitions. [2022-04-08 04:35:00,188 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-08 04:35:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-04-08 04:35:00,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-08 04:35:00,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:00,189 INFO L499 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:00,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-08 04:35:00,390 WARN L460 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-08 04:35:00,390 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:00,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:00,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1008454446, now seen corresponding path program 43 times [2022-04-08 04:35:00,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:00,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [584712515] [2022-04-08 04:35:00,459 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:35:00,459 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:35:00,459 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:35:00,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1008454446, now seen corresponding path program 44 times [2022-04-08 04:35:00,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:00,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654527631] [2022-04-08 04:35:00,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:00,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:00,481 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:00,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1742000677] [2022-04-08 04:35:00,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:35:00,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:00,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:00,483 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-08 04:35:00,490 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-08 04:35:01,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:35:01,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:01,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-08 04:35:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:01,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:02,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {15474#true} call ULTIMATE.init(); {15474#true} is VALID [2022-04-08 04:35:02,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {15474#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); {15474#true} is VALID [2022-04-08 04:35:02,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15474#true} {15474#true} #56#return; {15474#true} is VALID [2022-04-08 04:35:02,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {15474#true} call #t~ret5 := main(); {15474#true} is VALID [2022-04-08 04:35:02,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {15474#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; {15494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:02,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {15494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {15494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:02,194 INFO L272 TraceCheckUtils]: 7: Hoare triple {15494#(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)); {15474#true} is VALID [2022-04-08 04:35:02,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,196 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {15474#true} {15494#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {15494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:02,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {15494#(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; {15516#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:02,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {15516#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {15516#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:02,197 INFO L272 TraceCheckUtils]: 14: Hoare triple {15516#(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)); {15474#true} is VALID [2022-04-08 04:35:02,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,197 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15474#true} {15516#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {15516#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:02,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {15516#(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; {15538#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:02,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {15538#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {15538#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:02,198 INFO L272 TraceCheckUtils]: 21: Hoare triple {15538#(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)); {15474#true} is VALID [2022-04-08 04:35:02,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,199 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15474#true} {15538#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #50#return; {15538#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:02,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {15538#(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; {15560#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:35:02,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {15560#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {15560#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:35:02,199 INFO L272 TraceCheckUtils]: 28: Hoare triple {15560#(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)); {15474#true} is VALID [2022-04-08 04:35:02,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,200 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15474#true} {15560#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #50#return; {15560#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:35:02,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {15560#(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; {15582#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:35:02,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {15582#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {15582#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:35:02,201 INFO L272 TraceCheckUtils]: 35: Hoare triple {15582#(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)); {15474#true} is VALID [2022-04-08 04:35:02,201 INFO L290 TraceCheckUtils]: 36: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,201 INFO L290 TraceCheckUtils]: 37: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,201 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15474#true} {15582#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #50#return; {15582#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:35:02,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {15582#(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; {15604#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 04:35:02,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {15604#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {15604#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 04:35:02,202 INFO L272 TraceCheckUtils]: 42: Hoare triple {15604#(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)); {15474#true} is VALID [2022-04-08 04:35:02,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,203 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15474#true} {15604#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #50#return; {15604#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 04:35:02,203 INFO L290 TraceCheckUtils]: 47: Hoare triple {15604#(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; {15626#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:02,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {15626#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {15626#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:02,203 INFO L272 TraceCheckUtils]: 49: Hoare triple {15626#(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)); {15474#true} is VALID [2022-04-08 04:35:02,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,204 INFO L290 TraceCheckUtils]: 51: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,204 INFO L290 TraceCheckUtils]: 52: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,204 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15474#true} {15626#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #50#return; {15626#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:02,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {15626#(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; {15648#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:35:02,205 INFO L290 TraceCheckUtils]: 55: Hoare triple {15648#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {15648#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:35:02,205 INFO L272 TraceCheckUtils]: 56: Hoare triple {15648#(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)); {15474#true} is VALID [2022-04-08 04:35:02,205 INFO L290 TraceCheckUtils]: 57: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,205 INFO L290 TraceCheckUtils]: 58: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,205 INFO L290 TraceCheckUtils]: 59: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,205 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15474#true} {15648#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {15648#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:35:02,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {15648#(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; {15670#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 04:35:02,206 INFO L290 TraceCheckUtils]: 62: Hoare triple {15670#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {15670#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 04:35:02,206 INFO L272 TraceCheckUtils]: 63: Hoare triple {15670#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 04:35:02,206 INFO L290 TraceCheckUtils]: 64: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,206 INFO L290 TraceCheckUtils]: 65: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,206 INFO L290 TraceCheckUtils]: 66: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,207 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {15474#true} {15670#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #50#return; {15670#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 04:35:02,207 INFO L290 TraceCheckUtils]: 68: Hoare triple {15670#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15692#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-08 04:35:02,207 INFO L290 TraceCheckUtils]: 69: Hoare triple {15692#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !false; {15692#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-08 04:35:02,208 INFO L272 TraceCheckUtils]: 70: Hoare triple {15692#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 04:35:02,208 INFO L290 TraceCheckUtils]: 71: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,208 INFO L290 TraceCheckUtils]: 72: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,208 INFO L290 TraceCheckUtils]: 73: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,208 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15474#true} {15692#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} #50#return; {15692#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-08 04:35:02,208 INFO L290 TraceCheckUtils]: 75: Hoare triple {15692#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15714#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:35:02,209 INFO L290 TraceCheckUtils]: 76: Hoare triple {15714#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {15714#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:35:02,209 INFO L272 TraceCheckUtils]: 77: Hoare triple {15714#(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)); {15474#true} is VALID [2022-04-08 04:35:02,209 INFO L290 TraceCheckUtils]: 78: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,209 INFO L290 TraceCheckUtils]: 79: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,209 INFO L290 TraceCheckUtils]: 80: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,209 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {15474#true} {15714#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {15714#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:35:02,210 INFO L290 TraceCheckUtils]: 82: Hoare triple {15714#(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; {15736#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:35:02,210 INFO L290 TraceCheckUtils]: 83: Hoare triple {15736#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {15736#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:35:02,210 INFO L272 TraceCheckUtils]: 84: Hoare triple {15736#(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)); {15474#true} is VALID [2022-04-08 04:35:02,210 INFO L290 TraceCheckUtils]: 85: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,210 INFO L290 TraceCheckUtils]: 86: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,210 INFO L290 TraceCheckUtils]: 87: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,211 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {15474#true} {15736#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {15736#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:35:02,211 INFO L290 TraceCheckUtils]: 89: Hoare triple {15736#(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; {15758#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:35:02,211 INFO L290 TraceCheckUtils]: 90: Hoare triple {15758#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {15758#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:35:02,212 INFO L272 TraceCheckUtils]: 91: Hoare triple {15758#(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)); {15474#true} is VALID [2022-04-08 04:35:02,212 INFO L290 TraceCheckUtils]: 92: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,212 INFO L290 TraceCheckUtils]: 93: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,212 INFO L290 TraceCheckUtils]: 94: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,212 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {15474#true} {15758#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #50#return; {15758#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:35:02,212 INFO L290 TraceCheckUtils]: 96: Hoare triple {15758#(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; {15780#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:35:02,213 INFO L290 TraceCheckUtils]: 97: Hoare triple {15780#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {15780#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:35:02,213 INFO L272 TraceCheckUtils]: 98: Hoare triple {15780#(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)); {15474#true} is VALID [2022-04-08 04:35:02,213 INFO L290 TraceCheckUtils]: 99: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,213 INFO L290 TraceCheckUtils]: 100: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,213 INFO L290 TraceCheckUtils]: 101: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,213 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {15474#true} {15780#(and (= main_~c~0 13) (= main_~y~0 13))} #50#return; {15780#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:35:02,214 INFO L290 TraceCheckUtils]: 103: Hoare triple {15780#(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; {15802#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 04:35:02,214 INFO L290 TraceCheckUtils]: 104: Hoare triple {15802#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {15802#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 04:35:02,214 INFO L272 TraceCheckUtils]: 105: Hoare triple {15802#(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)); {15474#true} is VALID [2022-04-08 04:35:02,214 INFO L290 TraceCheckUtils]: 106: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,214 INFO L290 TraceCheckUtils]: 107: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,214 INFO L290 TraceCheckUtils]: 108: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,215 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {15474#true} {15802#(and (= main_~y~0 14) (= main_~c~0 14))} #50#return; {15802#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 04:35:02,215 INFO L290 TraceCheckUtils]: 110: Hoare triple {15802#(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; {15824#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:02,215 INFO L290 TraceCheckUtils]: 111: Hoare triple {15824#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {15824#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:02,215 INFO L272 TraceCheckUtils]: 112: Hoare triple {15824#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 04:35:02,216 INFO L290 TraceCheckUtils]: 113: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,216 INFO L290 TraceCheckUtils]: 114: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,216 INFO L290 TraceCheckUtils]: 115: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,216 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15474#true} {15824#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #50#return; {15824#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:02,216 INFO L290 TraceCheckUtils]: 117: Hoare triple {15824#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15846#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:35:02,217 INFO L290 TraceCheckUtils]: 118: Hoare triple {15846#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {15846#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:35:02,217 INFO L272 TraceCheckUtils]: 119: Hoare triple {15846#(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)); {15474#true} is VALID [2022-04-08 04:35:02,217 INFO L290 TraceCheckUtils]: 120: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,217 INFO L290 TraceCheckUtils]: 121: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,217 INFO L290 TraceCheckUtils]: 122: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,217 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {15474#true} {15846#(and (= main_~c~0 16) (= main_~y~0 16))} #50#return; {15846#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:35:02,218 INFO L290 TraceCheckUtils]: 124: Hoare triple {15846#(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; {15868#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 04:35:02,218 INFO L290 TraceCheckUtils]: 125: Hoare triple {15868#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {15868#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 04:35:02,218 INFO L272 TraceCheckUtils]: 126: Hoare triple {15868#(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)); {15474#true} is VALID [2022-04-08 04:35:02,218 INFO L290 TraceCheckUtils]: 127: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,218 INFO L290 TraceCheckUtils]: 128: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,218 INFO L290 TraceCheckUtils]: 129: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,219 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {15474#true} {15868#(and (= main_~c~0 17) (= main_~y~0 17))} #50#return; {15868#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 04:35:02,219 INFO L290 TraceCheckUtils]: 131: Hoare triple {15868#(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; {15890#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:35:02,219 INFO L290 TraceCheckUtils]: 132: Hoare triple {15890#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {15890#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:35:02,219 INFO L272 TraceCheckUtils]: 133: Hoare triple {15890#(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)); {15474#true} is VALID [2022-04-08 04:35:02,220 INFO L290 TraceCheckUtils]: 134: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,220 INFO L290 TraceCheckUtils]: 135: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,220 INFO L290 TraceCheckUtils]: 136: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,220 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {15474#true} {15890#(and (= main_~c~0 18) (= main_~y~0 18))} #50#return; {15890#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:35:02,220 INFO L290 TraceCheckUtils]: 138: Hoare triple {15890#(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; {15912#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 04:35:02,221 INFO L290 TraceCheckUtils]: 139: Hoare triple {15912#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {15912#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 04:35:02,221 INFO L272 TraceCheckUtils]: 140: Hoare triple {15912#(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)); {15474#true} is VALID [2022-04-08 04:35:02,221 INFO L290 TraceCheckUtils]: 141: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,221 INFO L290 TraceCheckUtils]: 142: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,221 INFO L290 TraceCheckUtils]: 143: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,221 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {15474#true} {15912#(and (= 19 main_~y~0) (= 19 main_~c~0))} #50#return; {15912#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 04:35:02,222 INFO L290 TraceCheckUtils]: 145: Hoare triple {15912#(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; {15934#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:35:02,222 INFO L290 TraceCheckUtils]: 146: Hoare triple {15934#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {15934#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:35:02,222 INFO L272 TraceCheckUtils]: 147: Hoare triple {15934#(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)); {15474#true} is VALID [2022-04-08 04:35:02,222 INFO L290 TraceCheckUtils]: 148: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,222 INFO L290 TraceCheckUtils]: 149: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,222 INFO L290 TraceCheckUtils]: 150: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,223 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {15474#true} {15934#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #50#return; {15934#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:35:02,223 INFO L290 TraceCheckUtils]: 152: Hoare triple {15934#(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; {15956#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 04:35:02,223 INFO L290 TraceCheckUtils]: 153: Hoare triple {15956#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {15956#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 04:35:02,223 INFO L272 TraceCheckUtils]: 154: Hoare triple {15956#(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)); {15474#true} is VALID [2022-04-08 04:35:02,224 INFO L290 TraceCheckUtils]: 155: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,224 INFO L290 TraceCheckUtils]: 156: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,224 INFO L290 TraceCheckUtils]: 157: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,224 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {15474#true} {15956#(and (= main_~c~0 21) (= main_~y~0 21))} #50#return; {15956#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 04:35:02,224 INFO L290 TraceCheckUtils]: 159: Hoare triple {15956#(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; {15978#(and (<= main_~c~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:02,225 INFO L290 TraceCheckUtils]: 160: Hoare triple {15978#(and (<= main_~c~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} assume !false; {15978#(and (<= main_~c~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:02,225 INFO L272 TraceCheckUtils]: 161: Hoare triple {15978#(and (<= main_~c~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15474#true} is VALID [2022-04-08 04:35:02,225 INFO L290 TraceCheckUtils]: 162: Hoare triple {15474#true} ~cond := #in~cond; {15474#true} is VALID [2022-04-08 04:35:02,225 INFO L290 TraceCheckUtils]: 163: Hoare triple {15474#true} assume !(0 == ~cond); {15474#true} is VALID [2022-04-08 04:35:02,225 INFO L290 TraceCheckUtils]: 164: Hoare triple {15474#true} assume true; {15474#true} is VALID [2022-04-08 04:35:02,225 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {15474#true} {15978#(and (<= main_~c~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} #50#return; {15978#(and (<= main_~c~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:02,227 INFO L290 TraceCheckUtils]: 166: Hoare triple {15978#(and (<= main_~c~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} assume !(~c~0 < ~k~0); {16000#(and (<= main_~k~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:02,228 INFO L272 TraceCheckUtils]: 167: Hoare triple {16000#(and (<= main_~k~0 22) (< 21 main_~k~0) (= 21 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16004#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:02,228 INFO L290 TraceCheckUtils]: 168: Hoare triple {16004#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16008#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:02,228 INFO L290 TraceCheckUtils]: 169: Hoare triple {16008#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15475#false} is VALID [2022-04-08 04:35:02,228 INFO L290 TraceCheckUtils]: 170: Hoare triple {15475#false} assume !false; {15475#false} is VALID [2022-04-08 04:35:02,229 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-08 04:35:02,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:35:02,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:02,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654527631] [2022-04-08 04:35:02,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:35:02,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742000677] [2022-04-08 04:35:02,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742000677] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:35:02,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:35:02,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-04-08 04:35:02,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:02,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [584712515] [2022-04-08 04:35:02,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [584712515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:02,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:02,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 04:35:02,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901677105] [2022-04-08 04:35:02,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:02,741 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-08 04:35:02,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:02,742 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-08 04:35:02,916 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-08 04:35:02,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 04:35:02,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:02,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 04:35:02,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-04-08 04:35:02,917 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-08 04:35:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:08,025 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-08 04:35:08,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 04:35:08,026 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-08 04:35:08,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:08,026 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-08 04:35:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 114 transitions. [2022-04-08 04:35:08,028 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-08 04:35:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 114 transitions. [2022-04-08 04:35:08,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 114 transitions. [2022-04-08 04:35:08,233 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-08 04:35:08,235 INFO L225 Difference]: With dead ends: 96 [2022-04-08 04:35:08,235 INFO L226 Difference]: Without dead ends: 91 [2022-04-08 04:35:08,235 INFO L912 BasicCegarLoop]: 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-08 04:35:08,236 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 1831 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 04:35:08,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 987 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1831 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 04:35:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-08 04:35:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-08 04:35:08,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:08,384 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-08 04:35:08,384 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-08 04:35:08,384 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-08 04:35:08,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:08,387 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-04-08 04:35:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-04-08 04:35:08,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:08,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:08,388 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-08 04:35:08,388 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-08 04:35:08,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:08,390 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-04-08 04:35:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-04-08 04:35:08,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:08,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:08,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:08,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:08,391 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-08 04:35:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2022-04-08 04:35:08,393 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 171 [2022-04-08 04:35:08,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:08,394 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2022-04-08 04:35:08,394 INFO L479 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-08 04:35:08,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 113 transitions. [2022-04-08 04:35:08,759 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-08 04:35:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-04-08 04:35:08,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-08 04:35:08,761 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:08,761 INFO L499 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:08,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-08 04:35:08,961 WARN L460 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-08 04:35:08,961 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:08,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1981050373, now seen corresponding path program 45 times [2022-04-08 04:35:08,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:08,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1582232714] [2022-04-08 04:35:09,032 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:35:09,032 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:35:09,032 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:35:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1981050373, now seen corresponding path program 46 times [2022-04-08 04:35:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:09,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030786677] [2022-04-08 04:35:09,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:09,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:09,055 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:09,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843012608] [2022-04-08 04:35:09,056 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:35:09,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:09,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:09,057 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-08 04:35:09,058 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-08 04:35:10,575 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:35:10,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:10,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-08 04:35:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:10,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:11,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {16616#true} call ULTIMATE.init(); {16616#true} is VALID [2022-04-08 04:35:11,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {16616#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); {16616#true} is VALID [2022-04-08 04:35:11,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16616#true} {16616#true} #56#return; {16616#true} is VALID [2022-04-08 04:35:11,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {16616#true} call #t~ret5 := main(); {16616#true} is VALID [2022-04-08 04:35:11,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {16616#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; {16636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:11,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {16636#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {16636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:11,631 INFO L272 TraceCheckUtils]: 7: Hoare triple {16636#(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)); {16616#true} is VALID [2022-04-08 04:35:11,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,631 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {16616#true} {16636#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {16636#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:11,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {16636#(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; {16658#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:11,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {16658#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {16658#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:11,632 INFO L272 TraceCheckUtils]: 14: Hoare triple {16658#(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)); {16616#true} is VALID [2022-04-08 04:35:11,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,632 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16616#true} {16658#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {16658#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:11,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {16658#(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; {16680#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:11,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {16680#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {16680#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:11,633 INFO L272 TraceCheckUtils]: 21: Hoare triple {16680#(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)); {16616#true} is VALID [2022-04-08 04:35:11,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,634 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16616#true} {16680#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #50#return; {16680#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:11,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {16680#(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; {16702#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 04:35:11,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {16702#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {16702#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 04:35:11,635 INFO L272 TraceCheckUtils]: 28: Hoare triple {16702#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 04:35:11,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,635 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16616#true} {16702#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #50#return; {16702#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 04:35:11,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {16702#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16724#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 04:35:11,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {16724#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} assume !false; {16724#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 04:35:11,636 INFO L272 TraceCheckUtils]: 35: Hoare triple {16724#(and (= (+ main_~y~0 (- 3)) 1) (= (+ 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)); {16616#true} is VALID [2022-04-08 04:35:11,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,636 INFO L290 TraceCheckUtils]: 38: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,637 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16616#true} {16724#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} #50#return; {16724#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 04:35:11,637 INFO L290 TraceCheckUtils]: 40: Hoare triple {16724#(and (= (+ main_~y~0 (- 3)) 1) (= (+ 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; {16746#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:35:11,637 INFO L290 TraceCheckUtils]: 41: Hoare triple {16746#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {16746#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:35:11,637 INFO L272 TraceCheckUtils]: 42: Hoare triple {16746#(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)); {16616#true} is VALID [2022-04-08 04:35:11,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,638 INFO L290 TraceCheckUtils]: 45: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,638 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16616#true} {16746#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {16746#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:35:11,638 INFO L290 TraceCheckUtils]: 47: Hoare triple {16746#(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; {16768#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:11,639 INFO L290 TraceCheckUtils]: 48: Hoare triple {16768#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {16768#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:11,639 INFO L272 TraceCheckUtils]: 49: Hoare triple {16768#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 04:35:11,639 INFO L290 TraceCheckUtils]: 50: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,639 INFO L290 TraceCheckUtils]: 51: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,639 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16616#true} {16768#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #50#return; {16768#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:11,640 INFO L290 TraceCheckUtils]: 54: Hoare triple {16768#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16790#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-08 04:35:11,640 INFO L290 TraceCheckUtils]: 55: Hoare triple {16790#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} assume !false; {16790#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-08 04:35:11,640 INFO L272 TraceCheckUtils]: 56: Hoare triple {16790#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 04:35:11,640 INFO L290 TraceCheckUtils]: 57: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,640 INFO L290 TraceCheckUtils]: 58: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,640 INFO L290 TraceCheckUtils]: 59: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,641 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16616#true} {16790#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} #50#return; {16790#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-08 04:35:11,641 INFO L290 TraceCheckUtils]: 61: Hoare triple {16790#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16812#(and (= (+ main_~y~0 (- 3)) 5) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:35:11,642 INFO L290 TraceCheckUtils]: 62: Hoare triple {16812#(and (= (+ main_~y~0 (- 3)) 5) (= 5 (+ main_~c~0 (- 3))))} assume !false; {16812#(and (= (+ main_~y~0 (- 3)) 5) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:35:11,642 INFO L272 TraceCheckUtils]: 63: Hoare triple {16812#(and (= (+ main_~y~0 (- 3)) 5) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 04:35:11,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,642 INFO L290 TraceCheckUtils]: 65: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,642 INFO L290 TraceCheckUtils]: 66: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,642 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {16616#true} {16812#(and (= (+ main_~y~0 (- 3)) 5) (= 5 (+ main_~c~0 (- 3))))} #50#return; {16812#(and (= (+ main_~y~0 (- 3)) 5) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:35:11,643 INFO L290 TraceCheckUtils]: 68: Hoare triple {16812#(and (= (+ main_~y~0 (- 3)) 5) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16834#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 04:35:11,643 INFO L290 TraceCheckUtils]: 69: Hoare triple {16834#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {16834#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 04:35:11,643 INFO L272 TraceCheckUtils]: 70: Hoare triple {16834#(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)); {16616#true} is VALID [2022-04-08 04:35:11,643 INFO L290 TraceCheckUtils]: 71: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,643 INFO L290 TraceCheckUtils]: 72: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,643 INFO L290 TraceCheckUtils]: 73: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,644 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16616#true} {16834#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {16834#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 04:35:11,644 INFO L290 TraceCheckUtils]: 75: Hoare triple {16834#(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; {16856#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:35:11,644 INFO L290 TraceCheckUtils]: 76: Hoare triple {16856#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {16856#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:35:11,644 INFO L272 TraceCheckUtils]: 77: Hoare triple {16856#(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)); {16616#true} is VALID [2022-04-08 04:35:11,644 INFO L290 TraceCheckUtils]: 78: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,644 INFO L290 TraceCheckUtils]: 79: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,644 INFO L290 TraceCheckUtils]: 80: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,645 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16616#true} {16856#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #50#return; {16856#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:35:11,645 INFO L290 TraceCheckUtils]: 82: Hoare triple {16856#(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; {16878#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 04:35:11,646 INFO L290 TraceCheckUtils]: 83: Hoare triple {16878#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {16878#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 04:35:11,646 INFO L272 TraceCheckUtils]: 84: Hoare triple {16878#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 04:35:11,646 INFO L290 TraceCheckUtils]: 85: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,646 INFO L290 TraceCheckUtils]: 86: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,646 INFO L290 TraceCheckUtils]: 87: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,646 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {16616#true} {16878#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #50#return; {16878#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 04:35:11,647 INFO L290 TraceCheckUtils]: 89: Hoare triple {16878#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16900#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:35:11,647 INFO L290 TraceCheckUtils]: 90: Hoare triple {16900#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !false; {16900#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:35:11,647 INFO L272 TraceCheckUtils]: 91: Hoare triple {16900#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 04:35:11,647 INFO L290 TraceCheckUtils]: 92: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,647 INFO L290 TraceCheckUtils]: 93: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,647 INFO L290 TraceCheckUtils]: 94: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,648 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {16616#true} {16900#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} #50#return; {16900#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:35:11,648 INFO L290 TraceCheckUtils]: 96: Hoare triple {16900#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16922#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:35:11,648 INFO L290 TraceCheckUtils]: 97: Hoare triple {16922#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {16922#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:35:11,648 INFO L272 TraceCheckUtils]: 98: Hoare triple {16922#(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)); {16616#true} is VALID [2022-04-08 04:35:11,649 INFO L290 TraceCheckUtils]: 99: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,649 INFO L290 TraceCheckUtils]: 100: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,649 INFO L290 TraceCheckUtils]: 101: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,649 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {16616#true} {16922#(and (= main_~c~0 13) (= main_~y~0 13))} #50#return; {16922#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:35:11,649 INFO L290 TraceCheckUtils]: 103: Hoare triple {16922#(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; {16944#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:35:11,650 INFO L290 TraceCheckUtils]: 104: Hoare triple {16944#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !false; {16944#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:35:11,650 INFO L272 TraceCheckUtils]: 105: Hoare triple {16944#(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)); {16616#true} is VALID [2022-04-08 04:35:11,650 INFO L290 TraceCheckUtils]: 106: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,650 INFO L290 TraceCheckUtils]: 107: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,650 INFO L290 TraceCheckUtils]: 108: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,650 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {16616#true} {16944#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} #50#return; {16944#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:35:11,651 INFO L290 TraceCheckUtils]: 110: Hoare triple {16944#(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; {16966#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-08 04:35:11,651 INFO L290 TraceCheckUtils]: 111: Hoare triple {16966#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} assume !false; {16966#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-08 04:35:11,651 INFO L272 TraceCheckUtils]: 112: Hoare triple {16966#(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)); {16616#true} is VALID [2022-04-08 04:35:11,651 INFO L290 TraceCheckUtils]: 113: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,651 INFO L290 TraceCheckUtils]: 114: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,651 INFO L290 TraceCheckUtils]: 115: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,652 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {16616#true} {16966#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} #50#return; {16966#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-08 04:35:11,652 INFO L290 TraceCheckUtils]: 117: Hoare triple {16966#(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; {16988#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-08 04:35:11,653 INFO L290 TraceCheckUtils]: 118: Hoare triple {16988#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} assume !false; {16988#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-08 04:35:11,653 INFO L272 TraceCheckUtils]: 119: Hoare triple {16988#(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)); {16616#true} is VALID [2022-04-08 04:35:11,653 INFO L290 TraceCheckUtils]: 120: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,653 INFO L290 TraceCheckUtils]: 121: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,653 INFO L290 TraceCheckUtils]: 122: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,653 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {16616#true} {16988#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} #50#return; {16988#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-08 04:35:11,654 INFO L290 TraceCheckUtils]: 124: Hoare triple {16988#(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; {17010#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13))} is VALID [2022-04-08 04:35:11,654 INFO L290 TraceCheckUtils]: 125: Hoare triple {17010#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13))} assume !false; {17010#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13))} is VALID [2022-04-08 04:35:11,654 INFO L272 TraceCheckUtils]: 126: Hoare triple {17010#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 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)); {16616#true} is VALID [2022-04-08 04:35:11,654 INFO L290 TraceCheckUtils]: 127: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,654 INFO L290 TraceCheckUtils]: 128: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,654 INFO L290 TraceCheckUtils]: 129: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,655 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {16616#true} {17010#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13))} #50#return; {17010#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 13))} is VALID [2022-04-08 04:35:11,655 INFO L290 TraceCheckUtils]: 131: Hoare triple {17010#(and (= main_~c~0 17) (= (+ main_~y~0 (- 4)) 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; {17032#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:35:11,655 INFO L290 TraceCheckUtils]: 132: Hoare triple {17032#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {17032#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:35:11,655 INFO L272 TraceCheckUtils]: 133: Hoare triple {17032#(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)); {16616#true} is VALID [2022-04-08 04:35:11,656 INFO L290 TraceCheckUtils]: 134: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,656 INFO L290 TraceCheckUtils]: 135: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,656 INFO L290 TraceCheckUtils]: 136: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,656 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {16616#true} {17032#(and (= main_~c~0 18) (= main_~y~0 18))} #50#return; {17032#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:35:11,656 INFO L290 TraceCheckUtils]: 138: Hoare triple {17032#(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; {17054#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:35:11,657 INFO L290 TraceCheckUtils]: 139: Hoare triple {17054#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} assume !false; {17054#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:35:11,657 INFO L272 TraceCheckUtils]: 140: Hoare triple {17054#(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)); {16616#true} is VALID [2022-04-08 04:35:11,657 INFO L290 TraceCheckUtils]: 141: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,659 INFO L290 TraceCheckUtils]: 142: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,659 INFO L290 TraceCheckUtils]: 143: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,663 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {16616#true} {17054#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} #50#return; {17054#(and (= 18 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:35:11,664 INFO L290 TraceCheckUtils]: 145: Hoare triple {17054#(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; {17076#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 04:35:11,664 INFO L290 TraceCheckUtils]: 146: Hoare triple {17076#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {17076#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 04:35:11,664 INFO L272 TraceCheckUtils]: 147: Hoare triple {17076#(and (= main_~c~0 20) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 04:35:11,665 INFO L290 TraceCheckUtils]: 148: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,665 INFO L290 TraceCheckUtils]: 149: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,665 INFO L290 TraceCheckUtils]: 150: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,665 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {16616#true} {17076#(and (= main_~c~0 20) (= main_~y~0 20))} #50#return; {17076#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 04:35:11,666 INFO L290 TraceCheckUtils]: 152: Hoare triple {17076#(and (= main_~c~0 20) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17098#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:11,666 INFO L290 TraceCheckUtils]: 153: Hoare triple {17098#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !false; {17098#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:11,666 INFO L272 TraceCheckUtils]: 154: Hoare triple {17098#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16616#true} is VALID [2022-04-08 04:35:11,666 INFO L290 TraceCheckUtils]: 155: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,666 INFO L290 TraceCheckUtils]: 156: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,666 INFO L290 TraceCheckUtils]: 157: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,667 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {16616#true} {17098#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} #50#return; {17098#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:11,667 INFO L290 TraceCheckUtils]: 159: Hoare triple {17098#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17120#(and (= (+ (- 1) main_~c~0) 21) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 04:35:11,667 INFO L290 TraceCheckUtils]: 160: Hoare triple {17120#(and (= (+ (- 1) main_~c~0) 21) (= (+ (- 2) main_~y~0) 20))} assume !false; {17120#(and (= (+ (- 1) main_~c~0) 21) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 04:35:11,668 INFO L272 TraceCheckUtils]: 161: Hoare triple {17120#(and (= (+ (- 1) main_~c~0) 21) (= (+ (- 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)); {16616#true} is VALID [2022-04-08 04:35:11,668 INFO L290 TraceCheckUtils]: 162: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,668 INFO L290 TraceCheckUtils]: 163: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,668 INFO L290 TraceCheckUtils]: 164: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,668 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {16616#true} {17120#(and (= (+ (- 1) main_~c~0) 21) (= (+ (- 2) main_~y~0) 20))} #50#return; {17120#(and (= (+ (- 1) main_~c~0) 21) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 04:35:11,669 INFO L290 TraceCheckUtils]: 166: Hoare triple {17120#(and (= (+ (- 1) main_~c~0) 21) (= (+ (- 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; {17142#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-08 04:35:11,669 INFO L290 TraceCheckUtils]: 167: Hoare triple {17142#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} assume !false; {17142#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-08 04:35:11,669 INFO L272 TraceCheckUtils]: 168: Hoare triple {17142#(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)); {16616#true} is VALID [2022-04-08 04:35:11,669 INFO L290 TraceCheckUtils]: 169: Hoare triple {16616#true} ~cond := #in~cond; {16616#true} is VALID [2022-04-08 04:35:11,669 INFO L290 TraceCheckUtils]: 170: Hoare triple {16616#true} assume !(0 == ~cond); {16616#true} is VALID [2022-04-08 04:35:11,669 INFO L290 TraceCheckUtils]: 171: Hoare triple {16616#true} assume true; {16616#true} is VALID [2022-04-08 04:35:11,670 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {16616#true} {17142#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} #50#return; {17142#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} is VALID [2022-04-08 04:35:11,671 INFO L290 TraceCheckUtils]: 173: Hoare triple {17142#(and (< 22 main_~k~0) (<= main_~c~0 23) (= 23 main_~y~0))} assume !(~c~0 < ~k~0); {17164#(and (< 22 main_~k~0) (<= main_~k~0 23) (= 23 main_~y~0))} is VALID [2022-04-08 04:35:11,672 INFO L272 TraceCheckUtils]: 174: Hoare triple {17164#(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)); {17168#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:11,672 INFO L290 TraceCheckUtils]: 175: Hoare triple {17168#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17172#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:11,672 INFO L290 TraceCheckUtils]: 176: Hoare triple {17172#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16617#false} is VALID [2022-04-08 04:35:11,673 INFO L290 TraceCheckUtils]: 177: Hoare triple {16617#false} assume !false; {16617#false} is VALID [2022-04-08 04:35:11,673 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-08 04:35:11,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:35:12,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:12,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030786677] [2022-04-08 04:35:12,003 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:35:12,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843012608] [2022-04-08 04:35:12,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843012608] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:35:12,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:35:12,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2022-04-08 04:35:12,003 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:12,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1582232714] [2022-04-08 04:35:12,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1582232714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:12,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:12,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 04:35:12,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779279334] [2022-04-08 04:35:12,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:12,004 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-08 04:35:12,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:12,005 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-08 04:35:12,171 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-08 04:35:12,171 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-08 04:35:12,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:12,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-08 04:35:12,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-04-08 04:35:12,173 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-08 04:35:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:18,313 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2022-04-08 04:35:18,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 04:35:18,314 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-08 04:35:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:18,314 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-08 04:35:18,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 118 transitions. [2022-04-08 04:35:18,317 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-08 04:35:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 118 transitions. [2022-04-08 04:35:18,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 118 transitions. [2022-04-08 04:35:18,484 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-08 04:35:18,485 INFO L225 Difference]: With dead ends: 99 [2022-04-08 04:35:18,485 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 04:35:18,486 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 04:35:18,486 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 2 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.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, 3.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:35:18,487 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1052 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-08 04:35:18,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 04:35:18,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-08 04:35:18,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:18,595 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-08 04:35:18,595 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-08 04:35:18,595 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-08 04:35:18,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:18,597 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-04-08 04:35:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-04-08 04:35:18,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:18,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:18,598 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-08 04:35:18,598 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-08 04:35:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:18,600 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-04-08 04:35:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-04-08 04:35:18,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:18,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:18,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:18,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:18,601 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-08 04:35:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2022-04-08 04:35:18,603 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 178 [2022-04-08 04:35:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:18,603 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2022-04-08 04:35:18,604 INFO L479 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-08 04:35:18,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 117 transitions. [2022-04-08 04:35:18,840 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-08 04:35:18,840 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-04-08 04:35:18,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-04-08 04:35:18,841 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:18,841 INFO L499 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:18,852 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-08 04:35:19,042 WARN L460 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-08 04:35:19,042 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:19,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:19,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1027734158, now seen corresponding path program 47 times [2022-04-08 04:35:19,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:19,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [829003592] [2022-04-08 04:35:19,129 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:35:19,129 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:35:19,129 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:35:19,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1027734158, now seen corresponding path program 48 times [2022-04-08 04:35:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:19,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965970232] [2022-04-08 04:35:19,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:19,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:19,145 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:19,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942269192] [2022-04-08 04:35:19,146 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:35:19,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:19,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:19,147 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-08 04:35:19,176 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-08 04:35:22,484 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-08 04:35:22,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:22,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-08 04:35:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:22,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:23,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {17798#true} call ULTIMATE.init(); {17798#true} is VALID [2022-04-08 04:35:23,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {17798#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); {17798#true} is VALID [2022-04-08 04:35:23,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17798#true} {17798#true} #56#return; {17798#true} is VALID [2022-04-08 04:35:23,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {17798#true} call #t~ret5 := main(); {17798#true} is VALID [2022-04-08 04:35:23,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {17798#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; {17818#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:23,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {17818#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {17818#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:23,558 INFO L272 TraceCheckUtils]: 7: Hoare triple {17818#(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)); {17798#true} is VALID [2022-04-08 04:35:23,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,559 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {17798#true} {17818#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {17818#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:23,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {17818#(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; {17840#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:35:23,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {17840#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {17840#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:35:23,559 INFO L272 TraceCheckUtils]: 14: Hoare triple {17840#(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)); {17798#true} is VALID [2022-04-08 04:35:23,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,560 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17798#true} {17840#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {17840#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:35:23,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {17840#(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; {17862#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:35:23,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {17862#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {17862#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:35:23,561 INFO L272 TraceCheckUtils]: 21: Hoare triple {17862#(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)); {17798#true} is VALID [2022-04-08 04:35:23,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,561 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17798#true} {17862#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {17862#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:35:23,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {17862#(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; {17884#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 04:35:23,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {17884#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {17884#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 04:35:23,562 INFO L272 TraceCheckUtils]: 28: Hoare triple {17884#(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)); {17798#true} is VALID [2022-04-08 04:35:23,562 INFO L290 TraceCheckUtils]: 29: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,563 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17798#true} {17884#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #50#return; {17884#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 04:35:23,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {17884#(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; {17906#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:23,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {17906#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} assume !false; {17906#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:23,563 INFO L272 TraceCheckUtils]: 35: Hoare triple {17906#(and (= (+ main_~c~0 (- 3)) 1) (= 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)); {17798#true} is VALID [2022-04-08 04:35:23,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,564 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17798#true} {17906#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} #50#return; {17906#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:23,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {17906#(and (= (+ main_~c~0 (- 3)) 1) (= 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; {17928#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:35:23,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {17928#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {17928#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:35:23,565 INFO L272 TraceCheckUtils]: 42: Hoare triple {17928#(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)); {17798#true} is VALID [2022-04-08 04:35:23,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,565 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {17798#true} {17928#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {17928#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:35:23,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {17928#(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; {17950#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:23,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {17950#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {17950#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:23,566 INFO L272 TraceCheckUtils]: 49: Hoare triple {17950#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 04:35:23,566 INFO L290 TraceCheckUtils]: 50: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,566 INFO L290 TraceCheckUtils]: 51: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,566 INFO L290 TraceCheckUtils]: 52: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,567 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {17798#true} {17950#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #50#return; {17950#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:23,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {17950#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17972#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 04:35:23,567 INFO L290 TraceCheckUtils]: 55: Hoare triple {17972#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {17972#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 04:35:23,567 INFO L272 TraceCheckUtils]: 56: Hoare triple {17972#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 04:35:23,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,567 INFO L290 TraceCheckUtils]: 58: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,567 INFO L290 TraceCheckUtils]: 59: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,568 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {17798#true} {17972#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #50#return; {17972#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 04:35:23,568 INFO L290 TraceCheckUtils]: 61: Hoare triple {17972#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17994#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:35:23,569 INFO L290 TraceCheckUtils]: 62: Hoare triple {17994#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {17994#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:35:23,569 INFO L272 TraceCheckUtils]: 63: Hoare triple {17994#(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)); {17798#true} is VALID [2022-04-08 04:35:23,569 INFO L290 TraceCheckUtils]: 64: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,569 INFO L290 TraceCheckUtils]: 65: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,569 INFO L290 TraceCheckUtils]: 66: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,569 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {17798#true} {17994#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #50#return; {17994#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:35:23,570 INFO L290 TraceCheckUtils]: 68: Hoare triple {17994#(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; {18016#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:23,570 INFO L290 TraceCheckUtils]: 69: Hoare triple {18016#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {18016#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:23,570 INFO L272 TraceCheckUtils]: 70: Hoare triple {18016#(and (= 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)); {17798#true} is VALID [2022-04-08 04:35:23,570 INFO L290 TraceCheckUtils]: 71: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,570 INFO L290 TraceCheckUtils]: 72: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,570 INFO L290 TraceCheckUtils]: 73: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,571 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17798#true} {18016#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #50#return; {18016#(and (= 8 (+ (- 1) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:23,571 INFO L290 TraceCheckUtils]: 75: Hoare triple {18016#(and (= 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; {18038#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 04:35:23,571 INFO L290 TraceCheckUtils]: 76: Hoare triple {18038#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !false; {18038#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 04:35:23,571 INFO L272 TraceCheckUtils]: 77: Hoare triple {18038#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 04:35:23,571 INFO L290 TraceCheckUtils]: 78: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,571 INFO L290 TraceCheckUtils]: 79: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,571 INFO L290 TraceCheckUtils]: 80: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,572 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17798#true} {18038#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} #50#return; {18038#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 04:35:23,572 INFO L290 TraceCheckUtils]: 82: Hoare triple {18038#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18060#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-08 04:35:23,573 INFO L290 TraceCheckUtils]: 83: Hoare triple {18060#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} assume !false; {18060#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-08 04:35:23,573 INFO L272 TraceCheckUtils]: 84: Hoare triple {18060#(and (= (+ (- 1) main_~c~0) 10) (= (+ 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)); {17798#true} is VALID [2022-04-08 04:35:23,573 INFO L290 TraceCheckUtils]: 85: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,573 INFO L290 TraceCheckUtils]: 86: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,573 INFO L290 TraceCheckUtils]: 87: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,573 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {17798#true} {18060#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} #50#return; {18060#(and (= (+ (- 1) main_~c~0) 10) (= (+ main_~y~0 (- 3)) 8))} is VALID [2022-04-08 04:35:23,574 INFO L290 TraceCheckUtils]: 89: Hoare triple {18060#(and (= (+ (- 1) main_~c~0) 10) (= (+ 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; {18082#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:35:23,574 INFO L290 TraceCheckUtils]: 90: Hoare triple {18082#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {18082#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:35:23,574 INFO L272 TraceCheckUtils]: 91: Hoare triple {18082#(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)); {17798#true} is VALID [2022-04-08 04:35:23,574 INFO L290 TraceCheckUtils]: 92: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,574 INFO L290 TraceCheckUtils]: 93: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,574 INFO L290 TraceCheckUtils]: 94: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,575 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {17798#true} {18082#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {18082#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:35:23,575 INFO L290 TraceCheckUtils]: 96: Hoare triple {18082#(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; {18104#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:35:23,575 INFO L290 TraceCheckUtils]: 97: Hoare triple {18104#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {18104#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:35:23,575 INFO L272 TraceCheckUtils]: 98: Hoare triple {18104#(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)); {17798#true} is VALID [2022-04-08 04:35:23,575 INFO L290 TraceCheckUtils]: 99: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,575 INFO L290 TraceCheckUtils]: 100: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,575 INFO L290 TraceCheckUtils]: 101: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,576 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {17798#true} {18104#(and (= main_~c~0 13) (= main_~y~0 13))} #50#return; {18104#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:35:23,576 INFO L290 TraceCheckUtils]: 103: Hoare triple {18104#(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; {18126#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 04:35:23,577 INFO L290 TraceCheckUtils]: 104: Hoare triple {18126#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {18126#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 04:35:23,577 INFO L272 TraceCheckUtils]: 105: Hoare triple {18126#(and (= main_~y~0 14) (= (+ (- 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)); {17798#true} is VALID [2022-04-08 04:35:23,577 INFO L290 TraceCheckUtils]: 106: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,577 INFO L290 TraceCheckUtils]: 107: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,577 INFO L290 TraceCheckUtils]: 108: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,577 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {17798#true} {18126#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #50#return; {18126#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 04:35:23,578 INFO L290 TraceCheckUtils]: 110: Hoare triple {18126#(and (= main_~y~0 14) (= (+ (- 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; {18148#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:35:23,578 INFO L290 TraceCheckUtils]: 111: Hoare triple {18148#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {18148#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:35:23,578 INFO L272 TraceCheckUtils]: 112: Hoare triple {18148#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 04:35:23,578 INFO L290 TraceCheckUtils]: 113: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,578 INFO L290 TraceCheckUtils]: 114: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,578 INFO L290 TraceCheckUtils]: 115: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,578 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {17798#true} {18148#(and (= main_~c~0 15) (= main_~y~0 15))} #50#return; {18148#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:35:23,579 INFO L290 TraceCheckUtils]: 117: Hoare triple {18148#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18170#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:35:23,579 INFO L290 TraceCheckUtils]: 118: Hoare triple {18170#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {18170#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:35:23,579 INFO L272 TraceCheckUtils]: 119: Hoare triple {18170#(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)); {17798#true} is VALID [2022-04-08 04:35:23,579 INFO L290 TraceCheckUtils]: 120: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,579 INFO L290 TraceCheckUtils]: 121: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,579 INFO L290 TraceCheckUtils]: 122: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,580 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {17798#true} {18170#(and (= main_~c~0 16) (= main_~y~0 16))} #50#return; {18170#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:35:23,580 INFO L290 TraceCheckUtils]: 124: Hoare triple {18170#(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; {18192#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-08 04:35:23,581 INFO L290 TraceCheckUtils]: 125: Hoare triple {18192#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !false; {18192#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-08 04:35:23,581 INFO L272 TraceCheckUtils]: 126: Hoare triple {18192#(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)); {17798#true} is VALID [2022-04-08 04:35:23,581 INFO L290 TraceCheckUtils]: 127: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,581 INFO L290 TraceCheckUtils]: 128: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,581 INFO L290 TraceCheckUtils]: 129: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,581 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {17798#true} {18192#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} #50#return; {18192#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-08 04:35:23,587 INFO L290 TraceCheckUtils]: 131: Hoare triple {18192#(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; {18214#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-08 04:35:23,588 INFO L290 TraceCheckUtils]: 132: Hoare triple {18214#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !false; {18214#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-08 04:35:23,588 INFO L272 TraceCheckUtils]: 133: Hoare triple {18214#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17798#true} is VALID [2022-04-08 04:35:23,588 INFO L290 TraceCheckUtils]: 134: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,588 INFO L290 TraceCheckUtils]: 135: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,588 INFO L290 TraceCheckUtils]: 136: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,589 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {17798#true} {18214#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} #50#return; {18214#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} is VALID [2022-04-08 04:35:23,589 INFO L290 TraceCheckUtils]: 138: Hoare triple {18214#(and (= 16 (+ (- 2) main_~c~0)) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18236#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 04:35:23,590 INFO L290 TraceCheckUtils]: 139: Hoare triple {18236#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !false; {18236#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 04:35:23,590 INFO L272 TraceCheckUtils]: 140: Hoare triple {18236#(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)); {17798#true} is VALID [2022-04-08 04:35:23,590 INFO L290 TraceCheckUtils]: 141: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,590 INFO L290 TraceCheckUtils]: 142: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,590 INFO L290 TraceCheckUtils]: 143: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,591 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {17798#true} {18236#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} #50#return; {18236#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 04:35:23,591 INFO L290 TraceCheckUtils]: 145: Hoare triple {18236#(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; {18258#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-08 04:35:23,592 INFO L290 TraceCheckUtils]: 146: Hoare triple {18258#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !false; {18258#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-08 04:35:23,592 INFO L272 TraceCheckUtils]: 147: Hoare triple {18258#(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)); {17798#true} is VALID [2022-04-08 04:35:23,592 INFO L290 TraceCheckUtils]: 148: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,592 INFO L290 TraceCheckUtils]: 149: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,592 INFO L290 TraceCheckUtils]: 150: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,593 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {17798#true} {18258#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} #50#return; {18258#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-08 04:35:23,593 INFO L290 TraceCheckUtils]: 152: Hoare triple {18258#(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; {18280#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:23,594 INFO L290 TraceCheckUtils]: 153: Hoare triple {18280#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} assume !false; {18280#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:23,594 INFO L272 TraceCheckUtils]: 154: Hoare triple {18280#(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)); {17798#true} is VALID [2022-04-08 04:35:23,594 INFO L290 TraceCheckUtils]: 155: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,594 INFO L290 TraceCheckUtils]: 156: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,594 INFO L290 TraceCheckUtils]: 157: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,595 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {17798#true} {18280#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} #50#return; {18280#(and (= 19 (+ (- 2) main_~c~0)) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:23,595 INFO L290 TraceCheckUtils]: 159: Hoare triple {18280#(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; {18302#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 04:35:23,596 INFO L290 TraceCheckUtils]: 160: Hoare triple {18302#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {18302#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 04:35:23,596 INFO L272 TraceCheckUtils]: 161: Hoare triple {18302#(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)); {17798#true} is VALID [2022-04-08 04:35:23,596 INFO L290 TraceCheckUtils]: 162: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,596 INFO L290 TraceCheckUtils]: 163: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,596 INFO L290 TraceCheckUtils]: 164: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,597 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {17798#true} {18302#(and (= main_~y~0 22) (= main_~c~0 22))} #50#return; {18302#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 04:35:23,597 INFO L290 TraceCheckUtils]: 166: Hoare triple {18302#(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; {18324#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 04:35:23,598 INFO L290 TraceCheckUtils]: 167: Hoare triple {18324#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !false; {18324#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 04:35:23,598 INFO L272 TraceCheckUtils]: 168: Hoare triple {18324#(and (= (+ (- 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)); {17798#true} is VALID [2022-04-08 04:35:23,598 INFO L290 TraceCheckUtils]: 169: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,598 INFO L290 TraceCheckUtils]: 170: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,598 INFO L290 TraceCheckUtils]: 171: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,599 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {17798#true} {18324#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} #50#return; {18324#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 04:35:23,599 INFO L290 TraceCheckUtils]: 173: Hoare triple {18324#(and (= (+ (- 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; {18346#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-08 04:35:23,600 INFO L290 TraceCheckUtils]: 174: Hoare triple {18346#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !false; {18346#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-08 04:35:23,600 INFO L272 TraceCheckUtils]: 175: Hoare triple {18346#(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)); {17798#true} is VALID [2022-04-08 04:35:23,600 INFO L290 TraceCheckUtils]: 176: Hoare triple {17798#true} ~cond := #in~cond; {17798#true} is VALID [2022-04-08 04:35:23,600 INFO L290 TraceCheckUtils]: 177: Hoare triple {17798#true} assume !(0 == ~cond); {17798#true} is VALID [2022-04-08 04:35:23,600 INFO L290 TraceCheckUtils]: 178: Hoare triple {17798#true} assume true; {17798#true} is VALID [2022-04-08 04:35:23,600 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {17798#true} {18346#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} #50#return; {18346#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-08 04:35:23,602 INFO L290 TraceCheckUtils]: 180: Hoare triple {18346#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !(~c~0 < ~k~0); {18368#(and (<= main_~k~0 24) (< 23 main_~k~0) (= main_~y~0 24))} is VALID [2022-04-08 04:35:23,602 INFO L272 TraceCheckUtils]: 181: Hoare triple {18368#(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)); {18372#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:23,603 INFO L290 TraceCheckUtils]: 182: Hoare triple {18372#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18376#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:23,603 INFO L290 TraceCheckUtils]: 183: Hoare triple {18376#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17799#false} is VALID [2022-04-08 04:35:23,603 INFO L290 TraceCheckUtils]: 184: Hoare triple {17799#false} assume !false; {17799#false} is VALID [2022-04-08 04:35:23,605 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-08 04:35:23,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:35:23,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:23,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965970232] [2022-04-08 04:35:23,959 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:35:23,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942269192] [2022-04-08 04:35:23,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942269192] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:35:23,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:35:23,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2022-04-08 04:35:23,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:23,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [829003592] [2022-04-08 04:35:23,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [829003592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:23,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:23,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-08 04:35:23,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595934637] [2022-04-08 04:35:23,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:23,961 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-08 04:35:23,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:23,961 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-08 04:35:24,216 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-08 04:35:24,217 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-08 04:35:24,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:24,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-08 04:35:24,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 04:35:24,218 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-08 04:35:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:30,671 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-04-08 04:35:30,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 04:35:30,671 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-08 04:35:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:30,672 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-08 04:35:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 122 transitions. [2022-04-08 04:35:30,674 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-08 04:35:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 122 transitions. [2022-04-08 04:35:30,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 122 transitions. [2022-04-08 04:35:30,882 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-08 04:35:30,883 INFO L225 Difference]: With dead ends: 102 [2022-04-08 04:35:30,883 INFO L226 Difference]: Without dead ends: 97 [2022-04-08 04:35:30,884 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 04:35:30,885 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 2139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 04:35:30,885 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1119 Invalid, 2139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2139 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-08 04:35:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-08 04:35:30,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-04-08 04:35:30,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:30,975 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-08 04:35:30,975 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-08 04:35:30,976 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-08 04:35:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:30,978 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-04-08 04:35:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2022-04-08 04:35:30,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:30,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:30,979 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-08 04:35:30,979 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-08 04:35:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:30,981 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-04-08 04:35:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2022-04-08 04:35:30,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:30,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:30,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:30,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:30,982 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-08 04:35:30,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 121 transitions. [2022-04-08 04:35:30,984 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 121 transitions. Word has length 185 [2022-04-08 04:35:30,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:30,985 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 121 transitions. [2022-04-08 04:35:30,985 INFO L479 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-08 04:35:30,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 121 transitions. [2022-04-08 04:35:31,261 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-08 04:35:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2022-04-08 04:35:31,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-04-08 04:35:31,263 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:31,263 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:31,271 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-08 04:35:31,471 WARN L460 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-08 04:35:31,471 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:31,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:31,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1572034203, now seen corresponding path program 49 times [2022-04-08 04:35:31,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:31,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1833010510] [2022-04-08 04:35:31,543 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:35:31,543 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:35:31,543 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:35:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1572034203, now seen corresponding path program 50 times [2022-04-08 04:35:31,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:31,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469015259] [2022-04-08 04:35:31,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:31,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:31,558 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:31,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [510324617] [2022-04-08 04:35:31,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:35:31,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:31,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:31,560 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-08 04:35:31,563 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-08 04:35:32,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:35:32,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:32,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-08 04:35:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:32,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:34,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {19020#true} call ULTIMATE.init(); {19020#true} is VALID [2022-04-08 04:35:34,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {19020#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); {19020#true} is VALID [2022-04-08 04:35:34,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19020#true} {19020#true} #56#return; {19020#true} is VALID [2022-04-08 04:35:34,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {19020#true} call #t~ret5 := main(); {19020#true} is VALID [2022-04-08 04:35:34,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {19020#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; {19040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:34,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {19040#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {19040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:34,080 INFO L272 TraceCheckUtils]: 7: Hoare triple {19040#(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)); {19020#true} is VALID [2022-04-08 04:35:34,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,081 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {19020#true} {19040#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {19040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:34,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {19040#(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; {19062#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:35:34,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {19062#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {19062#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:35:34,081 INFO L272 TraceCheckUtils]: 14: Hoare triple {19062#(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)); {19020#true} is VALID [2022-04-08 04:35:34,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,082 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {19020#true} {19062#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {19062#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:35:34,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {19062#(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; {19084#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 04:35:34,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {19084#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {19084#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 04:35:34,083 INFO L272 TraceCheckUtils]: 21: Hoare triple {19084#(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)); {19020#true} is VALID [2022-04-08 04:35:34,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,083 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {19020#true} {19084#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #50#return; {19084#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 04:35:34,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {19084#(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; {19106#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:35:34,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {19106#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} assume !false; {19106#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:35:34,084 INFO L272 TraceCheckUtils]: 28: Hoare triple {19106#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 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)); {19020#true} is VALID [2022-04-08 04:35:34,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,085 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19020#true} {19106#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} #50#return; {19106#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:35:34,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {19106#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 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; {19128#(and (= (+ main_~y~0 (- 3)) 1) (= 2 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:34,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {19128#(and (= (+ main_~y~0 (- 3)) 1) (= 2 (+ (- 2) main_~c~0)))} assume !false; {19128#(and (= (+ main_~y~0 (- 3)) 1) (= 2 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:34,086 INFO L272 TraceCheckUtils]: 35: Hoare triple {19128#(and (= (+ main_~y~0 (- 3)) 1) (= 2 (+ (- 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)); {19020#true} is VALID [2022-04-08 04:35:34,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,086 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {19020#true} {19128#(and (= (+ main_~y~0 (- 3)) 1) (= 2 (+ (- 2) main_~c~0)))} #50#return; {19128#(and (= (+ main_~y~0 (- 3)) 1) (= 2 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:34,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {19128#(and (= (+ main_~y~0 (- 3)) 1) (= 2 (+ (- 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; {19150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:35:34,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {19150#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {19150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:35:34,087 INFO L272 TraceCheckUtils]: 42: Hoare triple {19150#(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)); {19020#true} is VALID [2022-04-08 04:35:34,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,088 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {19020#true} {19150#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {19150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:35:34,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {19150#(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; {19172#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:35:34,088 INFO L290 TraceCheckUtils]: 48: Hoare triple {19172#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {19172#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:35:34,088 INFO L272 TraceCheckUtils]: 49: Hoare triple {19172#(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)); {19020#true} is VALID [2022-04-08 04:35:34,088 INFO L290 TraceCheckUtils]: 50: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,088 INFO L290 TraceCheckUtils]: 51: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,088 INFO L290 TraceCheckUtils]: 52: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,089 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {19020#true} {19172#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {19172#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:35:34,089 INFO L290 TraceCheckUtils]: 54: Hoare triple {19172#(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; {19194#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 04:35:34,090 INFO L290 TraceCheckUtils]: 55: Hoare triple {19194#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {19194#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 04:35:34,090 INFO L272 TraceCheckUtils]: 56: Hoare triple {19194#(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)); {19020#true} is VALID [2022-04-08 04:35:34,090 INFO L290 TraceCheckUtils]: 57: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,090 INFO L290 TraceCheckUtils]: 58: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,090 INFO L290 TraceCheckUtils]: 59: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,090 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19020#true} {19194#(and (= 7 main_~y~0) (= 7 main_~c~0))} #50#return; {19194#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 04:35:34,091 INFO L290 TraceCheckUtils]: 61: Hoare triple {19194#(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; {19216#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 04:35:34,091 INFO L290 TraceCheckUtils]: 62: Hoare triple {19216#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {19216#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 04:35:34,091 INFO L272 TraceCheckUtils]: 63: Hoare triple {19216#(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)); {19020#true} is VALID [2022-04-08 04:35:34,091 INFO L290 TraceCheckUtils]: 64: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,091 INFO L290 TraceCheckUtils]: 65: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,091 INFO L290 TraceCheckUtils]: 66: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,092 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {19020#true} {19216#(and (= main_~y~0 8) (= main_~c~0 8))} #50#return; {19216#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 04:35:34,092 INFO L290 TraceCheckUtils]: 68: Hoare triple {19216#(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; {19238#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:35:34,092 INFO L290 TraceCheckUtils]: 69: Hoare triple {19238#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {19238#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:35:34,092 INFO L272 TraceCheckUtils]: 70: Hoare triple {19238#(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)); {19020#true} is VALID [2022-04-08 04:35:34,092 INFO L290 TraceCheckUtils]: 71: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,092 INFO L290 TraceCheckUtils]: 72: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,093 INFO L290 TraceCheckUtils]: 73: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,093 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {19020#true} {19238#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #50#return; {19238#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:35:34,093 INFO L290 TraceCheckUtils]: 75: Hoare triple {19238#(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; {19260#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 04:35:34,094 INFO L290 TraceCheckUtils]: 76: Hoare triple {19260#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {19260#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 04:35:34,094 INFO L272 TraceCheckUtils]: 77: Hoare triple {19260#(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)); {19020#true} is VALID [2022-04-08 04:35:34,094 INFO L290 TraceCheckUtils]: 78: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,094 INFO L290 TraceCheckUtils]: 79: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,094 INFO L290 TraceCheckUtils]: 80: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,094 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19020#true} {19260#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #50#return; {19260#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 04:35:34,095 INFO L290 TraceCheckUtils]: 82: Hoare triple {19260#(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; {19282#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 04:35:34,095 INFO L290 TraceCheckUtils]: 83: Hoare triple {19282#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} assume !false; {19282#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 04:35:34,095 INFO L272 TraceCheckUtils]: 84: Hoare triple {19282#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 04:35:34,095 INFO L290 TraceCheckUtils]: 85: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,095 INFO L290 TraceCheckUtils]: 86: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,095 INFO L290 TraceCheckUtils]: 87: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,096 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {19020#true} {19282#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} #50#return; {19282#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 04:35:34,096 INFO L290 TraceCheckUtils]: 89: Hoare triple {19282#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19304#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 04:35:34,096 INFO L290 TraceCheckUtils]: 90: Hoare triple {19304#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} assume !false; {19304#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 04:35:34,096 INFO L272 TraceCheckUtils]: 91: Hoare triple {19304#(and (= 10 (+ (- 2) main_~c~0)) (= (+ 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)); {19020#true} is VALID [2022-04-08 04:35:34,096 INFO L290 TraceCheckUtils]: 92: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,097 INFO L290 TraceCheckUtils]: 93: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,097 INFO L290 TraceCheckUtils]: 94: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,097 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {19020#true} {19304#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} #50#return; {19304#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 04:35:34,097 INFO L290 TraceCheckUtils]: 96: Hoare triple {19304#(and (= 10 (+ (- 2) main_~c~0)) (= (+ 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; {19326#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-08 04:35:34,098 INFO L290 TraceCheckUtils]: 97: Hoare triple {19326#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} assume !false; {19326#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-08 04:35:34,098 INFO L272 TraceCheckUtils]: 98: Hoare triple {19326#(and (= (+ main_~y~0 (- 4)) 9) (= 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)); {19020#true} is VALID [2022-04-08 04:35:34,098 INFO L290 TraceCheckUtils]: 99: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,098 INFO L290 TraceCheckUtils]: 100: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,098 INFO L290 TraceCheckUtils]: 101: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,098 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {19020#true} {19326#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} #50#return; {19326#(and (= (+ main_~y~0 (- 4)) 9) (= main_~c~0 13))} is VALID [2022-04-08 04:35:34,099 INFO L290 TraceCheckUtils]: 103: Hoare triple {19326#(and (= (+ main_~y~0 (- 4)) 9) (= 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; {19348#(and (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 04:35:34,099 INFO L290 TraceCheckUtils]: 104: Hoare triple {19348#(and (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} assume !false; {19348#(and (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 04:35:34,099 INFO L272 TraceCheckUtils]: 105: Hoare triple {19348#(and (= 9 (+ main_~y~0 (- 5))) (= (+ (- 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)); {19020#true} is VALID [2022-04-08 04:35:34,100 INFO L290 TraceCheckUtils]: 106: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,100 INFO L290 TraceCheckUtils]: 107: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,100 INFO L290 TraceCheckUtils]: 108: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,100 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {19020#true} {19348#(and (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} #50#return; {19348#(and (= 9 (+ main_~y~0 (- 5))) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 04:35:34,101 INFO L290 TraceCheckUtils]: 110: Hoare triple {19348#(and (= 9 (+ main_~y~0 (- 5))) (= (+ (- 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; {19370#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:34,101 INFO L290 TraceCheckUtils]: 111: Hoare triple {19370#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !false; {19370#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:34,101 INFO L272 TraceCheckUtils]: 112: Hoare triple {19370#(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)); {19020#true} is VALID [2022-04-08 04:35:34,101 INFO L290 TraceCheckUtils]: 113: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,101 INFO L290 TraceCheckUtils]: 114: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,102 INFO L290 TraceCheckUtils]: 115: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,102 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {19020#true} {19370#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} #50#return; {19370#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:34,103 INFO L290 TraceCheckUtils]: 117: Hoare triple {19370#(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; {19392#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-08 04:35:34,103 INFO L290 TraceCheckUtils]: 118: Hoare triple {19392#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 13))} assume !false; {19392#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-08 04:35:34,103 INFO L272 TraceCheckUtils]: 119: Hoare triple {19392#(and (= 15 (+ (- 1) main_~y~0)) (= (+ 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)); {19020#true} is VALID [2022-04-08 04:35:34,103 INFO L290 TraceCheckUtils]: 120: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,103 INFO L290 TraceCheckUtils]: 121: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,103 INFO L290 TraceCheckUtils]: 122: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,104 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {19020#true} {19392#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 13))} #50#return; {19392#(and (= 15 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-08 04:35:34,104 INFO L290 TraceCheckUtils]: 124: Hoare triple {19392#(and (= 15 (+ (- 1) main_~y~0)) (= (+ 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; {19414#(and (= (+ (- 2) main_~y~0) 15) (= 13 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:35:34,105 INFO L290 TraceCheckUtils]: 125: Hoare triple {19414#(and (= (+ (- 2) main_~y~0) 15) (= 13 (+ main_~c~0 (- 4))))} assume !false; {19414#(and (= (+ (- 2) main_~y~0) 15) (= 13 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:35:34,105 INFO L272 TraceCheckUtils]: 126: Hoare triple {19414#(and (= (+ (- 2) main_~y~0) 15) (= 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)); {19020#true} is VALID [2022-04-08 04:35:34,105 INFO L290 TraceCheckUtils]: 127: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,105 INFO L290 TraceCheckUtils]: 128: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,105 INFO L290 TraceCheckUtils]: 129: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,106 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {19020#true} {19414#(and (= (+ (- 2) main_~y~0) 15) (= 13 (+ main_~c~0 (- 4))))} #50#return; {19414#(and (= (+ (- 2) main_~y~0) 15) (= 13 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:35:34,106 INFO L290 TraceCheckUtils]: 131: Hoare triple {19414#(and (= (+ (- 2) main_~y~0) 15) (= 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; {19436#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} is VALID [2022-04-08 04:35:34,107 INFO L290 TraceCheckUtils]: 132: Hoare triple {19436#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} assume !false; {19436#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} is VALID [2022-04-08 04:35:34,107 INFO L272 TraceCheckUtils]: 133: Hoare triple {19436#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 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)); {19020#true} is VALID [2022-04-08 04:35:34,107 INFO L290 TraceCheckUtils]: 134: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,107 INFO L290 TraceCheckUtils]: 135: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,107 INFO L290 TraceCheckUtils]: 136: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,107 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {19020#true} {19436#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} #50#return; {19436#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} is VALID [2022-04-08 04:35:34,108 INFO L290 TraceCheckUtils]: 138: Hoare triple {19436#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 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; {19458#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:35:34,108 INFO L290 TraceCheckUtils]: 139: Hoare triple {19458#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {19458#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:35:34,108 INFO L272 TraceCheckUtils]: 140: Hoare triple {19458#(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)); {19020#true} is VALID [2022-04-08 04:35:34,108 INFO L290 TraceCheckUtils]: 141: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,108 INFO L290 TraceCheckUtils]: 142: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,108 INFO L290 TraceCheckUtils]: 143: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,109 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {19020#true} {19458#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #50#return; {19458#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:35:34,109 INFO L290 TraceCheckUtils]: 145: Hoare triple {19458#(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; {19480#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:34,109 INFO L290 TraceCheckUtils]: 146: Hoare triple {19480#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} assume !false; {19480#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:34,110 INFO L272 TraceCheckUtils]: 147: Hoare triple {19480#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 04:35:34,110 INFO L290 TraceCheckUtils]: 148: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,110 INFO L290 TraceCheckUtils]: 149: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,110 INFO L290 TraceCheckUtils]: 150: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,110 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {19020#true} {19480#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} #50#return; {19480#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:34,111 INFO L290 TraceCheckUtils]: 152: Hoare triple {19480#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19502#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-08 04:35:34,111 INFO L290 TraceCheckUtils]: 153: Hoare triple {19502#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} assume !false; {19502#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-08 04:35:34,111 INFO L272 TraceCheckUtils]: 154: Hoare triple {19502#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 04:35:34,111 INFO L290 TraceCheckUtils]: 155: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,111 INFO L290 TraceCheckUtils]: 156: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,111 INFO L290 TraceCheckUtils]: 157: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,112 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {19020#true} {19502#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} #50#return; {19502#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-08 04:35:34,112 INFO L290 TraceCheckUtils]: 159: Hoare triple {19502#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19524#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-08 04:35:34,112 INFO L290 TraceCheckUtils]: 160: Hoare triple {19524#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} assume !false; {19524#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-08 04:35:34,112 INFO L272 TraceCheckUtils]: 161: Hoare triple {19524#(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)); {19020#true} is VALID [2022-04-08 04:35:34,112 INFO L290 TraceCheckUtils]: 162: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,112 INFO L290 TraceCheckUtils]: 163: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,113 INFO L290 TraceCheckUtils]: 164: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,113 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {19020#true} {19524#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} #50#return; {19524#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-08 04:35:34,113 INFO L290 TraceCheckUtils]: 166: Hoare triple {19524#(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; {19546#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 04:35:34,114 INFO L290 TraceCheckUtils]: 167: Hoare triple {19546#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {19546#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 04:35:34,114 INFO L272 TraceCheckUtils]: 168: Hoare triple {19546#(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)); {19020#true} is VALID [2022-04-08 04:35:34,114 INFO L290 TraceCheckUtils]: 169: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,114 INFO L290 TraceCheckUtils]: 170: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,114 INFO L290 TraceCheckUtils]: 171: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,114 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {19020#true} {19546#(and (= 23 main_~y~0) (= 23 main_~c~0))} #50#return; {19546#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 04:35:34,115 INFO L290 TraceCheckUtils]: 173: Hoare triple {19546#(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; {19568#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-08 04:35:34,115 INFO L290 TraceCheckUtils]: 174: Hoare triple {19568#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} assume !false; {19568#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-08 04:35:34,115 INFO L272 TraceCheckUtils]: 175: Hoare triple {19568#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 04:35:34,115 INFO L290 TraceCheckUtils]: 176: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,115 INFO L290 TraceCheckUtils]: 177: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,115 INFO L290 TraceCheckUtils]: 178: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,116 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {19020#true} {19568#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} #50#return; {19568#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-08 04:35:34,116 INFO L290 TraceCheckUtils]: 180: Hoare triple {19568#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19590#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} is VALID [2022-04-08 04:35:34,116 INFO L290 TraceCheckUtils]: 181: Hoare triple {19590#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} assume !false; {19590#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} is VALID [2022-04-08 04:35:34,116 INFO L272 TraceCheckUtils]: 182: Hoare triple {19590#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19020#true} is VALID [2022-04-08 04:35:34,116 INFO L290 TraceCheckUtils]: 183: Hoare triple {19020#true} ~cond := #in~cond; {19020#true} is VALID [2022-04-08 04:35:34,117 INFO L290 TraceCheckUtils]: 184: Hoare triple {19020#true} assume !(0 == ~cond); {19020#true} is VALID [2022-04-08 04:35:34,117 INFO L290 TraceCheckUtils]: 185: Hoare triple {19020#true} assume true; {19020#true} is VALID [2022-04-08 04:35:34,117 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {19020#true} {19590#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} #50#return; {19590#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} is VALID [2022-04-08 04:35:34,119 INFO L290 TraceCheckUtils]: 187: Hoare triple {19590#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} assume !(~c~0 < ~k~0); {19612#(and (<= main_~k~0 25) (< 24 main_~k~0) (= main_~y~0 25))} is VALID [2022-04-08 04:35:34,120 INFO L272 TraceCheckUtils]: 188: Hoare triple {19612#(and (<= main_~k~0 25) (< 24 main_~k~0) (= main_~y~0 25))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19616#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:34,120 INFO L290 TraceCheckUtils]: 189: Hoare triple {19616#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19620#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:34,120 INFO L290 TraceCheckUtils]: 190: Hoare triple {19620#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19021#false} is VALID [2022-04-08 04:35:34,120 INFO L290 TraceCheckUtils]: 191: Hoare triple {19021#false} assume !false; {19021#false} is VALID [2022-04-08 04:35:34,121 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-08 04:35:34,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:35:34,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:34,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469015259] [2022-04-08 04:35:34,456 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:35:34,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510324617] [2022-04-08 04:35:34,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510324617] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:35:34,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:35:34,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2022-04-08 04:35:34,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:34,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1833010510] [2022-04-08 04:35:34,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1833010510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:34,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:34,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-08 04:35:34,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869915077] [2022-04-08 04:35:34,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:34,458 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-08 04:35:34,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:34,458 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-08 04:35:34,626 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-08 04:35:34,627 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-08 04:35:34,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:34,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-08 04:35:34,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 04:35:34,628 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-08 04:35:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:42,620 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2022-04-08 04:35:42,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 04:35:42,620 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-08 04:35:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:42,621 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-08 04:35:42,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2022-04-08 04:35:42,624 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-08 04:35:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2022-04-08 04:35:42,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 126 transitions. [2022-04-08 04:35:42,985 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-08 04:35:42,987 INFO L225 Difference]: With dead ends: 105 [2022-04-08 04:35:42,987 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 04:35:42,987 INFO L912 BasicCegarLoop]: 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-08 04:35:42,988 INFO L913 BasicCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:35:42,988 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1188 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-08 04:35:42,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 04:35:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-08 04:35:43,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:43,095 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-08 04:35:43,095 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-08 04:35:43,095 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-08 04:35:43,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:43,098 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2022-04-08 04:35:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2022-04-08 04:35:43,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:43,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:43,099 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-08 04:35:43,099 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-08 04:35:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:43,101 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2022-04-08 04:35:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2022-04-08 04:35:43,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:43,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:43,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:43,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:43,102 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-08 04:35:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2022-04-08 04:35:43,105 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 192 [2022-04-08 04:35:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:43,105 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2022-04-08 04:35:43,105 INFO L479 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-08 04:35:43,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 125 transitions. [2022-04-08 04:35:43,401 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-08 04:35:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2022-04-08 04:35:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-04-08 04:35:43,402 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:43,402 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:43,407 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-08 04:35:43,602 WARN L460 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-08 04:35:43,602 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:43,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:43,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1051836910, now seen corresponding path program 51 times [2022-04-08 04:35:43,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:43,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [977830145] [2022-04-08 04:35:43,681 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:35:43,681 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:35:43,681 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:35:43,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1051836910, now seen corresponding path program 52 times [2022-04-08 04:35:43,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:43,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506690798] [2022-04-08 04:35:43,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:43,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:43,700 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:43,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1626466517] [2022-04-08 04:35:43,700 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:35:43,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:43,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:43,701 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-08 04:35:43,726 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-08 04:35:48,203 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:35:48,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:48,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-08 04:35:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:48,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:49,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {20282#true} call ULTIMATE.init(); {20282#true} is VALID [2022-04-08 04:35:49,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {20282#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); {20282#true} is VALID [2022-04-08 04:35:49,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20282#true} {20282#true} #56#return; {20282#true} is VALID [2022-04-08 04:35:49,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {20282#true} call #t~ret5 := main(); {20282#true} is VALID [2022-04-08 04:35:49,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {20282#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; {20302#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:49,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {20302#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {20302#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:49,404 INFO L272 TraceCheckUtils]: 7: Hoare triple {20302#(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)); {20282#true} is VALID [2022-04-08 04:35:49,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,404 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {20282#true} {20302#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {20302#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:49,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {20302#(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; {20324#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:49,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {20324#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {20324#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:49,405 INFO L272 TraceCheckUtils]: 14: Hoare triple {20324#(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)); {20282#true} is VALID [2022-04-08 04:35:49,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,406 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20282#true} {20324#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {20324#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:49,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {20324#(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; {20346#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:49,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {20346#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {20346#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:49,407 INFO L272 TraceCheckUtils]: 21: Hoare triple {20346#(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)); {20282#true} is VALID [2022-04-08 04:35:49,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,407 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20282#true} {20346#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #50#return; {20346#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:49,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {20346#(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; {20368#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 04:35:49,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {20368#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {20368#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 04:35:49,408 INFO L272 TraceCheckUtils]: 28: Hoare triple {20368#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 04:35:49,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,409 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20282#true} {20368#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #50#return; {20368#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 04:35:49,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {20368#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20390#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 04:35:49,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {20390#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !false; {20390#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 04:35:49,409 INFO L272 TraceCheckUtils]: 35: Hoare triple {20390#(and (= (+ 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)); {20282#true} is VALID [2022-04-08 04:35:49,409 INFO L290 TraceCheckUtils]: 36: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,410 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20282#true} {20390#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #50#return; {20390#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 04:35:49,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {20390#(and (= (+ 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; {20412#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 04:35:49,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {20412#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} assume !false; {20412#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 04:35:49,411 INFO L272 TraceCheckUtils]: 42: Hoare triple {20412#(and (= (+ main_~y~0 (- 4)) 1) (= 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)); {20282#true} is VALID [2022-04-08 04:35:49,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,411 INFO L290 TraceCheckUtils]: 45: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,411 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {20282#true} {20412#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} #50#return; {20412#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 04:35:49,412 INFO L290 TraceCheckUtils]: 47: Hoare triple {20412#(and (= (+ main_~y~0 (- 4)) 1) (= 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; {20434#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:35:49,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {20434#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {20434#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:35:49,412 INFO L272 TraceCheckUtils]: 49: Hoare triple {20434#(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)); {20282#true} is VALID [2022-04-08 04:35:49,412 INFO L290 TraceCheckUtils]: 50: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,412 INFO L290 TraceCheckUtils]: 51: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,412 INFO L290 TraceCheckUtils]: 52: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,413 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {20282#true} {20434#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #50#return; {20434#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:35:49,413 INFO L290 TraceCheckUtils]: 54: Hoare triple {20434#(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; {20456#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:49,413 INFO L290 TraceCheckUtils]: 55: Hoare triple {20456#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {20456#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:49,413 INFO L272 TraceCheckUtils]: 56: Hoare triple {20456#(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)); {20282#true} is VALID [2022-04-08 04:35:49,413 INFO L290 TraceCheckUtils]: 57: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,414 INFO L290 TraceCheckUtils]: 58: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,414 INFO L290 TraceCheckUtils]: 59: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,414 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20282#true} {20456#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #50#return; {20456#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:49,414 INFO L290 TraceCheckUtils]: 61: Hoare triple {20456#(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; {20478#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 04:35:49,415 INFO L290 TraceCheckUtils]: 62: Hoare triple {20478#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {20478#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 04:35:49,415 INFO L272 TraceCheckUtils]: 63: Hoare triple {20478#(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)); {20282#true} is VALID [2022-04-08 04:35:49,415 INFO L290 TraceCheckUtils]: 64: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,415 INFO L290 TraceCheckUtils]: 65: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,415 INFO L290 TraceCheckUtils]: 66: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,415 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {20282#true} {20478#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #50#return; {20478#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 04:35:49,416 INFO L290 TraceCheckUtils]: 68: Hoare triple {20478#(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; {20500#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-08 04:35:49,416 INFO L290 TraceCheckUtils]: 69: Hoare triple {20500#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !false; {20500#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-08 04:35:49,416 INFO L272 TraceCheckUtils]: 70: Hoare triple {20500#(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)); {20282#true} is VALID [2022-04-08 04:35:49,416 INFO L290 TraceCheckUtils]: 71: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,416 INFO L290 TraceCheckUtils]: 72: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,416 INFO L290 TraceCheckUtils]: 73: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,417 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20282#true} {20500#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} #50#return; {20500#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-08 04:35:49,417 INFO L290 TraceCheckUtils]: 75: Hoare triple {20500#(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; {20522#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:35:49,417 INFO L290 TraceCheckUtils]: 76: Hoare triple {20522#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {20522#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:35:49,417 INFO L272 TraceCheckUtils]: 77: Hoare triple {20522#(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)); {20282#true} is VALID [2022-04-08 04:35:49,418 INFO L290 TraceCheckUtils]: 78: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,418 INFO L290 TraceCheckUtils]: 79: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,418 INFO L290 TraceCheckUtils]: 80: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,418 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20282#true} {20522#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #50#return; {20522#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:35:49,418 INFO L290 TraceCheckUtils]: 82: Hoare triple {20522#(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; {20544#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:35:49,419 INFO L290 TraceCheckUtils]: 83: Hoare triple {20544#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {20544#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:35:49,419 INFO L272 TraceCheckUtils]: 84: Hoare triple {20544#(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)); {20282#true} is VALID [2022-04-08 04:35:49,419 INFO L290 TraceCheckUtils]: 85: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,419 INFO L290 TraceCheckUtils]: 86: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,419 INFO L290 TraceCheckUtils]: 87: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,419 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {20282#true} {20544#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {20544#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:35:49,420 INFO L290 TraceCheckUtils]: 89: Hoare triple {20544#(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; {20566#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:35:49,420 INFO L290 TraceCheckUtils]: 90: Hoare triple {20566#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {20566#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:35:49,420 INFO L272 TraceCheckUtils]: 91: Hoare triple {20566#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 04:35:49,420 INFO L290 TraceCheckUtils]: 92: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,420 INFO L290 TraceCheckUtils]: 93: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,420 INFO L290 TraceCheckUtils]: 94: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,421 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {20282#true} {20566#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #50#return; {20566#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:35:49,421 INFO L290 TraceCheckUtils]: 96: Hoare triple {20566#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20588#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 04:35:49,421 INFO L290 TraceCheckUtils]: 97: Hoare triple {20588#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !false; {20588#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 04:35:49,421 INFO L272 TraceCheckUtils]: 98: Hoare triple {20588#(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)); {20282#true} is VALID [2022-04-08 04:35:49,422 INFO L290 TraceCheckUtils]: 99: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,422 INFO L290 TraceCheckUtils]: 100: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,422 INFO L290 TraceCheckUtils]: 101: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,422 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {20282#true} {20588#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} #50#return; {20588#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 04:35:49,422 INFO L290 TraceCheckUtils]: 103: Hoare triple {20588#(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; {20610#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 04:35:49,423 INFO L290 TraceCheckUtils]: 104: Hoare triple {20610#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {20610#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 04:35:49,423 INFO L272 TraceCheckUtils]: 105: Hoare triple {20610#(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)); {20282#true} is VALID [2022-04-08 04:35:49,423 INFO L290 TraceCheckUtils]: 106: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,423 INFO L290 TraceCheckUtils]: 107: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,423 INFO L290 TraceCheckUtils]: 108: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,423 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {20282#true} {20610#(and (= main_~y~0 14) (= main_~c~0 14))} #50#return; {20610#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 04:35:49,424 INFO L290 TraceCheckUtils]: 110: Hoare triple {20610#(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; {20632#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:35:49,424 INFO L290 TraceCheckUtils]: 111: Hoare triple {20632#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {20632#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:35:49,424 INFO L272 TraceCheckUtils]: 112: Hoare triple {20632#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 04:35:49,424 INFO L290 TraceCheckUtils]: 113: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,424 INFO L290 TraceCheckUtils]: 114: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,424 INFO L290 TraceCheckUtils]: 115: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,425 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {20282#true} {20632#(and (= main_~c~0 15) (= main_~y~0 15))} #50#return; {20632#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:35:49,425 INFO L290 TraceCheckUtils]: 117: Hoare triple {20632#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20654#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 04:35:49,425 INFO L290 TraceCheckUtils]: 118: Hoare triple {20654#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !false; {20654#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 04:35:49,425 INFO L272 TraceCheckUtils]: 119: Hoare triple {20654#(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)); {20282#true} is VALID [2022-04-08 04:35:49,426 INFO L290 TraceCheckUtils]: 120: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,426 INFO L290 TraceCheckUtils]: 121: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,426 INFO L290 TraceCheckUtils]: 122: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,426 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {20282#true} {20654#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} #50#return; {20654#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 04:35:49,426 INFO L290 TraceCheckUtils]: 124: Hoare triple {20654#(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; {20676#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 04:35:49,427 INFO L290 TraceCheckUtils]: 125: Hoare triple {20676#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {20676#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 04:35:49,427 INFO L272 TraceCheckUtils]: 126: Hoare triple {20676#(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)); {20282#true} is VALID [2022-04-08 04:35:49,427 INFO L290 TraceCheckUtils]: 127: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,427 INFO L290 TraceCheckUtils]: 128: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,427 INFO L290 TraceCheckUtils]: 129: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,427 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {20282#true} {20676#(and (= main_~c~0 17) (= main_~y~0 17))} #50#return; {20676#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 04:35:49,428 INFO L290 TraceCheckUtils]: 131: Hoare triple {20676#(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; {20698#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 04:35:49,428 INFO L290 TraceCheckUtils]: 132: Hoare triple {20698#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !false; {20698#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 04:35:49,428 INFO L272 TraceCheckUtils]: 133: Hoare triple {20698#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 04:35:49,428 INFO L290 TraceCheckUtils]: 134: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,428 INFO L290 TraceCheckUtils]: 135: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,428 INFO L290 TraceCheckUtils]: 136: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,429 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {20282#true} {20698#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} #50#return; {20698#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 04:35:49,429 INFO L290 TraceCheckUtils]: 138: Hoare triple {20698#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20720#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 04:35:49,429 INFO L290 TraceCheckUtils]: 139: Hoare triple {20720#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !false; {20720#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 04:35:49,429 INFO L272 TraceCheckUtils]: 140: Hoare triple {20720#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 04:35:49,430 INFO L290 TraceCheckUtils]: 141: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,430 INFO L290 TraceCheckUtils]: 142: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,430 INFO L290 TraceCheckUtils]: 143: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,430 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {20282#true} {20720#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} #50#return; {20720#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 04:35:49,430 INFO L290 TraceCheckUtils]: 145: Hoare triple {20720#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20742#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-08 04:35:49,431 INFO L290 TraceCheckUtils]: 146: Hoare triple {20742#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} assume !false; {20742#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-08 04:35:49,431 INFO L272 TraceCheckUtils]: 147: Hoare triple {20742#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 04:35:49,431 INFO L290 TraceCheckUtils]: 148: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,431 INFO L290 TraceCheckUtils]: 149: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,431 INFO L290 TraceCheckUtils]: 150: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,431 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {20282#true} {20742#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} #50#return; {20742#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-08 04:35:49,432 INFO L290 TraceCheckUtils]: 152: Hoare triple {20742#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20764#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:49,432 INFO L290 TraceCheckUtils]: 153: Hoare triple {20764#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} assume !false; {20764#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:49,432 INFO L272 TraceCheckUtils]: 154: Hoare triple {20764#(and (= 17 (+ main_~c~0 (- 4))) (= 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)); {20282#true} is VALID [2022-04-08 04:35:49,432 INFO L290 TraceCheckUtils]: 155: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,432 INFO L290 TraceCheckUtils]: 156: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,432 INFO L290 TraceCheckUtils]: 157: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,433 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {20282#true} {20764#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} #50#return; {20764#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:49,433 INFO L290 TraceCheckUtils]: 159: Hoare triple {20764#(and (= 17 (+ main_~c~0 (- 4))) (= 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; {20786#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 04:35:49,434 INFO L290 TraceCheckUtils]: 160: Hoare triple {20786#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} assume !false; {20786#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 04:35:49,434 INFO L272 TraceCheckUtils]: 161: Hoare triple {20786#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 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)); {20282#true} is VALID [2022-04-08 04:35:49,434 INFO L290 TraceCheckUtils]: 162: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,434 INFO L290 TraceCheckUtils]: 163: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,434 INFO L290 TraceCheckUtils]: 164: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,434 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {20282#true} {20786#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} #50#return; {20786#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 04:35:49,435 INFO L290 TraceCheckUtils]: 166: Hoare triple {20786#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 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; {20808#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} is VALID [2022-04-08 04:35:49,435 INFO L290 TraceCheckUtils]: 167: Hoare triple {20808#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} assume !false; {20808#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} is VALID [2022-04-08 04:35:49,435 INFO L272 TraceCheckUtils]: 168: Hoare triple {20808#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20282#true} is VALID [2022-04-08 04:35:49,435 INFO L290 TraceCheckUtils]: 169: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,435 INFO L290 TraceCheckUtils]: 170: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,435 INFO L290 TraceCheckUtils]: 171: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,435 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {20282#true} {20808#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} #50#return; {20808#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} is VALID [2022-04-08 04:35:49,436 INFO L290 TraceCheckUtils]: 173: Hoare triple {20808#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20830#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} is VALID [2022-04-08 04:35:49,436 INFO L290 TraceCheckUtils]: 174: Hoare triple {20830#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} assume !false; {20830#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} is VALID [2022-04-08 04:35:49,436 INFO L272 TraceCheckUtils]: 175: Hoare triple {20830#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 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)); {20282#true} is VALID [2022-04-08 04:35:49,436 INFO L290 TraceCheckUtils]: 176: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,436 INFO L290 TraceCheckUtils]: 177: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,436 INFO L290 TraceCheckUtils]: 178: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,437 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {20282#true} {20830#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} #50#return; {20830#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} is VALID [2022-04-08 04:35:49,437 INFO L290 TraceCheckUtils]: 180: Hoare triple {20830#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 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; {20852#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 04:35:49,438 INFO L290 TraceCheckUtils]: 181: Hoare triple {20852#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} assume !false; {20852#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 04:35:49,438 INFO L272 TraceCheckUtils]: 182: Hoare triple {20852#(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)); {20282#true} is VALID [2022-04-08 04:35:49,438 INFO L290 TraceCheckUtils]: 183: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,438 INFO L290 TraceCheckUtils]: 184: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,438 INFO L290 TraceCheckUtils]: 185: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,438 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {20282#true} {20852#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} #50#return; {20852#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 04:35:49,439 INFO L290 TraceCheckUtils]: 187: Hoare triple {20852#(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; {20874#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-08 04:35:49,439 INFO L290 TraceCheckUtils]: 188: Hoare triple {20874#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} assume !false; {20874#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-08 04:35:49,439 INFO L272 TraceCheckUtils]: 189: Hoare triple {20874#(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)); {20282#true} is VALID [2022-04-08 04:35:49,439 INFO L290 TraceCheckUtils]: 190: Hoare triple {20282#true} ~cond := #in~cond; {20282#true} is VALID [2022-04-08 04:35:49,439 INFO L290 TraceCheckUtils]: 191: Hoare triple {20282#true} assume !(0 == ~cond); {20282#true} is VALID [2022-04-08 04:35:49,439 INFO L290 TraceCheckUtils]: 192: Hoare triple {20282#true} assume true; {20282#true} is VALID [2022-04-08 04:35:49,440 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {20282#true} {20874#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} #50#return; {20874#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-08 04:35:49,441 INFO L290 TraceCheckUtils]: 194: Hoare triple {20874#(and (<= main_~c~0 26) (< 25 main_~k~0) (= main_~y~0 26))} assume !(~c~0 < ~k~0); {20896#(and (<= main_~k~0 26) (< 25 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-08 04:35:49,441 INFO L272 TraceCheckUtils]: 195: Hoare triple {20896#(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)); {20900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:49,442 INFO L290 TraceCheckUtils]: 196: Hoare triple {20900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:49,442 INFO L290 TraceCheckUtils]: 197: Hoare triple {20904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20283#false} is VALID [2022-04-08 04:35:49,442 INFO L290 TraceCheckUtils]: 198: Hoare triple {20283#false} assume !false; {20283#false} is VALID [2022-04-08 04:35:49,443 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-08 04:35:49,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:35:49,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:49,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506690798] [2022-04-08 04:35:49,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:35:49,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626466517] [2022-04-08 04:35:49,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626466517] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:35:49,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:35:49,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2022-04-08 04:35:49,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:49,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [977830145] [2022-04-08 04:35:49,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [977830145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:49,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:49,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-08 04:35:49,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35225330] [2022-04-08 04:35:49,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:49,826 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-08 04:35:49,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:49,826 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-08 04:35:50,028 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-08 04:35:50,028 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-08 04:35:50,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:50,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-08 04:35:50,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 04:35:50,029 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-08 04:35:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:59,067 INFO L93 Difference]: Finished difference Result 108 states and 134 transitions. [2022-04-08 04:35:59,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 04:35:59,067 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-08 04:35:59,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:59,068 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-08 04:35:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 130 transitions. [2022-04-08 04:35:59,070 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-08 04:35:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 130 transitions. [2022-04-08 04:35:59,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 130 transitions. [2022-04-08 04:35:59,398 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-08 04:35:59,400 INFO L225 Difference]: With dead ends: 108 [2022-04-08 04:35:59,400 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 04:35:59,401 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=1223, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 04:35:59,401 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.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, 4.7s IncrementalHoareTripleChecker+Time [2022-04-08 04:35:59,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1259 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-08 04:35:59,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 04:35:59,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-08 04:35:59,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:59,508 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-08 04:35:59,509 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-08 04:35:59,509 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-08 04:35:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:59,512 INFO L93 Difference]: Finished difference Result 103 states and 129 transitions. [2022-04-08 04:35:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2022-04-08 04:35:59,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:59,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:59,512 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-08 04:35:59,513 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-08 04:35:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:59,515 INFO L93 Difference]: Finished difference Result 103 states and 129 transitions. [2022-04-08 04:35:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2022-04-08 04:35:59,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:59,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:59,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:59,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:59,516 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-08 04:35:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2022-04-08 04:35:59,518 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 199 [2022-04-08 04:35:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:59,518 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2022-04-08 04:35:59,519 INFO L479 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-08 04:35:59,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 129 transitions. [2022-04-08 04:35:59,838 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-08 04:35:59,839 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2022-04-08 04:35:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-04-08 04:35:59,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:59,840 INFO L499 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:59,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-08 04:36:00,051 WARN L460 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-08 04:36:00,051 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:36:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:36:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1346993349, now seen corresponding path program 53 times [2022-04-08 04:36:00,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:00,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [457145628] [2022-04-08 04:36:00,124 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:36:00,125 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:36:00,125 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:36:00,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1346993349, now seen corresponding path program 54 times [2022-04-08 04:36:00,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:36:00,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538430740] [2022-04-08 04:36:00,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:36:00,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:36:00,142 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:36:00,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222407197] [2022-04-08 04:36:00,142 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:36:00,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:36:00,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:36:00,143 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-08 04:36:00,144 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-08 04:36:09,794 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-08 04:36:09,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:36:09,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 116 conjunts are in the unsatisfiable core [2022-04-08 04:36:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:36:09,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:36:10,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {21584#true} call ULTIMATE.init(); {21584#true} is VALID [2022-04-08 04:36:10,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {21584#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); {21584#true} is VALID [2022-04-08 04:36:10,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21584#true} {21584#true} #56#return; {21584#true} is VALID [2022-04-08 04:36:10,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {21584#true} call #t~ret5 := main(); {21584#true} is VALID [2022-04-08 04:36:10,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {21584#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; {21604#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:36:10,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {21604#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {21604#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:36:10,971 INFO L272 TraceCheckUtils]: 7: Hoare triple {21604#(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)); {21584#true} is VALID [2022-04-08 04:36:10,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,972 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {21584#true} {21604#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {21604#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:36:10,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {21604#(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; {21626#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:36:10,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {21626#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {21626#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:36:10,972 INFO L272 TraceCheckUtils]: 14: Hoare triple {21626#(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)); {21584#true} is VALID [2022-04-08 04:36:10,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,973 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {21584#true} {21626#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {21626#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:36:10,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {21626#(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; {21648#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:36:10,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {21648#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {21648#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:36:10,974 INFO L272 TraceCheckUtils]: 21: Hoare triple {21648#(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)); {21584#true} is VALID [2022-04-08 04:36:10,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,974 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {21584#true} {21648#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #50#return; {21648#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:36:10,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {21648#(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; {21670#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 04:36:10,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {21670#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {21670#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 04:36:10,975 INFO L272 TraceCheckUtils]: 28: Hoare triple {21670#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 04:36:10,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,976 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21584#true} {21670#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #50#return; {21670#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 04:36:10,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {21670#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21692#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 04:36:10,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {21692#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !false; {21692#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 04:36:10,976 INFO L272 TraceCheckUtils]: 35: Hoare triple {21692#(and (= (+ 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)); {21584#true} is VALID [2022-04-08 04:36:10,976 INFO L290 TraceCheckUtils]: 36: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,976 INFO L290 TraceCheckUtils]: 37: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,977 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21584#true} {21692#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #50#return; {21692#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 04:36:10,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {21692#(and (= (+ 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; {21714#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 04:36:10,978 INFO L290 TraceCheckUtils]: 41: Hoare triple {21714#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} assume !false; {21714#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 04:36:10,978 INFO L272 TraceCheckUtils]: 42: Hoare triple {21714#(and (= (+ main_~y~0 (- 4)) 1) (= 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)); {21584#true} is VALID [2022-04-08 04:36:10,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,978 INFO L290 TraceCheckUtils]: 45: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,978 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21584#true} {21714#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} #50#return; {21714#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 04:36:10,979 INFO L290 TraceCheckUtils]: 47: Hoare triple {21714#(and (= (+ main_~y~0 (- 4)) 1) (= 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; {21736#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-08 04:36:10,979 INFO L290 TraceCheckUtils]: 48: Hoare triple {21736#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} assume !false; {21736#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-08 04:36:10,979 INFO L272 TraceCheckUtils]: 49: Hoare triple {21736#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 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)); {21584#true} is VALID [2022-04-08 04:36:10,979 INFO L290 TraceCheckUtils]: 50: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,979 INFO L290 TraceCheckUtils]: 51: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,979 INFO L290 TraceCheckUtils]: 52: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,980 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {21584#true} {21736#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} #50#return; {21736#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-08 04:36:10,980 INFO L290 TraceCheckUtils]: 54: Hoare triple {21736#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 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; {21758#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-08 04:36:10,980 INFO L290 TraceCheckUtils]: 55: Hoare triple {21758#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 6)) 1))} assume !false; {21758#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-08 04:36:10,980 INFO L272 TraceCheckUtils]: 56: Hoare triple {21758#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 6)) 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)); {21584#true} is VALID [2022-04-08 04:36:10,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,980 INFO L290 TraceCheckUtils]: 58: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,981 INFO L290 TraceCheckUtils]: 59: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,981 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {21584#true} {21758#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 6)) 1))} #50#return; {21758#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-08 04:36:10,981 INFO L290 TraceCheckUtils]: 61: Hoare triple {21758#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 6)) 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; {21780#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:36:10,982 INFO L290 TraceCheckUtils]: 62: Hoare triple {21780#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {21780#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:36:10,982 INFO L272 TraceCheckUtils]: 63: Hoare triple {21780#(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)); {21584#true} is VALID [2022-04-08 04:36:10,982 INFO L290 TraceCheckUtils]: 64: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,982 INFO L290 TraceCheckUtils]: 65: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,982 INFO L290 TraceCheckUtils]: 66: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,982 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {21584#true} {21780#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #50#return; {21780#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:36:10,983 INFO L290 TraceCheckUtils]: 68: Hoare triple {21780#(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; {21802#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 04:36:10,983 INFO L290 TraceCheckUtils]: 69: Hoare triple {21802#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {21802#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 04:36:10,983 INFO L272 TraceCheckUtils]: 70: Hoare triple {21802#(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)); {21584#true} is VALID [2022-04-08 04:36:10,983 INFO L290 TraceCheckUtils]: 71: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,983 INFO L290 TraceCheckUtils]: 72: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,983 INFO L290 TraceCheckUtils]: 73: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,984 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {21584#true} {21802#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #50#return; {21802#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 04:36:10,984 INFO L290 TraceCheckUtils]: 75: Hoare triple {21802#(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; {21824#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:36:10,984 INFO L290 TraceCheckUtils]: 76: Hoare triple {21824#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {21824#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:36:10,984 INFO L272 TraceCheckUtils]: 77: Hoare triple {21824#(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)); {21584#true} is VALID [2022-04-08 04:36:10,984 INFO L290 TraceCheckUtils]: 78: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,984 INFO L290 TraceCheckUtils]: 79: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,985 INFO L290 TraceCheckUtils]: 80: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,985 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {21584#true} {21824#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {21824#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:36:10,985 INFO L290 TraceCheckUtils]: 82: Hoare triple {21824#(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; {21846#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:36:10,986 INFO L290 TraceCheckUtils]: 83: Hoare triple {21846#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {21846#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:36:10,986 INFO L272 TraceCheckUtils]: 84: Hoare triple {21846#(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)); {21584#true} is VALID [2022-04-08 04:36:10,986 INFO L290 TraceCheckUtils]: 85: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,986 INFO L290 TraceCheckUtils]: 86: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,986 INFO L290 TraceCheckUtils]: 87: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,986 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {21584#true} {21846#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {21846#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:36:10,987 INFO L290 TraceCheckUtils]: 89: Hoare triple {21846#(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; {21868#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:36:10,987 INFO L290 TraceCheckUtils]: 90: Hoare triple {21868#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} assume !false; {21868#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:36:10,987 INFO L272 TraceCheckUtils]: 91: Hoare triple {21868#(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)); {21584#true} is VALID [2022-04-08 04:36:10,987 INFO L290 TraceCheckUtils]: 92: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,987 INFO L290 TraceCheckUtils]: 93: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,987 INFO L290 TraceCheckUtils]: 94: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,988 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {21584#true} {21868#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} #50#return; {21868#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:36:10,988 INFO L290 TraceCheckUtils]: 96: Hoare triple {21868#(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; {21890#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:36:10,988 INFO L290 TraceCheckUtils]: 97: Hoare triple {21890#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} assume !false; {21890#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:36:10,988 INFO L272 TraceCheckUtils]: 98: Hoare triple {21890#(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)); {21584#true} is VALID [2022-04-08 04:36:10,988 INFO L290 TraceCheckUtils]: 99: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,989 INFO L290 TraceCheckUtils]: 100: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,989 INFO L290 TraceCheckUtils]: 101: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,989 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {21584#true} {21890#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} #50#return; {21890#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:36:10,989 INFO L290 TraceCheckUtils]: 103: Hoare triple {21890#(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; {21912#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:36:10,991 INFO L290 TraceCheckUtils]: 104: Hoare triple {21912#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} assume !false; {21912#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:36:10,991 INFO L272 TraceCheckUtils]: 105: Hoare triple {21912#(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)); {21584#true} is VALID [2022-04-08 04:36:10,991 INFO L290 TraceCheckUtils]: 106: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,991 INFO L290 TraceCheckUtils]: 107: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,992 INFO L290 TraceCheckUtils]: 108: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,992 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {21584#true} {21912#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} #50#return; {21912#(and (= (+ (- 2) main_~y~0) 12) (= 10 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:36:10,993 INFO L290 TraceCheckUtils]: 110: Hoare triple {21912#(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; {21934#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 04:36:10,993 INFO L290 TraceCheckUtils]: 111: Hoare triple {21934#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} assume !false; {21934#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 04:36:10,993 INFO L272 TraceCheckUtils]: 112: Hoare triple {21934#(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)); {21584#true} is VALID [2022-04-08 04:36:10,993 INFO L290 TraceCheckUtils]: 113: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,993 INFO L290 TraceCheckUtils]: 114: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,993 INFO L290 TraceCheckUtils]: 115: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,994 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {21584#true} {21934#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} #50#return; {21934#(and (= (+ main_~c~0 (- 5)) 10) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 04:36:10,994 INFO L290 TraceCheckUtils]: 117: Hoare triple {21934#(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; {21956#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:36:10,995 INFO L290 TraceCheckUtils]: 118: Hoare triple {21956#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {21956#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:36:10,995 INFO L272 TraceCheckUtils]: 119: Hoare triple {21956#(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)); {21584#true} is VALID [2022-04-08 04:36:10,995 INFO L290 TraceCheckUtils]: 120: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,995 INFO L290 TraceCheckUtils]: 121: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,995 INFO L290 TraceCheckUtils]: 122: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,996 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {21584#true} {21956#(and (= main_~c~0 16) (= main_~y~0 16))} #50#return; {21956#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:36:10,996 INFO L290 TraceCheckUtils]: 124: Hoare triple {21956#(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; {21978#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 04:36:10,997 INFO L290 TraceCheckUtils]: 125: Hoare triple {21978#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {21978#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 04:36:10,997 INFO L272 TraceCheckUtils]: 126: Hoare triple {21978#(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)); {21584#true} is VALID [2022-04-08 04:36:10,997 INFO L290 TraceCheckUtils]: 127: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,997 INFO L290 TraceCheckUtils]: 128: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,997 INFO L290 TraceCheckUtils]: 129: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,997 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {21584#true} {21978#(and (= main_~c~0 17) (= main_~y~0 17))} #50#return; {21978#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 04:36:10,998 INFO L290 TraceCheckUtils]: 131: Hoare triple {21978#(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; {22000#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 04:36:10,998 INFO L290 TraceCheckUtils]: 132: Hoare triple {22000#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {22000#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 04:36:10,998 INFO L272 TraceCheckUtils]: 133: Hoare triple {22000#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21584#true} is VALID [2022-04-08 04:36:10,998 INFO L290 TraceCheckUtils]: 134: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:10,999 INFO L290 TraceCheckUtils]: 135: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:10,999 INFO L290 TraceCheckUtils]: 136: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:10,999 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {21584#true} {22000#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #50#return; {22000#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 04:36:11,000 INFO L290 TraceCheckUtils]: 138: Hoare triple {22000#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22022#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 04:36:11,000 INFO L290 TraceCheckUtils]: 139: Hoare triple {22022#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !false; {22022#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 04:36:11,000 INFO L272 TraceCheckUtils]: 140: Hoare triple {22022#(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)); {21584#true} is VALID [2022-04-08 04:36:11,000 INFO L290 TraceCheckUtils]: 141: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:11,000 INFO L290 TraceCheckUtils]: 142: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:11,000 INFO L290 TraceCheckUtils]: 143: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:11,001 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {21584#true} {22022#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} #50#return; {22022#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 04:36:11,002 INFO L290 TraceCheckUtils]: 145: Hoare triple {22022#(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; {22044#(and (= (+ main_~y~0 (- 3)) 17) (= main_~c~0 20))} is VALID [2022-04-08 04:36:11,002 INFO L290 TraceCheckUtils]: 146: Hoare triple {22044#(and (= (+ main_~y~0 (- 3)) 17) (= main_~c~0 20))} assume !false; {22044#(and (= (+ main_~y~0 (- 3)) 17) (= main_~c~0 20))} is VALID [2022-04-08 04:36:11,002 INFO L272 TraceCheckUtils]: 147: Hoare triple {22044#(and (= (+ main_~y~0 (- 3)) 17) (= 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)); {21584#true} is VALID [2022-04-08 04:36:11,002 INFO L290 TraceCheckUtils]: 148: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:11,002 INFO L290 TraceCheckUtils]: 149: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:11,002 INFO L290 TraceCheckUtils]: 150: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:11,003 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {21584#true} {22044#(and (= (+ main_~y~0 (- 3)) 17) (= main_~c~0 20))} #50#return; {22044#(and (= (+ main_~y~0 (- 3)) 17) (= main_~c~0 20))} is VALID [2022-04-08 04:36:11,003 INFO L290 TraceCheckUtils]: 152: Hoare triple {22044#(and (= (+ main_~y~0 (- 3)) 17) (= 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; {22066#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} is VALID [2022-04-08 04:36:11,004 INFO L290 TraceCheckUtils]: 153: Hoare triple {22066#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} assume !false; {22066#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} is VALID [2022-04-08 04:36:11,004 INFO L272 TraceCheckUtils]: 154: Hoare triple {22066#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 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)); {21584#true} is VALID [2022-04-08 04:36:11,004 INFO L290 TraceCheckUtils]: 155: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:11,004 INFO L290 TraceCheckUtils]: 156: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:11,004 INFO L290 TraceCheckUtils]: 157: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:11,004 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {21584#true} {22066#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} #50#return; {22066#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 17))} is VALID [2022-04-08 04:36:11,005 INFO L290 TraceCheckUtils]: 159: Hoare triple {22066#(and (= main_~c~0 21) (= (+ main_~y~0 (- 4)) 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; {22088#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 04:36:11,005 INFO L290 TraceCheckUtils]: 160: Hoare triple {22088#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {22088#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 04:36:11,005 INFO L272 TraceCheckUtils]: 161: Hoare triple {22088#(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)); {21584#true} is VALID [2022-04-08 04:36:11,005 INFO L290 TraceCheckUtils]: 162: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:11,005 INFO L290 TraceCheckUtils]: 163: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:11,006 INFO L290 TraceCheckUtils]: 164: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:11,006 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {21584#true} {22088#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #50#return; {22088#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 04:36:11,006 INFO L290 TraceCheckUtils]: 166: Hoare triple {22088#(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; {22110#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 04:36:11,007 INFO L290 TraceCheckUtils]: 167: Hoare triple {22110#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {22110#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 04:36:11,007 INFO L272 TraceCheckUtils]: 168: Hoare triple {22110#(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)); {21584#true} is VALID [2022-04-08 04:36:11,007 INFO L290 TraceCheckUtils]: 169: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:11,007 INFO L290 TraceCheckUtils]: 170: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:11,007 INFO L290 TraceCheckUtils]: 171: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:11,007 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {21584#true} {22110#(and (= 23 main_~y~0) (= 23 main_~c~0))} #50#return; {22110#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 04:36:11,008 INFO L290 TraceCheckUtils]: 173: Hoare triple {22110#(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; {22132#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 04:36:11,008 INFO L290 TraceCheckUtils]: 174: Hoare triple {22132#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {22132#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 04:36:11,008 INFO L272 TraceCheckUtils]: 175: Hoare triple {22132#(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)); {21584#true} is VALID [2022-04-08 04:36:11,008 INFO L290 TraceCheckUtils]: 176: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:11,008 INFO L290 TraceCheckUtils]: 177: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:11,008 INFO L290 TraceCheckUtils]: 178: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:11,009 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {21584#true} {22132#(and (= main_~c~0 24) (= main_~y~0 24))} #50#return; {22132#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 04:36:11,009 INFO L290 TraceCheckUtils]: 180: Hoare triple {22132#(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; {22154#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 04:36:11,009 INFO L290 TraceCheckUtils]: 181: Hoare triple {22154#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} assume !false; {22154#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 04:36:11,009 INFO L272 TraceCheckUtils]: 182: Hoare triple {22154#(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)); {21584#true} is VALID [2022-04-08 04:36:11,009 INFO L290 TraceCheckUtils]: 183: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:11,009 INFO L290 TraceCheckUtils]: 184: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:11,009 INFO L290 TraceCheckUtils]: 185: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:11,010 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {21584#true} {22154#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} #50#return; {22154#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 04:36:11,010 INFO L290 TraceCheckUtils]: 187: Hoare triple {22154#(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; {22176#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 04:36:11,011 INFO L290 TraceCheckUtils]: 188: Hoare triple {22176#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} assume !false; {22176#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 04:36:11,011 INFO L272 TraceCheckUtils]: 189: Hoare triple {22176#(and (= main_~c~0 26) (= (+ (- 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)); {21584#true} is VALID [2022-04-08 04:36:11,011 INFO L290 TraceCheckUtils]: 190: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:11,011 INFO L290 TraceCheckUtils]: 191: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:11,011 INFO L290 TraceCheckUtils]: 192: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:11,011 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {21584#true} {22176#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} #50#return; {22176#(and (= main_~c~0 26) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 04:36:11,012 INFO L290 TraceCheckUtils]: 194: Hoare triple {22176#(and (= main_~c~0 26) (= (+ (- 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; {22198#(and (<= main_~c~0 27) (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-08 04:36:11,012 INFO L290 TraceCheckUtils]: 195: Hoare triple {22198#(and (<= main_~c~0 27) (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25))} assume !false; {22198#(and (<= main_~c~0 27) (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-08 04:36:11,012 INFO L272 TraceCheckUtils]: 196: Hoare triple {22198#(and (<= main_~c~0 27) (< 26 main_~k~0) (= (+ (- 2) 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)); {21584#true} is VALID [2022-04-08 04:36:11,012 INFO L290 TraceCheckUtils]: 197: Hoare triple {21584#true} ~cond := #in~cond; {21584#true} is VALID [2022-04-08 04:36:11,012 INFO L290 TraceCheckUtils]: 198: Hoare triple {21584#true} assume !(0 == ~cond); {21584#true} is VALID [2022-04-08 04:36:11,012 INFO L290 TraceCheckUtils]: 199: Hoare triple {21584#true} assume true; {21584#true} is VALID [2022-04-08 04:36:11,013 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {21584#true} {22198#(and (<= main_~c~0 27) (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25))} #50#return; {22198#(and (<= main_~c~0 27) (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-08 04:36:11,013 INFO L290 TraceCheckUtils]: 201: Hoare triple {22198#(and (<= main_~c~0 27) (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25))} assume !(~c~0 < ~k~0); {22220#(and (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25) (<= main_~k~0 27))} is VALID [2022-04-08 04:36:11,014 INFO L272 TraceCheckUtils]: 202: Hoare triple {22220#(and (< 26 main_~k~0) (= (+ (- 2) main_~y~0) 25) (<= main_~k~0 27))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22224#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:36:11,014 INFO L290 TraceCheckUtils]: 203: Hoare triple {22224#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22228#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:36:11,014 INFO L290 TraceCheckUtils]: 204: Hoare triple {22228#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21585#false} is VALID [2022-04-08 04:36:11,014 INFO L290 TraceCheckUtils]: 205: Hoare triple {21585#false} assume !false; {21585#false} is VALID [2022-04-08 04:36:11,015 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-08 04:36:11,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:36:11,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:36:11,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538430740] [2022-04-08 04:36:11,393 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:36:11,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222407197] [2022-04-08 04:36:11,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222407197] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:36:11,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:36:11,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2022-04-08 04:36:11,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:36:11,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [457145628] [2022-04-08 04:36:11,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [457145628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:36:11,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:36:11,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-08 04:36:11,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894954018] [2022-04-08 04:36:11,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:36:11,395 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-08 04:36:11,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:36:11,395 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-08 04:36:11,597 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-08 04:36:11,597 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-08 04:36:11,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:11,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-08 04:36:11,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 04:36:11,598 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-08 04:36:22,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:22,177 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2022-04-08 04:36:22,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 04:36:22,177 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-08 04:36:22,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:36:22,178 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-08 04:36:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 134 transitions. [2022-04-08 04:36:22,181 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-08 04:36:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 134 transitions. [2022-04-08 04:36:22,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 134 transitions. [2022-04-08 04:36:22,569 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-08 04:36:22,570 INFO L225 Difference]: With dead ends: 111 [2022-04-08 04:36:22,571 INFO L226 Difference]: Without dead ends: 106 [2022-04-08 04:36:22,571 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=1294, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 04:36:22,572 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 2646 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s 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, 5.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:36:22,572 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1332 Invalid, 2646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2646 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-08 04:36:22,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-08 04:36:22,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-08 04:36:22,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:36:22,668 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-08 04:36:22,669 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-08 04:36:22,669 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-08 04:36:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:22,671 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-08 04:36:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-08 04:36:22,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:36:22,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:36:22,671 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-08 04:36:22,671 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-08 04:36:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:22,674 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-08 04:36:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-08 04:36:22,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:36:22,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:36:22,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:36:22,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:36:22,675 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-08 04:36:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2022-04-08 04:36:22,678 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 206 [2022-04-08 04:36:22,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:36:22,678 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2022-04-08 04:36:22,678 INFO L479 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-08 04:36:22,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 133 transitions. [2022-04-08 04:36:23,088 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-08 04:36:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-08 04:36:23,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-04-08 04:36:23,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:36:23,090 INFO L499 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:36:23,103 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-08 04:36:23,290 WARN L460 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-08 04:36:23,290 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:36:23,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:36:23,291 INFO L85 PathProgramCache]: Analyzing trace with hash 742317746, now seen corresponding path program 55 times [2022-04-08 04:36:23,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:23,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1445636856] [2022-04-08 04:36:23,381 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:36:23,381 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:36:23,381 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:36:23,382 INFO L85 PathProgramCache]: Analyzing trace with hash 742317746, now seen corresponding path program 56 times [2022-04-08 04:36:23,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:36:23,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260226996] [2022-04-08 04:36:23,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:36:23,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:36:23,401 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:36:23,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196535793] [2022-04-08 04:36:23,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:36:23,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:36:23,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:36:23,403 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-08 04:36:23,428 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-08 04:36:24,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:36:24,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:36:24,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 120 conjunts are in the unsatisfiable core [2022-04-08 04:36:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:36:24,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:36:25,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {22926#true} call ULTIMATE.init(); {22926#true} is VALID [2022-04-08 04:36:25,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {22926#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); {22926#true} is VALID [2022-04-08 04:36:25,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22926#true} {22926#true} #56#return; {22926#true} is VALID [2022-04-08 04:36:25,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {22926#true} call #t~ret5 := main(); {22926#true} is VALID [2022-04-08 04:36:25,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {22926#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; {22946#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:36:25,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {22946#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {22946#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:36:25,645 INFO L272 TraceCheckUtils]: 7: Hoare triple {22946#(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)); {22926#true} is VALID [2022-04-08 04:36:25,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,646 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {22926#true} {22946#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {22946#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:36:25,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {22946#(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; {22968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:36:25,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {22968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {22968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:36:25,647 INFO L272 TraceCheckUtils]: 14: Hoare triple {22968#(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)); {22926#true} is VALID [2022-04-08 04:36:25,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,648 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22926#true} {22968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {22968#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:36:25,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {22968#(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; {22990#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:36:25,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {22990#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {22990#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:36:25,649 INFO L272 TraceCheckUtils]: 21: Hoare triple {22990#(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)); {22926#true} is VALID [2022-04-08 04:36:25,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,649 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22926#true} {22990#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {22990#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:36:25,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {22990#(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; {23012#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:36:25,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {23012#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {23012#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:36:25,650 INFO L272 TraceCheckUtils]: 28: Hoare triple {23012#(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)); {22926#true} is VALID [2022-04-08 04:36:25,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,651 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {22926#true} {23012#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #50#return; {23012#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:36:25,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {23012#(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; {23034#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:36:25,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {23034#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {23034#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:36:25,652 INFO L272 TraceCheckUtils]: 35: Hoare triple {23034#(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)); {22926#true} is VALID [2022-04-08 04:36:25,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,653 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22926#true} {23034#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #50#return; {23034#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:36:25,653 INFO L290 TraceCheckUtils]: 40: Hoare triple {23034#(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; {23056#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-08 04:36:25,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {23056#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !false; {23056#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-08 04:36:25,654 INFO L272 TraceCheckUtils]: 42: Hoare triple {23056#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 04:36:25,654 INFO L290 TraceCheckUtils]: 43: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,655 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22926#true} {23056#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} #50#return; {23056#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-08 04:36:25,655 INFO L290 TraceCheckUtils]: 47: Hoare triple {23056#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23078#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:36:25,656 INFO L290 TraceCheckUtils]: 48: Hoare triple {23078#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {23078#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:36:25,656 INFO L272 TraceCheckUtils]: 49: Hoare triple {23078#(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)); {22926#true} is VALID [2022-04-08 04:36:25,656 INFO L290 TraceCheckUtils]: 50: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,656 INFO L290 TraceCheckUtils]: 51: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,656 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {22926#true} {23078#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {23078#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:36:25,657 INFO L290 TraceCheckUtils]: 54: Hoare triple {23078#(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; {23100#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:36:25,657 INFO L290 TraceCheckUtils]: 55: Hoare triple {23100#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {23100#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:36:25,657 INFO L272 TraceCheckUtils]: 56: Hoare triple {23100#(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)); {22926#true} is VALID [2022-04-08 04:36:25,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,658 INFO L290 TraceCheckUtils]: 58: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,658 INFO L290 TraceCheckUtils]: 59: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,658 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {22926#true} {23100#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #50#return; {23100#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:36:25,659 INFO L290 TraceCheckUtils]: 61: Hoare triple {23100#(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; {23122#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 04:36:25,659 INFO L290 TraceCheckUtils]: 62: Hoare triple {23122#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {23122#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 04:36:25,659 INFO L272 TraceCheckUtils]: 63: Hoare triple {23122#(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)); {22926#true} is VALID [2022-04-08 04:36:25,659 INFO L290 TraceCheckUtils]: 64: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,659 INFO L290 TraceCheckUtils]: 66: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,660 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {22926#true} {23122#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #50#return; {23122#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 04:36:25,660 INFO L290 TraceCheckUtils]: 68: Hoare triple {23122#(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; {23144#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 04:36:25,661 INFO L290 TraceCheckUtils]: 69: Hoare triple {23144#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {23144#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 04:36:25,661 INFO L272 TraceCheckUtils]: 70: Hoare triple {23144#(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)); {22926#true} is VALID [2022-04-08 04:36:25,661 INFO L290 TraceCheckUtils]: 71: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,661 INFO L290 TraceCheckUtils]: 72: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,661 INFO L290 TraceCheckUtils]: 73: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,662 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22926#true} {23144#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {23144#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 04:36:25,662 INFO L290 TraceCheckUtils]: 75: Hoare triple {23144#(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; {23166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:36:25,662 INFO L290 TraceCheckUtils]: 76: Hoare triple {23166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {23166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:36:25,663 INFO L272 TraceCheckUtils]: 77: Hoare triple {23166#(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)); {22926#true} is VALID [2022-04-08 04:36:25,663 INFO L290 TraceCheckUtils]: 78: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,663 INFO L290 TraceCheckUtils]: 79: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,663 INFO L290 TraceCheckUtils]: 80: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,663 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {22926#true} {23166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #50#return; {23166#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:36:25,664 INFO L290 TraceCheckUtils]: 82: Hoare triple {23166#(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; {23188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 04:36:25,664 INFO L290 TraceCheckUtils]: 83: Hoare triple {23188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {23188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 04:36:25,664 INFO L272 TraceCheckUtils]: 84: Hoare triple {23188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 04:36:25,664 INFO L290 TraceCheckUtils]: 85: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,664 INFO L290 TraceCheckUtils]: 86: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,664 INFO L290 TraceCheckUtils]: 87: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,665 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {22926#true} {23188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #50#return; {23188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 04:36:25,665 INFO L290 TraceCheckUtils]: 89: Hoare triple {23188#(and (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23210#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:36:25,666 INFO L290 TraceCheckUtils]: 90: Hoare triple {23210#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !false; {23210#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:36:25,666 INFO L272 TraceCheckUtils]: 91: Hoare triple {23210#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 04:36:25,666 INFO L290 TraceCheckUtils]: 92: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,666 INFO L290 TraceCheckUtils]: 93: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,666 INFO L290 TraceCheckUtils]: 94: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,667 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {22926#true} {23210#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} #50#return; {23210#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:36:25,667 INFO L290 TraceCheckUtils]: 96: Hoare triple {23210#(and (= 9 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23232#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 04:36:25,668 INFO L290 TraceCheckUtils]: 97: Hoare triple {23232#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !false; {23232#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 04:36:25,668 INFO L272 TraceCheckUtils]: 98: Hoare triple {23232#(and (= (+ (- 2) main_~y~0) 11) (= 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)); {22926#true} is VALID [2022-04-08 04:36:25,668 INFO L290 TraceCheckUtils]: 99: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,668 INFO L290 TraceCheckUtils]: 100: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,668 INFO L290 TraceCheckUtils]: 101: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,668 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {22926#true} {23232#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #50#return; {23232#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 04:36:25,669 INFO L290 TraceCheckUtils]: 103: Hoare triple {23232#(and (= (+ (- 2) main_~y~0) 11) (= 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; {23254#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} is VALID [2022-04-08 04:36:25,669 INFO L290 TraceCheckUtils]: 104: Hoare triple {23254#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} assume !false; {23254#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} is VALID [2022-04-08 04:36:25,669 INFO L272 TraceCheckUtils]: 105: Hoare triple {23254#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 04:36:25,670 INFO L290 TraceCheckUtils]: 106: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,670 INFO L290 TraceCheckUtils]: 107: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,670 INFO L290 TraceCheckUtils]: 108: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,670 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {22926#true} {23254#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} #50#return; {23254#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} is VALID [2022-04-08 04:36:25,671 INFO L290 TraceCheckUtils]: 110: Hoare triple {23254#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23276#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 04:36:25,671 INFO L290 TraceCheckUtils]: 111: Hoare triple {23276#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {23276#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 04:36:25,671 INFO L272 TraceCheckUtils]: 112: Hoare triple {23276#(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)); {22926#true} is VALID [2022-04-08 04:36:25,671 INFO L290 TraceCheckUtils]: 113: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,671 INFO L290 TraceCheckUtils]: 114: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,672 INFO L290 TraceCheckUtils]: 115: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,672 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {22926#true} {23276#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #50#return; {23276#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 04:36:25,673 INFO L290 TraceCheckUtils]: 117: Hoare triple {23276#(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; {23298#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 04:36:25,673 INFO L290 TraceCheckUtils]: 118: Hoare triple {23298#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} assume !false; {23298#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 04:36:25,673 INFO L272 TraceCheckUtils]: 119: Hoare triple {23298#(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)); {22926#true} is VALID [2022-04-08 04:36:25,673 INFO L290 TraceCheckUtils]: 120: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,673 INFO L290 TraceCheckUtils]: 121: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,673 INFO L290 TraceCheckUtils]: 122: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,674 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {22926#true} {23298#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} #50#return; {23298#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 04:36:25,674 INFO L290 TraceCheckUtils]: 124: Hoare triple {23298#(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; {23320#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-08 04:36:25,675 INFO L290 TraceCheckUtils]: 125: Hoare triple {23320#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} assume !false; {23320#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-08 04:36:25,675 INFO L272 TraceCheckUtils]: 126: Hoare triple {23320#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 04:36:25,675 INFO L290 TraceCheckUtils]: 127: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,675 INFO L290 TraceCheckUtils]: 128: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,675 INFO L290 TraceCheckUtils]: 129: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,675 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {22926#true} {23320#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} #50#return; {23320#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-08 04:36:25,676 INFO L290 TraceCheckUtils]: 131: Hoare triple {23320#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23342#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:36:25,676 INFO L290 TraceCheckUtils]: 132: Hoare triple {23342#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {23342#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:36:25,676 INFO L272 TraceCheckUtils]: 133: Hoare triple {23342#(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)); {22926#true} is VALID [2022-04-08 04:36:25,677 INFO L290 TraceCheckUtils]: 134: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,677 INFO L290 TraceCheckUtils]: 135: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,677 INFO L290 TraceCheckUtils]: 136: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,677 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {22926#true} {23342#(and (= main_~c~0 18) (= main_~y~0 18))} #50#return; {23342#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:36:25,678 INFO L290 TraceCheckUtils]: 138: Hoare triple {23342#(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; {23364#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 04:36:25,678 INFO L290 TraceCheckUtils]: 139: Hoare triple {23364#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !false; {23364#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 04:36:25,678 INFO L272 TraceCheckUtils]: 140: Hoare triple {23364#(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)); {22926#true} is VALID [2022-04-08 04:36:25,678 INFO L290 TraceCheckUtils]: 141: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,679 INFO L290 TraceCheckUtils]: 142: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,679 INFO L290 TraceCheckUtils]: 143: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,679 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {22926#true} {23364#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} #50#return; {23364#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 04:36:25,680 INFO L290 TraceCheckUtils]: 145: Hoare triple {23364#(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; {23386#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 04:36:25,680 INFO L290 TraceCheckUtils]: 146: Hoare triple {23386#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {23386#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 04:36:25,680 INFO L272 TraceCheckUtils]: 147: Hoare triple {23386#(and (= main_~c~0 20) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 04:36:25,680 INFO L290 TraceCheckUtils]: 148: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,680 INFO L290 TraceCheckUtils]: 149: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,681 INFO L290 TraceCheckUtils]: 150: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,681 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {22926#true} {23386#(and (= main_~c~0 20) (= main_~y~0 20))} #50#return; {23386#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 04:36:25,682 INFO L290 TraceCheckUtils]: 152: Hoare triple {23386#(and (= main_~c~0 20) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23408#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 04:36:25,682 INFO L290 TraceCheckUtils]: 153: Hoare triple {23408#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {23408#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 04:36:25,682 INFO L272 TraceCheckUtils]: 154: Hoare triple {23408#(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)); {22926#true} is VALID [2022-04-08 04:36:25,682 INFO L290 TraceCheckUtils]: 155: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,682 INFO L290 TraceCheckUtils]: 156: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,682 INFO L290 TraceCheckUtils]: 157: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,683 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {22926#true} {23408#(and (= main_~c~0 21) (= main_~y~0 21))} #50#return; {23408#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 04:36:25,684 INFO L290 TraceCheckUtils]: 159: Hoare triple {23408#(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; {23430#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 04:36:25,684 INFO L290 TraceCheckUtils]: 160: Hoare triple {23430#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {23430#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 04:36:25,684 INFO L272 TraceCheckUtils]: 161: Hoare triple {23430#(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)); {22926#true} is VALID [2022-04-08 04:36:25,684 INFO L290 TraceCheckUtils]: 162: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,684 INFO L290 TraceCheckUtils]: 163: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,684 INFO L290 TraceCheckUtils]: 164: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,685 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {22926#true} {23430#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #50#return; {23430#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 04:36:25,686 INFO L290 TraceCheckUtils]: 166: Hoare triple {23430#(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; {23452#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:36:25,686 INFO L290 TraceCheckUtils]: 167: Hoare triple {23452#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} assume !false; {23452#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:36:25,686 INFO L272 TraceCheckUtils]: 168: Hoare triple {23452#(and (= 21 (+ (- 2) 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)); {22926#true} is VALID [2022-04-08 04:36:25,686 INFO L290 TraceCheckUtils]: 169: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,686 INFO L290 TraceCheckUtils]: 170: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,686 INFO L290 TraceCheckUtils]: 171: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,687 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {22926#true} {23452#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} #50#return; {23452#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:36:25,688 INFO L290 TraceCheckUtils]: 173: Hoare triple {23452#(and (= 21 (+ (- 2) 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; {23474#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-08 04:36:25,688 INFO L290 TraceCheckUtils]: 174: Hoare triple {23474#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} assume !false; {23474#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-08 04:36:25,688 INFO L272 TraceCheckUtils]: 175: Hoare triple {23474#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 04:36:25,688 INFO L290 TraceCheckUtils]: 176: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,688 INFO L290 TraceCheckUtils]: 177: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,688 INFO L290 TraceCheckUtils]: 178: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,689 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {22926#true} {23474#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} #50#return; {23474#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-08 04:36:25,689 INFO L290 TraceCheckUtils]: 180: Hoare triple {23474#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23496#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} is VALID [2022-04-08 04:36:25,690 INFO L290 TraceCheckUtils]: 181: Hoare triple {23496#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} assume !false; {23496#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} is VALID [2022-04-08 04:36:25,690 INFO L272 TraceCheckUtils]: 182: Hoare triple {23496#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22926#true} is VALID [2022-04-08 04:36:25,690 INFO L290 TraceCheckUtils]: 183: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,690 INFO L290 TraceCheckUtils]: 184: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,690 INFO L290 TraceCheckUtils]: 185: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,691 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {22926#true} {23496#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} #50#return; {23496#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} is VALID [2022-04-08 04:36:25,691 INFO L290 TraceCheckUtils]: 187: Hoare triple {23496#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23518#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 04:36:25,692 INFO L290 TraceCheckUtils]: 188: Hoare triple {23518#(and (= main_~c~0 26) (= main_~y~0 26))} assume !false; {23518#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 04:36:25,692 INFO L272 TraceCheckUtils]: 189: Hoare triple {23518#(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)); {22926#true} is VALID [2022-04-08 04:36:25,692 INFO L290 TraceCheckUtils]: 190: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,692 INFO L290 TraceCheckUtils]: 191: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,692 INFO L290 TraceCheckUtils]: 192: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,693 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {22926#true} {23518#(and (= main_~c~0 26) (= main_~y~0 26))} #50#return; {23518#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 04:36:25,693 INFO L290 TraceCheckUtils]: 194: Hoare triple {23518#(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; {23540#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 04:36:25,693 INFO L290 TraceCheckUtils]: 195: Hoare triple {23540#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {23540#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 04:36:25,693 INFO L272 TraceCheckUtils]: 196: Hoare triple {23540#(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)); {22926#true} is VALID [2022-04-08 04:36:25,694 INFO L290 TraceCheckUtils]: 197: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,694 INFO L290 TraceCheckUtils]: 198: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,694 INFO L290 TraceCheckUtils]: 199: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,694 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {22926#true} {23540#(and (= main_~y~0 27) (= main_~c~0 27))} #50#return; {23540#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 04:36:25,695 INFO L290 TraceCheckUtils]: 201: Hoare triple {23540#(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; {23562#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-08 04:36:25,695 INFO L290 TraceCheckUtils]: 202: Hoare triple {23562#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} assume !false; {23562#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-08 04:36:25,695 INFO L272 TraceCheckUtils]: 203: Hoare triple {23562#(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)); {22926#true} is VALID [2022-04-08 04:36:25,695 INFO L290 TraceCheckUtils]: 204: Hoare triple {22926#true} ~cond := #in~cond; {22926#true} is VALID [2022-04-08 04:36:25,695 INFO L290 TraceCheckUtils]: 205: Hoare triple {22926#true} assume !(0 == ~cond); {22926#true} is VALID [2022-04-08 04:36:25,696 INFO L290 TraceCheckUtils]: 206: Hoare triple {22926#true} assume true; {22926#true} is VALID [2022-04-08 04:36:25,696 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {22926#true} {23562#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} #50#return; {23562#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-08 04:36:25,697 INFO L290 TraceCheckUtils]: 208: Hoare triple {23562#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} assume !(~c~0 < ~k~0); {23584#(and (<= main_~k~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-08 04:36:25,697 INFO L272 TraceCheckUtils]: 209: Hoare triple {23584#(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)); {23588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:36:25,698 INFO L290 TraceCheckUtils]: 210: Hoare triple {23588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:36:25,698 INFO L290 TraceCheckUtils]: 211: Hoare triple {23592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22927#false} is VALID [2022-04-08 04:36:25,698 INFO L290 TraceCheckUtils]: 212: Hoare triple {22927#false} assume !false; {22927#false} is VALID [2022-04-08 04:36:25,700 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-08 04:36:25,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:36:26,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:36:26,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260226996] [2022-04-08 04:36:26,129 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:36:26,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196535793] [2022-04-08 04:36:26,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196535793] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:36:26,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:36:26,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2022-04-08 04:36:26,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:36:26,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1445636856] [2022-04-08 04:36:26,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1445636856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:36:26,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:36:26,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-08 04:36:26,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650737060] [2022-04-08 04:36:26,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:36:26,130 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-08 04:36:26,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:36:26,130 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-08 04:36:26,337 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-08 04:36:26,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-08 04:36:26,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:26,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-08 04:36:26,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 04:36:26,338 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-08 04:36:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:37,806 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2022-04-08 04:36:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 04:36:37,806 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-08 04:36:37,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:36:37,807 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-08 04:36:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 138 transitions. [2022-04-08 04:36:37,809 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-08 04:36:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 138 transitions. [2022-04-08 04:36:37,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 138 transitions. [2022-04-08 04:36:38,110 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-08 04:36:38,111 INFO L225 Difference]: With dead ends: 114 [2022-04-08 04:36:38,111 INFO L226 Difference]: Without dead ends: 109 [2022-04-08 04:36:38,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 04:36:38,112 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 2827 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s 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, 6.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:36:38,112 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1407 Invalid, 2827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2827 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-04-08 04:36:38,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-08 04:36:38,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-08 04:36:38,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:36:38,216 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-08 04:36:38,216 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-08 04:36:38,216 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-08 04:36:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:38,219 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2022-04-08 04:36:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2022-04-08 04:36:38,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:36:38,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:36:38,220 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-08 04:36:38,220 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-08 04:36:38,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:38,223 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2022-04-08 04:36:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2022-04-08 04:36:38,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:36:38,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:36:38,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:36:38,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:36:38,224 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-08 04:36:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 137 transitions. [2022-04-08 04:36:38,234 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 137 transitions. Word has length 213 [2022-04-08 04:36:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:36:38,235 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 137 transitions. [2022-04-08 04:36:38,235 INFO L479 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-08 04:36:38,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 137 transitions. [2022-04-08 04:36:38,732 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-08 04:36:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2022-04-08 04:36:38,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-04-08 04:36:38,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:36:38,733 INFO L499 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:36:38,739 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-08 04:36:38,935 WARN L460 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-08 04:36:38,935 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:36:38,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:36:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1612769317, now seen corresponding path program 57 times [2022-04-08 04:36:38,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:38,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [981591477] [2022-04-08 04:36:39,013 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:36:39,013 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:36:39,013 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:36:39,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1612769317, now seen corresponding path program 58 times [2022-04-08 04:36:39,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:36:39,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222326346] [2022-04-08 04:36:39,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:36:39,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:36:39,028 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:36:39,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010226183] [2022-04-08 04:36:39,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:36:39,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:36:39,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:36:39,030 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-08 04:36:39,031 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-08 04:36:45,055 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:36:45,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:36:45,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 124 conjunts are in the unsatisfiable core [2022-04-08 04:36:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:36:45,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:36:46,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {24308#true} call ULTIMATE.init(); {24308#true} is VALID [2022-04-08 04:36:46,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {24308#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); {24308#true} is VALID [2022-04-08 04:36:46,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24308#true} {24308#true} #56#return; {24308#true} is VALID [2022-04-08 04:36:46,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {24308#true} call #t~ret5 := main(); {24308#true} is VALID [2022-04-08 04:36:46,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {24308#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; {24328#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:36:46,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {24328#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {24328#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:36:46,367 INFO L272 TraceCheckUtils]: 7: Hoare triple {24328#(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)); {24308#true} is VALID [2022-04-08 04:36:46,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,372 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {24308#true} {24328#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {24328#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:36:46,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {24328#(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; {24350#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:36:46,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {24350#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {24350#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:36:46,373 INFO L272 TraceCheckUtils]: 14: Hoare triple {24350#(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)); {24308#true} is VALID [2022-04-08 04:36:46,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,374 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {24308#true} {24350#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {24350#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:36:46,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {24350#(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; {24372#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:36:46,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {24372#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {24372#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:36:46,375 INFO L272 TraceCheckUtils]: 21: Hoare triple {24372#(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)); {24308#true} is VALID [2022-04-08 04:36:46,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,376 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {24308#true} {24372#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {24372#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:36:46,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {24372#(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; {24394#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:36:46,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {24394#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {24394#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:36:46,377 INFO L272 TraceCheckUtils]: 28: Hoare triple {24394#(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)); {24308#true} is VALID [2022-04-08 04:36:46,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,378 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {24308#true} {24394#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #50#return; {24394#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:36:46,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {24394#(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; {24416#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:36:46,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {24416#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {24416#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:36:46,379 INFO L272 TraceCheckUtils]: 35: Hoare triple {24416#(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)); {24308#true} is VALID [2022-04-08 04:36:46,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,380 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {24308#true} {24416#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #50#return; {24416#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:36:46,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {24416#(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; {24438#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:36:46,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {24438#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {24438#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:36:46,381 INFO L272 TraceCheckUtils]: 42: Hoare triple {24438#(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)); {24308#true} is VALID [2022-04-08 04:36:46,381 INFO L290 TraceCheckUtils]: 43: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,382 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24308#true} {24438#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {24438#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:36:46,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {24438#(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; {24460#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:36:46,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {24460#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {24460#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:36:46,383 INFO L272 TraceCheckUtils]: 49: Hoare triple {24460#(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)); {24308#true} is VALID [2022-04-08 04:36:46,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,383 INFO L290 TraceCheckUtils]: 52: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,383 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {24308#true} {24460#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {24460#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:36:46,384 INFO L290 TraceCheckUtils]: 54: Hoare triple {24460#(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; {24482#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:36:46,384 INFO L290 TraceCheckUtils]: 55: Hoare triple {24482#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {24482#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:36:46,385 INFO L272 TraceCheckUtils]: 56: Hoare triple {24482#(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)); {24308#true} is VALID [2022-04-08 04:36:46,385 INFO L290 TraceCheckUtils]: 57: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,385 INFO L290 TraceCheckUtils]: 58: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,385 INFO L290 TraceCheckUtils]: 59: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,385 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {24308#true} {24482#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #50#return; {24482#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:36:46,386 INFO L290 TraceCheckUtils]: 61: Hoare triple {24482#(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; {24504#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 04:36:46,386 INFO L290 TraceCheckUtils]: 62: Hoare triple {24504#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {24504#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 04:36:46,386 INFO L272 TraceCheckUtils]: 63: Hoare triple {24504#(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)); {24308#true} is VALID [2022-04-08 04:36:46,387 INFO L290 TraceCheckUtils]: 64: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,387 INFO L290 TraceCheckUtils]: 65: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,387 INFO L290 TraceCheckUtils]: 66: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,387 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {24308#true} {24504#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #50#return; {24504#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 04:36:46,388 INFO L290 TraceCheckUtils]: 68: Hoare triple {24504#(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; {24526#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:36:46,388 INFO L290 TraceCheckUtils]: 69: Hoare triple {24526#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} assume !false; {24526#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:36:46,388 INFO L272 TraceCheckUtils]: 70: Hoare triple {24526#(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)); {24308#true} is VALID [2022-04-08 04:36:46,388 INFO L290 TraceCheckUtils]: 71: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,389 INFO L290 TraceCheckUtils]: 72: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,389 INFO L290 TraceCheckUtils]: 73: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,389 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24308#true} {24526#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} #50#return; {24526#(and (= (+ main_~y~0 (- 3)) 6) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:36:46,390 INFO L290 TraceCheckUtils]: 75: Hoare triple {24526#(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; {24548#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:36:46,390 INFO L290 TraceCheckUtils]: 76: Hoare triple {24548#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} assume !false; {24548#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:36:46,390 INFO L272 TraceCheckUtils]: 77: Hoare triple {24548#(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)); {24308#true} is VALID [2022-04-08 04:36:46,390 INFO L290 TraceCheckUtils]: 78: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,390 INFO L290 TraceCheckUtils]: 79: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,390 INFO L290 TraceCheckUtils]: 80: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,391 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {24308#true} {24548#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} #50#return; {24548#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:36:46,392 INFO L290 TraceCheckUtils]: 82: Hoare triple {24548#(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; {24570#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:36:46,392 INFO L290 TraceCheckUtils]: 83: Hoare triple {24570#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {24570#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:36:46,392 INFO L272 TraceCheckUtils]: 84: Hoare triple {24570#(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)); {24308#true} is VALID [2022-04-08 04:36:46,392 INFO L290 TraceCheckUtils]: 85: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,392 INFO L290 TraceCheckUtils]: 86: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,392 INFO L290 TraceCheckUtils]: 87: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,393 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {24308#true} {24570#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {24570#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:36:46,393 INFO L290 TraceCheckUtils]: 89: Hoare triple {24570#(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; {24592#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:36:46,394 INFO L290 TraceCheckUtils]: 90: Hoare triple {24592#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {24592#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:36:46,394 INFO L272 TraceCheckUtils]: 91: Hoare triple {24592#(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)); {24308#true} is VALID [2022-04-08 04:36:46,394 INFO L290 TraceCheckUtils]: 92: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,394 INFO L290 TraceCheckUtils]: 93: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,394 INFO L290 TraceCheckUtils]: 94: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,395 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {24308#true} {24592#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {24592#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:36:46,395 INFO L290 TraceCheckUtils]: 96: Hoare triple {24592#(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; {24614#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:36:46,396 INFO L290 TraceCheckUtils]: 97: Hoare triple {24614#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !false; {24614#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:36:46,396 INFO L272 TraceCheckUtils]: 98: Hoare triple {24614#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 04:36:46,396 INFO L290 TraceCheckUtils]: 99: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,396 INFO L290 TraceCheckUtils]: 100: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,396 INFO L290 TraceCheckUtils]: 101: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,397 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {24308#true} {24614#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} #50#return; {24614#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:36:46,397 INFO L290 TraceCheckUtils]: 103: Hoare triple {24614#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24636#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-08 04:36:46,397 INFO L290 TraceCheckUtils]: 104: Hoare triple {24636#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} assume !false; {24636#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-08 04:36:46,397 INFO L272 TraceCheckUtils]: 105: Hoare triple {24636#(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)); {24308#true} is VALID [2022-04-08 04:36:46,398 INFO L290 TraceCheckUtils]: 106: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,398 INFO L290 TraceCheckUtils]: 107: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,398 INFO L290 TraceCheckUtils]: 108: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,398 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {24308#true} {24636#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} #50#return; {24636#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-08 04:36:46,399 INFO L290 TraceCheckUtils]: 110: Hoare triple {24636#(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; {24658#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 04:36:46,399 INFO L290 TraceCheckUtils]: 111: Hoare triple {24658#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12))} assume !false; {24658#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 04:36:46,399 INFO L272 TraceCheckUtils]: 112: Hoare triple {24658#(and (= main_~c~0 15) (= (+ 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)); {24308#true} is VALID [2022-04-08 04:36:46,399 INFO L290 TraceCheckUtils]: 113: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,399 INFO L290 TraceCheckUtils]: 114: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,399 INFO L290 TraceCheckUtils]: 115: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,400 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {24308#true} {24658#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12))} #50#return; {24658#(and (= main_~c~0 15) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 04:36:46,400 INFO L290 TraceCheckUtils]: 117: Hoare triple {24658#(and (= main_~c~0 15) (= (+ 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; {24680#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-08 04:36:46,401 INFO L290 TraceCheckUtils]: 118: Hoare triple {24680#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 4)) 12))} assume !false; {24680#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-08 04:36:46,401 INFO L272 TraceCheckUtils]: 119: Hoare triple {24680#(and (= (+ (- 1) main_~c~0) 15) (= (+ 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)); {24308#true} is VALID [2022-04-08 04:36:46,401 INFO L290 TraceCheckUtils]: 120: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,401 INFO L290 TraceCheckUtils]: 121: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,401 INFO L290 TraceCheckUtils]: 122: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,402 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {24308#true} {24680#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 4)) 12))} #50#return; {24680#(and (= (+ (- 1) main_~c~0) 15) (= (+ main_~y~0 (- 4)) 12))} is VALID [2022-04-08 04:36:46,402 INFO L290 TraceCheckUtils]: 124: Hoare triple {24680#(and (= (+ (- 1) main_~c~0) 15) (= (+ 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; {24702#(and (= main_~c~0 17) (= (+ main_~y~0 (- 5)) 12))} is VALID [2022-04-08 04:36:46,402 INFO L290 TraceCheckUtils]: 125: Hoare triple {24702#(and (= main_~c~0 17) (= (+ main_~y~0 (- 5)) 12))} assume !false; {24702#(and (= main_~c~0 17) (= (+ main_~y~0 (- 5)) 12))} is VALID [2022-04-08 04:36:46,403 INFO L272 TraceCheckUtils]: 126: Hoare triple {24702#(and (= main_~c~0 17) (= (+ main_~y~0 (- 5)) 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)); {24308#true} is VALID [2022-04-08 04:36:46,403 INFO L290 TraceCheckUtils]: 127: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,403 INFO L290 TraceCheckUtils]: 128: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,403 INFO L290 TraceCheckUtils]: 129: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,403 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {24308#true} {24702#(and (= main_~c~0 17) (= (+ main_~y~0 (- 5)) 12))} #50#return; {24702#(and (= main_~c~0 17) (= (+ main_~y~0 (- 5)) 12))} is VALID [2022-04-08 04:36:46,404 INFO L290 TraceCheckUtils]: 131: Hoare triple {24702#(and (= main_~c~0 17) (= (+ main_~y~0 (- 5)) 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; {24724#(and (= (+ main_~y~0 (- 6)) 12) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 04:36:46,404 INFO L290 TraceCheckUtils]: 132: Hoare triple {24724#(and (= (+ main_~y~0 (- 6)) 12) (= (+ (- 1) main_~c~0) 17))} assume !false; {24724#(and (= (+ main_~y~0 (- 6)) 12) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 04:36:46,404 INFO L272 TraceCheckUtils]: 133: Hoare triple {24724#(and (= (+ main_~y~0 (- 6)) 12) (= (+ (- 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)); {24308#true} is VALID [2022-04-08 04:36:46,404 INFO L290 TraceCheckUtils]: 134: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,404 INFO L290 TraceCheckUtils]: 135: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,405 INFO L290 TraceCheckUtils]: 136: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,405 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {24308#true} {24724#(and (= (+ main_~y~0 (- 6)) 12) (= (+ (- 1) main_~c~0) 17))} #50#return; {24724#(and (= (+ main_~y~0 (- 6)) 12) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 04:36:46,405 INFO L290 TraceCheckUtils]: 138: Hoare triple {24724#(and (= (+ main_~y~0 (- 6)) 12) (= (+ (- 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; {24746#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 04:36:46,406 INFO L290 TraceCheckUtils]: 139: Hoare triple {24746#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !false; {24746#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 04:36:46,406 INFO L272 TraceCheckUtils]: 140: Hoare triple {24746#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 04:36:46,406 INFO L290 TraceCheckUtils]: 141: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,406 INFO L290 TraceCheckUtils]: 142: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,406 INFO L290 TraceCheckUtils]: 143: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,407 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {24308#true} {24746#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} #50#return; {24746#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} is VALID [2022-04-08 04:36:46,407 INFO L290 TraceCheckUtils]: 145: Hoare triple {24746#(and (= 17 (+ (- 2) main_~c~0)) (= 19 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24768#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} is VALID [2022-04-08 04:36:46,408 INFO L290 TraceCheckUtils]: 146: Hoare triple {24768#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} assume !false; {24768#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} is VALID [2022-04-08 04:36:46,408 INFO L272 TraceCheckUtils]: 147: Hoare triple {24768#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 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)); {24308#true} is VALID [2022-04-08 04:36:46,408 INFO L290 TraceCheckUtils]: 148: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,408 INFO L290 TraceCheckUtils]: 149: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,408 INFO L290 TraceCheckUtils]: 150: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,408 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {24308#true} {24768#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} #50#return; {24768#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 17))} is VALID [2022-04-08 04:36:46,409 INFO L290 TraceCheckUtils]: 152: Hoare triple {24768#(and (= 19 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 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; {24790#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} is VALID [2022-04-08 04:36:46,409 INFO L290 TraceCheckUtils]: 153: Hoare triple {24790#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} assume !false; {24790#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} is VALID [2022-04-08 04:36:46,409 INFO L272 TraceCheckUtils]: 154: Hoare triple {24790#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 04:36:46,409 INFO L290 TraceCheckUtils]: 155: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,409 INFO L290 TraceCheckUtils]: 156: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,410 INFO L290 TraceCheckUtils]: 157: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,410 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {24308#true} {24790#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} #50#return; {24790#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} is VALID [2022-04-08 04:36:46,410 INFO L290 TraceCheckUtils]: 159: Hoare triple {24790#(and (= 17 (+ main_~c~0 (- 4))) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24812#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 04:36:46,411 INFO L290 TraceCheckUtils]: 160: Hoare triple {24812#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {24812#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 04:36:46,411 INFO L272 TraceCheckUtils]: 161: Hoare triple {24812#(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)); {24308#true} is VALID [2022-04-08 04:36:46,411 INFO L290 TraceCheckUtils]: 162: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,411 INFO L290 TraceCheckUtils]: 163: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,411 INFO L290 TraceCheckUtils]: 164: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,412 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {24308#true} {24812#(and (= main_~y~0 22) (= main_~c~0 22))} #50#return; {24812#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 04:36:46,412 INFO L290 TraceCheckUtils]: 166: Hoare triple {24812#(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; {24834#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 04:36:46,412 INFO L290 TraceCheckUtils]: 167: Hoare triple {24834#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {24834#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 04:36:46,412 INFO L272 TraceCheckUtils]: 168: Hoare triple {24834#(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)); {24308#true} is VALID [2022-04-08 04:36:46,413 INFO L290 TraceCheckUtils]: 169: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,413 INFO L290 TraceCheckUtils]: 170: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,413 INFO L290 TraceCheckUtils]: 171: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,413 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {24308#true} {24834#(and (= 23 main_~y~0) (= 23 main_~c~0))} #50#return; {24834#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 04:36:46,414 INFO L290 TraceCheckUtils]: 173: Hoare triple {24834#(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; {24856#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:36:46,414 INFO L290 TraceCheckUtils]: 174: Hoare triple {24856#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} assume !false; {24856#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:36:46,414 INFO L272 TraceCheckUtils]: 175: Hoare triple {24856#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24308#true} is VALID [2022-04-08 04:36:46,414 INFO L290 TraceCheckUtils]: 176: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,414 INFO L290 TraceCheckUtils]: 177: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,414 INFO L290 TraceCheckUtils]: 178: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,415 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {24308#true} {24856#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} #50#return; {24856#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:36:46,415 INFO L290 TraceCheckUtils]: 180: Hoare triple {24856#(and (= 23 (+ (- 1) main_~y~0)) (= 23 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24878#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} is VALID [2022-04-08 04:36:46,416 INFO L290 TraceCheckUtils]: 181: Hoare triple {24878#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} assume !false; {24878#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} is VALID [2022-04-08 04:36:46,416 INFO L272 TraceCheckUtils]: 182: Hoare triple {24878#(and (= 23 (+ (- 2) main_~y~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)); {24308#true} is VALID [2022-04-08 04:36:46,416 INFO L290 TraceCheckUtils]: 183: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,416 INFO L290 TraceCheckUtils]: 184: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,416 INFO L290 TraceCheckUtils]: 185: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,416 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {24308#true} {24878#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} #50#return; {24878#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} is VALID [2022-04-08 04:36:46,417 INFO L290 TraceCheckUtils]: 187: Hoare triple {24878#(and (= 23 (+ (- 2) main_~y~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; {24900#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 04:36:46,417 INFO L290 TraceCheckUtils]: 188: Hoare triple {24900#(and (= main_~c~0 26) (= main_~y~0 26))} assume !false; {24900#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 04:36:46,417 INFO L272 TraceCheckUtils]: 189: Hoare triple {24900#(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)); {24308#true} is VALID [2022-04-08 04:36:46,417 INFO L290 TraceCheckUtils]: 190: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,418 INFO L290 TraceCheckUtils]: 191: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,418 INFO L290 TraceCheckUtils]: 192: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,418 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {24308#true} {24900#(and (= main_~c~0 26) (= main_~y~0 26))} #50#return; {24900#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 04:36:46,419 INFO L290 TraceCheckUtils]: 194: Hoare triple {24900#(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; {24922#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 04:36:46,419 INFO L290 TraceCheckUtils]: 195: Hoare triple {24922#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {24922#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 04:36:46,419 INFO L272 TraceCheckUtils]: 196: Hoare triple {24922#(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)); {24308#true} is VALID [2022-04-08 04:36:46,419 INFO L290 TraceCheckUtils]: 197: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,419 INFO L290 TraceCheckUtils]: 198: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,419 INFO L290 TraceCheckUtils]: 199: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,420 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {24308#true} {24922#(and (= main_~y~0 27) (= main_~c~0 27))} #50#return; {24922#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 04:36:46,420 INFO L290 TraceCheckUtils]: 201: Hoare triple {24922#(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; {24944#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 04:36:46,421 INFO L290 TraceCheckUtils]: 202: Hoare triple {24944#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} assume !false; {24944#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 04:36:46,421 INFO L272 TraceCheckUtils]: 203: Hoare triple {24944#(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)); {24308#true} is VALID [2022-04-08 04:36:46,421 INFO L290 TraceCheckUtils]: 204: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,421 INFO L290 TraceCheckUtils]: 205: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,421 INFO L290 TraceCheckUtils]: 206: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,421 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {24308#true} {24944#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} #50#return; {24944#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 04:36:46,422 INFO L290 TraceCheckUtils]: 208: Hoare triple {24944#(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; {24966#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} is VALID [2022-04-08 04:36:46,422 INFO L290 TraceCheckUtils]: 209: Hoare triple {24966#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} assume !false; {24966#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} is VALID [2022-04-08 04:36:46,422 INFO L272 TraceCheckUtils]: 210: Hoare triple {24966#(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)); {24308#true} is VALID [2022-04-08 04:36:46,422 INFO L290 TraceCheckUtils]: 211: Hoare triple {24308#true} ~cond := #in~cond; {24308#true} is VALID [2022-04-08 04:36:46,422 INFO L290 TraceCheckUtils]: 212: Hoare triple {24308#true} assume !(0 == ~cond); {24308#true} is VALID [2022-04-08 04:36:46,423 INFO L290 TraceCheckUtils]: 213: Hoare triple {24308#true} assume true; {24308#true} is VALID [2022-04-08 04:36:46,423 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {24308#true} {24966#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} #50#return; {24966#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} is VALID [2022-04-08 04:36:46,429 INFO L290 TraceCheckUtils]: 215: Hoare triple {24966#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~c~0 29))} assume !(~c~0 < ~k~0); {24988#(and (< 28 main_~k~0) (= 29 main_~y~0) (<= main_~k~0 29))} is VALID [2022-04-08 04:36:46,430 INFO L272 TraceCheckUtils]: 216: Hoare triple {24988#(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)); {24992#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:36:46,430 INFO L290 TraceCheckUtils]: 217: Hoare triple {24992#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24996#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:36:46,431 INFO L290 TraceCheckUtils]: 218: Hoare triple {24996#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24309#false} is VALID [2022-04-08 04:36:46,431 INFO L290 TraceCheckUtils]: 219: Hoare triple {24309#false} assume !false; {24309#false} is VALID [2022-04-08 04:36:46,432 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-08 04:36:46,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:36:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:36:46,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222326346] [2022-04-08 04:36:46,955 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:36:46,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010226183] [2022-04-08 04:36:46,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010226183] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:36:46,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:36:46,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2022-04-08 04:36:46,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:36:46,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [981591477] [2022-04-08 04:36:46,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [981591477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:36:46,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:36:46,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-08 04:36:46,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013765292] [2022-04-08 04:36:46,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:36:46,956 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-08 04:36:46,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:36:46,957 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-08 04:36:47,492 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-08 04:36:47,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-08 04:36:47,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:47,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-08 04:36:47,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 04:36:47,493 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-08 04:37:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:37:06,818 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2022-04-08 04:37:06,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 04:37:06,818 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-08 04:37:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:37:06,819 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-08 04:37:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 142 transitions. [2022-04-08 04:37:06,822 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-08 04:37:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 142 transitions. [2022-04-08 04:37:06,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 142 transitions. [2022-04-08 04:37:07,385 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-08 04:37:07,387 INFO L225 Difference]: With dead ends: 117 [2022-04-08 04:37:07,387 INFO L226 Difference]: Without dead ends: 112 [2022-04-08 04:37:07,388 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 04:37:07,388 INFO L913 BasicCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 3014 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.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, 9.9s IncrementalHoareTripleChecker+Time [2022-04-08 04:37:07,388 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1484 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3014 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2022-04-08 04:37:07,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-08 04:37:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-04-08 04:37:07,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:37:07,485 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-08 04:37:07,485 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-08 04:37:07,486 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-08 04:37:07,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:37:07,490 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2022-04-08 04:37:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2022-04-08 04:37:07,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:37:07,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:37:07,490 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-08 04:37:07,491 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-08 04:37:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:37:07,494 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2022-04-08 04:37:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2022-04-08 04:37:07,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:37:07,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:37:07,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:37:07,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:37:07,495 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-08 04:37:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 141 transitions. [2022-04-08 04:37:07,499 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 141 transitions. Word has length 220 [2022-04-08 04:37:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:37:07,499 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 141 transitions. [2022-04-08 04:37:07,499 INFO L479 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-08 04:37:07,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 141 transitions. [2022-04-08 04:37:08,097 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-08 04:37:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2022-04-08 04:37:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-04-08 04:37:08,098 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:37:08,098 INFO L499 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:37:08,107 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-08 04:37:08,298 WARN L460 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-08 04:37:08,298 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:37:08,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:37:08,299 INFO L85 PathProgramCache]: Analyzing trace with hash -21371054, now seen corresponding path program 59 times [2022-04-08 04:37:08,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:37:08,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1193060459] [2022-04-08 04:37:08,373 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:37:08,373 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:37:08,373 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:37:08,373 INFO L85 PathProgramCache]: Analyzing trace with hash -21371054, now seen corresponding path program 60 times [2022-04-08 04:37:08,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:37:08,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374424175] [2022-04-08 04:37:08,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:37:08,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:37:08,398 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:37:08,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764571054] [2022-04-08 04:37:08,398 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:37:08,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:37:08,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:37:08,399 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-08 04:37:08,431 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-08 04:37:18,246 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-08 04:37:18,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:37:18,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 129 conjunts are in the unsatisfiable core [2022-04-08 04:37:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:37:18,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:37:20,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {25730#true} call ULTIMATE.init(); {25730#true} is VALID [2022-04-08 04:37:20,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {25730#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); {25730#true} is VALID [2022-04-08 04:37:20,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25730#true} {25730#true} #56#return; {25730#true} is VALID [2022-04-08 04:37:20,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {25730#true} call #t~ret5 := main(); {25730#true} is VALID [2022-04-08 04:37:20,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {25730#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; {25750#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:37:20,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {25750#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {25750#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:37:20,109 INFO L272 TraceCheckUtils]: 7: Hoare triple {25750#(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)); {25730#true} is VALID [2022-04-08 04:37:20,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,110 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {25730#true} {25750#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {25750#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:37:20,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {25750#(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; {25772#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 04:37:20,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {25772#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {25772#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 04:37:20,111 INFO L272 TraceCheckUtils]: 14: Hoare triple {25772#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,111 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25730#true} {25772#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #50#return; {25772#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 04:37:20,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {25772#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25794#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {25794#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !false; {25794#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,112 INFO L272 TraceCheckUtils]: 21: Hoare triple {25794#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,113 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25730#true} {25794#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} #50#return; {25794#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {25794#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25816#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 04:37:20,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {25816#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {25816#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 04:37:20,114 INFO L272 TraceCheckUtils]: 28: Hoare triple {25816#(and (= 2 (+ (- 1) main_~y~0)) (< 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)); {25730#true} is VALID [2022-04-08 04:37:20,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,115 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25730#true} {25816#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} #50#return; {25816#(and (= 2 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 04:37:20,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {25816#(and (= 2 (+ (- 1) main_~y~0)) (< 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; {25838#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:37:20,115 INFO L290 TraceCheckUtils]: 34: Hoare triple {25838#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !false; {25838#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:37:20,115 INFO L272 TraceCheckUtils]: 35: Hoare triple {25838#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 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)); {25730#true} is VALID [2022-04-08 04:37:20,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,116 INFO L290 TraceCheckUtils]: 38: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,116 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {25730#true} {25838#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} #50#return; {25838#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:37:20,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {25838#(and (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0) (= (+ (- 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; {25860#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,117 INFO L290 TraceCheckUtils]: 41: Hoare triple {25860#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {25860#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,117 INFO L272 TraceCheckUtils]: 42: Hoare triple {25860#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,117 INFO L290 TraceCheckUtils]: 43: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,117 INFO L290 TraceCheckUtils]: 44: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,117 INFO L290 TraceCheckUtils]: 45: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,118 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {25730#true} {25860#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} #50#return; {25860#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,118 INFO L290 TraceCheckUtils]: 47: Hoare triple {25860#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25882#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:37:20,118 INFO L290 TraceCheckUtils]: 48: Hoare triple {25882#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !false; {25882#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:37:20,118 INFO L272 TraceCheckUtils]: 49: Hoare triple {25882#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,119 INFO L290 TraceCheckUtils]: 50: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,119 INFO L290 TraceCheckUtils]: 51: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,119 INFO L290 TraceCheckUtils]: 52: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,119 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {25730#true} {25882#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} #50#return; {25882#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:37:20,119 INFO L290 TraceCheckUtils]: 54: Hoare triple {25882#(and (= main_~c~0 6) (< 0 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25904#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,120 INFO L290 TraceCheckUtils]: 55: Hoare triple {25904#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} assume !false; {25904#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,120 INFO L272 TraceCheckUtils]: 56: Hoare triple {25904#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,120 INFO L290 TraceCheckUtils]: 57: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,120 INFO L290 TraceCheckUtils]: 58: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,120 INFO L290 TraceCheckUtils]: 59: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,121 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25730#true} {25904#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} #50#return; {25904#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,121 INFO L290 TraceCheckUtils]: 61: Hoare triple {25904#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25926#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,122 INFO L290 TraceCheckUtils]: 62: Hoare triple {25926#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {25926#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,122 INFO L272 TraceCheckUtils]: 63: Hoare triple {25926#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,122 INFO L290 TraceCheckUtils]: 64: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,122 INFO L290 TraceCheckUtils]: 65: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,122 INFO L290 TraceCheckUtils]: 66: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,122 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {25730#true} {25926#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} #50#return; {25926#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,123 INFO L290 TraceCheckUtils]: 68: Hoare triple {25926#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25948#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,123 INFO L290 TraceCheckUtils]: 69: Hoare triple {25948#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {25948#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,123 INFO L272 TraceCheckUtils]: 70: Hoare triple {25948#(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)); {25730#true} is VALID [2022-04-08 04:37:20,123 INFO L290 TraceCheckUtils]: 71: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,123 INFO L290 TraceCheckUtils]: 72: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,123 INFO L290 TraceCheckUtils]: 73: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,124 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {25730#true} {25948#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} #50#return; {25948#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,124 INFO L290 TraceCheckUtils]: 75: Hoare triple {25948#(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; {25970#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-08 04:37:20,124 INFO L290 TraceCheckUtils]: 76: Hoare triple {25970#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} assume !false; {25970#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-08 04:37:20,125 INFO L272 TraceCheckUtils]: 77: Hoare triple {25970#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,125 INFO L290 TraceCheckUtils]: 78: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,125 INFO L290 TraceCheckUtils]: 79: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,125 INFO L290 TraceCheckUtils]: 80: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,125 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25730#true} {25970#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} #50#return; {25970#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-08 04:37:20,126 INFO L290 TraceCheckUtils]: 82: Hoare triple {25970#(and (= main_~y~0 10) (< 0 main_~k~0) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25992#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,126 INFO L290 TraceCheckUtils]: 83: Hoare triple {25992#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !false; {25992#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,126 INFO L272 TraceCheckUtils]: 84: Hoare triple {25992#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,126 INFO L290 TraceCheckUtils]: 85: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,126 INFO L290 TraceCheckUtils]: 86: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,126 INFO L290 TraceCheckUtils]: 87: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,127 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {25730#true} {25992#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} #50#return; {25992#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,127 INFO L290 TraceCheckUtils]: 89: Hoare triple {25992#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26014#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,128 INFO L290 TraceCheckUtils]: 90: Hoare triple {26014#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {26014#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,128 INFO L272 TraceCheckUtils]: 91: Hoare triple {26014#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 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)); {25730#true} is VALID [2022-04-08 04:37:20,128 INFO L290 TraceCheckUtils]: 92: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,128 INFO L290 TraceCheckUtils]: 93: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,128 INFO L290 TraceCheckUtils]: 94: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,128 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {25730#true} {26014#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #50#return; {26014#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,129 INFO L290 TraceCheckUtils]: 96: Hoare triple {26014#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 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; {26036#(and (= main_~c~0 13) (< 0 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 04:37:20,129 INFO L290 TraceCheckUtils]: 97: Hoare triple {26036#(and (= main_~c~0 13) (< 0 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} assume !false; {26036#(and (= main_~c~0 13) (< 0 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 04:37:20,129 INFO L272 TraceCheckUtils]: 98: Hoare triple {26036#(and (= main_~c~0 13) (< 0 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)); {25730#true} is VALID [2022-04-08 04:37:20,129 INFO L290 TraceCheckUtils]: 99: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,129 INFO L290 TraceCheckUtils]: 100: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,129 INFO L290 TraceCheckUtils]: 101: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,130 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {25730#true} {26036#(and (= main_~c~0 13) (< 0 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} #50#return; {26036#(and (= main_~c~0 13) (< 0 main_~k~0) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 04:37:20,130 INFO L290 TraceCheckUtils]: 103: Hoare triple {26036#(and (= main_~c~0 13) (< 0 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; {26058#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,130 INFO L290 TraceCheckUtils]: 104: Hoare triple {26058#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} assume !false; {26058#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,131 INFO L272 TraceCheckUtils]: 105: Hoare triple {26058#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,131 INFO L290 TraceCheckUtils]: 106: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,131 INFO L290 TraceCheckUtils]: 107: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,131 INFO L290 TraceCheckUtils]: 108: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,132 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {25730#true} {26058#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} #50#return; {26058#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,133 INFO L290 TraceCheckUtils]: 110: Hoare triple {26058#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26080#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:37:20,133 INFO L290 TraceCheckUtils]: 111: Hoare triple {26080#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} assume !false; {26080#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:37:20,133 INFO L272 TraceCheckUtils]: 112: Hoare triple {26080#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,133 INFO L290 TraceCheckUtils]: 113: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,133 INFO L290 TraceCheckUtils]: 114: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,133 INFO L290 TraceCheckUtils]: 115: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,134 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25730#true} {26080#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} #50#return; {26080#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:37:20,135 INFO L290 TraceCheckUtils]: 117: Hoare triple {26080#(and (= main_~c~0 15) (< 0 main_~k~0) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26102#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,135 INFO L290 TraceCheckUtils]: 118: Hoare triple {26102#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} assume !false; {26102#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,135 INFO L272 TraceCheckUtils]: 119: Hoare triple {26102#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,135 INFO L290 TraceCheckUtils]: 120: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,135 INFO L290 TraceCheckUtils]: 121: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,135 INFO L290 TraceCheckUtils]: 122: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,136 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {25730#true} {26102#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} #50#return; {26102#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,136 INFO L290 TraceCheckUtils]: 124: Hoare triple {26102#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26124#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,137 INFO L290 TraceCheckUtils]: 125: Hoare triple {26124#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14) (< 0 main_~k~0))} assume !false; {26124#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,137 INFO L272 TraceCheckUtils]: 126: Hoare triple {26124#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,137 INFO L290 TraceCheckUtils]: 127: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,137 INFO L290 TraceCheckUtils]: 128: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,137 INFO L290 TraceCheckUtils]: 129: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,137 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25730#true} {26124#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14) (< 0 main_~k~0))} #50#return; {26124#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,138 INFO L290 TraceCheckUtils]: 131: Hoare triple {26124#(and (= main_~c~0 17) (= (+ main_~y~0 (- 3)) 14) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26146#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 04:37:20,138 INFO L290 TraceCheckUtils]: 132: Hoare triple {26146#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !false; {26146#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 04:37:20,138 INFO L272 TraceCheckUtils]: 133: Hoare triple {26146#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,138 INFO L290 TraceCheckUtils]: 134: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,138 INFO L290 TraceCheckUtils]: 135: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,138 INFO L290 TraceCheckUtils]: 136: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,139 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {25730#true} {26146#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} #50#return; {26146#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 04:37:20,139 INFO L290 TraceCheckUtils]: 138: Hoare triple {26146#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26168#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:37:20,140 INFO L290 TraceCheckUtils]: 139: Hoare triple {26168#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {26168#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:37:20,140 INFO L272 TraceCheckUtils]: 140: Hoare triple {26168#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,140 INFO L290 TraceCheckUtils]: 141: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,140 INFO L290 TraceCheckUtils]: 142: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,140 INFO L290 TraceCheckUtils]: 143: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,145 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {25730#true} {26168#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} #50#return; {26168#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:37:20,145 INFO L290 TraceCheckUtils]: 145: Hoare triple {26168#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26190#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,145 INFO L290 TraceCheckUtils]: 146: Hoare triple {26190#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20) (< 0 main_~k~0))} assume !false; {26190#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,146 INFO L272 TraceCheckUtils]: 147: Hoare triple {26190#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,146 INFO L290 TraceCheckUtils]: 148: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,146 INFO L290 TraceCheckUtils]: 149: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,146 INFO L290 TraceCheckUtils]: 150: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,146 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {25730#true} {26190#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20) (< 0 main_~k~0))} #50#return; {26190#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,147 INFO L290 TraceCheckUtils]: 152: Hoare triple {26190#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26212#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,147 INFO L290 TraceCheckUtils]: 153: Hoare triple {26212#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} assume !false; {26212#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,147 INFO L272 TraceCheckUtils]: 154: Hoare triple {26212#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18) (< 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)); {25730#true} is VALID [2022-04-08 04:37:20,147 INFO L290 TraceCheckUtils]: 155: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,147 INFO L290 TraceCheckUtils]: 156: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,147 INFO L290 TraceCheckUtils]: 157: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,148 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {25730#true} {26212#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} #50#return; {26212#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,148 INFO L290 TraceCheckUtils]: 159: Hoare triple {26212#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18) (< 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; {26234#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,148 INFO L290 TraceCheckUtils]: 160: Hoare triple {26234#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !false; {26234#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,149 INFO L272 TraceCheckUtils]: 161: Hoare triple {26234#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,149 INFO L290 TraceCheckUtils]: 162: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,149 INFO L290 TraceCheckUtils]: 163: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,149 INFO L290 TraceCheckUtils]: 164: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,149 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {25730#true} {26234#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} #50#return; {26234#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,150 INFO L290 TraceCheckUtils]: 166: Hoare triple {26234#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26256#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:37:20,150 INFO L290 TraceCheckUtils]: 167: Hoare triple {26256#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {26256#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:37:20,150 INFO L272 TraceCheckUtils]: 168: Hoare triple {26256#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,150 INFO L290 TraceCheckUtils]: 169: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,150 INFO L290 TraceCheckUtils]: 170: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,150 INFO L290 TraceCheckUtils]: 171: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,151 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25730#true} {26256#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} #50#return; {26256#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:37:20,151 INFO L290 TraceCheckUtils]: 173: Hoare triple {26256#(and (= (+ (- 1) main_~c~0) 22) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26278#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,152 INFO L290 TraceCheckUtils]: 174: Hoare triple {26278#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} assume !false; {26278#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,152 INFO L272 TraceCheckUtils]: 175: Hoare triple {26278#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,152 INFO L290 TraceCheckUtils]: 176: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,152 INFO L290 TraceCheckUtils]: 177: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,152 INFO L290 TraceCheckUtils]: 178: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,152 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {25730#true} {26278#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} #50#return; {26278#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,153 INFO L290 TraceCheckUtils]: 180: Hoare triple {26278#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26300#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 04:37:20,153 INFO L290 TraceCheckUtils]: 181: Hoare triple {26300#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} assume !false; {26300#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 04:37:20,153 INFO L272 TraceCheckUtils]: 182: Hoare triple {26300#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,153 INFO L290 TraceCheckUtils]: 183: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,153 INFO L290 TraceCheckUtils]: 184: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,153 INFO L290 TraceCheckUtils]: 185: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,154 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {25730#true} {26300#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} #50#return; {26300#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 04:37:20,154 INFO L290 TraceCheckUtils]: 187: Hoare triple {26300#(and (= main_~c~0 25) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26322#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} is VALID [2022-04-08 04:37:20,154 INFO L290 TraceCheckUtils]: 188: Hoare triple {26322#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} assume !false; {26322#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} is VALID [2022-04-08 04:37:20,154 INFO L272 TraceCheckUtils]: 189: Hoare triple {26322#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,155 INFO L290 TraceCheckUtils]: 190: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,155 INFO L290 TraceCheckUtils]: 191: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,155 INFO L290 TraceCheckUtils]: 192: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,155 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {25730#true} {26322#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} #50#return; {26322#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} is VALID [2022-04-08 04:37:20,156 INFO L290 TraceCheckUtils]: 194: Hoare triple {26322#(and (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25) (= main_~y~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26344#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,156 INFO L290 TraceCheckUtils]: 195: Hoare triple {26344#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} assume !false; {26344#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,156 INFO L272 TraceCheckUtils]: 196: Hoare triple {26344#(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)); {25730#true} is VALID [2022-04-08 04:37:20,156 INFO L290 TraceCheckUtils]: 197: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,156 INFO L290 TraceCheckUtils]: 198: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,156 INFO L290 TraceCheckUtils]: 199: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,160 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {25730#true} {26344#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} #50#return; {26344#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,160 INFO L290 TraceCheckUtils]: 201: Hoare triple {26344#(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; {26366#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,161 INFO L290 TraceCheckUtils]: 202: Hoare triple {26366#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} assume !false; {26366#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,161 INFO L272 TraceCheckUtils]: 203: Hoare triple {26366#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,161 INFO L290 TraceCheckUtils]: 204: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,161 INFO L290 TraceCheckUtils]: 205: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,161 INFO L290 TraceCheckUtils]: 206: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,162 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {25730#true} {26366#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} #50#return; {26366#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,162 INFO L290 TraceCheckUtils]: 208: Hoare triple {26366#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26388#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,163 INFO L290 TraceCheckUtils]: 209: Hoare triple {26388#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} assume !false; {26388#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,163 INFO L272 TraceCheckUtils]: 210: Hoare triple {26388#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25730#true} is VALID [2022-04-08 04:37:20,163 INFO L290 TraceCheckUtils]: 211: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,163 INFO L290 TraceCheckUtils]: 212: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,163 INFO L290 TraceCheckUtils]: 213: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,164 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {25730#true} {26388#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} #50#return; {26388#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:20,164 INFO L290 TraceCheckUtils]: 215: Hoare triple {26388#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26410#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-08 04:37:20,165 INFO L290 TraceCheckUtils]: 216: Hoare triple {26410#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} assume !false; {26410#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-08 04:37:20,165 INFO L272 TraceCheckUtils]: 217: Hoare triple {26410#(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)); {25730#true} is VALID [2022-04-08 04:37:20,165 INFO L290 TraceCheckUtils]: 218: Hoare triple {25730#true} ~cond := #in~cond; {25730#true} is VALID [2022-04-08 04:37:20,165 INFO L290 TraceCheckUtils]: 219: Hoare triple {25730#true} assume !(0 == ~cond); {25730#true} is VALID [2022-04-08 04:37:20,165 INFO L290 TraceCheckUtils]: 220: Hoare triple {25730#true} assume true; {25730#true} is VALID [2022-04-08 04:37:20,165 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {25730#true} {26410#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} #50#return; {26410#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-08 04:37:20,166 INFO L290 TraceCheckUtils]: 222: Hoare triple {26410#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} assume !(~c~0 < ~k~0); {26432#(and (<= main_~k~0 30) (= 30 main_~y~0) (< 29 main_~k~0))} is VALID [2022-04-08 04:37:20,167 INFO L272 TraceCheckUtils]: 223: Hoare triple {26432#(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)); {26436#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:37:20,167 INFO L290 TraceCheckUtils]: 224: Hoare triple {26436#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26440#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:37:20,168 INFO L290 TraceCheckUtils]: 225: Hoare triple {26440#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25731#false} is VALID [2022-04-08 04:37:20,168 INFO L290 TraceCheckUtils]: 226: Hoare triple {25731#false} assume !false; {25731#false} is VALID [2022-04-08 04:37:20,170 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-08 04:37:20,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:37:25,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:37:25,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374424175] [2022-04-08 04:37:25,806 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:37:25,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764571054] [2022-04-08 04:37:25,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764571054] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:37:25,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:37:25,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2022-04-08 04:37:25,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:37:25,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1193060459] [2022-04-08 04:37:25,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1193060459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:37:25,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:37:25,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-08 04:37:25,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892490822] [2022-04-08 04:37:25,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:37:25,807 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-08 04:37:25,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:37:25,807 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-08 04:37:26,333 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-08 04:37:26,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-08 04:37:26,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:37:26,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-08 04:37:26,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=3516, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 04:37:26,334 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-08 04:37:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:37:46,960 INFO L93 Difference]: Finished difference Result 120 states and 150 transitions. [2022-04-08 04:37:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 04:37:46,961 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-08 04:37:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:37:46,961 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-08 04:37:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 146 transitions. [2022-04-08 04:37:46,964 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-08 04:37:46,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 146 transitions. [2022-04-08 04:37:46,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 146 transitions. [2022-04-08 04:37:47,548 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-08 04:37:47,549 INFO L225 Difference]: With dead ends: 120 [2022-04-08 04:37:47,549 INFO L226 Difference]: Without dead ends: 115 [2022-04-08 04:37:47,550 INFO L912 BasicCegarLoop]: 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-08 04:37:47,551 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 3207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s 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, 10.7s IncrementalHoareTripleChecker+Time [2022-04-08 04:37:47,551 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1563 Invalid, 3207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3207 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2022-04-08 04:37:47,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-08 04:37:47,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-08 04:37:47,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:37:47,682 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-08 04:37:47,682 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-08 04:37:47,682 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-08 04:37:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:37:47,684 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2022-04-08 04:37:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2022-04-08 04:37:47,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:37:47,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:37:47,684 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-08 04:37:47,685 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-08 04:37:47,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:37:47,686 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2022-04-08 04:37:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2022-04-08 04:37:47,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:37:47,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:37:47,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:37:47,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:37:47,687 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-08 04:37:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 145 transitions. [2022-04-08 04:37:47,690 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 145 transitions. Word has length 227 [2022-04-08 04:37:47,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:37:47,690 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 145 transitions. [2022-04-08 04:37:47,690 INFO L479 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-08 04:37:47,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 145 transitions. [2022-04-08 04:37:48,220 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-08 04:37:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2022-04-08 04:37:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-04-08 04:37:48,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:37:48,221 INFO L499 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:37:48,231 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-08 04:37:48,423 WARN L460 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-08 04:37:48,423 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:37:48,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:37:48,424 INFO L85 PathProgramCache]: Analyzing trace with hash -748098683, now seen corresponding path program 61 times [2022-04-08 04:37:48,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:37:48,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [286392137] [2022-04-08 04:37:48,507 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:37:48,508 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:37:48,508 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:37:48,508 INFO L85 PathProgramCache]: Analyzing trace with hash -748098683, now seen corresponding path program 62 times [2022-04-08 04:37:48,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:37:48,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209823732] [2022-04-08 04:37:48,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:37:48,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:37:48,523 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:37:48,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1472581271] [2022-04-08 04:37:48,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:37:48,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:37:48,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:37:48,524 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-08 04:37:48,531 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-08 04:37:49,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:37:49,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:37:49,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 133 conjunts are in the unsatisfiable core [2022-04-08 04:37:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:37:49,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:37:51,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {27830#true} call ULTIMATE.init(); {27830#true} is VALID [2022-04-08 04:37:51,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {27830#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); {27830#true} is VALID [2022-04-08 04:37:51,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27830#true} {27830#true} #56#return; {27830#true} is VALID [2022-04-08 04:37:51,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {27830#true} call #t~ret5 := main(); {27830#true} is VALID [2022-04-08 04:37:51,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {27830#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; {27850#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:37:51,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {27850#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {27850#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:37:51,575 INFO L272 TraceCheckUtils]: 7: Hoare triple {27850#(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)); {27830#true} is VALID [2022-04-08 04:37:51,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,582 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {27830#true} {27850#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {27850#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:37:51,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {27850#(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; {27872#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 04:37:51,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {27872#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {27872#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 04:37:51,583 INFO L272 TraceCheckUtils]: 14: Hoare triple {27872#(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)); {27830#true} is VALID [2022-04-08 04:37:51,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,584 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {27830#true} {27872#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #50#return; {27872#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 04:37:51,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {27872#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27894#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {27894#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !false; {27894#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,585 INFO L272 TraceCheckUtils]: 21: Hoare triple {27894#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,585 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {27830#true} {27894#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} #50#return; {27894#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {27894#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27916#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 04:37:51,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {27916#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {27916#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 04:37:51,586 INFO L272 TraceCheckUtils]: 28: Hoare triple {27916#(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)); {27830#true} is VALID [2022-04-08 04:37:51,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,587 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {27830#true} {27916#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #50#return; {27916#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 04:37:51,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {27916#(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; {27938#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {27938#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {27938#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,587 INFO L272 TraceCheckUtils]: 35: Hoare triple {27938#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,587 INFO L290 TraceCheckUtils]: 36: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,588 INFO L290 TraceCheckUtils]: 37: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,588 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {27830#true} {27938#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #50#return; {27938#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {27938#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27960#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {27960#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {27960#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,589 INFO L272 TraceCheckUtils]: 42: Hoare triple {27960#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,589 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {27830#true} {27960#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} #50#return; {27960#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {27960#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27982#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {27982#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !false; {27982#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,590 INFO L272 TraceCheckUtils]: 49: Hoare triple {27982#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,590 INFO L290 TraceCheckUtils]: 50: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,590 INFO L290 TraceCheckUtils]: 52: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,591 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27830#true} {27982#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} #50#return; {27982#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,591 INFO L290 TraceCheckUtils]: 54: Hoare triple {27982#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28004#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {28004#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {28004#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,592 INFO L272 TraceCheckUtils]: 56: Hoare triple {28004#(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)); {27830#true} is VALID [2022-04-08 04:37:51,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,592 INFO L290 TraceCheckUtils]: 58: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,592 INFO L290 TraceCheckUtils]: 59: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,592 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {27830#true} {28004#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #50#return; {28004#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,593 INFO L290 TraceCheckUtils]: 61: Hoare triple {28004#(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; {28026#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,593 INFO L290 TraceCheckUtils]: 62: Hoare triple {28026#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} assume !false; {28026#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,593 INFO L272 TraceCheckUtils]: 63: Hoare triple {28026#(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)); {27830#true} is VALID [2022-04-08 04:37:51,593 INFO L290 TraceCheckUtils]: 64: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,593 INFO L290 TraceCheckUtils]: 65: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,593 INFO L290 TraceCheckUtils]: 66: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,594 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {27830#true} {28026#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} #50#return; {28026#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,594 INFO L290 TraceCheckUtils]: 68: Hoare triple {28026#(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; {28048#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,594 INFO L290 TraceCheckUtils]: 69: Hoare triple {28048#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {28048#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,594 INFO L272 TraceCheckUtils]: 70: Hoare triple {28048#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,594 INFO L290 TraceCheckUtils]: 71: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,595 INFO L290 TraceCheckUtils]: 72: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,595 INFO L290 TraceCheckUtils]: 73: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,595 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27830#true} {28048#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} #50#return; {28048#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,595 INFO L290 TraceCheckUtils]: 75: Hoare triple {28048#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28070#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,596 INFO L290 TraceCheckUtils]: 76: Hoare triple {28070#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} assume !false; {28070#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,596 INFO L272 TraceCheckUtils]: 77: Hoare triple {28070#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,596 INFO L290 TraceCheckUtils]: 78: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,596 INFO L290 TraceCheckUtils]: 79: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,596 INFO L290 TraceCheckUtils]: 80: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,596 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {27830#true} {28070#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} #50#return; {28070#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,597 INFO L290 TraceCheckUtils]: 82: Hoare triple {28070#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28092#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,597 INFO L290 TraceCheckUtils]: 83: Hoare triple {28092#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !false; {28092#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,597 INFO L272 TraceCheckUtils]: 84: Hoare triple {28092#(and (= main_~c~0 11) (= 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)); {27830#true} is VALID [2022-04-08 04:37:51,597 INFO L290 TraceCheckUtils]: 85: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,597 INFO L290 TraceCheckUtils]: 86: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,597 INFO L290 TraceCheckUtils]: 87: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,598 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {27830#true} {28092#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} #50#return; {28092#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,598 INFO L290 TraceCheckUtils]: 89: Hoare triple {28092#(and (= main_~c~0 11) (= 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; {28114#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,599 INFO L290 TraceCheckUtils]: 90: Hoare triple {28114#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} assume !false; {28114#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,599 INFO L272 TraceCheckUtils]: 91: Hoare triple {28114#(and (= main_~c~0 12) (= (+ (- 1) 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)); {27830#true} is VALID [2022-04-08 04:37:51,599 INFO L290 TraceCheckUtils]: 92: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,599 INFO L290 TraceCheckUtils]: 93: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,599 INFO L290 TraceCheckUtils]: 94: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,599 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {27830#true} {28114#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} #50#return; {28114#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,600 INFO L290 TraceCheckUtils]: 96: Hoare triple {28114#(and (= main_~c~0 12) (= (+ (- 1) 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; {28136#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,600 INFO L290 TraceCheckUtils]: 97: Hoare triple {28136#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} assume !false; {28136#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,600 INFO L272 TraceCheckUtils]: 98: Hoare triple {28136#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) 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)); {27830#true} is VALID [2022-04-08 04:37:51,600 INFO L290 TraceCheckUtils]: 99: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,600 INFO L290 TraceCheckUtils]: 100: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,600 INFO L290 TraceCheckUtils]: 101: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,601 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {27830#true} {28136#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} #50#return; {28136#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,601 INFO L290 TraceCheckUtils]: 103: Hoare triple {28136#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) 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; {28158#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,601 INFO L290 TraceCheckUtils]: 104: Hoare triple {28158#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11) (< 0 main_~k~0))} assume !false; {28158#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,601 INFO L272 TraceCheckUtils]: 105: Hoare triple {28158#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 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)); {27830#true} is VALID [2022-04-08 04:37:51,602 INFO L290 TraceCheckUtils]: 106: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,602 INFO L290 TraceCheckUtils]: 107: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,602 INFO L290 TraceCheckUtils]: 108: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,602 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {27830#true} {28158#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11) (< 0 main_~k~0))} #50#return; {28158#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,602 INFO L290 TraceCheckUtils]: 110: Hoare triple {28158#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 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; {28180#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,603 INFO L290 TraceCheckUtils]: 111: Hoare triple {28180#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} assume !false; {28180#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,603 INFO L272 TraceCheckUtils]: 112: Hoare triple {28180#(and (= main_~c~0 15) (= main_~y~0 15) (< 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)); {27830#true} is VALID [2022-04-08 04:37:51,603 INFO L290 TraceCheckUtils]: 113: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,603 INFO L290 TraceCheckUtils]: 114: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,603 INFO L290 TraceCheckUtils]: 115: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,603 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {27830#true} {28180#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} #50#return; {28180#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,604 INFO L290 TraceCheckUtils]: 117: Hoare triple {28180#(and (= main_~c~0 15) (= main_~y~0 15) (< 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; {28202#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,604 INFO L290 TraceCheckUtils]: 118: Hoare triple {28202#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} assume !false; {28202#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,604 INFO L272 TraceCheckUtils]: 119: Hoare triple {28202#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,604 INFO L290 TraceCheckUtils]: 120: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,604 INFO L290 TraceCheckUtils]: 121: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,604 INFO L290 TraceCheckUtils]: 122: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,605 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {27830#true} {28202#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} #50#return; {28202#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,605 INFO L290 TraceCheckUtils]: 124: Hoare triple {28202#(and (= main_~c~0 16) (= main_~y~0 16) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28224#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,606 INFO L290 TraceCheckUtils]: 125: Hoare triple {28224#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0))} assume !false; {28224#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,606 INFO L272 TraceCheckUtils]: 126: Hoare triple {28224#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,606 INFO L290 TraceCheckUtils]: 127: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,606 INFO L290 TraceCheckUtils]: 128: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,606 INFO L290 TraceCheckUtils]: 129: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,606 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {27830#true} {28224#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0))} #50#return; {28224#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,607 INFO L290 TraceCheckUtils]: 131: Hoare triple {28224#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28246#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 04:37:51,607 INFO L290 TraceCheckUtils]: 132: Hoare triple {28246#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !false; {28246#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 04:37:51,607 INFO L272 TraceCheckUtils]: 133: Hoare triple {28246#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,607 INFO L290 TraceCheckUtils]: 134: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,607 INFO L290 TraceCheckUtils]: 135: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,607 INFO L290 TraceCheckUtils]: 136: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,608 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {27830#true} {28246#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} #50#return; {28246#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 04:37:51,608 INFO L290 TraceCheckUtils]: 138: Hoare triple {28246#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28268#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-08 04:37:51,608 INFO L290 TraceCheckUtils]: 139: Hoare triple {28268#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} assume !false; {28268#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-08 04:37:51,608 INFO L272 TraceCheckUtils]: 140: Hoare triple {28268#(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)); {27830#true} is VALID [2022-04-08 04:37:51,609 INFO L290 TraceCheckUtils]: 141: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,609 INFO L290 TraceCheckUtils]: 142: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,609 INFO L290 TraceCheckUtils]: 143: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,609 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {27830#true} {28268#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} #50#return; {28268#(and (= 19 main_~y~0) (< 0 main_~k~0) (= 19 main_~c~0))} is VALID [2022-04-08 04:37:51,609 INFO L290 TraceCheckUtils]: 145: Hoare triple {28268#(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; {28290#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,610 INFO L290 TraceCheckUtils]: 146: Hoare triple {28290#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20) (< 0 main_~k~0))} assume !false; {28290#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,610 INFO L272 TraceCheckUtils]: 147: Hoare triple {28290#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,610 INFO L290 TraceCheckUtils]: 148: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,610 INFO L290 TraceCheckUtils]: 149: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,610 INFO L290 TraceCheckUtils]: 150: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,610 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {27830#true} {28290#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20) (< 0 main_~k~0))} #50#return; {28290#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,611 INFO L290 TraceCheckUtils]: 152: Hoare triple {28290#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28312#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,611 INFO L290 TraceCheckUtils]: 153: Hoare triple {28312#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} assume !false; {28312#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,611 INFO L272 TraceCheckUtils]: 154: Hoare triple {28312#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,611 INFO L290 TraceCheckUtils]: 155: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,611 INFO L290 TraceCheckUtils]: 156: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,611 INFO L290 TraceCheckUtils]: 157: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,612 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {27830#true} {28312#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} #50#return; {28312#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,612 INFO L290 TraceCheckUtils]: 159: Hoare triple {28312#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28334#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,613 INFO L290 TraceCheckUtils]: 160: Hoare triple {28334#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !false; {28334#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,613 INFO L272 TraceCheckUtils]: 161: Hoare triple {28334#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,613 INFO L290 TraceCheckUtils]: 162: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,613 INFO L290 TraceCheckUtils]: 163: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,613 INFO L290 TraceCheckUtils]: 164: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,613 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {27830#true} {28334#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} #50#return; {28334#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,614 INFO L290 TraceCheckUtils]: 166: Hoare triple {28334#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28356#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,614 INFO L290 TraceCheckUtils]: 167: Hoare triple {28356#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0) (< 0 main_~k~0))} assume !false; {28356#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,614 INFO L272 TraceCheckUtils]: 168: Hoare triple {28356#(and (= (+ (- 1) main_~c~0) 22) (= 23 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)); {27830#true} is VALID [2022-04-08 04:37:51,614 INFO L290 TraceCheckUtils]: 169: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,614 INFO L290 TraceCheckUtils]: 170: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,614 INFO L290 TraceCheckUtils]: 171: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,615 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {27830#true} {28356#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0) (< 0 main_~k~0))} #50#return; {28356#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,615 INFO L290 TraceCheckUtils]: 173: Hoare triple {28356#(and (= (+ (- 1) main_~c~0) 22) (= 23 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; {28378#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,615 INFO L290 TraceCheckUtils]: 174: Hoare triple {28378#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} assume !false; {28378#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,615 INFO L272 TraceCheckUtils]: 175: Hoare triple {28378#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,616 INFO L290 TraceCheckUtils]: 176: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,616 INFO L290 TraceCheckUtils]: 177: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,616 INFO L290 TraceCheckUtils]: 178: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,616 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {27830#true} {28378#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} #50#return; {28378#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,616 INFO L290 TraceCheckUtils]: 180: Hoare triple {28378#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28400#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,617 INFO L290 TraceCheckUtils]: 181: Hoare triple {28400#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} assume !false; {28400#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,617 INFO L272 TraceCheckUtils]: 182: Hoare triple {28400#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,617 INFO L290 TraceCheckUtils]: 183: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,617 INFO L290 TraceCheckUtils]: 184: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,617 INFO L290 TraceCheckUtils]: 185: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,617 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {27830#true} {28400#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} #50#return; {28400#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,618 INFO L290 TraceCheckUtils]: 187: Hoare triple {28400#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28422#(and (= main_~c~0 26) (< 0 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-08 04:37:51,618 INFO L290 TraceCheckUtils]: 188: Hoare triple {28422#(and (= main_~c~0 26) (< 0 main_~k~0) (= main_~y~0 26))} assume !false; {28422#(and (= main_~c~0 26) (< 0 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-08 04:37:51,618 INFO L272 TraceCheckUtils]: 189: Hoare triple {28422#(and (= main_~c~0 26) (< 0 main_~k~0) (= main_~y~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,618 INFO L290 TraceCheckUtils]: 190: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,618 INFO L290 TraceCheckUtils]: 191: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,618 INFO L290 TraceCheckUtils]: 192: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,619 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {27830#true} {28422#(and (= main_~c~0 26) (< 0 main_~k~0) (= main_~y~0 26))} #50#return; {28422#(and (= main_~c~0 26) (< 0 main_~k~0) (= main_~y~0 26))} is VALID [2022-04-08 04:37:51,619 INFO L290 TraceCheckUtils]: 194: Hoare triple {28422#(and (= main_~c~0 26) (< 0 main_~k~0) (= main_~y~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28444#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,620 INFO L290 TraceCheckUtils]: 195: Hoare triple {28444#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} assume !false; {28444#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,620 INFO L272 TraceCheckUtils]: 196: Hoare triple {28444#(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)); {27830#true} is VALID [2022-04-08 04:37:51,620 INFO L290 TraceCheckUtils]: 197: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,620 INFO L290 TraceCheckUtils]: 198: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,620 INFO L290 TraceCheckUtils]: 199: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,620 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {27830#true} {28444#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} #50#return; {28444#(and (= main_~y~0 27) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,621 INFO L290 TraceCheckUtils]: 201: Hoare triple {28444#(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; {28466#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,621 INFO L290 TraceCheckUtils]: 202: Hoare triple {28466#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} assume !false; {28466#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,621 INFO L272 TraceCheckUtils]: 203: Hoare triple {28466#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,621 INFO L290 TraceCheckUtils]: 204: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,621 INFO L290 TraceCheckUtils]: 205: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,621 INFO L290 TraceCheckUtils]: 206: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,622 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {27830#true} {28466#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} #50#return; {28466#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,622 INFO L290 TraceCheckUtils]: 208: Hoare triple {28466#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28488#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,622 INFO L290 TraceCheckUtils]: 209: Hoare triple {28488#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} assume !false; {28488#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,623 INFO L272 TraceCheckUtils]: 210: Hoare triple {28488#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,623 INFO L290 TraceCheckUtils]: 211: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,623 INFO L290 TraceCheckUtils]: 212: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,623 INFO L290 TraceCheckUtils]: 213: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,623 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {27830#true} {28488#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} #50#return; {28488#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,624 INFO L290 TraceCheckUtils]: 215: Hoare triple {28488#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28510#(and (= 30 main_~y~0) (= 30 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,624 INFO L290 TraceCheckUtils]: 216: Hoare triple {28510#(and (= 30 main_~y~0) (= 30 main_~c~0) (< 0 main_~k~0))} assume !false; {28510#(and (= 30 main_~y~0) (= 30 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,624 INFO L272 TraceCheckUtils]: 217: Hoare triple {28510#(and (= 30 main_~y~0) (= 30 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)); {27830#true} is VALID [2022-04-08 04:37:51,624 INFO L290 TraceCheckUtils]: 218: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,624 INFO L290 TraceCheckUtils]: 219: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,624 INFO L290 TraceCheckUtils]: 220: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,624 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {27830#true} {28510#(and (= 30 main_~y~0) (= 30 main_~c~0) (< 0 main_~k~0))} #50#return; {28510#(and (= 30 main_~y~0) (= 30 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:37:51,625 INFO L290 TraceCheckUtils]: 222: Hoare triple {28510#(and (= 30 main_~y~0) (= 30 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; {28532#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} is VALID [2022-04-08 04:37:51,625 INFO L290 TraceCheckUtils]: 223: Hoare triple {28532#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} assume !false; {28532#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} is VALID [2022-04-08 04:37:51,625 INFO L272 TraceCheckUtils]: 224: Hoare triple {28532#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27830#true} is VALID [2022-04-08 04:37:51,625 INFO L290 TraceCheckUtils]: 225: Hoare triple {27830#true} ~cond := #in~cond; {27830#true} is VALID [2022-04-08 04:37:51,625 INFO L290 TraceCheckUtils]: 226: Hoare triple {27830#true} assume !(0 == ~cond); {27830#true} is VALID [2022-04-08 04:37:51,625 INFO L290 TraceCheckUtils]: 227: Hoare triple {27830#true} assume true; {27830#true} is VALID [2022-04-08 04:37:51,626 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {27830#true} {28532#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} #50#return; {28532#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} is VALID [2022-04-08 04:37:51,626 INFO L290 TraceCheckUtils]: 229: Hoare triple {28532#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} assume !(~c~0 < ~k~0); {28554#(and (= main_~y~0 31) (< 30 main_~k~0) (<= main_~k~0 31))} is VALID [2022-04-08 04:37:51,627 INFO L272 TraceCheckUtils]: 230: Hoare triple {28554#(and (= main_~y~0 31) (< 30 main_~k~0) (<= main_~k~0 31))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28558#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:37:51,627 INFO L290 TraceCheckUtils]: 231: Hoare triple {28558#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28562#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:37:51,628 INFO L290 TraceCheckUtils]: 232: Hoare triple {28562#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27831#false} is VALID [2022-04-08 04:37:51,628 INFO L290 TraceCheckUtils]: 233: Hoare triple {27831#false} assume !false; {27831#false} is VALID [2022-04-08 04:37:51,629 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-08 04:37:51,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:37:57,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:37:57,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209823732] [2022-04-08 04:37:57,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:37:57,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472581271] [2022-04-08 04:37:57,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472581271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:37:57,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:37:57,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2022-04-08 04:37:57,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:37:57,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [286392137] [2022-04-08 04:37:57,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [286392137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:37:57,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:37:57,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-08 04:37:57,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075208212] [2022-04-08 04:37:57,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:37:57,070 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-08 04:37:57,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:37:57,071 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-08 04:37:57,526 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-08 04:37:57,526 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-08 04:37:57,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:37:57,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-08 04:37:57,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=3725, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 04:37:57,528 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-08 04:38:23,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:38:23,198 INFO L93 Difference]: Finished difference Result 123 states and 154 transitions. [2022-04-08 04:38:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 04:38:23,198 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-08 04:38:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:38:23,199 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-08 04:38:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 150 transitions. [2022-04-08 04:38:23,202 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-08 04:38:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 150 transitions. [2022-04-08 04:38:23,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 150 transitions. [2022-04-08 04:38:23,777 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-08 04:38:23,778 INFO L225 Difference]: With dead ends: 123 [2022-04-08 04:38:23,778 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 04:38:23,779 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 387 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1115, Invalid=3997, Unknown=0, NotChecked=0, Total=5112 [2022-04-08 04:38:23,780 INFO L913 BasicCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 3406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s 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, 13.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:38:23,780 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1644 Invalid, 3406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3406 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2022-04-08 04:38:23,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 04:38:23,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-08 04:38:23,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:38:23,966 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-08 04:38:23,966 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-08 04:38:23,967 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-08 04:38:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:38:23,969 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2022-04-08 04:38:23,969 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2022-04-08 04:38:23,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:38:23,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:38:23,970 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-08 04:38:23,970 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-08 04:38:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:38:23,973 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2022-04-08 04:38:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2022-04-08 04:38:23,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:38:23,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:38:23,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:38:23,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:38:23,974 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-08 04:38:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2022-04-08 04:38:23,977 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 234 [2022-04-08 04:38:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:38:23,977 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2022-04-08 04:38:23,977 INFO L479 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-08 04:38:23,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 149 transitions. [2022-04-08 04:38:24,678 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-08 04:38:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2022-04-08 04:38:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-04-08 04:38:24,680 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:38:24,680 INFO L499 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:38:24,691 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-08 04:38:24,880 WARN L460 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-08 04:38:24,881 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:38:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:38:24,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1651070962, now seen corresponding path program 63 times [2022-04-08 04:38:24,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:38:24,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1283834254] [2022-04-08 04:38:24,994 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:38:24,994 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:38:24,994 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:38:24,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1651070962, now seen corresponding path program 64 times [2022-04-08 04:38:24,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:38:24,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492651308] [2022-04-08 04:38:24,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:38:24,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:38:25,012 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:38:25,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [624522965] [2022-04-08 04:38:25,012 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:38:25,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:38:25,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:38:25,013 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-08 04:38:25,018 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-08 04:38:43,320 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:38:43,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:38:43,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 136 conjunts are in the unsatisfiable core [2022-04-08 04:38:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:38:43,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:38:44,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {29992#true} call ULTIMATE.init(); {29992#true} is VALID [2022-04-08 04:38:44,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {29992#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); {29992#true} is VALID [2022-04-08 04:38:44,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29992#true} {29992#true} #56#return; {29992#true} is VALID [2022-04-08 04:38:44,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {29992#true} call #t~ret5 := main(); {29992#true} is VALID [2022-04-08 04:38:44,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {29992#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; {30012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:38:44,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {30012#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {30012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:38:44,800 INFO L272 TraceCheckUtils]: 7: Hoare triple {30012#(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)); {29992#true} is VALID [2022-04-08 04:38:44,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,801 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {29992#true} {30012#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {30012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:38:44,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {30012#(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; {30034#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:38:44,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {30034#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {30034#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:38:44,801 INFO L272 TraceCheckUtils]: 14: Hoare triple {30034#(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)); {29992#true} is VALID [2022-04-08 04:38:44,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,802 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29992#true} {30034#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {30034#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:38:44,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {30034#(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; {30056#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:38:44,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {30056#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {30056#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:38:44,803 INFO L272 TraceCheckUtils]: 21: Hoare triple {30056#(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)); {29992#true} is VALID [2022-04-08 04:38:44,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,803 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29992#true} {30056#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {30056#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:38:44,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {30056#(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; {30078#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 04:38:44,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {30078#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !false; {30078#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 04:38:44,804 INFO L272 TraceCheckUtils]: 28: Hoare triple {30078#(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)); {29992#true} is VALID [2022-04-08 04:38:44,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,804 INFO L290 TraceCheckUtils]: 31: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,804 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {29992#true} {30078#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #50#return; {30078#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 04:38:44,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {30078#(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; {30100#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:38:44,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {30100#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {30100#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:38:44,805 INFO L272 TraceCheckUtils]: 35: Hoare triple {30100#(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)); {29992#true} is VALID [2022-04-08 04:38:44,805 INFO L290 TraceCheckUtils]: 36: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,805 INFO L290 TraceCheckUtils]: 37: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,806 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {29992#true} {30100#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {30100#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:38:44,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {30100#(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; {30122#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:38:44,806 INFO L290 TraceCheckUtils]: 41: Hoare triple {30122#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {30122#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:38:44,807 INFO L272 TraceCheckUtils]: 42: Hoare triple {30122#(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)); {29992#true} is VALID [2022-04-08 04:38:44,807 INFO L290 TraceCheckUtils]: 43: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,807 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29992#true} {30122#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {30122#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:38:44,807 INFO L290 TraceCheckUtils]: 47: Hoare triple {30122#(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; {30144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:38:44,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {30144#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {30144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:38:44,808 INFO L272 TraceCheckUtils]: 49: Hoare triple {30144#(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)); {29992#true} is VALID [2022-04-08 04:38:44,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,808 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29992#true} {30144#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {30144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:38:44,809 INFO L290 TraceCheckUtils]: 54: Hoare triple {30144#(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; {30166#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:38:44,809 INFO L290 TraceCheckUtils]: 55: Hoare triple {30166#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {30166#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:38:44,809 INFO L272 TraceCheckUtils]: 56: Hoare triple {30166#(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)); {29992#true} is VALID [2022-04-08 04:38:44,809 INFO L290 TraceCheckUtils]: 57: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,809 INFO L290 TraceCheckUtils]: 58: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,809 INFO L290 TraceCheckUtils]: 59: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,810 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {29992#true} {30166#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {30166#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:38:44,810 INFO L290 TraceCheckUtils]: 61: Hoare triple {30166#(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; {30188#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 04:38:44,810 INFO L290 TraceCheckUtils]: 62: Hoare triple {30188#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {30188#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 04:38:44,811 INFO L272 TraceCheckUtils]: 63: Hoare triple {30188#(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)); {29992#true} is VALID [2022-04-08 04:38:44,811 INFO L290 TraceCheckUtils]: 64: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,811 INFO L290 TraceCheckUtils]: 65: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,811 INFO L290 TraceCheckUtils]: 66: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,811 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {29992#true} {30188#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #50#return; {30188#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 04:38:44,811 INFO L290 TraceCheckUtils]: 68: Hoare triple {30188#(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; {30210#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:38:44,812 INFO L290 TraceCheckUtils]: 69: Hoare triple {30210#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {30210#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:38:44,812 INFO L272 TraceCheckUtils]: 70: Hoare triple {30210#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 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)); {29992#true} is VALID [2022-04-08 04:38:44,812 INFO L290 TraceCheckUtils]: 71: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,812 INFO L290 TraceCheckUtils]: 72: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,812 INFO L290 TraceCheckUtils]: 73: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,812 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29992#true} {30210#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #50#return; {30210#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:38:44,813 INFO L290 TraceCheckUtils]: 75: Hoare triple {30210#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 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; {30232#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:38:44,813 INFO L290 TraceCheckUtils]: 76: Hoare triple {30232#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {30232#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:38:44,813 INFO L272 TraceCheckUtils]: 77: Hoare triple {30232#(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)); {29992#true} is VALID [2022-04-08 04:38:44,813 INFO L290 TraceCheckUtils]: 78: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,813 INFO L290 TraceCheckUtils]: 79: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,813 INFO L290 TraceCheckUtils]: 80: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,814 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {29992#true} {30232#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {30232#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:38:44,814 INFO L290 TraceCheckUtils]: 82: Hoare triple {30232#(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; {30254#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 04:38:44,814 INFO L290 TraceCheckUtils]: 83: Hoare triple {30254#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {30254#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 04:38:44,814 INFO L272 TraceCheckUtils]: 84: Hoare triple {30254#(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)); {29992#true} is VALID [2022-04-08 04:38:44,814 INFO L290 TraceCheckUtils]: 85: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,815 INFO L290 TraceCheckUtils]: 86: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,815 INFO L290 TraceCheckUtils]: 87: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,815 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {29992#true} {30254#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #50#return; {30254#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 04:38:44,815 INFO L290 TraceCheckUtils]: 89: Hoare triple {30254#(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; {30276#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-08 04:38:44,816 INFO L290 TraceCheckUtils]: 90: Hoare triple {30276#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} assume !false; {30276#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-08 04:38:44,816 INFO L272 TraceCheckUtils]: 91: Hoare triple {30276#(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)); {29992#true} is VALID [2022-04-08 04:38:44,816 INFO L290 TraceCheckUtils]: 92: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,816 INFO L290 TraceCheckUtils]: 93: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,816 INFO L290 TraceCheckUtils]: 94: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,816 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {29992#true} {30276#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} #50#return; {30276#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-08 04:38:44,817 INFO L290 TraceCheckUtils]: 96: Hoare triple {30276#(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; {30298#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 04:38:44,817 INFO L290 TraceCheckUtils]: 97: Hoare triple {30298#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} assume !false; {30298#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 04:38:44,817 INFO L272 TraceCheckUtils]: 98: Hoare triple {30298#(and (= (+ (- 1) main_~c~0) 12) (= (+ 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)); {29992#true} is VALID [2022-04-08 04:38:44,817 INFO L290 TraceCheckUtils]: 99: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,817 INFO L290 TraceCheckUtils]: 100: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,817 INFO L290 TraceCheckUtils]: 101: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,818 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {29992#true} {30298#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} #50#return; {30298#(and (= (+ (- 1) main_~c~0) 12) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-08 04:38:44,818 INFO L290 TraceCheckUtils]: 103: Hoare triple {30298#(and (= (+ (- 1) main_~c~0) 12) (= (+ 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; {30320#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-08 04:38:44,818 INFO L290 TraceCheckUtils]: 104: Hoare triple {30320#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} assume !false; {30320#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-08 04:38:44,818 INFO L272 TraceCheckUtils]: 105: Hoare triple {30320#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 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)); {29992#true} is VALID [2022-04-08 04:38:44,818 INFO L290 TraceCheckUtils]: 106: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,819 INFO L290 TraceCheckUtils]: 107: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,819 INFO L290 TraceCheckUtils]: 108: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,819 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {29992#true} {30320#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} #50#return; {30320#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 10))} is VALID [2022-04-08 04:38:44,819 INFO L290 TraceCheckUtils]: 110: Hoare triple {30320#(and (= main_~c~0 14) (= (+ main_~y~0 (- 4)) 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; {30342#(and (= (+ main_~y~0 (- 5)) 10) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 04:38:44,820 INFO L290 TraceCheckUtils]: 111: Hoare triple {30342#(and (= (+ main_~y~0 (- 5)) 10) (= (+ (- 1) main_~c~0) 14))} assume !false; {30342#(and (= (+ main_~y~0 (- 5)) 10) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 04:38:44,820 INFO L272 TraceCheckUtils]: 112: Hoare triple {30342#(and (= (+ main_~y~0 (- 5)) 10) (= (+ (- 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)); {29992#true} is VALID [2022-04-08 04:38:44,820 INFO L290 TraceCheckUtils]: 113: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,820 INFO L290 TraceCheckUtils]: 114: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,820 INFO L290 TraceCheckUtils]: 115: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,820 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {29992#true} {30342#(and (= (+ main_~y~0 (- 5)) 10) (= (+ (- 1) main_~c~0) 14))} #50#return; {30342#(and (= (+ main_~y~0 (- 5)) 10) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 04:38:44,821 INFO L290 TraceCheckUtils]: 117: Hoare triple {30342#(and (= (+ main_~y~0 (- 5)) 10) (= (+ (- 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; {30364#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 04:38:44,821 INFO L290 TraceCheckUtils]: 118: Hoare triple {30364#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} assume !false; {30364#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 04:38:44,821 INFO L272 TraceCheckUtils]: 119: Hoare triple {30364#(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)); {29992#true} is VALID [2022-04-08 04:38:44,821 INFO L290 TraceCheckUtils]: 120: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,821 INFO L290 TraceCheckUtils]: 121: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,821 INFO L290 TraceCheckUtils]: 122: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,822 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {29992#true} {30364#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} #50#return; {30364#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 04:38:44,823 INFO L290 TraceCheckUtils]: 124: Hoare triple {30364#(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; {30386#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-08 04:38:44,823 INFO L290 TraceCheckUtils]: 125: Hoare triple {30386#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} assume !false; {30386#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-08 04:38:44,823 INFO L272 TraceCheckUtils]: 126: Hoare triple {30386#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 04:38:44,823 INFO L290 TraceCheckUtils]: 127: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,823 INFO L290 TraceCheckUtils]: 128: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,823 INFO L290 TraceCheckUtils]: 129: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,824 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29992#true} {30386#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} #50#return; {30386#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-08 04:38:44,824 INFO L290 TraceCheckUtils]: 131: Hoare triple {30386#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30408#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 04:38:44,824 INFO L290 TraceCheckUtils]: 132: Hoare triple {30408#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {30408#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 04:38:44,825 INFO L272 TraceCheckUtils]: 133: Hoare triple {30408#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 04:38:44,825 INFO L290 TraceCheckUtils]: 134: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,825 INFO L290 TraceCheckUtils]: 135: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,825 INFO L290 TraceCheckUtils]: 136: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,825 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {29992#true} {30408#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #50#return; {30408#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 04:38:44,825 INFO L290 TraceCheckUtils]: 138: Hoare triple {30408#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30430#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 04:38:44,826 INFO L290 TraceCheckUtils]: 139: Hoare triple {30430#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !false; {30430#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 04:38:44,826 INFO L272 TraceCheckUtils]: 140: Hoare triple {30430#(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)); {29992#true} is VALID [2022-04-08 04:38:44,826 INFO L290 TraceCheckUtils]: 141: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,826 INFO L290 TraceCheckUtils]: 142: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,826 INFO L290 TraceCheckUtils]: 143: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,826 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {29992#true} {30430#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} #50#return; {30430#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 04:38:44,827 INFO L290 TraceCheckUtils]: 145: Hoare triple {30430#(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; {30452#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 04:38:44,827 INFO L290 TraceCheckUtils]: 146: Hoare triple {30452#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {30452#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 04:38:44,827 INFO L272 TraceCheckUtils]: 147: Hoare triple {30452#(and (= main_~c~0 20) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 04:38:44,827 INFO L290 TraceCheckUtils]: 148: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,827 INFO L290 TraceCheckUtils]: 149: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,827 INFO L290 TraceCheckUtils]: 150: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,828 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {29992#true} {30452#(and (= main_~c~0 20) (= main_~y~0 20))} #50#return; {30452#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 04:38:44,828 INFO L290 TraceCheckUtils]: 152: Hoare triple {30452#(and (= main_~c~0 20) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30474#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-08 04:38:44,828 INFO L290 TraceCheckUtils]: 153: Hoare triple {30474#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} assume !false; {30474#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-08 04:38:44,829 INFO L272 TraceCheckUtils]: 154: Hoare triple {30474#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 04:38:44,829 INFO L290 TraceCheckUtils]: 155: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,829 INFO L290 TraceCheckUtils]: 156: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,829 INFO L290 TraceCheckUtils]: 157: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,829 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {29992#true} {30474#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} #50#return; {30474#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-08 04:38:44,829 INFO L290 TraceCheckUtils]: 159: Hoare triple {30474#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30496#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:38:44,830 INFO L290 TraceCheckUtils]: 160: Hoare triple {30496#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} assume !false; {30496#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:38:44,830 INFO L272 TraceCheckUtils]: 161: Hoare triple {30496#(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)); {29992#true} is VALID [2022-04-08 04:38:44,830 INFO L290 TraceCheckUtils]: 162: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,830 INFO L290 TraceCheckUtils]: 163: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,830 INFO L290 TraceCheckUtils]: 164: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,830 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {29992#true} {30496#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} #50#return; {30496#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:38:44,831 INFO L290 TraceCheckUtils]: 166: Hoare triple {30496#(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; {30518#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 04:38:44,831 INFO L290 TraceCheckUtils]: 167: Hoare triple {30518#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {30518#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 04:38:44,831 INFO L272 TraceCheckUtils]: 168: Hoare triple {30518#(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)); {29992#true} is VALID [2022-04-08 04:38:44,831 INFO L290 TraceCheckUtils]: 169: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,831 INFO L290 TraceCheckUtils]: 170: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,831 INFO L290 TraceCheckUtils]: 171: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,832 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {29992#true} {30518#(and (= 23 main_~y~0) (= 23 main_~c~0))} #50#return; {30518#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 04:38:44,832 INFO L290 TraceCheckUtils]: 173: Hoare triple {30518#(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; {30540#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 04:38:44,832 INFO L290 TraceCheckUtils]: 174: Hoare triple {30540#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {30540#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 04:38:44,832 INFO L272 TraceCheckUtils]: 175: Hoare triple {30540#(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)); {29992#true} is VALID [2022-04-08 04:38:44,833 INFO L290 TraceCheckUtils]: 176: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,833 INFO L290 TraceCheckUtils]: 177: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,833 INFO L290 TraceCheckUtils]: 178: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,833 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {29992#true} {30540#(and (= main_~c~0 24) (= main_~y~0 24))} #50#return; {30540#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 04:38:44,833 INFO L290 TraceCheckUtils]: 180: Hoare triple {30540#(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; {30562#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 04:38:44,834 INFO L290 TraceCheckUtils]: 181: Hoare triple {30562#(and (= main_~y~0 25) (= main_~c~0 25))} assume !false; {30562#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 04:38:44,834 INFO L272 TraceCheckUtils]: 182: Hoare triple {30562#(and (= main_~y~0 25) (= main_~c~0 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29992#true} is VALID [2022-04-08 04:38:44,834 INFO L290 TraceCheckUtils]: 183: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,834 INFO L290 TraceCheckUtils]: 184: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,834 INFO L290 TraceCheckUtils]: 185: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,834 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {29992#true} {30562#(and (= main_~y~0 25) (= main_~c~0 25))} #50#return; {30562#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 04:38:44,835 INFO L290 TraceCheckUtils]: 187: Hoare triple {30562#(and (= main_~y~0 25) (= main_~c~0 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30584#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 04:38:44,835 INFO L290 TraceCheckUtils]: 188: Hoare triple {30584#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} assume !false; {30584#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 04:38:44,835 INFO L272 TraceCheckUtils]: 189: Hoare triple {30584#(and (= (+ (- 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)); {29992#true} is VALID [2022-04-08 04:38:44,835 INFO L290 TraceCheckUtils]: 190: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,835 INFO L290 TraceCheckUtils]: 191: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,835 INFO L290 TraceCheckUtils]: 192: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,836 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {29992#true} {30584#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} #50#return; {30584#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 04:38:44,836 INFO L290 TraceCheckUtils]: 194: Hoare triple {30584#(and (= (+ (- 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; {30606#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} is VALID [2022-04-08 04:38:44,836 INFO L290 TraceCheckUtils]: 195: Hoare triple {30606#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} assume !false; {30606#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} is VALID [2022-04-08 04:38:44,836 INFO L272 TraceCheckUtils]: 196: Hoare triple {30606#(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)); {29992#true} is VALID [2022-04-08 04:38:44,836 INFO L290 TraceCheckUtils]: 197: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,837 INFO L290 TraceCheckUtils]: 198: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,837 INFO L290 TraceCheckUtils]: 199: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,837 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {29992#true} {30606#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} #50#return; {30606#(and (= 25 (+ (- 2) main_~c~0)) (= main_~y~0 27))} is VALID [2022-04-08 04:38:44,837 INFO L290 TraceCheckUtils]: 201: Hoare triple {30606#(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; {30628#(and (= (+ main_~c~0 (- 3)) 25) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 04:38:44,838 INFO L290 TraceCheckUtils]: 202: Hoare triple {30628#(and (= (+ main_~c~0 (- 3)) 25) (= (+ (- 1) main_~y~0) 27))} assume !false; {30628#(and (= (+ main_~c~0 (- 3)) 25) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 04:38:44,838 INFO L272 TraceCheckUtils]: 203: Hoare triple {30628#(and (= (+ main_~c~0 (- 3)) 25) (= (+ (- 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)); {29992#true} is VALID [2022-04-08 04:38:44,838 INFO L290 TraceCheckUtils]: 204: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,838 INFO L290 TraceCheckUtils]: 205: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,838 INFO L290 TraceCheckUtils]: 206: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,838 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {29992#true} {30628#(and (= (+ main_~c~0 (- 3)) 25) (= (+ (- 1) main_~y~0) 27))} #50#return; {30628#(and (= (+ main_~c~0 (- 3)) 25) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 04:38:44,839 INFO L290 TraceCheckUtils]: 208: Hoare triple {30628#(and (= (+ main_~c~0 (- 3)) 25) (= (+ (- 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; {30650#(and (= 25 (+ main_~c~0 (- 4))) (= 29 main_~y~0))} is VALID [2022-04-08 04:38:44,839 INFO L290 TraceCheckUtils]: 209: Hoare triple {30650#(and (= 25 (+ main_~c~0 (- 4))) (= 29 main_~y~0))} assume !false; {30650#(and (= 25 (+ main_~c~0 (- 4))) (= 29 main_~y~0))} is VALID [2022-04-08 04:38:44,839 INFO L272 TraceCheckUtils]: 210: Hoare triple {30650#(and (= 25 (+ main_~c~0 (- 4))) (= 29 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)); {29992#true} is VALID [2022-04-08 04:38:44,839 INFO L290 TraceCheckUtils]: 211: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,839 INFO L290 TraceCheckUtils]: 212: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,839 INFO L290 TraceCheckUtils]: 213: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,840 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {29992#true} {30650#(and (= 25 (+ main_~c~0 (- 4))) (= 29 main_~y~0))} #50#return; {30650#(and (= 25 (+ main_~c~0 (- 4))) (= 29 main_~y~0))} is VALID [2022-04-08 04:38:44,840 INFO L290 TraceCheckUtils]: 215: Hoare triple {30650#(and (= 25 (+ main_~c~0 (- 4))) (= 29 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; {30672#(and (= (+ main_~c~0 (- 5)) 25) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:38:44,840 INFO L290 TraceCheckUtils]: 216: Hoare triple {30672#(and (= (+ main_~c~0 (- 5)) 25) (= 29 (+ (- 1) main_~y~0)))} assume !false; {30672#(and (= (+ main_~c~0 (- 5)) 25) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:38:44,840 INFO L272 TraceCheckUtils]: 217: Hoare triple {30672#(and (= (+ main_~c~0 (- 5)) 25) (= 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)); {29992#true} is VALID [2022-04-08 04:38:44,840 INFO L290 TraceCheckUtils]: 218: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,841 INFO L290 TraceCheckUtils]: 219: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,841 INFO L290 TraceCheckUtils]: 220: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,841 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {29992#true} {30672#(and (= (+ main_~c~0 (- 5)) 25) (= 29 (+ (- 1) main_~y~0)))} #50#return; {30672#(and (= (+ main_~c~0 (- 5)) 25) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:38:44,841 INFO L290 TraceCheckUtils]: 222: Hoare triple {30672#(and (= (+ main_~c~0 (- 5)) 25) (= 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; {30694#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-08 04:38:44,842 INFO L290 TraceCheckUtils]: 223: Hoare triple {30694#(and (= main_~y~0 31) (= main_~c~0 31))} assume !false; {30694#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-08 04:38:44,842 INFO L272 TraceCheckUtils]: 224: Hoare triple {30694#(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)); {29992#true} is VALID [2022-04-08 04:38:44,842 INFO L290 TraceCheckUtils]: 225: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,842 INFO L290 TraceCheckUtils]: 226: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,842 INFO L290 TraceCheckUtils]: 227: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,842 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {29992#true} {30694#(and (= main_~y~0 31) (= main_~c~0 31))} #50#return; {30694#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-08 04:38:44,843 INFO L290 TraceCheckUtils]: 229: Hoare triple {30694#(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; {30716#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-08 04:38:44,843 INFO L290 TraceCheckUtils]: 230: Hoare triple {30716#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} assume !false; {30716#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-08 04:38:44,843 INFO L272 TraceCheckUtils]: 231: Hoare triple {30716#(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)); {29992#true} is VALID [2022-04-08 04:38:44,843 INFO L290 TraceCheckUtils]: 232: Hoare triple {29992#true} ~cond := #in~cond; {29992#true} is VALID [2022-04-08 04:38:44,843 INFO L290 TraceCheckUtils]: 233: Hoare triple {29992#true} assume !(0 == ~cond); {29992#true} is VALID [2022-04-08 04:38:44,843 INFO L290 TraceCheckUtils]: 234: Hoare triple {29992#true} assume true; {29992#true} is VALID [2022-04-08 04:38:44,844 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {29992#true} {30716#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} #50#return; {30716#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-08 04:38:44,847 INFO L290 TraceCheckUtils]: 236: Hoare triple {30716#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} assume !(~c~0 < ~k~0); {30738#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~k~0 32))} is VALID [2022-04-08 04:38:44,848 INFO L272 TraceCheckUtils]: 237: Hoare triple {30738#(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)); {30742#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:38:44,848 INFO L290 TraceCheckUtils]: 238: Hoare triple {30742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:38:44,849 INFO L290 TraceCheckUtils]: 239: Hoare triple {30746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29993#false} is VALID [2022-04-08 04:38:44,849 INFO L290 TraceCheckUtils]: 240: Hoare triple {29993#false} assume !false; {29993#false} is VALID [2022-04-08 04:38:44,850 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-08 04:38:44,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:38:45,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:38:45,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492651308] [2022-04-08 04:38:45,331 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:38:45,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624522965] [2022-04-08 04:38:45,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624522965] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:38:45,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:38:45,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2022-04-08 04:38:45,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:38:45,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1283834254] [2022-04-08 04:38:45,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1283834254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:38:45,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:38:45,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-08 04:38:45,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671864922] [2022-04-08 04:38:45,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:38:45,332 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-08 04:38:45,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:38:45,333 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-08 04:38:45,950 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-08 04:38:45,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-08 04:38:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:38:45,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-08 04:38:45,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 04:38:45,952 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-08 04:39:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:39:14,393 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2022-04-08 04:39:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 04:39:14,393 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-08 04:39:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:39:14,394 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-08 04:39:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 154 transitions. [2022-04-08 04:39:14,397 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-08 04:39:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 154 transitions. [2022-04-08 04:39:14,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 154 transitions. [2022-04-08 04:39:15,049 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-08 04:39:15,051 INFO L225 Difference]: With dead ends: 126 [2022-04-08 04:39:15,051 INFO L226 Difference]: Without dead ends: 121 [2022-04-08 04:39:15,052 INFO L912 BasicCegarLoop]: 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-08 04:39:15,052 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 3611 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s 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, 14.7s IncrementalHoareTripleChecker+Time [2022-04-08 04:39:15,052 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1727 Invalid, 3611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3611 Invalid, 0 Unknown, 0 Unchecked, 14.7s Time] [2022-04-08 04:39:15,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-08 04:39:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-04-08 04:39:15,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:39:15,196 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-08 04:39:15,196 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-08 04:39:15,196 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-08 04:39:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:39:15,199 INFO L93 Difference]: Finished difference Result 121 states and 153 transitions. [2022-04-08 04:39:15,199 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2022-04-08 04:39:15,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:39:15,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:39:15,199 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-08 04:39:15,199 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-08 04:39:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:39:15,202 INFO L93 Difference]: Finished difference Result 121 states and 153 transitions. [2022-04-08 04:39:15,202 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2022-04-08 04:39:15,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:39:15,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:39:15,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:39:15,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:39:15,203 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-08 04:39:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2022-04-08 04:39:15,206 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 241 [2022-04-08 04:39:15,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:39:15,206 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2022-04-08 04:39:15,206 INFO L479 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-08 04:39:15,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 153 transitions. [2022-04-08 04:39:15,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:39:15,883 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2022-04-08 04:39:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-04-08 04:39:15,883 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:39:15,884 INFO L499 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:39:15,903 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-08 04:39:16,084 WARN L460 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-08 04:39:16,084 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:39:16,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:39:16,085 INFO L85 PathProgramCache]: Analyzing trace with hash 758613733, now seen corresponding path program 65 times [2022-04-08 04:39:16,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:39:16,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1033073836] [2022-04-08 04:39:16,173 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:39:16,173 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:39:16,173 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:39:16,173 INFO L85 PathProgramCache]: Analyzing trace with hash 758613733, now seen corresponding path program 66 times [2022-04-08 04:39:16,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:39:16,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734614988] [2022-04-08 04:39:16,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:39:16,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:39:16,190 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:39:16,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [349261441] [2022-04-08 04:39:16,190 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:39:16,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:39:16,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:39:16,192 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-08 04:39:16,192 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-08 04:39:37,018 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2022-04-08 04:39:37,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:39:37,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 141 conjunts are in the unsatisfiable core [2022-04-08 04:39:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:39:37,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:39:39,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {31534#true} call ULTIMATE.init(); {31534#true} is VALID [2022-04-08 04:39:39,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {31534#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); {31534#true} is VALID [2022-04-08 04:39:39,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31534#true} {31534#true} #56#return; {31534#true} is VALID [2022-04-08 04:39:39,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {31534#true} call #t~ret5 := main(); {31534#true} is VALID [2022-04-08 04:39:39,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {31534#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; {31554#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:39:39,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {31554#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {31554#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:39:39,144 INFO L272 TraceCheckUtils]: 7: Hoare triple {31554#(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)); {31534#true} is VALID [2022-04-08 04:39:39,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,144 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {31534#true} {31554#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {31554#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:39:39,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {31554#(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; {31576#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 04:39:39,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {31576#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {31576#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 04:39:39,145 INFO L272 TraceCheckUtils]: 14: Hoare triple {31576#(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)); {31534#true} is VALID [2022-04-08 04:39:39,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,146 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {31534#true} {31576#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #50#return; {31576#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 04:39:39,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {31576#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31598#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {31598#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} assume !false; {31598#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,146 INFO L272 TraceCheckUtils]: 21: Hoare triple {31598#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 04:39:39,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,147 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {31534#true} {31598#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} #50#return; {31598#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {31598#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31620#(and (= (+ (- 2) main_~y~0) 1) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 04:39:39,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {31620#(and (= (+ (- 2) main_~y~0) 1) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {31620#(and (= (+ (- 2) main_~y~0) 1) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 04:39:39,148 INFO L272 TraceCheckUtils]: 28: Hoare triple {31620#(and (= (+ (- 2) main_~y~0) 1) (< 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)); {31534#true} is VALID [2022-04-08 04:39:39,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,148 INFO L290 TraceCheckUtils]: 31: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,148 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {31534#true} {31620#(and (= (+ (- 2) main_~y~0) 1) (< 0 main_~k~0) (= main_~c~0 3))} #50#return; {31620#(and (= (+ (- 2) main_~y~0) 1) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 04:39:39,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {31620#(and (= (+ (- 2) main_~y~0) 1) (< 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; {31642#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {31642#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0))} assume !false; {31642#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,149 INFO L272 TraceCheckUtils]: 35: Hoare triple {31642#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 04:39:39,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,150 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31534#true} {31642#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0))} #50#return; {31642#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {31642#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31664#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {31664#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {31664#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,151 INFO L272 TraceCheckUtils]: 42: Hoare triple {31664#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 04:39:39,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,151 INFO L290 TraceCheckUtils]: 45: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,151 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {31534#true} {31664#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} #50#return; {31664#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,151 INFO L290 TraceCheckUtils]: 47: Hoare triple {31664#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31686#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,152 INFO L290 TraceCheckUtils]: 48: Hoare triple {31686#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !false; {31686#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,152 INFO L272 TraceCheckUtils]: 49: Hoare triple {31686#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 04:39:39,152 INFO L290 TraceCheckUtils]: 50: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,152 INFO L290 TraceCheckUtils]: 51: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,152 INFO L290 TraceCheckUtils]: 52: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,152 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {31534#true} {31686#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} #50#return; {31686#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,153 INFO L290 TraceCheckUtils]: 54: Hoare triple {31686#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31708#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,153 INFO L290 TraceCheckUtils]: 55: Hoare triple {31708#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {31708#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,153 INFO L272 TraceCheckUtils]: 56: Hoare triple {31708#(and (= (+ (- 1) main_~c~0) 6) (= 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)); {31534#true} is VALID [2022-04-08 04:39:39,153 INFO L290 TraceCheckUtils]: 57: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,153 INFO L290 TraceCheckUtils]: 58: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,153 INFO L290 TraceCheckUtils]: 59: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,154 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {31534#true} {31708#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #50#return; {31708#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,154 INFO L290 TraceCheckUtils]: 61: Hoare triple {31708#(and (= (+ (- 1) main_~c~0) 6) (= 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; {31730#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,155 INFO L290 TraceCheckUtils]: 62: Hoare triple {31730#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} assume !false; {31730#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,155 INFO L272 TraceCheckUtils]: 63: Hoare triple {31730#(and (= 6 (+ (- 2) 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)); {31534#true} is VALID [2022-04-08 04:39:39,155 INFO L290 TraceCheckUtils]: 64: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,155 INFO L290 TraceCheckUtils]: 65: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,155 INFO L290 TraceCheckUtils]: 66: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,155 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {31534#true} {31730#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} #50#return; {31730#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,156 INFO L290 TraceCheckUtils]: 68: Hoare triple {31730#(and (= 6 (+ (- 2) 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; {31752#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,156 INFO L290 TraceCheckUtils]: 69: Hoare triple {31752#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {31752#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,156 INFO L272 TraceCheckUtils]: 70: Hoare triple {31752#(and (= (+ main_~y~0 (- 3)) 6) (= 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)); {31534#true} is VALID [2022-04-08 04:39:39,156 INFO L290 TraceCheckUtils]: 71: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,156 INFO L290 TraceCheckUtils]: 72: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,156 INFO L290 TraceCheckUtils]: 73: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,157 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {31534#true} {31752#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} #50#return; {31752#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,157 INFO L290 TraceCheckUtils]: 75: Hoare triple {31752#(and (= (+ main_~y~0 (- 3)) 6) (= 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; {31774#(and (= (+ main_~y~0 (- 4)) 6) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-08 04:39:39,157 INFO L290 TraceCheckUtils]: 76: Hoare triple {31774#(and (= (+ main_~y~0 (- 4)) 6) (< 0 main_~k~0) (= main_~c~0 10))} assume !false; {31774#(and (= (+ main_~y~0 (- 4)) 6) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-08 04:39:39,157 INFO L272 TraceCheckUtils]: 77: Hoare triple {31774#(and (= (+ main_~y~0 (- 4)) 6) (< 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)); {31534#true} is VALID [2022-04-08 04:39:39,157 INFO L290 TraceCheckUtils]: 78: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,158 INFO L290 TraceCheckUtils]: 79: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,158 INFO L290 TraceCheckUtils]: 80: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,158 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {31534#true} {31774#(and (= (+ main_~y~0 (- 4)) 6) (< 0 main_~k~0) (= main_~c~0 10))} #50#return; {31774#(and (= (+ main_~y~0 (- 4)) 6) (< 0 main_~k~0) (= main_~c~0 10))} is VALID [2022-04-08 04:39:39,158 INFO L290 TraceCheckUtils]: 82: Hoare triple {31774#(and (= (+ main_~y~0 (- 4)) 6) (< 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; {31796#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,159 INFO L290 TraceCheckUtils]: 83: Hoare triple {31796#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} assume !false; {31796#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,159 INFO L272 TraceCheckUtils]: 84: Hoare triple {31796#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 04:39:39,159 INFO L290 TraceCheckUtils]: 85: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,159 INFO L290 TraceCheckUtils]: 86: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,159 INFO L290 TraceCheckUtils]: 87: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,159 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {31534#true} {31796#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} #50#return; {31796#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,160 INFO L290 TraceCheckUtils]: 89: Hoare triple {31796#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31818#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,160 INFO L290 TraceCheckUtils]: 90: Hoare triple {31818#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11) (< 0 main_~k~0))} assume !false; {31818#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,160 INFO L272 TraceCheckUtils]: 91: Hoare triple {31818#(and (= main_~y~0 12) (= (+ (- 1) main_~c~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)); {31534#true} is VALID [2022-04-08 04:39:39,160 INFO L290 TraceCheckUtils]: 92: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,160 INFO L290 TraceCheckUtils]: 93: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,160 INFO L290 TraceCheckUtils]: 94: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,161 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {31534#true} {31818#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11) (< 0 main_~k~0))} #50#return; {31818#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,161 INFO L290 TraceCheckUtils]: 96: Hoare triple {31818#(and (= main_~y~0 12) (= (+ (- 1) main_~c~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; {31840#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 04:39:39,161 INFO L290 TraceCheckUtils]: 97: Hoare triple {31840#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {31840#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 04:39:39,162 INFO L272 TraceCheckUtils]: 98: Hoare triple {31840#(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)); {31534#true} is VALID [2022-04-08 04:39:39,162 INFO L290 TraceCheckUtils]: 99: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,162 INFO L290 TraceCheckUtils]: 100: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,162 INFO L290 TraceCheckUtils]: 101: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,162 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {31534#true} {31840#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} #50#return; {31840#(and (= main_~c~0 13) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 04:39:39,162 INFO L290 TraceCheckUtils]: 103: Hoare triple {31840#(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; {31862#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,163 INFO L290 TraceCheckUtils]: 104: Hoare triple {31862#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} assume !false; {31862#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,163 INFO L272 TraceCheckUtils]: 105: Hoare triple {31862#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 04:39:39,163 INFO L290 TraceCheckUtils]: 106: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,163 INFO L290 TraceCheckUtils]: 107: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,163 INFO L290 TraceCheckUtils]: 108: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,163 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {31534#true} {31862#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} #50#return; {31862#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,164 INFO L290 TraceCheckUtils]: 110: Hoare triple {31862#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31884#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,164 INFO L290 TraceCheckUtils]: 111: Hoare triple {31884#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} assume !false; {31884#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,164 INFO L272 TraceCheckUtils]: 112: Hoare triple {31884#(and (= main_~c~0 15) (= main_~y~0 15) (< 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)); {31534#true} is VALID [2022-04-08 04:39:39,164 INFO L290 TraceCheckUtils]: 113: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,164 INFO L290 TraceCheckUtils]: 114: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,164 INFO L290 TraceCheckUtils]: 115: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,165 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {31534#true} {31884#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} #50#return; {31884#(and (= main_~c~0 15) (= main_~y~0 15) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,165 INFO L290 TraceCheckUtils]: 117: Hoare triple {31884#(and (= main_~c~0 15) (= main_~y~0 15) (< 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; {31906#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,166 INFO L290 TraceCheckUtils]: 118: Hoare triple {31906#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 0 main_~k~0))} assume !false; {31906#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,166 INFO L272 TraceCheckUtils]: 119: Hoare triple {31906#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 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)); {31534#true} is VALID [2022-04-08 04:39:39,166 INFO L290 TraceCheckUtils]: 120: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,166 INFO L290 TraceCheckUtils]: 121: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,166 INFO L290 TraceCheckUtils]: 122: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,166 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {31534#true} {31906#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 0 main_~k~0))} #50#return; {31906#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,167 INFO L290 TraceCheckUtils]: 124: Hoare triple {31906#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15) (< 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; {31928#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 04:39:39,167 INFO L290 TraceCheckUtils]: 125: Hoare triple {31928#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !false; {31928#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 04:39:39,167 INFO L272 TraceCheckUtils]: 126: Hoare triple {31928#(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)); {31534#true} is VALID [2022-04-08 04:39:39,167 INFO L290 TraceCheckUtils]: 127: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,167 INFO L290 TraceCheckUtils]: 128: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,167 INFO L290 TraceCheckUtils]: 129: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,168 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {31534#true} {31928#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} #50#return; {31928#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 04:39:39,168 INFO L290 TraceCheckUtils]: 131: Hoare triple {31928#(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; {31950#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 04:39:39,168 INFO L290 TraceCheckUtils]: 132: Hoare triple {31950#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !false; {31950#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 04:39:39,168 INFO L272 TraceCheckUtils]: 133: Hoare triple {31950#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 04:39:39,168 INFO L290 TraceCheckUtils]: 134: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,171 INFO L290 TraceCheckUtils]: 135: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,171 INFO L290 TraceCheckUtils]: 136: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,175 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {31534#true} {31950#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} #50#return; {31950#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 04:39:39,176 INFO L290 TraceCheckUtils]: 138: Hoare triple {31950#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31972#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:39:39,177 INFO L290 TraceCheckUtils]: 139: Hoare triple {31972#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {31972#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:39:39,177 INFO L272 TraceCheckUtils]: 140: Hoare triple {31972#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 04:39:39,177 INFO L290 TraceCheckUtils]: 141: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,177 INFO L290 TraceCheckUtils]: 142: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,177 INFO L290 TraceCheckUtils]: 143: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,178 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {31534#true} {31972#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} #50#return; {31972#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:39:39,178 INFO L290 TraceCheckUtils]: 145: Hoare triple {31972#(and (= 18 (+ (- 1) main_~y~0)) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31994#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,179 INFO L290 TraceCheckUtils]: 146: Hoare triple {31994#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} assume !false; {31994#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,179 INFO L272 TraceCheckUtils]: 147: Hoare triple {31994#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 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)); {31534#true} is VALID [2022-04-08 04:39:39,179 INFO L290 TraceCheckUtils]: 148: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,179 INFO L290 TraceCheckUtils]: 149: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,179 INFO L290 TraceCheckUtils]: 150: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,180 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {31534#true} {31994#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} #50#return; {31994#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,180 INFO L290 TraceCheckUtils]: 152: Hoare triple {31994#(and (= 18 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 18) (< 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; {32016#(and (= (+ main_~c~0 (- 3)) 18) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,181 INFO L290 TraceCheckUtils]: 153: Hoare triple {32016#(and (= (+ main_~c~0 (- 3)) 18) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} assume !false; {32016#(and (= (+ main_~c~0 (- 3)) 18) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,181 INFO L272 TraceCheckUtils]: 154: Hoare triple {32016#(and (= (+ main_~c~0 (- 3)) 18) (= (+ main_~y~0 (- 3)) 18) (< 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)); {31534#true} is VALID [2022-04-08 04:39:39,181 INFO L290 TraceCheckUtils]: 155: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,181 INFO L290 TraceCheckUtils]: 156: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,181 INFO L290 TraceCheckUtils]: 157: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,182 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {31534#true} {32016#(and (= (+ main_~c~0 (- 3)) 18) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} #50#return; {32016#(and (= (+ main_~c~0 (- 3)) 18) (= (+ main_~y~0 (- 3)) 18) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,182 INFO L290 TraceCheckUtils]: 159: Hoare triple {32016#(and (= (+ main_~c~0 (- 3)) 18) (= (+ main_~y~0 (- 3)) 18) (< 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; {32038#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,183 INFO L290 TraceCheckUtils]: 160: Hoare triple {32038#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !false; {32038#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,183 INFO L272 TraceCheckUtils]: 161: Hoare triple {32038#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 04:39:39,183 INFO L290 TraceCheckUtils]: 162: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,183 INFO L290 TraceCheckUtils]: 163: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,183 INFO L290 TraceCheckUtils]: 164: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,184 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {31534#true} {32038#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} #50#return; {32038#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,184 INFO L290 TraceCheckUtils]: 166: Hoare triple {32038#(and (= main_~y~0 22) (= main_~c~0 22) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32060#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:39:39,184 INFO L290 TraceCheckUtils]: 167: Hoare triple {32060#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {32060#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:39:39,184 INFO L272 TraceCheckUtils]: 168: Hoare triple {32060#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 04:39:39,185 INFO L290 TraceCheckUtils]: 169: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,185 INFO L290 TraceCheckUtils]: 170: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,185 INFO L290 TraceCheckUtils]: 171: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,185 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {31534#true} {32060#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} #50#return; {32060#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:39:39,185 INFO L290 TraceCheckUtils]: 173: Hoare triple {32060#(and (= 23 main_~c~0) (< 0 main_~k~0) (= 22 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32082#(and (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:39:39,186 INFO L290 TraceCheckUtils]: 174: Hoare triple {32082#(and (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0) (= 23 (+ (- 1) main_~c~0)))} assume !false; {32082#(and (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:39:39,186 INFO L272 TraceCheckUtils]: 175: Hoare triple {32082#(and (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0) (= 23 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 04:39:39,186 INFO L290 TraceCheckUtils]: 176: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,186 INFO L290 TraceCheckUtils]: 177: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,186 INFO L290 TraceCheckUtils]: 178: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,186 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {31534#true} {32082#(and (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0) (= 23 (+ (- 1) main_~c~0)))} #50#return; {32082#(and (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:39:39,187 INFO L290 TraceCheckUtils]: 180: Hoare triple {32082#(and (= (+ (- 2) main_~y~0) 22) (< 0 main_~k~0) (= 23 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32104#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,187 INFO L290 TraceCheckUtils]: 181: Hoare triple {32104#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22) (< 0 main_~k~0))} assume !false; {32104#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,187 INFO L272 TraceCheckUtils]: 182: Hoare triple {32104#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 04:39:39,187 INFO L290 TraceCheckUtils]: 183: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,187 INFO L290 TraceCheckUtils]: 184: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,187 INFO L290 TraceCheckUtils]: 185: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,188 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {31534#true} {32104#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22) (< 0 main_~k~0))} #50#return; {32104#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,188 INFO L290 TraceCheckUtils]: 187: Hoare triple {32104#(and (= main_~c~0 25) (= (+ main_~y~0 (- 3)) 22) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32126#(and (= (+ main_~y~0 (- 4)) 22) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-08 04:39:39,189 INFO L290 TraceCheckUtils]: 188: Hoare triple {32126#(and (= (+ main_~y~0 (- 4)) 22) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25))} assume !false; {32126#(and (= (+ main_~y~0 (- 4)) 22) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-08 04:39:39,189 INFO L272 TraceCheckUtils]: 189: Hoare triple {32126#(and (= (+ main_~y~0 (- 4)) 22) (< 0 main_~k~0) (= (+ (- 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)); {31534#true} is VALID [2022-04-08 04:39:39,189 INFO L290 TraceCheckUtils]: 190: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,189 INFO L290 TraceCheckUtils]: 191: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,189 INFO L290 TraceCheckUtils]: 192: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,189 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {31534#true} {32126#(and (= (+ main_~y~0 (- 4)) 22) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25))} #50#return; {32126#(and (= (+ main_~y~0 (- 4)) 22) (< 0 main_~k~0) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-08 04:39:39,190 INFO L290 TraceCheckUtils]: 194: Hoare triple {32126#(and (= (+ main_~y~0 (- 4)) 22) (< 0 main_~k~0) (= (+ (- 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; {32148#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,190 INFO L290 TraceCheckUtils]: 195: Hoare triple {32148#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27) (< 0 main_~k~0))} assume !false; {32148#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,190 INFO L272 TraceCheckUtils]: 196: Hoare triple {32148#(and (= 22 (+ main_~y~0 (- 5))) (= 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)); {31534#true} is VALID [2022-04-08 04:39:39,190 INFO L290 TraceCheckUtils]: 197: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,190 INFO L290 TraceCheckUtils]: 198: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,190 INFO L290 TraceCheckUtils]: 199: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,191 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {31534#true} {32148#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27) (< 0 main_~k~0))} #50#return; {32148#(and (= 22 (+ main_~y~0 (- 5))) (= main_~c~0 27) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,191 INFO L290 TraceCheckUtils]: 201: Hoare triple {32148#(and (= 22 (+ main_~y~0 (- 5))) (= 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; {32170#(and (= (+ (- 1) main_~c~0) 27) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 22))} is VALID [2022-04-08 04:39:39,191 INFO L290 TraceCheckUtils]: 202: Hoare triple {32170#(and (= (+ (- 1) main_~c~0) 27) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 22))} assume !false; {32170#(and (= (+ (- 1) main_~c~0) 27) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 22))} is VALID [2022-04-08 04:39:39,191 INFO L272 TraceCheckUtils]: 203: Hoare triple {32170#(and (= (+ (- 1) main_~c~0) 27) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 04:39:39,191 INFO L290 TraceCheckUtils]: 204: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,192 INFO L290 TraceCheckUtils]: 205: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,192 INFO L290 TraceCheckUtils]: 206: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,192 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {31534#true} {32170#(and (= (+ (- 1) main_~c~0) 27) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 22))} #50#return; {32170#(and (= (+ (- 1) main_~c~0) 27) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 22))} is VALID [2022-04-08 04:39:39,192 INFO L290 TraceCheckUtils]: 208: Hoare triple {32170#(and (= (+ (- 1) main_~c~0) 27) (< 0 main_~k~0) (= (+ main_~y~0 (- 6)) 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32192#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,193 INFO L290 TraceCheckUtils]: 209: Hoare triple {32192#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} assume !false; {32192#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,193 INFO L272 TraceCheckUtils]: 210: Hoare triple {32192#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 04:39:39,193 INFO L290 TraceCheckUtils]: 211: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,193 INFO L290 TraceCheckUtils]: 212: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,193 INFO L290 TraceCheckUtils]: 213: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,193 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {31534#true} {32192#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} #50#return; {32192#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,194 INFO L290 TraceCheckUtils]: 215: Hoare triple {32192#(and (= 29 main_~y~0) (= 29 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32214#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,194 INFO L290 TraceCheckUtils]: 216: Hoare triple {32214#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29) (< 0 main_~k~0))} assume !false; {32214#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,194 INFO L272 TraceCheckUtils]: 217: Hoare triple {32214#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31534#true} is VALID [2022-04-08 04:39:39,194 INFO L290 TraceCheckUtils]: 218: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,194 INFO L290 TraceCheckUtils]: 219: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,194 INFO L290 TraceCheckUtils]: 220: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,195 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {31534#true} {32214#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29) (< 0 main_~k~0))} #50#return; {32214#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,195 INFO L290 TraceCheckUtils]: 222: Hoare triple {32214#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {32236#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,196 INFO L290 TraceCheckUtils]: 223: Hoare triple {32236#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {32236#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,196 INFO L272 TraceCheckUtils]: 224: Hoare triple {32236#(and (= main_~y~0 31) (= 29 (+ (- 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)); {31534#true} is VALID [2022-04-08 04:39:39,196 INFO L290 TraceCheckUtils]: 225: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,196 INFO L290 TraceCheckUtils]: 226: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,196 INFO L290 TraceCheckUtils]: 227: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,196 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {31534#true} {32236#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #50#return; {32236#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,199 INFO L290 TraceCheckUtils]: 229: Hoare triple {32236#(and (= main_~y~0 31) (= 29 (+ (- 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; {32258#(and (= 29 (+ main_~c~0 (- 3))) (= 31 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,199 INFO L290 TraceCheckUtils]: 230: Hoare triple {32258#(and (= 29 (+ main_~c~0 (- 3))) (= 31 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {32258#(and (= 29 (+ main_~c~0 (- 3))) (= 31 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,199 INFO L272 TraceCheckUtils]: 231: Hoare triple {32258#(and (= 29 (+ main_~c~0 (- 3))) (= 31 (+ (- 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)); {31534#true} is VALID [2022-04-08 04:39:39,200 INFO L290 TraceCheckUtils]: 232: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,200 INFO L290 TraceCheckUtils]: 233: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,200 INFO L290 TraceCheckUtils]: 234: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,200 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {31534#true} {32258#(and (= 29 (+ main_~c~0 (- 3))) (= 31 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #50#return; {32258#(and (= 29 (+ main_~c~0 (- 3))) (= 31 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 04:39:39,201 INFO L290 TraceCheckUtils]: 236: Hoare triple {32258#(and (= 29 (+ main_~c~0 (- 3))) (= 31 (+ (- 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; {32280#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-08 04:39:39,201 INFO L290 TraceCheckUtils]: 237: Hoare triple {32280#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} assume !false; {32280#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-08 04:39:39,201 INFO L272 TraceCheckUtils]: 238: Hoare triple {32280#(and (= main_~y~0 33) (<= 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)); {31534#true} is VALID [2022-04-08 04:39:39,201 INFO L290 TraceCheckUtils]: 239: Hoare triple {31534#true} ~cond := #in~cond; {31534#true} is VALID [2022-04-08 04:39:39,202 INFO L290 TraceCheckUtils]: 240: Hoare triple {31534#true} assume !(0 == ~cond); {31534#true} is VALID [2022-04-08 04:39:39,202 INFO L290 TraceCheckUtils]: 241: Hoare triple {31534#true} assume true; {31534#true} is VALID [2022-04-08 04:39:39,202 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {31534#true} {32280#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} #50#return; {32280#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-08 04:39:39,203 INFO L290 TraceCheckUtils]: 243: Hoare triple {32280#(and (= main_~y~0 33) (<= main_~c~0 33) (< 32 main_~k~0))} assume !(~c~0 < ~k~0); {32302#(and (= main_~y~0 33) (<= main_~k~0 33) (< 32 main_~k~0))} is VALID [2022-04-08 04:39:39,204 INFO L272 TraceCheckUtils]: 244: Hoare triple {32302#(and (= main_~y~0 33) (<= 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)); {32306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:39:39,204 INFO L290 TraceCheckUtils]: 245: Hoare triple {32306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:39:39,204 INFO L290 TraceCheckUtils]: 246: Hoare triple {32310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31535#false} is VALID [2022-04-08 04:39:39,204 INFO L290 TraceCheckUtils]: 247: Hoare triple {31535#false} assume !false; {31535#false} is VALID [2022-04-08 04:39:39,206 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-08 04:39:39,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:39:45,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:39:45,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734614988] [2022-04-08 04:39:45,612 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:39:45,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349261441] [2022-04-08 04:39:45,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349261441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:39:45,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:39:45,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2022-04-08 04:39:45,612 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:39:45,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1033073836] [2022-04-08 04:39:45,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1033073836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:39:45,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:39:45,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-08 04:39:45,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337439123] [2022-04-08 04:39:45,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:39:45,613 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-08 04:39:45,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:39:45,613 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-08 04:39:46,378 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-08 04:39:46,379 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-08 04:39:46,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:39:46,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-08 04:39:46,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1241, Invalid=4161, Unknown=0, NotChecked=0, Total=5402 [2022-04-08 04:39:46,380 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) [2022-04-08 04:40:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:40:19,882 INFO L93 Difference]: Finished difference Result 129 states and 162 transitions. [2022-04-08 04:40:19,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-08 04:40:19,882 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-08 04:40:19,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:40:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-04-08 04:40:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 158 transitions. [2022-04-08 04:40:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-04-08 04:40:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 158 transitions. [2022-04-08 04:40:19,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 158 transitions. [2022-04-08 04:40:20,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:40:20,658 INFO L225 Difference]: With dead ends: 129 [2022-04-08 04:40:20,658 INFO L226 Difference]: Without dead ends: 124 [2022-04-08 04:40:20,658 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1251, Invalid=4449, Unknown=0, NotChecked=0, Total=5700 [2022-04-08 04:40:20,658 INFO L913 BasicCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 3822 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 3822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:40:20,659 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1812 Invalid, 3822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3822 Invalid, 0 Unknown, 0 Unchecked, 17.4s Time] [2022-04-08 04:40:20,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-08 04:40:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-04-08 04:40:20,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:40:20,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 38 states have call successors, (38), 5 states have call predecessors, (38), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 04:40:20,809 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 38 states have call successors, (38), 5 states have call predecessors, (38), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 04:40:20,809 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 38 states have call successors, (38), 5 states have call predecessors, (38), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 04:40:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:40:20,813 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2022-04-08 04:40:20,813 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-04-08 04:40:20,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:40:20,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:40:20,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 38 states have call successors, (38), 5 states have call predecessors, (38), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 124 states. [2022-04-08 04:40:20,813 INFO L87 Difference]: Start difference. First operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 38 states have call successors, (38), 5 states have call predecessors, (38), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 124 states. [2022-04-08 04:40:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:40:20,816 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2022-04-08 04:40:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-04-08 04:40:20,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:40:20,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:40:20,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:40:20,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:40:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 38 states have call successors, (38), 5 states have call predecessors, (38), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 04:40:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 157 transitions. [2022-04-08 04:40:20,821 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 157 transitions. Word has length 248 [2022-04-08 04:40:20,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:40:20,821 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 157 transitions. [2022-04-08 04:40:20,821 INFO L479 AbstractCegarLoop]: INTERPOLANT 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) [2022-04-08 04:40:20,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 157 transitions. [2022-04-08 04:40:21,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:40:21,652 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-04-08 04:40:21,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-04-08 04:40:21,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:40:21,653 INFO L499 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:40:21,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-08 04:40:21,853 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-08 04:40:21,854 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:40:21,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:40:21,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1333211282, now seen corresponding path program 67 times [2022-04-08 04:40:21,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:40:21,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1498139829] [2022-04-08 04:40:21,948 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:40:21,948 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:40:21,948 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:40:21,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1333211282, now seen corresponding path program 68 times [2022-04-08 04:40:21,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:40:21,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083988117] [2022-04-08 04:40:21,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:40:21,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:40:21,963 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:40:21,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747459012] [2022-04-08 04:40:21,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:40:21,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:40:21,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:40:21,965 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:40:21,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-08 04:40:23,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:40:23,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:40:23,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 144 conjunts are in the unsatisfiable core [2022-04-08 04:40:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:40:23,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:40:24,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {33820#true} call ULTIMATE.init(); {33820#true} is VALID [2022-04-08 04:40:24,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {33820#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); {33820#true} is VALID [2022-04-08 04:40:24,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33820#true} {33820#true} #56#return; {33820#true} is VALID [2022-04-08 04:40:24,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {33820#true} call #t~ret5 := main(); {33820#true} is VALID [2022-04-08 04:40:24,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {33820#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; {33840#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:40:24,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {33840#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {33840#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:40:24,765 INFO L272 TraceCheckUtils]: 7: Hoare triple {33840#(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)); {33820#true} is VALID [2022-04-08 04:40:24,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,765 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {33820#true} {33840#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {33840#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:40:24,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {33840#(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; {33862#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:40:24,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {33862#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {33862#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:40:24,766 INFO L272 TraceCheckUtils]: 14: Hoare triple {33862#(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)); {33820#true} is VALID [2022-04-08 04:40:24,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,767 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {33820#true} {33862#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {33862#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:40:24,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {33862#(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; {33884#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:40:24,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {33884#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {33884#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:40:24,767 INFO L272 TraceCheckUtils]: 21: Hoare triple {33884#(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)); {33820#true} is VALID [2022-04-08 04:40:24,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,768 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {33820#true} {33884#(and (= main_~y~0 2) (= main_~c~0 2))} #50#return; {33884#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:40:24,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {33884#(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; {33906#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:40:24,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {33906#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {33906#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:40:24,769 INFO L272 TraceCheckUtils]: 28: Hoare triple {33906#(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)); {33820#true} is VALID [2022-04-08 04:40:24,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,769 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {33820#true} {33906#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {33906#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:40:24,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {33906#(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; {33928#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:40:24,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {33928#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {33928#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:40:24,770 INFO L272 TraceCheckUtils]: 35: Hoare triple {33928#(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)); {33820#true} is VALID [2022-04-08 04:40:24,770 INFO L290 TraceCheckUtils]: 36: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,771 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {33820#true} {33928#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {33928#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:40:24,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {33928#(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; {33950#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:40:24,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {33950#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {33950#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:40:24,771 INFO L272 TraceCheckUtils]: 42: Hoare triple {33950#(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)); {33820#true} is VALID [2022-04-08 04:40:24,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,772 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {33820#true} {33950#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {33950#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:40:24,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {33950#(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; {33972#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:40:24,773 INFO L290 TraceCheckUtils]: 48: Hoare triple {33972#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {33972#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:40:24,773 INFO L272 TraceCheckUtils]: 49: Hoare triple {33972#(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)); {33820#true} is VALID [2022-04-08 04:40:24,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,773 INFO L290 TraceCheckUtils]: 51: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,773 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {33820#true} {33972#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #50#return; {33972#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:40:24,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {33972#(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; {33994#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:40:24,774 INFO L290 TraceCheckUtils]: 55: Hoare triple {33994#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !false; {33994#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:40:24,774 INFO L272 TraceCheckUtils]: 56: Hoare triple {33994#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 04:40:24,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,774 INFO L290 TraceCheckUtils]: 59: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,774 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {33820#true} {33994#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} #50#return; {33994#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:40:24,775 INFO L290 TraceCheckUtils]: 61: Hoare triple {33994#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34016#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:40:24,775 INFO L290 TraceCheckUtils]: 62: Hoare triple {34016#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} assume !false; {34016#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:40:24,775 INFO L272 TraceCheckUtils]: 63: Hoare triple {34016#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 04:40:24,775 INFO L290 TraceCheckUtils]: 64: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,776 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {33820#true} {34016#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} #50#return; {34016#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:40:24,776 INFO L290 TraceCheckUtils]: 68: Hoare triple {34016#(and (= (+ (- 2) main_~y~0) 6) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34038#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-08 04:40:24,777 INFO L290 TraceCheckUtils]: 69: Hoare triple {34038#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} assume !false; {34038#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-08 04:40:24,777 INFO L272 TraceCheckUtils]: 70: Hoare triple {34038#(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)); {33820#true} is VALID [2022-04-08 04:40:24,777 INFO L290 TraceCheckUtils]: 71: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,777 INFO L290 TraceCheckUtils]: 72: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,777 INFO L290 TraceCheckUtils]: 73: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,777 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {33820#true} {34038#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} #50#return; {34038#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9))} is VALID [2022-04-08 04:40:24,778 INFO L290 TraceCheckUtils]: 75: Hoare triple {34038#(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; {34060#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:40:24,778 INFO L290 TraceCheckUtils]: 76: Hoare triple {34060#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} assume !false; {34060#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:40:24,778 INFO L272 TraceCheckUtils]: 77: Hoare triple {34060#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 04:40:24,778 INFO L290 TraceCheckUtils]: 78: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,778 INFO L290 TraceCheckUtils]: 79: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,778 INFO L290 TraceCheckUtils]: 80: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,779 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {33820#true} {34060#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} #50#return; {34060#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:40:24,779 INFO L290 TraceCheckUtils]: 82: Hoare triple {34060#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34082#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 04:40:24,779 INFO L290 TraceCheckUtils]: 83: Hoare triple {34082#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} assume !false; {34082#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 04:40:24,780 INFO L272 TraceCheckUtils]: 84: Hoare triple {34082#(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)); {33820#true} is VALID [2022-04-08 04:40:24,780 INFO L290 TraceCheckUtils]: 85: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,780 INFO L290 TraceCheckUtils]: 86: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,780 INFO L290 TraceCheckUtils]: 87: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,780 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {33820#true} {34082#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} #50#return; {34082#(and (= main_~c~0 11) (= 6 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 04:40:24,781 INFO L290 TraceCheckUtils]: 89: Hoare triple {34082#(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; {34104#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 04:40:24,781 INFO L290 TraceCheckUtils]: 90: Hoare triple {34104#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} assume !false; {34104#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 04:40:24,781 INFO L272 TraceCheckUtils]: 91: Hoare triple {34104#(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)); {33820#true} is VALID [2022-04-08 04:40:24,781 INFO L290 TraceCheckUtils]: 92: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,781 INFO L290 TraceCheckUtils]: 93: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,781 INFO L290 TraceCheckUtils]: 94: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,781 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {33820#true} {34104#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} #50#return; {34104#(and (= (+ main_~y~0 (- 6)) 6) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 04:40:24,782 INFO L290 TraceCheckUtils]: 96: Hoare triple {34104#(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; {34126#(and (= 11 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 7))))} is VALID [2022-04-08 04:40:24,782 INFO L290 TraceCheckUtils]: 97: Hoare triple {34126#(and (= 11 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 7))))} assume !false; {34126#(and (= 11 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 7))))} is VALID [2022-04-08 04:40:24,782 INFO L272 TraceCheckUtils]: 98: Hoare triple {34126#(and (= 11 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 04:40:24,782 INFO L290 TraceCheckUtils]: 99: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,782 INFO L290 TraceCheckUtils]: 100: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,782 INFO L290 TraceCheckUtils]: 101: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,783 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {33820#true} {34126#(and (= 11 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 7))))} #50#return; {34126#(and (= 11 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 7))))} is VALID [2022-04-08 04:40:24,783 INFO L290 TraceCheckUtils]: 103: Hoare triple {34126#(and (= 11 (+ (- 2) main_~c~0)) (= 6 (+ main_~y~0 (- 7))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34148#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 04:40:24,783 INFO L290 TraceCheckUtils]: 104: Hoare triple {34148#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {34148#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 04:40:24,784 INFO L272 TraceCheckUtils]: 105: Hoare triple {34148#(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)); {33820#true} is VALID [2022-04-08 04:40:24,784 INFO L290 TraceCheckUtils]: 106: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,784 INFO L290 TraceCheckUtils]: 107: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,784 INFO L290 TraceCheckUtils]: 108: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,784 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {33820#true} {34148#(and (= main_~y~0 14) (= main_~c~0 14))} #50#return; {34148#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 04:40:24,784 INFO L290 TraceCheckUtils]: 110: Hoare triple {34148#(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; {34170#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:40:24,785 INFO L290 TraceCheckUtils]: 111: Hoare triple {34170#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {34170#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:40:24,785 INFO L272 TraceCheckUtils]: 112: Hoare triple {34170#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 04:40:24,785 INFO L290 TraceCheckUtils]: 113: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,785 INFO L290 TraceCheckUtils]: 114: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,785 INFO L290 TraceCheckUtils]: 115: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,785 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {33820#true} {34170#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #50#return; {34170#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:40:24,786 INFO L290 TraceCheckUtils]: 117: Hoare triple {34170#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34192#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 04:40:24,786 INFO L290 TraceCheckUtils]: 118: Hoare triple {34192#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} assume !false; {34192#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 04:40:24,786 INFO L272 TraceCheckUtils]: 119: Hoare triple {34192#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 04:40:24,786 INFO L290 TraceCheckUtils]: 120: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,786 INFO L290 TraceCheckUtils]: 121: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,786 INFO L290 TraceCheckUtils]: 122: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,787 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {33820#true} {34192#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} #50#return; {34192#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 04:40:24,787 INFO L290 TraceCheckUtils]: 124: Hoare triple {34192#(and (= (+ (- 1) main_~c~0) 15) (= (+ (- 2) main_~y~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34214#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 04:40:24,787 INFO L290 TraceCheckUtils]: 125: Hoare triple {34214#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {34214#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 04:40:24,787 INFO L272 TraceCheckUtils]: 126: Hoare triple {34214#(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)); {33820#true} is VALID [2022-04-08 04:40:24,788 INFO L290 TraceCheckUtils]: 127: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,788 INFO L290 TraceCheckUtils]: 128: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,788 INFO L290 TraceCheckUtils]: 129: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,788 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {33820#true} {34214#(and (= main_~c~0 17) (= main_~y~0 17))} #50#return; {34214#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 04:40:24,788 INFO L290 TraceCheckUtils]: 131: Hoare triple {34214#(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; {34236#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:40:24,789 INFO L290 TraceCheckUtils]: 132: Hoare triple {34236#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {34236#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:40:24,789 INFO L272 TraceCheckUtils]: 133: Hoare triple {34236#(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)); {33820#true} is VALID [2022-04-08 04:40:24,789 INFO L290 TraceCheckUtils]: 134: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,789 INFO L290 TraceCheckUtils]: 135: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,789 INFO L290 TraceCheckUtils]: 136: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,789 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {33820#true} {34236#(and (= main_~c~0 18) (= main_~y~0 18))} #50#return; {34236#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 04:40:24,790 INFO L290 TraceCheckUtils]: 138: Hoare triple {34236#(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; {34258#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 04:40:24,790 INFO L290 TraceCheckUtils]: 139: Hoare triple {34258#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !false; {34258#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 04:40:24,790 INFO L272 TraceCheckUtils]: 140: Hoare triple {34258#(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)); {33820#true} is VALID [2022-04-08 04:40:24,790 INFO L290 TraceCheckUtils]: 141: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,790 INFO L290 TraceCheckUtils]: 142: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,790 INFO L290 TraceCheckUtils]: 143: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,791 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {33820#true} {34258#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} #50#return; {34258#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 04:40:24,791 INFO L290 TraceCheckUtils]: 145: Hoare triple {34258#(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; {34280#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-08 04:40:24,791 INFO L290 TraceCheckUtils]: 146: Hoare triple {34280#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} assume !false; {34280#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-08 04:40:24,791 INFO L272 TraceCheckUtils]: 147: Hoare triple {34280#(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)); {33820#true} is VALID [2022-04-08 04:40:24,791 INFO L290 TraceCheckUtils]: 148: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,791 INFO L290 TraceCheckUtils]: 149: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,792 INFO L290 TraceCheckUtils]: 150: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,792 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {33820#true} {34280#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} #50#return; {34280#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-08 04:40:24,792 INFO L290 TraceCheckUtils]: 152: Hoare triple {34280#(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; {34302#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-08 04:40:24,793 INFO L290 TraceCheckUtils]: 153: Hoare triple {34302#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} assume !false; {34302#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-08 04:40:24,793 INFO L272 TraceCheckUtils]: 154: Hoare triple {34302#(and (= (+ (- 1) main_~c~0) 20) (= (+ 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)); {33820#true} is VALID [2022-04-08 04:40:24,793 INFO L290 TraceCheckUtils]: 155: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,793 INFO L290 TraceCheckUtils]: 156: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,793 INFO L290 TraceCheckUtils]: 157: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,793 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {33820#true} {34302#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} #50#return; {34302#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-08 04:40:24,794 INFO L290 TraceCheckUtils]: 159: Hoare triple {34302#(and (= (+ (- 1) main_~c~0) 20) (= (+ 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; {34324#(and (= (+ main_~y~0 (- 4)) 18) (= main_~c~0 22))} is VALID [2022-04-08 04:40:24,794 INFO L290 TraceCheckUtils]: 160: Hoare triple {34324#(and (= (+ main_~y~0 (- 4)) 18) (= main_~c~0 22))} assume !false; {34324#(and (= (+ main_~y~0 (- 4)) 18) (= main_~c~0 22))} is VALID [2022-04-08 04:40:24,794 INFO L272 TraceCheckUtils]: 161: Hoare triple {34324#(and (= (+ main_~y~0 (- 4)) 18) (= 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)); {33820#true} is VALID [2022-04-08 04:40:24,794 INFO L290 TraceCheckUtils]: 162: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,794 INFO L290 TraceCheckUtils]: 163: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,794 INFO L290 TraceCheckUtils]: 164: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,795 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {33820#true} {34324#(and (= (+ main_~y~0 (- 4)) 18) (= main_~c~0 22))} #50#return; {34324#(and (= (+ main_~y~0 (- 4)) 18) (= main_~c~0 22))} is VALID [2022-04-08 04:40:24,795 INFO L290 TraceCheckUtils]: 166: Hoare triple {34324#(and (= (+ main_~y~0 (- 4)) 18) (= 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; {34346#(and (= 23 main_~c~0) (= (+ main_~y~0 (- 5)) 18))} is VALID [2022-04-08 04:40:24,795 INFO L290 TraceCheckUtils]: 167: Hoare triple {34346#(and (= 23 main_~c~0) (= (+ main_~y~0 (- 5)) 18))} assume !false; {34346#(and (= 23 main_~c~0) (= (+ main_~y~0 (- 5)) 18))} is VALID [2022-04-08 04:40:24,795 INFO L272 TraceCheckUtils]: 168: Hoare triple {34346#(and (= 23 main_~c~0) (= (+ main_~y~0 (- 5)) 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)); {33820#true} is VALID [2022-04-08 04:40:24,795 INFO L290 TraceCheckUtils]: 169: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,795 INFO L290 TraceCheckUtils]: 170: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,796 INFO L290 TraceCheckUtils]: 171: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,796 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {33820#true} {34346#(and (= 23 main_~c~0) (= (+ main_~y~0 (- 5)) 18))} #50#return; {34346#(and (= 23 main_~c~0) (= (+ main_~y~0 (- 5)) 18))} is VALID [2022-04-08 04:40:24,796 INFO L290 TraceCheckUtils]: 173: Hoare triple {34346#(and (= 23 main_~c~0) (= (+ main_~y~0 (- 5)) 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; {34368#(and (= main_~c~0 24) (= (+ main_~y~0 (- 6)) 18))} is VALID [2022-04-08 04:40:24,797 INFO L290 TraceCheckUtils]: 174: Hoare triple {34368#(and (= main_~c~0 24) (= (+ main_~y~0 (- 6)) 18))} assume !false; {34368#(and (= main_~c~0 24) (= (+ main_~y~0 (- 6)) 18))} is VALID [2022-04-08 04:40:24,797 INFO L272 TraceCheckUtils]: 175: Hoare triple {34368#(and (= main_~c~0 24) (= (+ main_~y~0 (- 6)) 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)); {33820#true} is VALID [2022-04-08 04:40:24,797 INFO L290 TraceCheckUtils]: 176: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,797 INFO L290 TraceCheckUtils]: 177: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,797 INFO L290 TraceCheckUtils]: 178: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,797 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {33820#true} {34368#(and (= main_~c~0 24) (= (+ main_~y~0 (- 6)) 18))} #50#return; {34368#(and (= main_~c~0 24) (= (+ main_~y~0 (- 6)) 18))} is VALID [2022-04-08 04:40:24,798 INFO L290 TraceCheckUtils]: 180: Hoare triple {34368#(and (= main_~c~0 24) (= (+ main_~y~0 (- 6)) 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; {34390#(and (= (+ (- 1) main_~c~0) 24) (= 18 (+ main_~y~0 (- 7))))} is VALID [2022-04-08 04:40:24,798 INFO L290 TraceCheckUtils]: 181: Hoare triple {34390#(and (= (+ (- 1) main_~c~0) 24) (= 18 (+ main_~y~0 (- 7))))} assume !false; {34390#(and (= (+ (- 1) main_~c~0) 24) (= 18 (+ main_~y~0 (- 7))))} is VALID [2022-04-08 04:40:24,798 INFO L272 TraceCheckUtils]: 182: Hoare triple {34390#(and (= (+ (- 1) main_~c~0) 24) (= 18 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 04:40:24,798 INFO L290 TraceCheckUtils]: 183: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,798 INFO L290 TraceCheckUtils]: 184: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,798 INFO L290 TraceCheckUtils]: 185: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,799 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {33820#true} {34390#(and (= (+ (- 1) main_~c~0) 24) (= 18 (+ main_~y~0 (- 7))))} #50#return; {34390#(and (= (+ (- 1) main_~c~0) 24) (= 18 (+ main_~y~0 (- 7))))} is VALID [2022-04-08 04:40:24,799 INFO L290 TraceCheckUtils]: 187: Hoare triple {34390#(and (= (+ (- 1) main_~c~0) 24) (= 18 (+ main_~y~0 (- 7))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34412#(and (= main_~c~0 26) (= 18 (+ main_~y~0 (- 8))))} is VALID [2022-04-08 04:40:24,799 INFO L290 TraceCheckUtils]: 188: Hoare triple {34412#(and (= main_~c~0 26) (= 18 (+ main_~y~0 (- 8))))} assume !false; {34412#(and (= main_~c~0 26) (= 18 (+ main_~y~0 (- 8))))} is VALID [2022-04-08 04:40:24,799 INFO L272 TraceCheckUtils]: 189: Hoare triple {34412#(and (= main_~c~0 26) (= 18 (+ 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)); {33820#true} is VALID [2022-04-08 04:40:24,799 INFO L290 TraceCheckUtils]: 190: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,799 INFO L290 TraceCheckUtils]: 191: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,799 INFO L290 TraceCheckUtils]: 192: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,800 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {33820#true} {34412#(and (= main_~c~0 26) (= 18 (+ main_~y~0 (- 8))))} #50#return; {34412#(and (= main_~c~0 26) (= 18 (+ main_~y~0 (- 8))))} is VALID [2022-04-08 04:40:24,800 INFO L290 TraceCheckUtils]: 194: Hoare triple {34412#(and (= main_~c~0 26) (= 18 (+ 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; {34434#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 9) main_~y~0) 18))} is VALID [2022-04-08 04:40:24,801 INFO L290 TraceCheckUtils]: 195: Hoare triple {34434#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 9) main_~y~0) 18))} assume !false; {34434#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 9) main_~y~0) 18))} is VALID [2022-04-08 04:40:24,801 INFO L272 TraceCheckUtils]: 196: Hoare triple {34434#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 9) 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)); {33820#true} is VALID [2022-04-08 04:40:24,801 INFO L290 TraceCheckUtils]: 197: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,801 INFO L290 TraceCheckUtils]: 198: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,801 INFO L290 TraceCheckUtils]: 199: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,801 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {33820#true} {34434#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 9) main_~y~0) 18))} #50#return; {34434#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 9) main_~y~0) 18))} is VALID [2022-04-08 04:40:24,802 INFO L290 TraceCheckUtils]: 201: Hoare triple {34434#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 9) 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; {34456#(and (= main_~c~0 28) (= 18 (+ main_~y~0 (- 10))))} is VALID [2022-04-08 04:40:24,802 INFO L290 TraceCheckUtils]: 202: Hoare triple {34456#(and (= main_~c~0 28) (= 18 (+ main_~y~0 (- 10))))} assume !false; {34456#(and (= main_~c~0 28) (= 18 (+ main_~y~0 (- 10))))} is VALID [2022-04-08 04:40:24,802 INFO L272 TraceCheckUtils]: 203: Hoare triple {34456#(and (= main_~c~0 28) (= 18 (+ 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)); {33820#true} is VALID [2022-04-08 04:40:24,802 INFO L290 TraceCheckUtils]: 204: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,802 INFO L290 TraceCheckUtils]: 205: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,802 INFO L290 TraceCheckUtils]: 206: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,803 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {33820#true} {34456#(and (= main_~c~0 28) (= 18 (+ main_~y~0 (- 10))))} #50#return; {34456#(and (= main_~c~0 28) (= 18 (+ main_~y~0 (- 10))))} is VALID [2022-04-08 04:40:24,803 INFO L290 TraceCheckUtils]: 208: Hoare triple {34456#(and (= main_~c~0 28) (= 18 (+ 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; {34478#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 04:40:24,803 INFO L290 TraceCheckUtils]: 209: Hoare triple {34478#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} assume !false; {34478#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 04:40:24,803 INFO L272 TraceCheckUtils]: 210: Hoare triple {34478#(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)); {33820#true} is VALID [2022-04-08 04:40:24,803 INFO L290 TraceCheckUtils]: 211: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,803 INFO L290 TraceCheckUtils]: 212: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,803 INFO L290 TraceCheckUtils]: 213: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,804 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {33820#true} {34478#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} #50#return; {34478#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 04:40:24,804 INFO L290 TraceCheckUtils]: 215: Hoare triple {34478#(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; {34500#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 04:40:24,805 INFO L290 TraceCheckUtils]: 216: Hoare triple {34500#(and (= 30 main_~y~0) (= 30 main_~c~0))} assume !false; {34500#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 04:40:24,805 INFO L272 TraceCheckUtils]: 217: Hoare triple {34500#(and (= 30 main_~y~0) (= 30 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 04:40:24,805 INFO L290 TraceCheckUtils]: 218: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,805 INFO L290 TraceCheckUtils]: 219: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,805 INFO L290 TraceCheckUtils]: 220: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,805 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {33820#true} {34500#(and (= 30 main_~y~0) (= 30 main_~c~0))} #50#return; {34500#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 04:40:24,806 INFO L290 TraceCheckUtils]: 222: Hoare triple {34500#(and (= 30 main_~y~0) (= 30 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34522#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-08 04:40:24,806 INFO L290 TraceCheckUtils]: 223: Hoare triple {34522#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !false; {34522#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-08 04:40:24,806 INFO L272 TraceCheckUtils]: 224: Hoare triple {34522#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 04:40:24,806 INFO L290 TraceCheckUtils]: 225: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,806 INFO L290 TraceCheckUtils]: 226: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,806 INFO L290 TraceCheckUtils]: 227: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,806 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {33820#true} {34522#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} #50#return; {34522#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-08 04:40:24,807 INFO L290 TraceCheckUtils]: 229: Hoare triple {34522#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34544#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 04:40:24,807 INFO L290 TraceCheckUtils]: 230: Hoare triple {34544#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !false; {34544#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 04:40:24,807 INFO L272 TraceCheckUtils]: 231: Hoare triple {34544#(and (= 32 main_~y~0) (= 32 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 04:40:24,807 INFO L290 TraceCheckUtils]: 232: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,807 INFO L290 TraceCheckUtils]: 233: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,807 INFO L290 TraceCheckUtils]: 234: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,808 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {33820#true} {34544#(and (= 32 main_~y~0) (= 32 main_~c~0))} #50#return; {34544#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 04:40:24,808 INFO L290 TraceCheckUtils]: 236: Hoare triple {34544#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34566#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} is VALID [2022-04-08 04:40:24,808 INFO L290 TraceCheckUtils]: 237: Hoare triple {34566#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} assume !false; {34566#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} is VALID [2022-04-08 04:40:24,809 INFO L272 TraceCheckUtils]: 238: Hoare triple {34566#(and (= main_~y~0 33) (= (+ (- 1) 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)); {33820#true} is VALID [2022-04-08 04:40:24,809 INFO L290 TraceCheckUtils]: 239: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,809 INFO L290 TraceCheckUtils]: 240: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,809 INFO L290 TraceCheckUtils]: 241: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,809 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {33820#true} {34566#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} #50#return; {34566#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} is VALID [2022-04-08 04:40:24,809 INFO L290 TraceCheckUtils]: 243: Hoare triple {34566#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34588#(and (<= main_~c~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} is VALID [2022-04-08 04:40:24,810 INFO L290 TraceCheckUtils]: 244: Hoare triple {34588#(and (<= main_~c~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} assume !false; {34588#(and (<= main_~c~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} is VALID [2022-04-08 04:40:24,810 INFO L272 TraceCheckUtils]: 245: Hoare triple {34588#(and (<= main_~c~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33820#true} is VALID [2022-04-08 04:40:24,810 INFO L290 TraceCheckUtils]: 246: Hoare triple {33820#true} ~cond := #in~cond; {33820#true} is VALID [2022-04-08 04:40:24,810 INFO L290 TraceCheckUtils]: 247: Hoare triple {33820#true} assume !(0 == ~cond); {33820#true} is VALID [2022-04-08 04:40:24,810 INFO L290 TraceCheckUtils]: 248: Hoare triple {33820#true} assume true; {33820#true} is VALID [2022-04-08 04:40:24,810 INFO L284 TraceCheckUtils]: 249: Hoare quadruple {33820#true} {34588#(and (<= main_~c~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} #50#return; {34588#(and (<= main_~c~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} is VALID [2022-04-08 04:40:24,811 INFO L290 TraceCheckUtils]: 250: Hoare triple {34588#(and (<= main_~c~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} assume !(~c~0 < ~k~0); {34610#(and (<= main_~k~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} is VALID [2022-04-08 04:40:24,812 INFO L272 TraceCheckUtils]: 251: Hoare triple {34610#(and (<= main_~k~0 34) (= 33 (+ (- 1) main_~y~0)) (< 33 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34614#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:40:24,812 INFO L290 TraceCheckUtils]: 252: Hoare triple {34614#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34618#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:40:24,812 INFO L290 TraceCheckUtils]: 253: Hoare triple {34618#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33821#false} is VALID [2022-04-08 04:40:24,812 INFO L290 TraceCheckUtils]: 254: Hoare triple {33821#false} assume !false; {33821#false} is VALID [2022-04-08 04:40:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 70 proven. 1785 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2022-04-08 04:40:24,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:40:25,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:40:25,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083988117] [2022-04-08 04:40:25,322 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:40:25,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747459012] [2022-04-08 04:40:25,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747459012] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:40:25,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:40:25,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2022-04-08 04:40:25,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:40:25,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1498139829] [2022-04-08 04:40:25,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1498139829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:40:25,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:40:25,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-08 04:40:25,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306515203] [2022-04-08 04:40:25,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:40:25,323 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 37 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Word has length 255 [2022-04-08 04:40:25,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:40:25,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 37 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 04:40:26,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:40:26,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-08 04:40:26,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:40:26,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-08 04:40:26,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 04:40:26,148 INFO L87 Difference]: Start difference. First operand 124 states and 157 transitions. Second operand has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 37 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 04:41:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:41:04,655 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2022-04-08 04:41:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-08 04:41:04,655 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 37 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Word has length 255 [2022-04-08 04:41:04,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:41:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 37 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 04:41:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 162 transitions. [2022-04-08 04:41:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 37 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 04:41:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 162 transitions. [2022-04-08 04:41:04,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 162 transitions. [2022-04-08 04:41:05,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:41:05,676 INFO L225 Difference]: With dead ends: 132 [2022-04-08 04:41:05,676 INFO L226 Difference]: Without dead ends: 127 [2022-04-08 04:41:05,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=1847, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 04:41:05,677 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 4039 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 4039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:41:05,677 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1899 Invalid, 4039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4039 Invalid, 0 Unknown, 0 Unchecked, 20.2s Time] [2022-04-08 04:41:05,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-08 04:41:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-04-08 04:41:05,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:41:05,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 39 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 04:41:05,877 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 39 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 04:41:05,877 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 39 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 04:41:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:41:05,881 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2022-04-08 04:41:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions. [2022-04-08 04:41:05,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:41:05,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:41:05,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 39 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 127 states. [2022-04-08 04:41:05,881 INFO L87 Difference]: Start difference. First operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 39 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 127 states. [2022-04-08 04:41:05,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:41:05,885 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2022-04-08 04:41:05,885 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions. [2022-04-08 04:41:05,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:41:05,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:41:05,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:41:05,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:41:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 39 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 04:41:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 161 transitions. [2022-04-08 04:41:05,889 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 161 transitions. Word has length 255 [2022-04-08 04:41:05,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:41:05,889 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 161 transitions. [2022-04-08 04:41:05,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 37 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 04:41:05,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 161 transitions. [2022-04-08 04:41:06,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:41:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions. [2022-04-08 04:41:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-04-08 04:41:06,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:41:06,650 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:41:06,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-08 04:41:06,850 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:41:06,851 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:41:06,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:41:06,851 INFO L85 PathProgramCache]: Analyzing trace with hash -769476027, now seen corresponding path program 69 times [2022-04-08 04:41:06,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:41:06,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [194857887] [2022-04-08 04:41:06,922 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:41:06,922 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:41:06,922 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:41:06,922 INFO L85 PathProgramCache]: Analyzing trace with hash -769476027, now seen corresponding path program 70 times [2022-04-08 04:41:06,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:41:06,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747646042] [2022-04-08 04:41:06,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:41:06,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:41:06,938 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:41:06,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1155467478] [2022-04-08 04:41:06,939 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:41:06,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:41:06,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:41:06,940 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:41:06,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-08 04:41:11,821 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:41:11,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:41:11,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 148 conjunts are in the unsatisfiable core [2022-04-08 04:41:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:41:11,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:41:13,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {35442#true} call ULTIMATE.init(); {35442#true} is VALID [2022-04-08 04:41:13,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {35442#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); {35442#true} is VALID [2022-04-08 04:41:13,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35442#true} {35442#true} #56#return; {35442#true} is VALID [2022-04-08 04:41:13,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {35442#true} call #t~ret5 := main(); {35442#true} is VALID [2022-04-08 04:41:13,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {35442#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; {35462#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:41:13,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {35462#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {35462#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:41:13,481 INFO L272 TraceCheckUtils]: 7: Hoare triple {35462#(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)); {35442#true} is VALID [2022-04-08 04:41:13,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,482 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {35442#true} {35462#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {35462#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:41:13,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {35462#(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; {35484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:41:13,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {35484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {35484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:41:13,483 INFO L272 TraceCheckUtils]: 14: Hoare triple {35484#(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)); {35442#true} is VALID [2022-04-08 04:41:13,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,483 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {35442#true} {35484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {35484#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:41:13,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {35484#(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; {35506#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:41:13,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {35506#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {35506#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:41:13,484 INFO L272 TraceCheckUtils]: 21: Hoare triple {35506#(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)); {35442#true} is VALID [2022-04-08 04:41:13,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,485 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {35442#true} {35506#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #50#return; {35506#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:41:13,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {35506#(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; {35528#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 04:41:13,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {35528#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {35528#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 04:41:13,485 INFO L272 TraceCheckUtils]: 28: Hoare triple {35528#(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)); {35442#true} is VALID [2022-04-08 04:41:13,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,486 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {35442#true} {35528#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #50#return; {35528#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 04:41:13,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {35528#(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; {35550#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:41:13,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {35550#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} assume !false; {35550#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:41:13,487 INFO L272 TraceCheckUtils]: 35: Hoare triple {35550#(and (= (+ main_~c~0 (- 3)) 1) (= 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)); {35442#true} is VALID [2022-04-08 04:41:13,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,487 INFO L290 TraceCheckUtils]: 38: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,487 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {35442#true} {35550#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} #50#return; {35550#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:41:13,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {35550#(and (= (+ main_~c~0 (- 3)) 1) (= 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; {35572#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} is VALID [2022-04-08 04:41:13,488 INFO L290 TraceCheckUtils]: 41: Hoare triple {35572#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} assume !false; {35572#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} is VALID [2022-04-08 04:41:13,488 INFO L272 TraceCheckUtils]: 42: Hoare triple {35572#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 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)); {35442#true} is VALID [2022-04-08 04:41:13,488 INFO L290 TraceCheckUtils]: 43: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,488 INFO L290 TraceCheckUtils]: 44: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,489 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35442#true} {35572#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} #50#return; {35572#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} is VALID [2022-04-08 04:41:13,489 INFO L290 TraceCheckUtils]: 47: Hoare triple {35572#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 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; {35594#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:41:13,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {35594#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {35594#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:41:13,489 INFO L272 TraceCheckUtils]: 49: Hoare triple {35594#(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)); {35442#true} is VALID [2022-04-08 04:41:13,489 INFO L290 TraceCheckUtils]: 50: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,489 INFO L290 TraceCheckUtils]: 51: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,490 INFO L290 TraceCheckUtils]: 52: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,490 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {35442#true} {35594#(and (= main_~y~0 6) (= main_~c~0 6))} #50#return; {35594#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 04:41:13,490 INFO L290 TraceCheckUtils]: 54: Hoare triple {35594#(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; {35616#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 04:41:13,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {35616#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {35616#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 04:41:13,491 INFO L272 TraceCheckUtils]: 56: Hoare triple {35616#(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)); {35442#true} is VALID [2022-04-08 04:41:13,491 INFO L290 TraceCheckUtils]: 57: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,491 INFO L290 TraceCheckUtils]: 58: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,491 INFO L290 TraceCheckUtils]: 59: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,491 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {35442#true} {35616#(and (= 7 main_~y~0) (= 7 main_~c~0))} #50#return; {35616#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 04:41:13,492 INFO L290 TraceCheckUtils]: 61: Hoare triple {35616#(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; {35638#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:41:13,492 INFO L290 TraceCheckUtils]: 62: Hoare triple {35638#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {35638#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:41:13,492 INFO L272 TraceCheckUtils]: 63: Hoare triple {35638#(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)); {35442#true} is VALID [2022-04-08 04:41:13,492 INFO L290 TraceCheckUtils]: 64: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,492 INFO L290 TraceCheckUtils]: 65: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,492 INFO L290 TraceCheckUtils]: 66: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,493 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {35442#true} {35638#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #50#return; {35638#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:41:13,493 INFO L290 TraceCheckUtils]: 68: Hoare triple {35638#(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; {35660#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:41:13,493 INFO L290 TraceCheckUtils]: 69: Hoare triple {35660#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} assume !false; {35660#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:41:13,493 INFO L272 TraceCheckUtils]: 70: Hoare triple {35660#(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)); {35442#true} is VALID [2022-04-08 04:41:13,493 INFO L290 TraceCheckUtils]: 71: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,493 INFO L290 TraceCheckUtils]: 72: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,493 INFO L290 TraceCheckUtils]: 73: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,494 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {35442#true} {35660#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} #50#return; {35660#(and (= 7 (+ (- 2) main_~y~0)) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:41:13,494 INFO L290 TraceCheckUtils]: 75: Hoare triple {35660#(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; {35682#(and (= 7 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 3))))} is VALID [2022-04-08 04:41:13,495 INFO L290 TraceCheckUtils]: 76: Hoare triple {35682#(and (= 7 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 3))))} assume !false; {35682#(and (= 7 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 3))))} is VALID [2022-04-08 04:41:13,495 INFO L272 TraceCheckUtils]: 77: Hoare triple {35682#(and (= 7 (+ main_~c~0 (- 3))) (= 7 (+ 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)); {35442#true} is VALID [2022-04-08 04:41:13,495 INFO L290 TraceCheckUtils]: 78: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,495 INFO L290 TraceCheckUtils]: 79: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,495 INFO L290 TraceCheckUtils]: 80: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,495 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {35442#true} {35682#(and (= 7 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 3))))} #50#return; {35682#(and (= 7 (+ main_~c~0 (- 3))) (= 7 (+ main_~y~0 (- 3))))} is VALID [2022-04-08 04:41:13,496 INFO L290 TraceCheckUtils]: 82: Hoare triple {35682#(and (= 7 (+ main_~c~0 (- 3))) (= 7 (+ 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; {35704#(and (= 7 (+ main_~y~0 (- 4))) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:41:13,496 INFO L290 TraceCheckUtils]: 83: Hoare triple {35704#(and (= 7 (+ main_~y~0 (- 4))) (= 7 (+ main_~c~0 (- 4))))} assume !false; {35704#(and (= 7 (+ main_~y~0 (- 4))) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:41:13,496 INFO L272 TraceCheckUtils]: 84: Hoare triple {35704#(and (= 7 (+ main_~y~0 (- 4))) (= 7 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 04:41:13,496 INFO L290 TraceCheckUtils]: 85: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,496 INFO L290 TraceCheckUtils]: 86: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,496 INFO L290 TraceCheckUtils]: 87: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,496 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {35442#true} {35704#(and (= 7 (+ main_~y~0 (- 4))) (= 7 (+ main_~c~0 (- 4))))} #50#return; {35704#(and (= 7 (+ main_~y~0 (- 4))) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:41:13,497 INFO L290 TraceCheckUtils]: 89: Hoare triple {35704#(and (= 7 (+ main_~y~0 (- 4))) (= 7 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35726#(and (= 7 (+ main_~c~0 (- 5))) (= 7 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 04:41:13,497 INFO L290 TraceCheckUtils]: 90: Hoare triple {35726#(and (= 7 (+ main_~c~0 (- 5))) (= 7 (+ main_~y~0 (- 5))))} assume !false; {35726#(and (= 7 (+ main_~c~0 (- 5))) (= 7 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 04:41:13,497 INFO L272 TraceCheckUtils]: 91: Hoare triple {35726#(and (= 7 (+ main_~c~0 (- 5))) (= 7 (+ 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)); {35442#true} is VALID [2022-04-08 04:41:13,497 INFO L290 TraceCheckUtils]: 92: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,497 INFO L290 TraceCheckUtils]: 93: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,497 INFO L290 TraceCheckUtils]: 94: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,498 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {35442#true} {35726#(and (= 7 (+ main_~c~0 (- 5))) (= 7 (+ main_~y~0 (- 5))))} #50#return; {35726#(and (= 7 (+ main_~c~0 (- 5))) (= 7 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 04:41:13,498 INFO L290 TraceCheckUtils]: 96: Hoare triple {35726#(and (= 7 (+ main_~c~0 (- 5))) (= 7 (+ 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; {35748#(and (= 7 (+ main_~c~0 (- 6))) (= (+ main_~y~0 (- 6)) 7))} is VALID [2022-04-08 04:41:13,499 INFO L290 TraceCheckUtils]: 97: Hoare triple {35748#(and (= 7 (+ main_~c~0 (- 6))) (= (+ main_~y~0 (- 6)) 7))} assume !false; {35748#(and (= 7 (+ main_~c~0 (- 6))) (= (+ main_~y~0 (- 6)) 7))} is VALID [2022-04-08 04:41:13,499 INFO L272 TraceCheckUtils]: 98: Hoare triple {35748#(and (= 7 (+ main_~c~0 (- 6))) (= (+ main_~y~0 (- 6)) 7))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 04:41:13,499 INFO L290 TraceCheckUtils]: 99: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,499 INFO L290 TraceCheckUtils]: 100: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,499 INFO L290 TraceCheckUtils]: 101: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,499 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {35442#true} {35748#(and (= 7 (+ main_~c~0 (- 6))) (= (+ main_~y~0 (- 6)) 7))} #50#return; {35748#(and (= 7 (+ main_~c~0 (- 6))) (= (+ main_~y~0 (- 6)) 7))} is VALID [2022-04-08 04:41:13,500 INFO L290 TraceCheckUtils]: 103: Hoare triple {35748#(and (= 7 (+ main_~c~0 (- 6))) (= (+ main_~y~0 (- 6)) 7))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35770#(and (= 7 (+ main_~y~0 (- 7))) (= main_~c~0 14))} is VALID [2022-04-08 04:41:13,500 INFO L290 TraceCheckUtils]: 104: Hoare triple {35770#(and (= 7 (+ main_~y~0 (- 7))) (= main_~c~0 14))} assume !false; {35770#(and (= 7 (+ main_~y~0 (- 7))) (= main_~c~0 14))} is VALID [2022-04-08 04:41:13,500 INFO L272 TraceCheckUtils]: 105: Hoare triple {35770#(and (= 7 (+ main_~y~0 (- 7))) (= 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)); {35442#true} is VALID [2022-04-08 04:41:13,500 INFO L290 TraceCheckUtils]: 106: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,500 INFO L290 TraceCheckUtils]: 107: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,500 INFO L290 TraceCheckUtils]: 108: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,500 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {35442#true} {35770#(and (= 7 (+ main_~y~0 (- 7))) (= main_~c~0 14))} #50#return; {35770#(and (= 7 (+ main_~y~0 (- 7))) (= main_~c~0 14))} is VALID [2022-04-08 04:41:13,501 INFO L290 TraceCheckUtils]: 110: Hoare triple {35770#(and (= 7 (+ main_~y~0 (- 7))) (= 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; {35792#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 04:41:13,501 INFO L290 TraceCheckUtils]: 111: Hoare triple {35792#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {35792#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 04:41:13,501 INFO L272 TraceCheckUtils]: 112: Hoare triple {35792#(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)); {35442#true} is VALID [2022-04-08 04:41:13,501 INFO L290 TraceCheckUtils]: 113: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,501 INFO L290 TraceCheckUtils]: 114: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,501 INFO L290 TraceCheckUtils]: 115: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,502 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {35442#true} {35792#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #50#return; {35792#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 04:41:13,502 INFO L290 TraceCheckUtils]: 117: Hoare triple {35792#(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; {35814#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 04:41:13,502 INFO L290 TraceCheckUtils]: 118: Hoare triple {35814#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} assume !false; {35814#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 04:41:13,503 INFO L272 TraceCheckUtils]: 119: Hoare triple {35814#(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)); {35442#true} is VALID [2022-04-08 04:41:13,503 INFO L290 TraceCheckUtils]: 120: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,503 INFO L290 TraceCheckUtils]: 121: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,503 INFO L290 TraceCheckUtils]: 122: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,503 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {35442#true} {35814#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} #50#return; {35814#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 04:41:13,503 INFO L290 TraceCheckUtils]: 124: Hoare triple {35814#(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; {35836#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 04:41:13,504 INFO L290 TraceCheckUtils]: 125: Hoare triple {35836#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {35836#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 04:41:13,504 INFO L272 TraceCheckUtils]: 126: Hoare triple {35836#(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)); {35442#true} is VALID [2022-04-08 04:41:13,504 INFO L290 TraceCheckUtils]: 127: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,504 INFO L290 TraceCheckUtils]: 128: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,504 INFO L290 TraceCheckUtils]: 129: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,504 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {35442#true} {35836#(and (= main_~c~0 17) (= main_~y~0 17))} #50#return; {35836#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 04:41:13,505 INFO L290 TraceCheckUtils]: 131: Hoare triple {35836#(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; {35858#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 04:41:13,505 INFO L290 TraceCheckUtils]: 132: Hoare triple {35858#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {35858#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 04:41:13,505 INFO L272 TraceCheckUtils]: 133: Hoare triple {35858#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 04:41:13,505 INFO L290 TraceCheckUtils]: 134: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,505 INFO L290 TraceCheckUtils]: 135: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,505 INFO L290 TraceCheckUtils]: 136: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,506 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {35442#true} {35858#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #50#return; {35858#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 04:41:13,506 INFO L290 TraceCheckUtils]: 138: Hoare triple {35858#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35880#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:41:13,506 INFO L290 TraceCheckUtils]: 139: Hoare triple {35880#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {35880#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:41:13,506 INFO L272 TraceCheckUtils]: 140: Hoare triple {35880#(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)); {35442#true} is VALID [2022-04-08 04:41:13,507 INFO L290 TraceCheckUtils]: 141: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,507 INFO L290 TraceCheckUtils]: 142: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,507 INFO L290 TraceCheckUtils]: 143: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,507 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {35442#true} {35880#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #50#return; {35880#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:41:13,507 INFO L290 TraceCheckUtils]: 145: Hoare triple {35880#(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; {35902#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:41:13,508 INFO L290 TraceCheckUtils]: 146: Hoare triple {35902#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} assume !false; {35902#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:41:13,508 INFO L272 TraceCheckUtils]: 147: Hoare triple {35902#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 04:41:13,508 INFO L290 TraceCheckUtils]: 148: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,508 INFO L290 TraceCheckUtils]: 149: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,508 INFO L290 TraceCheckUtils]: 150: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,508 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {35442#true} {35902#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} #50#return; {35902#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:41:13,509 INFO L290 TraceCheckUtils]: 152: Hoare triple {35902#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35924#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-08 04:41:13,509 INFO L290 TraceCheckUtils]: 153: Hoare triple {35924#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} assume !false; {35924#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-08 04:41:13,509 INFO L272 TraceCheckUtils]: 154: Hoare triple {35924#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 04:41:13,509 INFO L290 TraceCheckUtils]: 155: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,509 INFO L290 TraceCheckUtils]: 156: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,509 INFO L290 TraceCheckUtils]: 157: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,510 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {35442#true} {35924#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} #50#return; {35924#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-08 04:41:13,510 INFO L290 TraceCheckUtils]: 159: Hoare triple {35924#(and (= main_~y~0 21) (= (+ main_~c~0 (- 3)) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35946#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 04:41:13,510 INFO L290 TraceCheckUtils]: 160: Hoare triple {35946#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {35946#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 04:41:13,510 INFO L272 TraceCheckUtils]: 161: Hoare triple {35946#(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)); {35442#true} is VALID [2022-04-08 04:41:13,510 INFO L290 TraceCheckUtils]: 162: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,511 INFO L290 TraceCheckUtils]: 163: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,511 INFO L290 TraceCheckUtils]: 164: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,511 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {35442#true} {35946#(and (= main_~y~0 22) (= main_~c~0 22))} #50#return; {35946#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 04:41:13,511 INFO L290 TraceCheckUtils]: 166: Hoare triple {35946#(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; {35968#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:41:13,512 INFO L290 TraceCheckUtils]: 167: Hoare triple {35968#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {35968#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:41:13,512 INFO L272 TraceCheckUtils]: 168: Hoare triple {35968#(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)); {35442#true} is VALID [2022-04-08 04:41:13,512 INFO L290 TraceCheckUtils]: 169: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,512 INFO L290 TraceCheckUtils]: 170: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,512 INFO L290 TraceCheckUtils]: 171: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,512 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {35442#true} {35968#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} #50#return; {35968#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:41:13,513 INFO L290 TraceCheckUtils]: 173: Hoare triple {35968#(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; {35990#(and (= (+ (- 2) main_~y~0) 22) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:41:13,513 INFO L290 TraceCheckUtils]: 174: Hoare triple {35990#(and (= (+ (- 2) main_~y~0) 22) (= 23 (+ (- 1) main_~c~0)))} assume !false; {35990#(and (= (+ (- 2) main_~y~0) 22) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:41:13,513 INFO L272 TraceCheckUtils]: 175: Hoare triple {35990#(and (= (+ (- 2) main_~y~0) 22) (= 23 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 04:41:13,513 INFO L290 TraceCheckUtils]: 176: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,513 INFO L290 TraceCheckUtils]: 177: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,513 INFO L290 TraceCheckUtils]: 178: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,514 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {35442#true} {35990#(and (= (+ (- 2) main_~y~0) 22) (= 23 (+ (- 1) main_~c~0)))} #50#return; {35990#(and (= (+ (- 2) main_~y~0) 22) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:41:13,514 INFO L290 TraceCheckUtils]: 180: Hoare triple {35990#(and (= (+ (- 2) main_~y~0) 22) (= 23 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36012#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 04:41:13,514 INFO L290 TraceCheckUtils]: 181: Hoare triple {36012#(and (= main_~y~0 25) (= main_~c~0 25))} assume !false; {36012#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 04:41:13,514 INFO L272 TraceCheckUtils]: 182: Hoare triple {36012#(and (= main_~y~0 25) (= main_~c~0 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 04:41:13,514 INFO L290 TraceCheckUtils]: 183: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,515 INFO L290 TraceCheckUtils]: 184: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,515 INFO L290 TraceCheckUtils]: 185: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,515 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {35442#true} {36012#(and (= main_~y~0 25) (= main_~c~0 25))} #50#return; {36012#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 04:41:13,515 INFO L290 TraceCheckUtils]: 187: Hoare triple {36012#(and (= main_~y~0 25) (= main_~c~0 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36034#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 04:41:13,516 INFO L290 TraceCheckUtils]: 188: Hoare triple {36034#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} assume !false; {36034#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 04:41:13,516 INFO L272 TraceCheckUtils]: 189: Hoare triple {36034#(and (= (+ (- 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)); {35442#true} is VALID [2022-04-08 04:41:13,516 INFO L290 TraceCheckUtils]: 190: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,516 INFO L290 TraceCheckUtils]: 191: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,516 INFO L290 TraceCheckUtils]: 192: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,516 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {35442#true} {36034#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} #50#return; {36034#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 04:41:13,517 INFO L290 TraceCheckUtils]: 194: Hoare triple {36034#(and (= (+ (- 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; {36056#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 04:41:13,517 INFO L290 TraceCheckUtils]: 195: Hoare triple {36056#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {36056#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 04:41:13,517 INFO L272 TraceCheckUtils]: 196: Hoare triple {36056#(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)); {35442#true} is VALID [2022-04-08 04:41:13,517 INFO L290 TraceCheckUtils]: 197: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,517 INFO L290 TraceCheckUtils]: 198: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,517 INFO L290 TraceCheckUtils]: 199: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,518 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {35442#true} {36056#(and (= main_~y~0 27) (= main_~c~0 27))} #50#return; {36056#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 04:41:13,518 INFO L290 TraceCheckUtils]: 201: Hoare triple {36056#(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; {36078#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-08 04:41:13,518 INFO L290 TraceCheckUtils]: 202: Hoare triple {36078#(and (= main_~c~0 28) (= main_~y~0 28))} assume !false; {36078#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-08 04:41:13,518 INFO L272 TraceCheckUtils]: 203: Hoare triple {36078#(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)); {35442#true} is VALID [2022-04-08 04:41:13,518 INFO L290 TraceCheckUtils]: 204: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,518 INFO L290 TraceCheckUtils]: 205: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,519 INFO L290 TraceCheckUtils]: 206: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,519 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {35442#true} {36078#(and (= main_~c~0 28) (= main_~y~0 28))} #50#return; {36078#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-08 04:41:13,519 INFO L290 TraceCheckUtils]: 208: Hoare triple {36078#(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; {36100#(and (= 28 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 04:41:13,520 INFO L290 TraceCheckUtils]: 209: Hoare triple {36100#(and (= 28 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 28))} assume !false; {36100#(and (= 28 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 04:41:13,520 INFO L272 TraceCheckUtils]: 210: Hoare triple {36100#(and (= 28 (+ (- 1) 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)); {35442#true} is VALID [2022-04-08 04:41:13,520 INFO L290 TraceCheckUtils]: 211: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,520 INFO L290 TraceCheckUtils]: 212: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,520 INFO L290 TraceCheckUtils]: 213: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,520 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {35442#true} {36100#(and (= 28 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 28))} #50#return; {36100#(and (= 28 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 04:41:13,521 INFO L290 TraceCheckUtils]: 215: Hoare triple {36100#(and (= 28 (+ (- 1) 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; {36122#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 04:41:13,521 INFO L290 TraceCheckUtils]: 216: Hoare triple {36122#(and (= 30 main_~y~0) (= 30 main_~c~0))} assume !false; {36122#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 04:41:13,521 INFO L272 TraceCheckUtils]: 217: Hoare triple {36122#(and (= 30 main_~y~0) (= 30 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 04:41:13,521 INFO L290 TraceCheckUtils]: 218: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,521 INFO L290 TraceCheckUtils]: 219: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,521 INFO L290 TraceCheckUtils]: 220: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,522 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {35442#true} {36122#(and (= 30 main_~y~0) (= 30 main_~c~0))} #50#return; {36122#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 04:41:13,522 INFO L290 TraceCheckUtils]: 222: Hoare triple {36122#(and (= 30 main_~y~0) (= 30 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36144#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} is VALID [2022-04-08 04:41:13,522 INFO L290 TraceCheckUtils]: 223: Hoare triple {36144#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} assume !false; {36144#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} is VALID [2022-04-08 04:41:13,522 INFO L272 TraceCheckUtils]: 224: Hoare triple {36144#(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)); {35442#true} is VALID [2022-04-08 04:41:13,522 INFO L290 TraceCheckUtils]: 225: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,522 INFO L290 TraceCheckUtils]: 226: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,522 INFO L290 TraceCheckUtils]: 227: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,523 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {35442#true} {36144#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} #50#return; {36144#(and (= 30 (+ (- 1) main_~y~0)) (= main_~c~0 31))} is VALID [2022-04-08 04:41:13,523 INFO L290 TraceCheckUtils]: 229: Hoare triple {36144#(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; {36166#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} is VALID [2022-04-08 04:41:13,524 INFO L290 TraceCheckUtils]: 230: Hoare triple {36166#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} assume !false; {36166#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} is VALID [2022-04-08 04:41:13,524 INFO L272 TraceCheckUtils]: 231: Hoare triple {36166#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) 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)); {35442#true} is VALID [2022-04-08 04:41:13,524 INFO L290 TraceCheckUtils]: 232: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,524 INFO L290 TraceCheckUtils]: 233: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,524 INFO L290 TraceCheckUtils]: 234: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,524 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {35442#true} {36166#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} #50#return; {36166#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) main_~c~0) 31))} is VALID [2022-04-08 04:41:13,525 INFO L290 TraceCheckUtils]: 236: Hoare triple {36166#(and (= (+ (- 2) main_~y~0) 30) (= (+ (- 1) 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; {36188#(and (= main_~y~0 33) (= 31 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:41:13,525 INFO L290 TraceCheckUtils]: 237: Hoare triple {36188#(and (= main_~y~0 33) (= 31 (+ (- 2) main_~c~0)))} assume !false; {36188#(and (= main_~y~0 33) (= 31 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:41:13,525 INFO L272 TraceCheckUtils]: 238: Hoare triple {36188#(and (= main_~y~0 33) (= 31 (+ (- 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)); {35442#true} is VALID [2022-04-08 04:41:13,525 INFO L290 TraceCheckUtils]: 239: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,525 INFO L290 TraceCheckUtils]: 240: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,525 INFO L290 TraceCheckUtils]: 241: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,526 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {35442#true} {36188#(and (= main_~y~0 33) (= 31 (+ (- 2) main_~c~0)))} #50#return; {36188#(and (= main_~y~0 33) (= 31 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:41:13,526 INFO L290 TraceCheckUtils]: 243: Hoare triple {36188#(and (= main_~y~0 33) (= 31 (+ (- 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; {36210#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} is VALID [2022-04-08 04:41:13,526 INFO L290 TraceCheckUtils]: 244: Hoare triple {36210#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} assume !false; {36210#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} is VALID [2022-04-08 04:41:13,526 INFO L272 TraceCheckUtils]: 245: Hoare triple {36210#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 04:41:13,526 INFO L290 TraceCheckUtils]: 246: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,526 INFO L290 TraceCheckUtils]: 247: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,526 INFO L290 TraceCheckUtils]: 248: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,527 INFO L284 TraceCheckUtils]: 249: Hoare quadruple {35442#true} {36210#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} #50#return; {36210#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} is VALID [2022-04-08 04:41:13,527 INFO L290 TraceCheckUtils]: 250: Hoare triple {36210#(and (= 33 (+ (- 1) main_~y~0)) (= main_~c~0 34))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36232#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} is VALID [2022-04-08 04:41:13,528 INFO L290 TraceCheckUtils]: 251: Hoare triple {36232#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} assume !false; {36232#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} is VALID [2022-04-08 04:41:13,528 INFO L272 TraceCheckUtils]: 252: Hoare triple {36232#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35442#true} is VALID [2022-04-08 04:41:13,528 INFO L290 TraceCheckUtils]: 253: Hoare triple {35442#true} ~cond := #in~cond; {35442#true} is VALID [2022-04-08 04:41:13,528 INFO L290 TraceCheckUtils]: 254: Hoare triple {35442#true} assume !(0 == ~cond); {35442#true} is VALID [2022-04-08 04:41:13,528 INFO L290 TraceCheckUtils]: 255: Hoare triple {35442#true} assume true; {35442#true} is VALID [2022-04-08 04:41:13,528 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {35442#true} {36232#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} #50#return; {36232#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} is VALID [2022-04-08 04:41:13,529 INFO L290 TraceCheckUtils]: 257: Hoare triple {36232#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} assume !(~c~0 < ~k~0); {36254#(and (= 35 main_~y~0) (<= main_~k~0 35) (< 34 main_~k~0))} is VALID [2022-04-08 04:41:13,529 INFO L272 TraceCheckUtils]: 258: Hoare triple {36254#(and (= 35 main_~y~0) (<= main_~k~0 35) (< 34 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36258#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:41:13,530 INFO L290 TraceCheckUtils]: 259: Hoare triple {36258#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:41:13,530 INFO L290 TraceCheckUtils]: 260: Hoare triple {36262#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35443#false} is VALID [2022-04-08 04:41:13,530 INFO L290 TraceCheckUtils]: 261: Hoare triple {35443#false} assume !false; {35443#false} is VALID [2022-04-08 04:41:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4482 backedges. 72 proven. 1890 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2022-04-08 04:41:13,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:41:13,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:41:13,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747646042] [2022-04-08 04:41:13,991 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:41:13,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155467478] [2022-04-08 04:41:13,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155467478] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:41:13,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:41:13,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2022-04-08 04:41:13,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:41:13,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [194857887] [2022-04-08 04:41:13,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [194857887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:41:13,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:41:13,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-08 04:41:13,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511640619] [2022-04-08 04:41:13,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:41:13,993 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.025) internal successors, (81), 40 states have internal predecessors, (81), 38 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Word has length 262 [2022-04-08 04:41:13,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:41:13,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 40 states have (on average 2.025) internal successors, (81), 40 states have internal predecessors, (81), 38 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 04:41:14,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:41:14,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-08 04:41:14,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:41:14,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-08 04:41:14,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 04:41:14,859 INFO L87 Difference]: Start difference. First operand 127 states and 161 transitions. Second operand has 41 states, 40 states have (on average 2.025) internal successors, (81), 40 states have internal predecessors, (81), 38 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 04:41:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:41:59,409 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2022-04-08 04:41:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-08 04:41:59,410 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.025) internal successors, (81), 40 states have internal predecessors, (81), 38 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Word has length 262 [2022-04-08 04:41:59,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:41:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.025) internal successors, (81), 40 states have internal predecessors, (81), 38 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 04:41:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 166 transitions. [2022-04-08 04:41:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.025) internal successors, (81), 40 states have internal predecessors, (81), 38 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 04:41:59,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 166 transitions. [2022-04-08 04:41:59,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 166 transitions. [2022-04-08 04:42:00,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:42:00,559 INFO L225 Difference]: With dead ends: 135 [2022-04-08 04:42:00,559 INFO L226 Difference]: Without dead ends: 130 [2022-04-08 04:42:00,560 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=1934, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 04:42:00,563 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 2 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 4262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 4262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:42:00,563 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1988 Invalid, 4262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4262 Invalid, 0 Unknown, 0 Unchecked, 23.2s Time] [2022-04-08 04:42:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-08 04:42:00,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-04-08 04:42:00,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:42:00,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 40 states have call successors, (40), 5 states have call predecessors, (40), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 04:42:00,723 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 40 states have call successors, (40), 5 states have call predecessors, (40), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 04:42:00,723 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 40 states have call successors, (40), 5 states have call predecessors, (40), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 04:42:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:42:00,726 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2022-04-08 04:42:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2022-04-08 04:42:00,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:42:00,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:42:00,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 40 states have call successors, (40), 5 states have call predecessors, (40), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand 130 states. [2022-04-08 04:42:00,727 INFO L87 Difference]: Start difference. First operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 40 states have call successors, (40), 5 states have call predecessors, (40), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand 130 states. [2022-04-08 04:42:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:42:00,730 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2022-04-08 04:42:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2022-04-08 04:42:00,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:42:00,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:42:00,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:42:00,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:42:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 40 states have call successors, (40), 5 states have call predecessors, (40), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 04:42:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2022-04-08 04:42:00,734 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 262 [2022-04-08 04:42:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:42:00,734 INFO L478 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2022-04-08 04:42:00,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.025) internal successors, (81), 40 states have internal predecessors, (81), 38 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 04:42:00,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 165 transitions. [2022-04-08 04:42:01,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:42:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2022-04-08 04:42:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-04-08 04:42:01,677 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:42:01,677 INFO L499 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:42:01,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-08 04:42:01,878 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-08 04:42:01,878 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:42:01,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:42:01,879 INFO L85 PathProgramCache]: Analyzing trace with hash 747467058, now seen corresponding path program 71 times [2022-04-08 04:42:01,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:42:01,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1970956798] [2022-04-08 04:42:01,977 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:42:01,977 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:42:01,977 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:42:01,977 INFO L85 PathProgramCache]: Analyzing trace with hash 747467058, now seen corresponding path program 72 times [2022-04-08 04:42:01,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:42:01,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089881235] [2022-04-08 04:42:01,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:42:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:42:01,993 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:42:01,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [679352725] [2022-04-08 04:42:01,993 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:42:01,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:42:01,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:42:01,995 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:42:01,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-08 04:42:10,478 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2022-04-08 04:42:10,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:42:10,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 152 conjunts are in the unsatisfiable core [2022-04-08 04:42:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:42:10,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:42:12,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {37104#true} call ULTIMATE.init(); {37104#true} is VALID [2022-04-08 04:42:12,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {37104#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); {37104#true} is VALID [2022-04-08 04:42:12,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37104#true} {37104#true} #56#return; {37104#true} is VALID [2022-04-08 04:42:12,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {37104#true} call #t~ret5 := main(); {37104#true} is VALID [2022-04-08 04:42:12,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {37104#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; {37124#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:42:12,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {37124#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {37124#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:42:12,123 INFO L272 TraceCheckUtils]: 7: Hoare triple {37124#(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)); {37104#true} is VALID [2022-04-08 04:42:12,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,124 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {37104#true} {37124#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {37124#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:42:12,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {37124#(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; {37146#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:42:12,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {37146#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {37146#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:42:12,125 INFO L272 TraceCheckUtils]: 14: Hoare triple {37146#(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)); {37104#true} is VALID [2022-04-08 04:42:12,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,125 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {37104#true} {37146#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #50#return; {37146#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:42:12,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {37146#(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; {37168#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:42:12,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {37168#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {37168#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:42:12,126 INFO L272 TraceCheckUtils]: 21: Hoare triple {37168#(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)); {37104#true} is VALID [2022-04-08 04:42:12,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,126 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {37104#true} {37168#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #50#return; {37168#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:42:12,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {37168#(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; {37190#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 04:42:12,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {37190#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {37190#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 04:42:12,127 INFO L272 TraceCheckUtils]: 28: Hoare triple {37190#(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)); {37104#true} is VALID [2022-04-08 04:42:12,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,133 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {37104#true} {37190#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #50#return; {37190#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 04:42:12,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {37190#(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; {37212#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 04:42:12,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {37212#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} assume !false; {37212#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 04:42:12,134 INFO L272 TraceCheckUtils]: 35: Hoare triple {37212#(and (= 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)); {37104#true} is VALID [2022-04-08 04:42:12,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,135 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37104#true} {37212#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} #50#return; {37212#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 04:42:12,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {37212#(and (= 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; {37234#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 04:42:12,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {37234#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 2) main_~y~0) 3))} assume !false; {37234#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 04:42:12,135 INFO L272 TraceCheckUtils]: 42: Hoare triple {37234#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 2) 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)); {37104#true} is VALID [2022-04-08 04:42:12,136 INFO L290 TraceCheckUtils]: 43: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,136 INFO L290 TraceCheckUtils]: 44: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,136 INFO L290 TraceCheckUtils]: 45: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,136 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {37104#true} {37234#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 2) main_~y~0) 3))} #50#return; {37234#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 04:42:12,136 INFO L290 TraceCheckUtils]: 47: Hoare triple {37234#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 2) 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; {37256#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-08 04:42:12,137 INFO L290 TraceCheckUtils]: 48: Hoare triple {37256#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} assume !false; {37256#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-08 04:42:12,137 INFO L272 TraceCheckUtils]: 49: Hoare triple {37256#(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)); {37104#true} is VALID [2022-04-08 04:42:12,137 INFO L290 TraceCheckUtils]: 50: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,137 INFO L290 TraceCheckUtils]: 51: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,137 INFO L290 TraceCheckUtils]: 52: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,137 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {37104#true} {37256#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} #50#return; {37256#(and (= main_~y~0 6) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-08 04:42:12,138 INFO L290 TraceCheckUtils]: 54: Hoare triple {37256#(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; {37278#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 04:42:12,138 INFO L290 TraceCheckUtils]: 55: Hoare triple {37278#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {37278#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 04:42:12,138 INFO L272 TraceCheckUtils]: 56: Hoare triple {37278#(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)); {37104#true} is VALID [2022-04-08 04:42:12,138 INFO L290 TraceCheckUtils]: 57: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,138 INFO L290 TraceCheckUtils]: 58: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,138 INFO L290 TraceCheckUtils]: 59: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,139 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {37104#true} {37278#(and (= 7 main_~y~0) (= 7 main_~c~0))} #50#return; {37278#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 04:42:12,139 INFO L290 TraceCheckUtils]: 61: Hoare triple {37278#(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; {37300#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:42:12,139 INFO L290 TraceCheckUtils]: 62: Hoare triple {37300#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {37300#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:42:12,139 INFO L272 TraceCheckUtils]: 63: Hoare triple {37300#(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)); {37104#true} is VALID [2022-04-08 04:42:12,139 INFO L290 TraceCheckUtils]: 64: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,139 INFO L290 TraceCheckUtils]: 65: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,140 INFO L290 TraceCheckUtils]: 66: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,140 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {37104#true} {37300#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #50#return; {37300#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:42:12,140 INFO L290 TraceCheckUtils]: 68: Hoare triple {37300#(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; {37322#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 04:42:12,141 INFO L290 TraceCheckUtils]: 69: Hoare triple {37322#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {37322#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 04:42:12,141 INFO L272 TraceCheckUtils]: 70: Hoare triple {37322#(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)); {37104#true} is VALID [2022-04-08 04:42:12,141 INFO L290 TraceCheckUtils]: 71: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,141 INFO L290 TraceCheckUtils]: 72: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,141 INFO L290 TraceCheckUtils]: 73: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,141 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {37104#true} {37322#(and (= main_~y~0 9) (= main_~c~0 9))} #50#return; {37322#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 04:42:12,142 INFO L290 TraceCheckUtils]: 75: Hoare triple {37322#(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; {37344#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:42:12,142 INFO L290 TraceCheckUtils]: 76: Hoare triple {37344#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {37344#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:42:12,142 INFO L272 TraceCheckUtils]: 77: Hoare triple {37344#(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)); {37104#true} is VALID [2022-04-08 04:42:12,142 INFO L290 TraceCheckUtils]: 78: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,142 INFO L290 TraceCheckUtils]: 79: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,142 INFO L290 TraceCheckUtils]: 80: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,143 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {37104#true} {37344#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #50#return; {37344#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 04:42:12,144 INFO L290 TraceCheckUtils]: 82: Hoare triple {37344#(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; {37366#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:42:12,144 INFO L290 TraceCheckUtils]: 83: Hoare triple {37366#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {37366#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:42:12,144 INFO L272 TraceCheckUtils]: 84: Hoare triple {37366#(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)); {37104#true} is VALID [2022-04-08 04:42:12,144 INFO L290 TraceCheckUtils]: 85: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,144 INFO L290 TraceCheckUtils]: 86: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,145 INFO L290 TraceCheckUtils]: 87: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,145 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {37104#true} {37366#(and (= main_~c~0 11) (= main_~y~0 11))} #50#return; {37366#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 04:42:12,146 INFO L290 TraceCheckUtils]: 89: Hoare triple {37366#(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; {37388#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:42:12,146 INFO L290 TraceCheckUtils]: 90: Hoare triple {37388#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {37388#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:42:12,146 INFO L272 TraceCheckUtils]: 91: Hoare triple {37388#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 04:42:12,146 INFO L290 TraceCheckUtils]: 92: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,146 INFO L290 TraceCheckUtils]: 93: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,146 INFO L290 TraceCheckUtils]: 94: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,147 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {37104#true} {37388#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #50#return; {37388#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:42:12,147 INFO L290 TraceCheckUtils]: 96: Hoare triple {37388#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37410#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:42:12,148 INFO L290 TraceCheckUtils]: 97: Hoare triple {37410#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {37410#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:42:12,148 INFO L272 TraceCheckUtils]: 98: Hoare triple {37410#(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)); {37104#true} is VALID [2022-04-08 04:42:12,148 INFO L290 TraceCheckUtils]: 99: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,148 INFO L290 TraceCheckUtils]: 100: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,148 INFO L290 TraceCheckUtils]: 101: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,149 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {37104#true} {37410#(and (= main_~c~0 13) (= main_~y~0 13))} #50#return; {37410#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 04:42:12,149 INFO L290 TraceCheckUtils]: 103: Hoare triple {37410#(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; {37432#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 04:42:12,150 INFO L290 TraceCheckUtils]: 104: Hoare triple {37432#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {37432#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 04:42:12,150 INFO L272 TraceCheckUtils]: 105: Hoare triple {37432#(and (= main_~y~0 14) (= (+ (- 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)); {37104#true} is VALID [2022-04-08 04:42:12,150 INFO L290 TraceCheckUtils]: 106: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,150 INFO L290 TraceCheckUtils]: 107: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,150 INFO L290 TraceCheckUtils]: 108: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,150 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {37104#true} {37432#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #50#return; {37432#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 04:42:12,151 INFO L290 TraceCheckUtils]: 110: Hoare triple {37432#(and (= main_~y~0 14) (= (+ (- 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; {37454#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:42:12,151 INFO L290 TraceCheckUtils]: 111: Hoare triple {37454#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {37454#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:42:12,151 INFO L272 TraceCheckUtils]: 112: Hoare triple {37454#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 04:42:12,152 INFO L290 TraceCheckUtils]: 113: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,152 INFO L290 TraceCheckUtils]: 114: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,152 INFO L290 TraceCheckUtils]: 115: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,152 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {37104#true} {37454#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #50#return; {37454#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:42:12,153 INFO L290 TraceCheckUtils]: 117: Hoare triple {37454#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37476#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 04:42:12,153 INFO L290 TraceCheckUtils]: 118: Hoare triple {37476#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} assume !false; {37476#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 04:42:12,153 INFO L272 TraceCheckUtils]: 119: Hoare triple {37476#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 04:42:12,153 INFO L290 TraceCheckUtils]: 120: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,153 INFO L290 TraceCheckUtils]: 121: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,154 INFO L290 TraceCheckUtils]: 122: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,154 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {37104#true} {37476#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} #50#return; {37476#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 04:42:12,155 INFO L290 TraceCheckUtils]: 124: Hoare triple {37476#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37498#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-08 04:42:12,155 INFO L290 TraceCheckUtils]: 125: Hoare triple {37498#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {37498#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-08 04:42:12,155 INFO L272 TraceCheckUtils]: 126: Hoare triple {37498#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 04:42:12,155 INFO L290 TraceCheckUtils]: 127: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,155 INFO L290 TraceCheckUtils]: 128: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,155 INFO L290 TraceCheckUtils]: 129: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,156 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {37104#true} {37498#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #50#return; {37498#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-08 04:42:12,156 INFO L290 TraceCheckUtils]: 131: Hoare triple {37498#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37520#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 04:42:12,157 INFO L290 TraceCheckUtils]: 132: Hoare triple {37520#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} assume !false; {37520#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 04:42:12,157 INFO L272 TraceCheckUtils]: 133: Hoare triple {37520#(and (= 16 (+ (- 2) main_~c~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)); {37104#true} is VALID [2022-04-08 04:42:12,157 INFO L290 TraceCheckUtils]: 134: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,157 INFO L290 TraceCheckUtils]: 135: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,157 INFO L290 TraceCheckUtils]: 136: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,158 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {37104#true} {37520#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} #50#return; {37520#(and (= 16 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 04:42:12,158 INFO L290 TraceCheckUtils]: 138: Hoare triple {37520#(and (= 16 (+ (- 2) main_~c~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; {37542#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 04:42:12,159 INFO L290 TraceCheckUtils]: 139: Hoare triple {37542#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !false; {37542#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 04:42:12,159 INFO L272 TraceCheckUtils]: 140: Hoare triple {37542#(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)); {37104#true} is VALID [2022-04-08 04:42:12,159 INFO L290 TraceCheckUtils]: 141: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,159 INFO L290 TraceCheckUtils]: 142: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,159 INFO L290 TraceCheckUtils]: 143: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,159 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {37104#true} {37542#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} #50#return; {37542#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 04:42:12,160 INFO L290 TraceCheckUtils]: 145: Hoare triple {37542#(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; {37564#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-08 04:42:12,160 INFO L290 TraceCheckUtils]: 146: Hoare triple {37564#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} assume !false; {37564#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-08 04:42:12,160 INFO L272 TraceCheckUtils]: 147: Hoare triple {37564#(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)); {37104#true} is VALID [2022-04-08 04:42:12,161 INFO L290 TraceCheckUtils]: 148: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,161 INFO L290 TraceCheckUtils]: 149: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,161 INFO L290 TraceCheckUtils]: 150: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,161 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {37104#true} {37564#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} #50#return; {37564#(and (= 19 (+ (- 1) main_~c~0)) (= main_~y~0 20))} is VALID [2022-04-08 04:42:12,162 INFO L290 TraceCheckUtils]: 152: Hoare triple {37564#(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; {37586#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:42:12,162 INFO L290 TraceCheckUtils]: 153: Hoare triple {37586#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !false; {37586#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:42:12,162 INFO L272 TraceCheckUtils]: 154: Hoare triple {37586#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 04:42:12,162 INFO L290 TraceCheckUtils]: 155: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,162 INFO L290 TraceCheckUtils]: 156: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,162 INFO L290 TraceCheckUtils]: 157: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,163 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {37104#true} {37586#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} #50#return; {37586#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:42:12,163 INFO L290 TraceCheckUtils]: 159: Hoare triple {37586#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37608#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 04:42:12,163 INFO L290 TraceCheckUtils]: 160: Hoare triple {37608#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {37608#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 04:42:12,163 INFO L272 TraceCheckUtils]: 161: Hoare triple {37608#(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)); {37104#true} is VALID [2022-04-08 04:42:12,163 INFO L290 TraceCheckUtils]: 162: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,164 INFO L290 TraceCheckUtils]: 163: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,164 INFO L290 TraceCheckUtils]: 164: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,164 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {37104#true} {37608#(and (= main_~y~0 22) (= main_~c~0 22))} #50#return; {37608#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 04:42:12,164 INFO L290 TraceCheckUtils]: 166: Hoare triple {37608#(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; {37630#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 04:42:12,165 INFO L290 TraceCheckUtils]: 167: Hoare triple {37630#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !false; {37630#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 04:42:12,165 INFO L272 TraceCheckUtils]: 168: Hoare triple {37630#(and (= (+ (- 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)); {37104#true} is VALID [2022-04-08 04:42:12,165 INFO L290 TraceCheckUtils]: 169: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,165 INFO L290 TraceCheckUtils]: 170: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,165 INFO L290 TraceCheckUtils]: 171: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,165 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {37104#true} {37630#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} #50#return; {37630#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 04:42:12,166 INFO L290 TraceCheckUtils]: 173: Hoare triple {37630#(and (= (+ (- 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; {37652#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} is VALID [2022-04-08 04:42:12,166 INFO L290 TraceCheckUtils]: 174: Hoare triple {37652#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} assume !false; {37652#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} is VALID [2022-04-08 04:42:12,166 INFO L272 TraceCheckUtils]: 175: Hoare triple {37652#(and (= 22 (+ (- 2) main_~c~0)) (= 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)); {37104#true} is VALID [2022-04-08 04:42:12,166 INFO L290 TraceCheckUtils]: 176: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,166 INFO L290 TraceCheckUtils]: 177: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,166 INFO L290 TraceCheckUtils]: 178: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,167 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {37104#true} {37652#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} #50#return; {37652#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} is VALID [2022-04-08 04:42:12,167 INFO L290 TraceCheckUtils]: 180: Hoare triple {37652#(and (= 22 (+ (- 2) main_~c~0)) (= 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; {37674#(and (= (+ main_~c~0 (- 3)) 22) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 04:42:12,167 INFO L290 TraceCheckUtils]: 181: Hoare triple {37674#(and (= (+ main_~c~0 (- 3)) 22) (= (+ (- 1) main_~y~0) 24))} assume !false; {37674#(and (= (+ main_~c~0 (- 3)) 22) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 04:42:12,167 INFO L272 TraceCheckUtils]: 182: Hoare triple {37674#(and (= (+ main_~c~0 (- 3)) 22) (= (+ (- 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)); {37104#true} is VALID [2022-04-08 04:42:12,167 INFO L290 TraceCheckUtils]: 183: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,168 INFO L290 TraceCheckUtils]: 184: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,168 INFO L290 TraceCheckUtils]: 185: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,168 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {37104#true} {37674#(and (= (+ main_~c~0 (- 3)) 22) (= (+ (- 1) main_~y~0) 24))} #50#return; {37674#(and (= (+ main_~c~0 (- 3)) 22) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 04:42:12,169 INFO L290 TraceCheckUtils]: 187: Hoare triple {37674#(and (= (+ main_~c~0 (- 3)) 22) (= (+ (- 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; {37696#(and (= 22 (+ main_~c~0 (- 4))) (= main_~y~0 26))} is VALID [2022-04-08 04:42:12,169 INFO L290 TraceCheckUtils]: 188: Hoare triple {37696#(and (= 22 (+ main_~c~0 (- 4))) (= main_~y~0 26))} assume !false; {37696#(and (= 22 (+ main_~c~0 (- 4))) (= main_~y~0 26))} is VALID [2022-04-08 04:42:12,169 INFO L272 TraceCheckUtils]: 189: Hoare triple {37696#(and (= 22 (+ main_~c~0 (- 4))) (= 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)); {37104#true} is VALID [2022-04-08 04:42:12,169 INFO L290 TraceCheckUtils]: 190: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,169 INFO L290 TraceCheckUtils]: 191: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,169 INFO L290 TraceCheckUtils]: 192: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,170 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {37104#true} {37696#(and (= 22 (+ main_~c~0 (- 4))) (= main_~y~0 26))} #50#return; {37696#(and (= 22 (+ main_~c~0 (- 4))) (= main_~y~0 26))} is VALID [2022-04-08 04:42:12,170 INFO L290 TraceCheckUtils]: 194: Hoare triple {37696#(and (= 22 (+ main_~c~0 (- 4))) (= 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; {37718#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 04:42:12,171 INFO L290 TraceCheckUtils]: 195: Hoare triple {37718#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {37718#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 04:42:12,171 INFO L272 TraceCheckUtils]: 196: Hoare triple {37718#(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)); {37104#true} is VALID [2022-04-08 04:42:12,171 INFO L290 TraceCheckUtils]: 197: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,171 INFO L290 TraceCheckUtils]: 198: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,171 INFO L290 TraceCheckUtils]: 199: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,171 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {37104#true} {37718#(and (= main_~y~0 27) (= main_~c~0 27))} #50#return; {37718#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 04:42:12,172 INFO L290 TraceCheckUtils]: 201: Hoare triple {37718#(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; {37740#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 04:42:12,172 INFO L290 TraceCheckUtils]: 202: Hoare triple {37740#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} assume !false; {37740#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 04:42:12,172 INFO L272 TraceCheckUtils]: 203: Hoare triple {37740#(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)); {37104#true} is VALID [2022-04-08 04:42:12,172 INFO L290 TraceCheckUtils]: 204: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,173 INFO L290 TraceCheckUtils]: 205: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,173 INFO L290 TraceCheckUtils]: 206: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,173 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {37104#true} {37740#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} #50#return; {37740#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 04:42:12,174 INFO L290 TraceCheckUtils]: 208: Hoare triple {37740#(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; {37762#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:42:12,174 INFO L290 TraceCheckUtils]: 209: Hoare triple {37762#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} assume !false; {37762#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:42:12,174 INFO L272 TraceCheckUtils]: 210: Hoare triple {37762#(and (= 29 main_~y~0) (= 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)); {37104#true} is VALID [2022-04-08 04:42:12,174 INFO L290 TraceCheckUtils]: 211: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,174 INFO L290 TraceCheckUtils]: 212: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,174 INFO L290 TraceCheckUtils]: 213: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,175 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {37104#true} {37762#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} #50#return; {37762#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:42:12,175 INFO L290 TraceCheckUtils]: 215: Hoare triple {37762#(and (= 29 main_~y~0) (= 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; {37784#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:42:12,176 INFO L290 TraceCheckUtils]: 216: Hoare triple {37784#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} assume !false; {37784#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:42:12,176 INFO L272 TraceCheckUtils]: 217: Hoare triple {37784#(and (= (+ main_~c~0 (- 3)) 27) (= 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)); {37104#true} is VALID [2022-04-08 04:42:12,176 INFO L290 TraceCheckUtils]: 218: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,176 INFO L290 TraceCheckUtils]: 219: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,176 INFO L290 TraceCheckUtils]: 220: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,176 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {37104#true} {37784#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} #50#return; {37784#(and (= (+ main_~c~0 (- 3)) 27) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:42:12,177 INFO L290 TraceCheckUtils]: 222: Hoare triple {37784#(and (= (+ main_~c~0 (- 3)) 27) (= 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; {37806#(and (= (+ main_~c~0 (- 4)) 27) (= (+ (- 2) main_~y~0) 29))} is VALID [2022-04-08 04:42:12,177 INFO L290 TraceCheckUtils]: 223: Hoare triple {37806#(and (= (+ main_~c~0 (- 4)) 27) (= (+ (- 2) main_~y~0) 29))} assume !false; {37806#(and (= (+ main_~c~0 (- 4)) 27) (= (+ (- 2) main_~y~0) 29))} is VALID [2022-04-08 04:42:12,177 INFO L272 TraceCheckUtils]: 224: Hoare triple {37806#(and (= (+ main_~c~0 (- 4)) 27) (= (+ (- 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)); {37104#true} is VALID [2022-04-08 04:42:12,177 INFO L290 TraceCheckUtils]: 225: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,178 INFO L290 TraceCheckUtils]: 226: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,178 INFO L290 TraceCheckUtils]: 227: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,178 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {37104#true} {37806#(and (= (+ main_~c~0 (- 4)) 27) (= (+ (- 2) main_~y~0) 29))} #50#return; {37806#(and (= (+ main_~c~0 (- 4)) 27) (= (+ (- 2) main_~y~0) 29))} is VALID [2022-04-08 04:42:12,179 INFO L290 TraceCheckUtils]: 229: Hoare triple {37806#(and (= (+ main_~c~0 (- 4)) 27) (= (+ (- 2) main_~y~0) 29))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37828#(and (= (+ main_~c~0 (- 5)) 27) (= (+ main_~y~0 (- 3)) 29))} is VALID [2022-04-08 04:42:12,179 INFO L290 TraceCheckUtils]: 230: Hoare triple {37828#(and (= (+ main_~c~0 (- 5)) 27) (= (+ main_~y~0 (- 3)) 29))} assume !false; {37828#(and (= (+ main_~c~0 (- 5)) 27) (= (+ main_~y~0 (- 3)) 29))} is VALID [2022-04-08 04:42:12,179 INFO L272 TraceCheckUtils]: 231: Hoare triple {37828#(and (= (+ main_~c~0 (- 5)) 27) (= (+ main_~y~0 (- 3)) 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)); {37104#true} is VALID [2022-04-08 04:42:12,179 INFO L290 TraceCheckUtils]: 232: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,179 INFO L290 TraceCheckUtils]: 233: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,179 INFO L290 TraceCheckUtils]: 234: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,180 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {37104#true} {37828#(and (= (+ main_~c~0 (- 5)) 27) (= (+ main_~y~0 (- 3)) 29))} #50#return; {37828#(and (= (+ main_~c~0 (- 5)) 27) (= (+ main_~y~0 (- 3)) 29))} is VALID [2022-04-08 04:42:12,180 INFO L290 TraceCheckUtils]: 236: Hoare triple {37828#(and (= (+ main_~c~0 (- 5)) 27) (= (+ main_~y~0 (- 3)) 29))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37850#(and (= 29 (+ main_~y~0 (- 4))) (= (+ main_~c~0 (- 6)) 27))} is VALID [2022-04-08 04:42:12,181 INFO L290 TraceCheckUtils]: 237: Hoare triple {37850#(and (= 29 (+ main_~y~0 (- 4))) (= (+ main_~c~0 (- 6)) 27))} assume !false; {37850#(and (= 29 (+ main_~y~0 (- 4))) (= (+ main_~c~0 (- 6)) 27))} is VALID [2022-04-08 04:42:12,181 INFO L272 TraceCheckUtils]: 238: Hoare triple {37850#(and (= 29 (+ main_~y~0 (- 4))) (= (+ main_~c~0 (- 6)) 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)); {37104#true} is VALID [2022-04-08 04:42:12,181 INFO L290 TraceCheckUtils]: 239: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,181 INFO L290 TraceCheckUtils]: 240: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,181 INFO L290 TraceCheckUtils]: 241: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,181 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {37104#true} {37850#(and (= 29 (+ main_~y~0 (- 4))) (= (+ main_~c~0 (- 6)) 27))} #50#return; {37850#(and (= 29 (+ main_~y~0 (- 4))) (= (+ main_~c~0 (- 6)) 27))} is VALID [2022-04-08 04:42:12,182 INFO L290 TraceCheckUtils]: 243: Hoare triple {37850#(and (= 29 (+ main_~y~0 (- 4))) (= (+ main_~c~0 (- 6)) 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; {37872#(and (= (+ main_~c~0 (- 7)) 27) (= 29 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 04:42:12,182 INFO L290 TraceCheckUtils]: 244: Hoare triple {37872#(and (= (+ main_~c~0 (- 7)) 27) (= 29 (+ main_~y~0 (- 5))))} assume !false; {37872#(and (= (+ main_~c~0 (- 7)) 27) (= 29 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 04:42:12,182 INFO L272 TraceCheckUtils]: 245: Hoare triple {37872#(and (= (+ main_~c~0 (- 7)) 27) (= 29 (+ 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)); {37104#true} is VALID [2022-04-08 04:42:12,182 INFO L290 TraceCheckUtils]: 246: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,182 INFO L290 TraceCheckUtils]: 247: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,182 INFO L290 TraceCheckUtils]: 248: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,183 INFO L284 TraceCheckUtils]: 249: Hoare quadruple {37104#true} {37872#(and (= (+ main_~c~0 (- 7)) 27) (= 29 (+ main_~y~0 (- 5))))} #50#return; {37872#(and (= (+ main_~c~0 (- 7)) 27) (= 29 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 04:42:12,183 INFO L290 TraceCheckUtils]: 250: Hoare triple {37872#(and (= (+ main_~c~0 (- 7)) 27) (= 29 (+ 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; {37894#(and (= (+ main_~y~0 (- 6)) 29) (= 27 (+ main_~c~0 (- 8))))} is VALID [2022-04-08 04:42:12,184 INFO L290 TraceCheckUtils]: 251: Hoare triple {37894#(and (= (+ main_~y~0 (- 6)) 29) (= 27 (+ main_~c~0 (- 8))))} assume !false; {37894#(and (= (+ main_~y~0 (- 6)) 29) (= 27 (+ main_~c~0 (- 8))))} is VALID [2022-04-08 04:42:12,184 INFO L272 TraceCheckUtils]: 252: Hoare triple {37894#(and (= (+ main_~y~0 (- 6)) 29) (= 27 (+ 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)); {37104#true} is VALID [2022-04-08 04:42:12,184 INFO L290 TraceCheckUtils]: 253: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,184 INFO L290 TraceCheckUtils]: 254: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,184 INFO L290 TraceCheckUtils]: 255: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,184 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {37104#true} {37894#(and (= (+ main_~y~0 (- 6)) 29) (= 27 (+ main_~c~0 (- 8))))} #50#return; {37894#(and (= (+ main_~y~0 (- 6)) 29) (= 27 (+ main_~c~0 (- 8))))} is VALID [2022-04-08 04:42:12,185 INFO L290 TraceCheckUtils]: 257: Hoare triple {37894#(and (= (+ main_~y~0 (- 6)) 29) (= 27 (+ 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; {37916#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-08 04:42:12,185 INFO L290 TraceCheckUtils]: 258: Hoare triple {37916#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} assume !false; {37916#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-08 04:42:12,185 INFO L272 TraceCheckUtils]: 259: Hoare triple {37916#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37104#true} is VALID [2022-04-08 04:42:12,185 INFO L290 TraceCheckUtils]: 260: Hoare triple {37104#true} ~cond := #in~cond; {37104#true} is VALID [2022-04-08 04:42:12,186 INFO L290 TraceCheckUtils]: 261: Hoare triple {37104#true} assume !(0 == ~cond); {37104#true} is VALID [2022-04-08 04:42:12,186 INFO L290 TraceCheckUtils]: 262: Hoare triple {37104#true} assume true; {37104#true} is VALID [2022-04-08 04:42:12,186 INFO L284 TraceCheckUtils]: 263: Hoare quadruple {37104#true} {37916#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} #50#return; {37916#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-08 04:42:12,187 INFO L290 TraceCheckUtils]: 264: Hoare triple {37916#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} assume !(~c~0 < ~k~0); {37938#(and (<= main_~k~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-08 04:42:12,187 INFO L272 TraceCheckUtils]: 265: Hoare triple {37938#(and (<= main_~k~0 36) (= main_~y~0 36) (< 35 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {37942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:42:12,188 INFO L290 TraceCheckUtils]: 266: Hoare triple {37942#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:42:12,188 INFO L290 TraceCheckUtils]: 267: Hoare triple {37946#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37105#false} is VALID [2022-04-08 04:42:12,188 INFO L290 TraceCheckUtils]: 268: Hoare triple {37105#false} assume !false; {37105#false} is VALID [2022-04-08 04:42:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4736 backedges. 74 proven. 1998 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2022-04-08 04:42:12,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:42:12,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:42:12,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089881235] [2022-04-08 04:42:12,702 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:42:12,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679352725] [2022-04-08 04:42:12,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679352725] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:42:12,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:42:12,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2022-04-08 04:42:12,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:42:12,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1970956798] [2022-04-08 04:42:12,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1970956798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:42:12,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:42:12,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-08 04:42:12,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134363242] [2022-04-08 04:42:12,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:42:12,704 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 39 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Word has length 269 [2022-04-08 04:42:12,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:42:12,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 39 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 04:42:13,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:42:13,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-08 04:42:13,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:42:13,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-08 04:42:13,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 04:42:13,747 INFO L87 Difference]: Start difference. First operand 130 states and 165 transitions. Second operand has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 39 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 04:43:05,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:43:05,128 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2022-04-08 04:43:05,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-08 04:43:05,129 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 39 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Word has length 269 [2022-04-08 04:43:05,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:43:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 39 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 04:43:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 170 transitions. [2022-04-08 04:43:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 39 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 04:43:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 170 transitions. [2022-04-08 04:43:05,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 170 transitions. [2022-04-08 04:43:06,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:43:06,469 INFO L225 Difference]: With dead ends: 138 [2022-04-08 04:43:06,469 INFO L226 Difference]: Without dead ends: 133 [2022-04-08 04:43:06,469 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=2023, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 04:43:06,470 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 2 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 4491 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 4491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2022-04-08 04:43:06,470 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2079 Invalid, 4491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4491 Invalid, 0 Unknown, 0 Unchecked, 26.9s Time] [2022-04-08 04:43:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-08 04:43:06,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-04-08 04:43:06,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:43:06,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 04:43:06,657 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 04:43:06,658 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 04:43:06,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:43:06,661 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2022-04-08 04:43:06,661 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2022-04-08 04:43:06,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:43:06,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:43:06,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 133 states. [2022-04-08 04:43:06,662 INFO L87 Difference]: Start difference. First operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 133 states. [2022-04-08 04:43:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:43:06,672 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2022-04-08 04:43:06,672 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2022-04-08 04:43:06,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:43:06,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:43:06,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:43:06,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:43:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 41 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 04:43:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 169 transitions. [2022-04-08 04:43:06,676 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 169 transitions. Word has length 269 [2022-04-08 04:43:06,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:43:06,677 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 169 transitions. [2022-04-08 04:43:06,677 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 39 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 04:43:06,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 169 transitions. [2022-04-08 04:43:07,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:43:07,641 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2022-04-08 04:43:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2022-04-08 04:43:07,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:43:07,643 INFO L499 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:43:07,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-08 04:43:07,853 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-08 04:43:07,853 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:43:07,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:43:07,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1749058981, now seen corresponding path program 73 times [2022-04-08 04:43:07,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:43:07,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [801262730] [2022-04-08 04:43:07,966 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:43:07,966 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:43:07,966 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:43:07,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1749058981, now seen corresponding path program 74 times [2022-04-08 04:43:07,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:43:07,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977543550] [2022-04-08 04:43:07,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:43:07,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:43:07,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:43:07,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1764009271] [2022-04-08 04:43:07,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:43:07,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:43:07,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:43:07,987 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:43:07,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-08 04:43:09,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:43:09,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:43:09,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 156 conjunts are in the unsatisfiable core [2022-04-08 04:43:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:43:09,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:43:11,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {38806#true} call ULTIMATE.init(); {38806#true} is VALID [2022-04-08 04:43:11,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {38806#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); {38806#true} is VALID [2022-04-08 04:43:11,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38806#true} {38806#true} #56#return; {38806#true} is VALID [2022-04-08 04:43:11,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {38806#true} call #t~ret5 := main(); {38806#true} is VALID [2022-04-08 04:43:11,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {38806#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; {38826#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:43:11,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {38826#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {38826#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:43:11,151 INFO L272 TraceCheckUtils]: 7: Hoare triple {38826#(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)); {38806#true} is VALID [2022-04-08 04:43:11,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,152 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {38806#true} {38826#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {38826#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:43:11,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {38826#(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; {38848#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:43:11,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {38848#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {38848#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:43:11,152 INFO L272 TraceCheckUtils]: 14: Hoare triple {38848#(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)); {38806#true} is VALID [2022-04-08 04:43:11,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,153 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {38806#true} {38848#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {38848#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:43:11,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {38848#(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; {38870#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 04:43:11,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {38870#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {38870#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 04:43:11,154 INFO L272 TraceCheckUtils]: 21: Hoare triple {38870#(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)); {38806#true} is VALID [2022-04-08 04:43:11,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,159 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {38806#true} {38870#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #50#return; {38870#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 04:43:11,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {38870#(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; {38892#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 04:43:11,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {38892#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} assume !false; {38892#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 04:43:11,160 INFO L272 TraceCheckUtils]: 28: Hoare triple {38892#(and (= (+ (- 2) main_~c~0) 1) (= (+ 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)); {38806#true} is VALID [2022-04-08 04:43:11,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,161 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {38806#true} {38892#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} #50#return; {38892#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 04:43:11,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {38892#(and (= (+ (- 2) main_~c~0) 1) (= (+ 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; {38914#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-08 04:43:11,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {38914#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} assume !false; {38914#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-08 04:43:11,162 INFO L272 TraceCheckUtils]: 35: Hoare triple {38914#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~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)); {38806#true} is VALID [2022-04-08 04:43:11,162 INFO L290 TraceCheckUtils]: 36: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,163 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {38806#true} {38914#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} #50#return; {38914#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-08 04:43:11,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {38914#(and (= (+ main_~c~0 (- 3)) 1) (= (+ main_~y~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; {38936#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:43:11,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {38936#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {38936#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:43:11,164 INFO L272 TraceCheckUtils]: 42: Hoare triple {38936#(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)); {38806#true} is VALID [2022-04-08 04:43:11,164 INFO L290 TraceCheckUtils]: 43: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,165 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {38806#true} {38936#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {38936#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:43:11,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {38936#(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; {38958#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {38958#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {38958#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,166 INFO L272 TraceCheckUtils]: 49: Hoare triple {38958#(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)); {38806#true} is VALID [2022-04-08 04:43:11,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,166 INFO L290 TraceCheckUtils]: 51: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,167 INFO L290 TraceCheckUtils]: 52: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,167 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38806#true} {38958#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #50#return; {38958#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,168 INFO L290 TraceCheckUtils]: 54: Hoare triple {38958#(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; {38980#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:43:11,168 INFO L290 TraceCheckUtils]: 55: Hoare triple {38980#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {38980#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:43:11,168 INFO L272 TraceCheckUtils]: 56: Hoare triple {38980#(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)); {38806#true} is VALID [2022-04-08 04:43:11,168 INFO L290 TraceCheckUtils]: 57: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,168 INFO L290 TraceCheckUtils]: 58: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,168 INFO L290 TraceCheckUtils]: 59: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,169 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {38806#true} {38980#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {38980#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:43:11,170 INFO L290 TraceCheckUtils]: 61: Hoare triple {38980#(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; {39002#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,170 INFO L290 TraceCheckUtils]: 62: Hoare triple {39002#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !false; {39002#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,170 INFO L272 TraceCheckUtils]: 63: Hoare triple {39002#(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)); {38806#true} is VALID [2022-04-08 04:43:11,170 INFO L290 TraceCheckUtils]: 64: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,170 INFO L290 TraceCheckUtils]: 65: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,171 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {38806#true} {39002#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #50#return; {39002#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,171 INFO L290 TraceCheckUtils]: 68: Hoare triple {39002#(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; {39024#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 04:43:11,172 INFO L290 TraceCheckUtils]: 69: Hoare triple {39024#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} assume !false; {39024#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 04:43:11,172 INFO L272 TraceCheckUtils]: 70: Hoare triple {39024#(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)); {38806#true} is VALID [2022-04-08 04:43:11,172 INFO L290 TraceCheckUtils]: 71: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,172 INFO L290 TraceCheckUtils]: 72: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,172 INFO L290 TraceCheckUtils]: 73: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,173 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {38806#true} {39024#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} #50#return; {39024#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 04:43:11,173 INFO L290 TraceCheckUtils]: 75: Hoare triple {39024#(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; {39046#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 04:43:11,174 INFO L290 TraceCheckUtils]: 76: Hoare triple {39046#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !false; {39046#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 04:43:11,174 INFO L272 TraceCheckUtils]: 77: Hoare triple {39046#(and (= 7 (+ main_~y~0 (- 3))) (= 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)); {38806#true} is VALID [2022-04-08 04:43:11,174 INFO L290 TraceCheckUtils]: 78: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,174 INFO L290 TraceCheckUtils]: 79: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,174 INFO L290 TraceCheckUtils]: 80: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,174 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {38806#true} {39046#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} #50#return; {39046#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 04:43:11,181 INFO L290 TraceCheckUtils]: 82: Hoare triple {39046#(and (= 7 (+ main_~y~0 (- 3))) (= 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; {39068#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 04:43:11,181 INFO L290 TraceCheckUtils]: 83: Hoare triple {39068#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} assume !false; {39068#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 04:43:11,181 INFO L272 TraceCheckUtils]: 84: Hoare triple {39068#(and (= main_~c~0 11) (= 7 (+ 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)); {38806#true} is VALID [2022-04-08 04:43:11,181 INFO L290 TraceCheckUtils]: 85: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,182 INFO L290 TraceCheckUtils]: 86: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,182 INFO L290 TraceCheckUtils]: 87: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,182 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {38806#true} {39068#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} #50#return; {39068#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 04:43:11,183 INFO L290 TraceCheckUtils]: 89: Hoare triple {39068#(and (= main_~c~0 11) (= 7 (+ 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; {39090#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:43:11,183 INFO L290 TraceCheckUtils]: 90: Hoare triple {39090#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {39090#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:43:11,183 INFO L272 TraceCheckUtils]: 91: Hoare triple {39090#(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)); {38806#true} is VALID [2022-04-08 04:43:11,183 INFO L290 TraceCheckUtils]: 92: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,183 INFO L290 TraceCheckUtils]: 93: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,183 INFO L290 TraceCheckUtils]: 94: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,184 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {38806#true} {39090#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {39090#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:43:11,184 INFO L290 TraceCheckUtils]: 96: Hoare triple {39090#(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; {39112#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,185 INFO L290 TraceCheckUtils]: 97: Hoare triple {39112#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {39112#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,185 INFO L272 TraceCheckUtils]: 98: Hoare triple {39112#(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)); {38806#true} is VALID [2022-04-08 04:43:11,185 INFO L290 TraceCheckUtils]: 99: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,185 INFO L290 TraceCheckUtils]: 100: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,185 INFO L290 TraceCheckUtils]: 101: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,186 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {38806#true} {39112#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #50#return; {39112#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,186 INFO L290 TraceCheckUtils]: 103: Hoare triple {39112#(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; {39134#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-08 04:43:11,187 INFO L290 TraceCheckUtils]: 104: Hoare triple {39134#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} assume !false; {39134#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-08 04:43:11,187 INFO L272 TraceCheckUtils]: 105: Hoare triple {39134#(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)); {38806#true} is VALID [2022-04-08 04:43:11,187 INFO L290 TraceCheckUtils]: 106: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,187 INFO L290 TraceCheckUtils]: 107: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,187 INFO L290 TraceCheckUtils]: 108: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,187 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {38806#true} {39134#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} #50#return; {39134#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-08 04:43:11,188 INFO L290 TraceCheckUtils]: 110: Hoare triple {39134#(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; {39156#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:43:11,188 INFO L290 TraceCheckUtils]: 111: Hoare triple {39156#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {39156#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:43:11,188 INFO L272 TraceCheckUtils]: 112: Hoare triple {39156#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 04:43:11,189 INFO L290 TraceCheckUtils]: 113: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,189 INFO L290 TraceCheckUtils]: 114: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,189 INFO L290 TraceCheckUtils]: 115: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,189 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {38806#true} {39156#(and (= main_~c~0 15) (= main_~y~0 15))} #50#return; {39156#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:43:11,190 INFO L290 TraceCheckUtils]: 117: Hoare triple {39156#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39178#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,190 INFO L290 TraceCheckUtils]: 118: Hoare triple {39178#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {39178#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,190 INFO L272 TraceCheckUtils]: 119: Hoare triple {39178#(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)); {38806#true} is VALID [2022-04-08 04:43:11,190 INFO L290 TraceCheckUtils]: 120: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,190 INFO L290 TraceCheckUtils]: 121: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,191 INFO L290 TraceCheckUtils]: 122: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,191 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {38806#true} {39178#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #50#return; {39178#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,192 INFO L290 TraceCheckUtils]: 124: Hoare triple {39178#(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; {39200#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-08 04:43:11,192 INFO L290 TraceCheckUtils]: 125: Hoare triple {39200#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !false; {39200#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-08 04:43:11,192 INFO L272 TraceCheckUtils]: 126: Hoare triple {39200#(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)); {38806#true} is VALID [2022-04-08 04:43:11,192 INFO L290 TraceCheckUtils]: 127: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,192 INFO L290 TraceCheckUtils]: 128: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,192 INFO L290 TraceCheckUtils]: 129: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,193 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {38806#true} {39200#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} #50#return; {39200#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-08 04:43:11,193 INFO L290 TraceCheckUtils]: 131: Hoare triple {39200#(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; {39222#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} is VALID [2022-04-08 04:43:11,194 INFO L290 TraceCheckUtils]: 132: Hoare triple {39222#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} assume !false; {39222#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} is VALID [2022-04-08 04:43:11,194 INFO L272 TraceCheckUtils]: 133: Hoare triple {39222#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 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)); {38806#true} is VALID [2022-04-08 04:43:11,194 INFO L290 TraceCheckUtils]: 134: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,194 INFO L290 TraceCheckUtils]: 135: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,194 INFO L290 TraceCheckUtils]: 136: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,194 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {38806#true} {39222#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} #50#return; {39222#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 15))} is VALID [2022-04-08 04:43:11,195 INFO L290 TraceCheckUtils]: 138: Hoare triple {39222#(and (= main_~c~0 18) (= (+ main_~y~0 (- 3)) 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; {39244#(and (= (+ main_~y~0 (- 4)) 15) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:43:11,195 INFO L290 TraceCheckUtils]: 139: Hoare triple {39244#(and (= (+ main_~y~0 (- 4)) 15) (= (+ (- 1) main_~c~0) 18))} assume !false; {39244#(and (= (+ main_~y~0 (- 4)) 15) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:43:11,195 INFO L272 TraceCheckUtils]: 140: Hoare triple {39244#(and (= (+ main_~y~0 (- 4)) 15) (= (+ (- 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)); {38806#true} is VALID [2022-04-08 04:43:11,196 INFO L290 TraceCheckUtils]: 141: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,196 INFO L290 TraceCheckUtils]: 142: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,196 INFO L290 TraceCheckUtils]: 143: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,196 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {38806#true} {39244#(and (= (+ main_~y~0 (- 4)) 15) (= (+ (- 1) main_~c~0) 18))} #50#return; {39244#(and (= (+ main_~y~0 (- 4)) 15) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 04:43:11,197 INFO L290 TraceCheckUtils]: 145: Hoare triple {39244#(and (= (+ main_~y~0 (- 4)) 15) (= (+ (- 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; {39266#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 04:43:11,197 INFO L290 TraceCheckUtils]: 146: Hoare triple {39266#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {39266#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 04:43:11,197 INFO L272 TraceCheckUtils]: 147: Hoare triple {39266#(and (= main_~c~0 20) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 04:43:11,197 INFO L290 TraceCheckUtils]: 148: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,197 INFO L290 TraceCheckUtils]: 149: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,197 INFO L290 TraceCheckUtils]: 150: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,198 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {38806#true} {39266#(and (= main_~c~0 20) (= main_~y~0 20))} #50#return; {39266#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 04:43:11,198 INFO L290 TraceCheckUtils]: 152: Hoare triple {39266#(and (= main_~c~0 20) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39288#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,199 INFO L290 TraceCheckUtils]: 153: Hoare triple {39288#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !false; {39288#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,199 INFO L272 TraceCheckUtils]: 154: Hoare triple {39288#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 04:43:11,199 INFO L290 TraceCheckUtils]: 155: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,199 INFO L290 TraceCheckUtils]: 156: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,199 INFO L290 TraceCheckUtils]: 157: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,199 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {38806#true} {39288#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} #50#return; {39288#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,200 INFO L290 TraceCheckUtils]: 159: Hoare triple {39288#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39310#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 04:43:11,200 INFO L290 TraceCheckUtils]: 160: Hoare triple {39310#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {39310#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 04:43:11,200 INFO L272 TraceCheckUtils]: 161: Hoare triple {39310#(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)); {38806#true} is VALID [2022-04-08 04:43:11,200 INFO L290 TraceCheckUtils]: 162: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,200 INFO L290 TraceCheckUtils]: 163: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,201 INFO L290 TraceCheckUtils]: 164: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,201 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {38806#true} {39310#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #50#return; {39310#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 04:43:11,201 INFO L290 TraceCheckUtils]: 166: Hoare triple {39310#(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; {39332#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} is VALID [2022-04-08 04:43:11,202 INFO L290 TraceCheckUtils]: 167: Hoare triple {39332#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} assume !false; {39332#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} is VALID [2022-04-08 04:43:11,202 INFO L272 TraceCheckUtils]: 168: Hoare triple {39332#(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)); {38806#true} is VALID [2022-04-08 04:43:11,202 INFO L290 TraceCheckUtils]: 169: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,202 INFO L290 TraceCheckUtils]: 170: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,202 INFO L290 TraceCheckUtils]: 171: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,203 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {38806#true} {39332#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} #50#return; {39332#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} is VALID [2022-04-08 04:43:11,203 INFO L290 TraceCheckUtils]: 173: Hoare triple {39332#(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; {39354#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24))} is VALID [2022-04-08 04:43:11,203 INFO L290 TraceCheckUtils]: 174: Hoare triple {39354#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24))} assume !false; {39354#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24))} is VALID [2022-04-08 04:43:11,204 INFO L272 TraceCheckUtils]: 175: Hoare triple {39354#(and (= 21 (+ main_~c~0 (- 3))) (= 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)); {38806#true} is VALID [2022-04-08 04:43:11,204 INFO L290 TraceCheckUtils]: 176: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,204 INFO L290 TraceCheckUtils]: 177: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,204 INFO L290 TraceCheckUtils]: 178: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,204 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {38806#true} {39354#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24))} #50#return; {39354#(and (= 21 (+ main_~c~0 (- 3))) (= main_~y~0 24))} is VALID [2022-04-08 04:43:11,205 INFO L290 TraceCheckUtils]: 180: Hoare triple {39354#(and (= 21 (+ main_~c~0 (- 3))) (= 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; {39376#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 04:43:11,205 INFO L290 TraceCheckUtils]: 181: Hoare triple {39376#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !false; {39376#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 04:43:11,205 INFO L272 TraceCheckUtils]: 182: Hoare triple {39376#(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)); {38806#true} is VALID [2022-04-08 04:43:11,205 INFO L290 TraceCheckUtils]: 183: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,205 INFO L290 TraceCheckUtils]: 184: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,205 INFO L290 TraceCheckUtils]: 185: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,206 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {38806#true} {39376#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} #50#return; {39376#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 04:43:11,206 INFO L290 TraceCheckUtils]: 187: Hoare triple {39376#(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; {39398#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} is VALID [2022-04-08 04:43:11,207 INFO L290 TraceCheckUtils]: 188: Hoare triple {39398#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} assume !false; {39398#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} is VALID [2022-04-08 04:43:11,207 INFO L272 TraceCheckUtils]: 189: Hoare triple {39398#(and (= main_~c~0 26) (= (+ (- 2) 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)); {38806#true} is VALID [2022-04-08 04:43:11,207 INFO L290 TraceCheckUtils]: 190: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,207 INFO L290 TraceCheckUtils]: 191: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,207 INFO L290 TraceCheckUtils]: 192: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,207 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {38806#true} {39398#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} #50#return; {39398#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} is VALID [2022-04-08 04:43:11,208 INFO L290 TraceCheckUtils]: 194: Hoare triple {39398#(and (= main_~c~0 26) (= (+ (- 2) 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; {39420#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} is VALID [2022-04-08 04:43:11,208 INFO L290 TraceCheckUtils]: 195: Hoare triple {39420#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} assume !false; {39420#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} is VALID [2022-04-08 04:43:11,208 INFO L272 TraceCheckUtils]: 196: Hoare triple {39420#(and (= (+ (- 1) main_~c~0) 26) (= 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)); {38806#true} is VALID [2022-04-08 04:43:11,209 INFO L290 TraceCheckUtils]: 197: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,209 INFO L290 TraceCheckUtils]: 198: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,209 INFO L290 TraceCheckUtils]: 199: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,209 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {38806#true} {39420#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} #50#return; {39420#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} is VALID [2022-04-08 04:43:11,210 INFO L290 TraceCheckUtils]: 201: Hoare triple {39420#(and (= (+ (- 1) main_~c~0) 26) (= 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; {39442#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} is VALID [2022-04-08 04:43:11,210 INFO L290 TraceCheckUtils]: 202: Hoare triple {39442#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} assume !false; {39442#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} is VALID [2022-04-08 04:43:11,210 INFO L272 TraceCheckUtils]: 203: Hoare triple {39442#(and (= 26 (+ (- 2) main_~c~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)); {38806#true} is VALID [2022-04-08 04:43:11,210 INFO L290 TraceCheckUtils]: 204: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,210 INFO L290 TraceCheckUtils]: 205: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,210 INFO L290 TraceCheckUtils]: 206: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,211 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {38806#true} {39442#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} #50#return; {39442#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} is VALID [2022-04-08 04:43:11,211 INFO L290 TraceCheckUtils]: 208: Hoare triple {39442#(and (= 26 (+ (- 2) main_~c~0)) (= 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; {39464#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 04:43:11,212 INFO L290 TraceCheckUtils]: 209: Hoare triple {39464#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !false; {39464#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 04:43:11,212 INFO L272 TraceCheckUtils]: 210: Hoare triple {39464#(and (= 29 main_~y~0) (= 29 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 04:43:11,212 INFO L290 TraceCheckUtils]: 211: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,212 INFO L290 TraceCheckUtils]: 212: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,212 INFO L290 TraceCheckUtils]: 213: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,212 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {38806#true} {39464#(and (= 29 main_~y~0) (= 29 main_~c~0))} #50#return; {39464#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 04:43:11,213 INFO L290 TraceCheckUtils]: 215: Hoare triple {39464#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39486#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,213 INFO L290 TraceCheckUtils]: 216: Hoare triple {39486#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} assume !false; {39486#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,213 INFO L272 TraceCheckUtils]: 217: Hoare triple {39486#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 04:43:11,213 INFO L290 TraceCheckUtils]: 218: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,213 INFO L290 TraceCheckUtils]: 219: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,214 INFO L290 TraceCheckUtils]: 220: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,214 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {38806#true} {39486#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} #50#return; {39486#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,215 INFO L290 TraceCheckUtils]: 222: Hoare triple {39486#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39508#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29))} is VALID [2022-04-08 04:43:11,215 INFO L290 TraceCheckUtils]: 223: Hoare triple {39508#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29))} assume !false; {39508#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29))} is VALID [2022-04-08 04:43:11,215 INFO L272 TraceCheckUtils]: 224: Hoare triple {39508#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 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)); {38806#true} is VALID [2022-04-08 04:43:11,215 INFO L290 TraceCheckUtils]: 225: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,215 INFO L290 TraceCheckUtils]: 226: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,215 INFO L290 TraceCheckUtils]: 227: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,216 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {38806#true} {39508#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29))} #50#return; {39508#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29))} is VALID [2022-04-08 04:43:11,216 INFO L290 TraceCheckUtils]: 229: Hoare triple {39508#(and (= (+ (- 1) main_~c~0) 30) (= (+ (- 2) main_~y~0) 29))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39530#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} is VALID [2022-04-08 04:43:11,216 INFO L290 TraceCheckUtils]: 230: Hoare triple {39530#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} assume !false; {39530#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} is VALID [2022-04-08 04:43:11,217 INFO L272 TraceCheckUtils]: 231: Hoare triple {39530#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 04:43:11,217 INFO L290 TraceCheckUtils]: 232: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,217 INFO L290 TraceCheckUtils]: 233: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,217 INFO L290 TraceCheckUtils]: 234: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,217 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {38806#true} {39530#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} #50#return; {39530#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} is VALID [2022-04-08 04:43:11,218 INFO L290 TraceCheckUtils]: 236: Hoare triple {39530#(and (= 30 (+ (- 2) main_~c~0)) (= 32 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {39552#(and (= main_~y~0 33) (= 30 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:43:11,218 INFO L290 TraceCheckUtils]: 237: Hoare triple {39552#(and (= main_~y~0 33) (= 30 (+ main_~c~0 (- 3))))} assume !false; {39552#(and (= main_~y~0 33) (= 30 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:43:11,218 INFO L272 TraceCheckUtils]: 238: Hoare triple {39552#(and (= main_~y~0 33) (= 30 (+ 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)); {38806#true} is VALID [2022-04-08 04:43:11,218 INFO L290 TraceCheckUtils]: 239: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,218 INFO L290 TraceCheckUtils]: 240: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,218 INFO L290 TraceCheckUtils]: 241: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,219 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {38806#true} {39552#(and (= main_~y~0 33) (= 30 (+ main_~c~0 (- 3))))} #50#return; {39552#(and (= main_~y~0 33) (= 30 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:43:11,219 INFO L290 TraceCheckUtils]: 243: Hoare triple {39552#(and (= main_~y~0 33) (= 30 (+ 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; {39574#(and (= 33 (+ (- 1) main_~y~0)) (= 30 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:43:11,220 INFO L290 TraceCheckUtils]: 244: Hoare triple {39574#(and (= 33 (+ (- 1) main_~y~0)) (= 30 (+ main_~c~0 (- 4))))} assume !false; {39574#(and (= 33 (+ (- 1) main_~y~0)) (= 30 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:43:11,220 INFO L272 TraceCheckUtils]: 245: Hoare triple {39574#(and (= 33 (+ (- 1) main_~y~0)) (= 30 (+ 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)); {38806#true} is VALID [2022-04-08 04:43:11,220 INFO L290 TraceCheckUtils]: 246: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,220 INFO L290 TraceCheckUtils]: 247: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,220 INFO L290 TraceCheckUtils]: 248: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,221 INFO L284 TraceCheckUtils]: 249: Hoare quadruple {38806#true} {39574#(and (= 33 (+ (- 1) main_~y~0)) (= 30 (+ main_~c~0 (- 4))))} #50#return; {39574#(and (= 33 (+ (- 1) main_~y~0)) (= 30 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 04:43:11,221 INFO L290 TraceCheckUtils]: 250: Hoare triple {39574#(and (= 33 (+ (- 1) main_~y~0)) (= 30 (+ 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; {39596#(and (= 30 (+ main_~c~0 (- 5))) (= 35 main_~y~0))} is VALID [2022-04-08 04:43:11,221 INFO L290 TraceCheckUtils]: 251: Hoare triple {39596#(and (= 30 (+ main_~c~0 (- 5))) (= 35 main_~y~0))} assume !false; {39596#(and (= 30 (+ main_~c~0 (- 5))) (= 35 main_~y~0))} is VALID [2022-04-08 04:43:11,221 INFO L272 TraceCheckUtils]: 252: Hoare triple {39596#(and (= 30 (+ main_~c~0 (- 5))) (= 35 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)); {38806#true} is VALID [2022-04-08 04:43:11,222 INFO L290 TraceCheckUtils]: 253: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,222 INFO L290 TraceCheckUtils]: 254: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,222 INFO L290 TraceCheckUtils]: 255: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,222 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {38806#true} {39596#(and (= 30 (+ main_~c~0 (- 5))) (= 35 main_~y~0))} #50#return; {39596#(and (= 30 (+ main_~c~0 (- 5))) (= 35 main_~y~0))} is VALID [2022-04-08 04:43:11,223 INFO L290 TraceCheckUtils]: 257: Hoare triple {39596#(and (= 30 (+ main_~c~0 (- 5))) (= 35 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; {39618#(and (= 30 (+ main_~c~0 (- 6))) (= 35 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,223 INFO L290 TraceCheckUtils]: 258: Hoare triple {39618#(and (= 30 (+ main_~c~0 (- 6))) (= 35 (+ (- 1) main_~y~0)))} assume !false; {39618#(and (= 30 (+ main_~c~0 (- 6))) (= 35 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,223 INFO L272 TraceCheckUtils]: 259: Hoare triple {39618#(and (= 30 (+ main_~c~0 (- 6))) (= 35 (+ (- 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)); {38806#true} is VALID [2022-04-08 04:43:11,223 INFO L290 TraceCheckUtils]: 260: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,223 INFO L290 TraceCheckUtils]: 261: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,223 INFO L290 TraceCheckUtils]: 262: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,224 INFO L284 TraceCheckUtils]: 263: Hoare quadruple {38806#true} {39618#(and (= 30 (+ main_~c~0 (- 6))) (= 35 (+ (- 1) main_~y~0)))} #50#return; {39618#(and (= 30 (+ main_~c~0 (- 6))) (= 35 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:43:11,224 INFO L290 TraceCheckUtils]: 264: Hoare triple {39618#(and (= 30 (+ main_~c~0 (- 6))) (= 35 (+ (- 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; {39640#(and (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0) (<= main_~c~0 37))} is VALID [2022-04-08 04:43:11,225 INFO L290 TraceCheckUtils]: 265: Hoare triple {39640#(and (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0) (<= main_~c~0 37))} assume !false; {39640#(and (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0) (<= main_~c~0 37))} is VALID [2022-04-08 04:43:11,225 INFO L272 TraceCheckUtils]: 266: Hoare triple {39640#(and (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0) (<= main_~c~0 37))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38806#true} is VALID [2022-04-08 04:43:11,225 INFO L290 TraceCheckUtils]: 267: Hoare triple {38806#true} ~cond := #in~cond; {38806#true} is VALID [2022-04-08 04:43:11,225 INFO L290 TraceCheckUtils]: 268: Hoare triple {38806#true} assume !(0 == ~cond); {38806#true} is VALID [2022-04-08 04:43:11,225 INFO L290 TraceCheckUtils]: 269: Hoare triple {38806#true} assume true; {38806#true} is VALID [2022-04-08 04:43:11,225 INFO L284 TraceCheckUtils]: 270: Hoare quadruple {38806#true} {39640#(and (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0) (<= main_~c~0 37))} #50#return; {39640#(and (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0) (<= main_~c~0 37))} is VALID [2022-04-08 04:43:11,226 INFO L290 TraceCheckUtils]: 271: Hoare triple {39640#(and (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0) (<= main_~c~0 37))} assume !(~c~0 < ~k~0); {39662#(and (<= main_~k~0 37) (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0))} is VALID [2022-04-08 04:43:11,227 INFO L272 TraceCheckUtils]: 272: Hoare triple {39662#(and (<= main_~k~0 37) (= (+ (- 2) main_~y~0) 35) (< 36 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {39666#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:43:11,227 INFO L290 TraceCheckUtils]: 273: Hoare triple {39666#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {39670#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:43:11,227 INFO L290 TraceCheckUtils]: 274: Hoare triple {39670#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {38807#false} is VALID [2022-04-08 04:43:11,228 INFO L290 TraceCheckUtils]: 275: Hoare triple {38807#false} assume !false; {38807#false} is VALID [2022-04-08 04:43:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4997 backedges. 76 proven. 2109 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2022-04-08 04:43:11,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:43:11,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:43:11,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977543550] [2022-04-08 04:43:11,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:43:11,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764009271] [2022-04-08 04:43:11,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764009271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:43:11,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:43:11,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2022-04-08 04:43:11,742 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:43:11,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [801262730] [2022-04-08 04:43:11,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [801262730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:43:11,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:43:11,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-08 04:43:11,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231630408] [2022-04-08 04:43:11,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:43:11,743 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 40 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Word has length 276 [2022-04-08 04:43:11,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:43:11,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 40 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 04:43:12,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:43:12,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-08 04:43:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:43:12,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-08 04:43:12,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 04:43:12,859 INFO L87 Difference]: Start difference. First operand 133 states and 169 transitions. Second operand has 43 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 40 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 04:44:12,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:44:12,634 INFO L93 Difference]: Finished difference Result 141 states and 178 transitions. [2022-04-08 04:44:12,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-08 04:44:12,634 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 40 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Word has length 276 [2022-04-08 04:44:12,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:44:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 40 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 04:44:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 174 transitions. [2022-04-08 04:44:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 40 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 04:44:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 174 transitions. [2022-04-08 04:44:12,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 174 transitions. [2022-04-08 04:44:13,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:44:13,852 INFO L225 Difference]: With dead ends: 141 [2022-04-08 04:44:13,852 INFO L226 Difference]: Without dead ends: 136 [2022-04-08 04:44:13,852 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=142, Invalid=2114, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 04:44:13,853 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 2 mSDsluCounter, 2045 mSDsCounter, 0 mSdLazyCounter, 4726 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 4726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.8s IncrementalHoareTripleChecker+Time [2022-04-08 04:44:13,853 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2172 Invalid, 4726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4726 Invalid, 0 Unknown, 0 Unchecked, 31.8s Time] [2022-04-08 04:44:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-08 04:44:14,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-04-08 04:44:14,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:44:14,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 42 states have call successors, (42), 5 states have call predecessors, (42), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 04:44:14,060 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 42 states have call successors, (42), 5 states have call predecessors, (42), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 04:44:14,060 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 42 states have call successors, (42), 5 states have call predecessors, (42), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 04:44:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:44:14,063 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2022-04-08 04:44:14,063 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2022-04-08 04:44:14,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:44:14,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:44:14,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 42 states have call successors, (42), 5 states have call predecessors, (42), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 136 states. [2022-04-08 04:44:14,064 INFO L87 Difference]: Start difference. First operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 42 states have call successors, (42), 5 states have call predecessors, (42), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 136 states. [2022-04-08 04:44:14,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:44:14,068 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2022-04-08 04:44:14,068 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2022-04-08 04:44:14,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:44:14,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:44:14,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:44:14,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:44:14,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 42 states have call successors, (42), 5 states have call predecessors, (42), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 04:44:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 173 transitions. [2022-04-08 04:44:14,072 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 173 transitions. Word has length 276 [2022-04-08 04:44:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:44:14,072 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 173 transitions. [2022-04-08 04:44:14,072 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 40 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 04:44:14,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 173 transitions. [2022-04-08 04:44:15,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:44:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2022-04-08 04:44:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-04-08 04:44:15,398 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:44:15,398 INFO L499 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:44:15,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-08 04:44:15,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-08 04:44:15,603 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:44:15,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:44:15,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1859525074, now seen corresponding path program 75 times [2022-04-08 04:44:15,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:44:15,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1128018561] [2022-04-08 04:44:15,707 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:44:15,708 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:44:15,708 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:44:15,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1859525074, now seen corresponding path program 76 times [2022-04-08 04:44:15,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:44:15,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179786630] [2022-04-08 04:44:15,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:44:15,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:44:15,724 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:44:15,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [626519648] [2022-04-08 04:44:15,724 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:44:15,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:44:15,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:44:15,726 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:44:15,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-08 04:44:20,864 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:44:20,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:44:20,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 160 conjunts are in the unsatisfiable core [2022-04-08 04:44:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:44:20,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:44:22,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {40548#true} call ULTIMATE.init(); {40548#true} is VALID [2022-04-08 04:44:22,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {40548#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); {40548#true} is VALID [2022-04-08 04:44:22,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40548#true} {40548#true} #56#return; {40548#true} is VALID [2022-04-08 04:44:22,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {40548#true} call #t~ret5 := main(); {40548#true} is VALID [2022-04-08 04:44:22,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {40548#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; {40568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:44:22,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {40568#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {40568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:44:22,907 INFO L272 TraceCheckUtils]: 7: Hoare triple {40568#(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)); {40548#true} is VALID [2022-04-08 04:44:22,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,908 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {40548#true} {40568#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {40568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:44:22,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {40568#(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; {40590#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:44:22,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {40590#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {40590#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:44:22,908 INFO L272 TraceCheckUtils]: 14: Hoare triple {40590#(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)); {40548#true} is VALID [2022-04-08 04:44:22,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,909 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {40548#true} {40590#(and (= main_~y~0 1) (= main_~c~0 1))} #50#return; {40590#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:44:22,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {40590#(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; {40612#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 04:44:22,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {40612#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {40612#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 04:44:22,910 INFO L272 TraceCheckUtils]: 21: Hoare triple {40612#(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)); {40548#true} is VALID [2022-04-08 04:44:22,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,910 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {40548#true} {40612#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #50#return; {40612#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 04:44:22,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {40612#(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; {40634#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:44:22,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {40634#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {40634#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:44:22,911 INFO L272 TraceCheckUtils]: 28: Hoare triple {40634#(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)); {40548#true} is VALID [2022-04-08 04:44:22,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,912 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {40548#true} {40634#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {40634#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:44:22,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {40634#(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; {40656#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:44:22,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {40656#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {40656#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:44:22,912 INFO L272 TraceCheckUtils]: 35: Hoare triple {40656#(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)); {40548#true} is VALID [2022-04-08 04:44:22,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,913 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40548#true} {40656#(and (= main_~y~0 4) (= main_~c~0 4))} #50#return; {40656#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:44:22,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {40656#(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; {40678#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 04:44:22,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {40678#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {40678#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 04:44:22,914 INFO L272 TraceCheckUtils]: 42: Hoare triple {40678#(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)); {40548#true} is VALID [2022-04-08 04:44:22,914 INFO L290 TraceCheckUtils]: 43: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,914 INFO L290 TraceCheckUtils]: 44: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,914 INFO L290 TraceCheckUtils]: 45: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,914 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {40548#true} {40678#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #50#return; {40678#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 04:44:22,915 INFO L290 TraceCheckUtils]: 47: Hoare triple {40678#(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; {40700#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:44:22,915 INFO L290 TraceCheckUtils]: 48: Hoare triple {40700#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {40700#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:44:22,915 INFO L272 TraceCheckUtils]: 49: Hoare triple {40700#(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)); {40548#true} is VALID [2022-04-08 04:44:22,915 INFO L290 TraceCheckUtils]: 50: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,915 INFO L290 TraceCheckUtils]: 51: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,915 INFO L290 TraceCheckUtils]: 52: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,915 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {40548#true} {40700#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #50#return; {40700#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:44:22,916 INFO L290 TraceCheckUtils]: 54: Hoare triple {40700#(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; {40722#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:44:22,916 INFO L290 TraceCheckUtils]: 55: Hoare triple {40722#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {40722#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:44:22,916 INFO L272 TraceCheckUtils]: 56: Hoare triple {40722#(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)); {40548#true} is VALID [2022-04-08 04:44:22,916 INFO L290 TraceCheckUtils]: 57: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,916 INFO L290 TraceCheckUtils]: 58: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,916 INFO L290 TraceCheckUtils]: 59: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,917 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {40548#true} {40722#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #50#return; {40722#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:44:22,917 INFO L290 TraceCheckUtils]: 61: Hoare triple {40722#(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; {40744#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 04:44:22,917 INFO L290 TraceCheckUtils]: 62: Hoare triple {40744#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {40744#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 04:44:22,918 INFO L272 TraceCheckUtils]: 63: Hoare triple {40744#(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)); {40548#true} is VALID [2022-04-08 04:44:22,918 INFO L290 TraceCheckUtils]: 64: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,918 INFO L290 TraceCheckUtils]: 65: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,918 INFO L290 TraceCheckUtils]: 66: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,918 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {40548#true} {40744#(and (= main_~y~0 8) (= main_~c~0 8))} #50#return; {40744#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 04:44:22,918 INFO L290 TraceCheckUtils]: 68: Hoare triple {40744#(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; {40766#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:44:22,919 INFO L290 TraceCheckUtils]: 69: Hoare triple {40766#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {40766#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:44:22,919 INFO L272 TraceCheckUtils]: 70: Hoare triple {40766#(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)); {40548#true} is VALID [2022-04-08 04:44:22,919 INFO L290 TraceCheckUtils]: 71: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,919 INFO L290 TraceCheckUtils]: 72: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,919 INFO L290 TraceCheckUtils]: 73: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,919 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {40548#true} {40766#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #50#return; {40766#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:44:22,920 INFO L290 TraceCheckUtils]: 75: Hoare triple {40766#(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; {40788#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:44:22,920 INFO L290 TraceCheckUtils]: 76: Hoare triple {40788#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {40788#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:44:22,920 INFO L272 TraceCheckUtils]: 77: Hoare triple {40788#(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)); {40548#true} is VALID [2022-04-08 04:44:22,920 INFO L290 TraceCheckUtils]: 78: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,920 INFO L290 TraceCheckUtils]: 79: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,920 INFO L290 TraceCheckUtils]: 80: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,921 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {40548#true} {40788#(and (= main_~y~0 10) (= main_~c~0 10))} #50#return; {40788#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 04:44:22,921 INFO L290 TraceCheckUtils]: 82: Hoare triple {40788#(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; {40810#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:44:22,921 INFO L290 TraceCheckUtils]: 83: Hoare triple {40810#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {40810#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:44:22,921 INFO L272 TraceCheckUtils]: 84: Hoare triple {40810#(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)); {40548#true} is VALID [2022-04-08 04:44:22,921 INFO L290 TraceCheckUtils]: 85: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,922 INFO L290 TraceCheckUtils]: 86: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,922 INFO L290 TraceCheckUtils]: 87: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,922 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {40548#true} {40810#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {40810#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:44:22,922 INFO L290 TraceCheckUtils]: 89: Hoare triple {40810#(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; {40832#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:44:22,923 INFO L290 TraceCheckUtils]: 90: Hoare triple {40832#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {40832#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:44:22,923 INFO L272 TraceCheckUtils]: 91: Hoare triple {40832#(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)); {40548#true} is VALID [2022-04-08 04:44:22,923 INFO L290 TraceCheckUtils]: 92: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,923 INFO L290 TraceCheckUtils]: 93: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,923 INFO L290 TraceCheckUtils]: 94: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,923 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40548#true} {40832#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #50#return; {40832#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 04:44:22,924 INFO L290 TraceCheckUtils]: 96: Hoare triple {40832#(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; {40854#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 04:44:22,924 INFO L290 TraceCheckUtils]: 97: Hoare triple {40854#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !false; {40854#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 04:44:22,924 INFO L272 TraceCheckUtils]: 98: Hoare triple {40854#(and (= (+ (- 2) main_~y~0) 11) (= 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)); {40548#true} is VALID [2022-04-08 04:44:22,924 INFO L290 TraceCheckUtils]: 99: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,924 INFO L290 TraceCheckUtils]: 100: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,924 INFO L290 TraceCheckUtils]: 101: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,925 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {40548#true} {40854#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #50#return; {40854#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 04:44:22,925 INFO L290 TraceCheckUtils]: 103: Hoare triple {40854#(and (= (+ (- 2) main_~y~0) 11) (= 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; {40876#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 04:44:22,925 INFO L290 TraceCheckUtils]: 104: Hoare triple {40876#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {40876#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 04:44:22,925 INFO L272 TraceCheckUtils]: 105: Hoare triple {40876#(and (= main_~y~0 14) (= (+ (- 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)); {40548#true} is VALID [2022-04-08 04:44:22,925 INFO L290 TraceCheckUtils]: 106: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,925 INFO L290 TraceCheckUtils]: 107: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,926 INFO L290 TraceCheckUtils]: 108: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,926 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {40548#true} {40876#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #50#return; {40876#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 04:44:22,926 INFO L290 TraceCheckUtils]: 110: Hoare triple {40876#(and (= main_~y~0 14) (= (+ (- 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; {40898#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:44:22,927 INFO L290 TraceCheckUtils]: 111: Hoare triple {40898#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {40898#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:44:22,927 INFO L272 TraceCheckUtils]: 112: Hoare triple {40898#(and (= main_~c~0 15) (= main_~y~0 15))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 04:44:22,927 INFO L290 TraceCheckUtils]: 113: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,927 INFO L290 TraceCheckUtils]: 114: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,927 INFO L290 TraceCheckUtils]: 115: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,927 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {40548#true} {40898#(and (= main_~c~0 15) (= main_~y~0 15))} #50#return; {40898#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 04:44:22,928 INFO L290 TraceCheckUtils]: 117: Hoare triple {40898#(and (= main_~c~0 15) (= main_~y~0 15))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40920#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 04:44:22,928 INFO L290 TraceCheckUtils]: 118: Hoare triple {40920#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} assume !false; {40920#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 04:44:22,928 INFO L272 TraceCheckUtils]: 119: Hoare triple {40920#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 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)); {40548#true} is VALID [2022-04-08 04:44:22,928 INFO L290 TraceCheckUtils]: 120: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,928 INFO L290 TraceCheckUtils]: 121: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,928 INFO L290 TraceCheckUtils]: 122: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,929 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {40548#true} {40920#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} #50#return; {40920#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 04:44:22,929 INFO L290 TraceCheckUtils]: 124: Hoare triple {40920#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 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; {40942#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:44:22,929 INFO L290 TraceCheckUtils]: 125: Hoare triple {40942#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} assume !false; {40942#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:44:22,929 INFO L272 TraceCheckUtils]: 126: Hoare triple {40942#(and (= (+ (- 2) main_~y~0) 15) (= 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)); {40548#true} is VALID [2022-04-08 04:44:22,929 INFO L290 TraceCheckUtils]: 127: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,929 INFO L290 TraceCheckUtils]: 128: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,929 INFO L290 TraceCheckUtils]: 129: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,930 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {40548#true} {40942#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} #50#return; {40942#(and (= (+ (- 2) main_~y~0) 15) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:44:22,930 INFO L290 TraceCheckUtils]: 131: Hoare triple {40942#(and (= (+ (- 2) main_~y~0) 15) (= 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; {40964#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} is VALID [2022-04-08 04:44:22,931 INFO L290 TraceCheckUtils]: 132: Hoare triple {40964#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} assume !false; {40964#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} is VALID [2022-04-08 04:44:22,931 INFO L272 TraceCheckUtils]: 133: Hoare triple {40964#(and (= (+ main_~c~0 (- 3)) 15) (= 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)); {40548#true} is VALID [2022-04-08 04:44:22,931 INFO L290 TraceCheckUtils]: 134: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,931 INFO L290 TraceCheckUtils]: 135: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,931 INFO L290 TraceCheckUtils]: 136: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,931 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {40548#true} {40964#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} #50#return; {40964#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} is VALID [2022-04-08 04:44:22,932 INFO L290 TraceCheckUtils]: 138: Hoare triple {40964#(and (= (+ main_~c~0 (- 3)) 15) (= 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; {40986#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 04:44:22,932 INFO L290 TraceCheckUtils]: 139: Hoare triple {40986#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !false; {40986#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 04:44:22,932 INFO L272 TraceCheckUtils]: 140: Hoare triple {40986#(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)); {40548#true} is VALID [2022-04-08 04:44:22,932 INFO L290 TraceCheckUtils]: 141: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,932 INFO L290 TraceCheckUtils]: 142: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,932 INFO L290 TraceCheckUtils]: 143: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,932 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {40548#true} {40986#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} #50#return; {40986#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 04:44:22,933 INFO L290 TraceCheckUtils]: 145: Hoare triple {40986#(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; {41008#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 04:44:22,933 INFO L290 TraceCheckUtils]: 146: Hoare triple {41008#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {41008#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 04:44:22,933 INFO L272 TraceCheckUtils]: 147: Hoare triple {41008#(and (= main_~c~0 20) (= main_~y~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 04:44:22,933 INFO L290 TraceCheckUtils]: 148: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,933 INFO L290 TraceCheckUtils]: 149: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,933 INFO L290 TraceCheckUtils]: 150: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,934 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {40548#true} {41008#(and (= main_~c~0 20) (= main_~y~0 20))} #50#return; {41008#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 04:44:22,934 INFO L290 TraceCheckUtils]: 152: Hoare triple {41008#(and (= main_~c~0 20) (= main_~y~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41030#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-08 04:44:22,934 INFO L290 TraceCheckUtils]: 153: Hoare triple {41030#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} assume !false; {41030#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-08 04:44:22,934 INFO L272 TraceCheckUtils]: 154: Hoare triple {41030#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 04:44:22,935 INFO L290 TraceCheckUtils]: 155: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,935 INFO L290 TraceCheckUtils]: 156: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,935 INFO L290 TraceCheckUtils]: 157: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,935 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {40548#true} {41030#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} #50#return; {41030#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-08 04:44:22,935 INFO L290 TraceCheckUtils]: 159: Hoare triple {41030#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41052#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-08 04:44:22,936 INFO L290 TraceCheckUtils]: 160: Hoare triple {41052#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} assume !false; {41052#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-08 04:44:22,936 INFO L272 TraceCheckUtils]: 161: Hoare triple {41052#(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)); {40548#true} is VALID [2022-04-08 04:44:22,936 INFO L290 TraceCheckUtils]: 162: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,936 INFO L290 TraceCheckUtils]: 163: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,936 INFO L290 TraceCheckUtils]: 164: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,936 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {40548#true} {41052#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} #50#return; {41052#(and (= 21 (+ (- 1) main_~y~0)) (= main_~c~0 22))} is VALID [2022-04-08 04:44:22,937 INFO L290 TraceCheckUtils]: 166: Hoare triple {41052#(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; {41074#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 04:44:22,937 INFO L290 TraceCheckUtils]: 167: Hoare triple {41074#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} assume !false; {41074#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 04:44:22,937 INFO L272 TraceCheckUtils]: 168: Hoare triple {41074#(and (= (+ (- 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)); {40548#true} is VALID [2022-04-08 04:44:22,937 INFO L290 TraceCheckUtils]: 169: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,937 INFO L290 TraceCheckUtils]: 170: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,937 INFO L290 TraceCheckUtils]: 171: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,938 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {40548#true} {41074#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} #50#return; {41074#(and (= (+ (- 1) main_~c~0) 22) (= 23 main_~y~0))} is VALID [2022-04-08 04:44:22,938 INFO L290 TraceCheckUtils]: 173: Hoare triple {41074#(and (= (+ (- 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; {41096#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} is VALID [2022-04-08 04:44:22,938 INFO L290 TraceCheckUtils]: 174: Hoare triple {41096#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} assume !false; {41096#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} is VALID [2022-04-08 04:44:22,938 INFO L272 TraceCheckUtils]: 175: Hoare triple {41096#(and (= 22 (+ (- 2) main_~c~0)) (= 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)); {40548#true} is VALID [2022-04-08 04:44:22,939 INFO L290 TraceCheckUtils]: 176: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,939 INFO L290 TraceCheckUtils]: 177: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,939 INFO L290 TraceCheckUtils]: 178: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,939 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {40548#true} {41096#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} #50#return; {41096#(and (= 22 (+ (- 2) main_~c~0)) (= main_~y~0 24))} is VALID [2022-04-08 04:44:22,939 INFO L290 TraceCheckUtils]: 180: Hoare triple {41096#(and (= 22 (+ (- 2) main_~c~0)) (= 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; {41118#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 04:44:22,940 INFO L290 TraceCheckUtils]: 181: Hoare triple {41118#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !false; {41118#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 04:44:22,940 INFO L272 TraceCheckUtils]: 182: Hoare triple {41118#(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)); {40548#true} is VALID [2022-04-08 04:44:22,940 INFO L290 TraceCheckUtils]: 183: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,940 INFO L290 TraceCheckUtils]: 184: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,940 INFO L290 TraceCheckUtils]: 185: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,940 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {40548#true} {41118#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} #50#return; {41118#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 04:44:22,941 INFO L290 TraceCheckUtils]: 187: Hoare triple {41118#(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; {41140#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 04:44:22,941 INFO L290 TraceCheckUtils]: 188: Hoare triple {41140#(and (= main_~c~0 26) (= main_~y~0 26))} assume !false; {41140#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 04:44:22,941 INFO L272 TraceCheckUtils]: 189: Hoare triple {41140#(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)); {40548#true} is VALID [2022-04-08 04:44:22,941 INFO L290 TraceCheckUtils]: 190: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,941 INFO L290 TraceCheckUtils]: 191: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,941 INFO L290 TraceCheckUtils]: 192: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,942 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {40548#true} {41140#(and (= main_~c~0 26) (= main_~y~0 26))} #50#return; {41140#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 04:44:22,942 INFO L290 TraceCheckUtils]: 194: Hoare triple {41140#(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; {41162#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-08 04:44:22,942 INFO L290 TraceCheckUtils]: 195: Hoare triple {41162#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 1) main_~y~0) 26))} assume !false; {41162#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-08 04:44:22,942 INFO L272 TraceCheckUtils]: 196: Hoare triple {41162#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 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)); {40548#true} is VALID [2022-04-08 04:44:22,943 INFO L290 TraceCheckUtils]: 197: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,943 INFO L290 TraceCheckUtils]: 198: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,943 INFO L290 TraceCheckUtils]: 199: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,943 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {40548#true} {41162#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 1) main_~y~0) 26))} #50#return; {41162#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-08 04:44:22,943 INFO L290 TraceCheckUtils]: 201: Hoare triple {41162#(and (= (+ (- 1) main_~c~0) 26) (= (+ (- 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; {41184#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} is VALID [2022-04-08 04:44:22,944 INFO L290 TraceCheckUtils]: 202: Hoare triple {41184#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} assume !false; {41184#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} is VALID [2022-04-08 04:44:22,944 INFO L272 TraceCheckUtils]: 203: Hoare triple {41184#(and (= 26 (+ (- 2) main_~c~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)); {40548#true} is VALID [2022-04-08 04:44:22,944 INFO L290 TraceCheckUtils]: 204: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,944 INFO L290 TraceCheckUtils]: 205: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,944 INFO L290 TraceCheckUtils]: 206: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,944 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {40548#true} {41184#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} #50#return; {41184#(and (= 26 (+ (- 2) main_~c~0)) (= main_~y~0 28))} is VALID [2022-04-08 04:44:22,945 INFO L290 TraceCheckUtils]: 208: Hoare triple {41184#(and (= 26 (+ (- 2) main_~c~0)) (= 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; {41206#(and (= 28 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 26))} is VALID [2022-04-08 04:44:22,945 INFO L290 TraceCheckUtils]: 209: Hoare triple {41206#(and (= 28 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 26))} assume !false; {41206#(and (= 28 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 26))} is VALID [2022-04-08 04:44:22,945 INFO L272 TraceCheckUtils]: 210: Hoare triple {41206#(and (= 28 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 04:44:22,945 INFO L290 TraceCheckUtils]: 211: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,945 INFO L290 TraceCheckUtils]: 212: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,945 INFO L290 TraceCheckUtils]: 213: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,946 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {40548#true} {41206#(and (= 28 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 26))} #50#return; {41206#(and (= 28 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 26))} is VALID [2022-04-08 04:44:22,946 INFO L290 TraceCheckUtils]: 215: Hoare triple {41206#(and (= 28 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41228#(and (= 26 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 28))} is VALID [2022-04-08 04:44:22,946 INFO L290 TraceCheckUtils]: 216: Hoare triple {41228#(and (= 26 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 28))} assume !false; {41228#(and (= 26 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 28))} is VALID [2022-04-08 04:44:22,946 INFO L272 TraceCheckUtils]: 217: Hoare triple {41228#(and (= 26 (+ main_~c~0 (- 4))) (= (+ (- 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)); {40548#true} is VALID [2022-04-08 04:44:22,947 INFO L290 TraceCheckUtils]: 218: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,947 INFO L290 TraceCheckUtils]: 219: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,947 INFO L290 TraceCheckUtils]: 220: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,947 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {40548#true} {41228#(and (= 26 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 28))} #50#return; {41228#(and (= 26 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 28))} is VALID [2022-04-08 04:44:22,947 INFO L290 TraceCheckUtils]: 222: Hoare triple {41228#(and (= 26 (+ main_~c~0 (- 4))) (= (+ (- 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; {41250#(and (= main_~c~0 31) (= (+ main_~y~0 (- 3)) 28))} is VALID [2022-04-08 04:44:22,948 INFO L290 TraceCheckUtils]: 223: Hoare triple {41250#(and (= main_~c~0 31) (= (+ main_~y~0 (- 3)) 28))} assume !false; {41250#(and (= main_~c~0 31) (= (+ main_~y~0 (- 3)) 28))} is VALID [2022-04-08 04:44:22,948 INFO L272 TraceCheckUtils]: 224: Hoare triple {41250#(and (= main_~c~0 31) (= (+ main_~y~0 (- 3)) 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)); {40548#true} is VALID [2022-04-08 04:44:22,948 INFO L290 TraceCheckUtils]: 225: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,948 INFO L290 TraceCheckUtils]: 226: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,948 INFO L290 TraceCheckUtils]: 227: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,948 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {40548#true} {41250#(and (= main_~c~0 31) (= (+ main_~y~0 (- 3)) 28))} #50#return; {41250#(and (= main_~c~0 31) (= (+ main_~y~0 (- 3)) 28))} is VALID [2022-04-08 04:44:22,949 INFO L290 TraceCheckUtils]: 229: Hoare triple {41250#(and (= main_~c~0 31) (= (+ main_~y~0 (- 3)) 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; {41272#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 04:44:22,949 INFO L290 TraceCheckUtils]: 230: Hoare triple {41272#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !false; {41272#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 04:44:22,949 INFO L272 TraceCheckUtils]: 231: Hoare triple {41272#(and (= 32 main_~y~0) (= 32 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 04:44:22,949 INFO L290 TraceCheckUtils]: 232: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,949 INFO L290 TraceCheckUtils]: 233: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,949 INFO L290 TraceCheckUtils]: 234: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,950 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {40548#true} {41272#(and (= 32 main_~y~0) (= 32 main_~c~0))} #50#return; {41272#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 04:44:22,950 INFO L290 TraceCheckUtils]: 236: Hoare triple {41272#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41294#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32))} is VALID [2022-04-08 04:44:22,950 INFO L290 TraceCheckUtils]: 237: Hoare triple {41294#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32))} assume !false; {41294#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32))} is VALID [2022-04-08 04:44:22,950 INFO L272 TraceCheckUtils]: 238: Hoare triple {41294#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) 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)); {40548#true} is VALID [2022-04-08 04:44:22,951 INFO L290 TraceCheckUtils]: 239: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,951 INFO L290 TraceCheckUtils]: 240: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,951 INFO L290 TraceCheckUtils]: 241: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,951 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {40548#true} {41294#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32))} #50#return; {41294#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32))} is VALID [2022-04-08 04:44:22,951 INFO L290 TraceCheckUtils]: 243: Hoare triple {41294#(and (= 32 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 32))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41316#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} is VALID [2022-04-08 04:44:22,952 INFO L290 TraceCheckUtils]: 244: Hoare triple {41316#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} assume !false; {41316#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} is VALID [2022-04-08 04:44:22,952 INFO L272 TraceCheckUtils]: 245: Hoare triple {41316#(and (= main_~c~0 34) (= (+ (- 2) main_~y~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)); {40548#true} is VALID [2022-04-08 04:44:22,952 INFO L290 TraceCheckUtils]: 246: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,952 INFO L290 TraceCheckUtils]: 247: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,952 INFO L290 TraceCheckUtils]: 248: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,952 INFO L284 TraceCheckUtils]: 249: Hoare quadruple {40548#true} {41316#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} #50#return; {41316#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} is VALID [2022-04-08 04:44:22,953 INFO L290 TraceCheckUtils]: 250: Hoare triple {41316#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41338#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0))} is VALID [2022-04-08 04:44:22,953 INFO L290 TraceCheckUtils]: 251: Hoare triple {41338#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0))} assume !false; {41338#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0))} is VALID [2022-04-08 04:44:22,953 INFO L272 TraceCheckUtils]: 252: Hoare triple {41338#(and (= (+ (- 1) main_~c~0) 34) (= 35 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)); {40548#true} is VALID [2022-04-08 04:44:22,953 INFO L290 TraceCheckUtils]: 253: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,953 INFO L290 TraceCheckUtils]: 254: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,953 INFO L290 TraceCheckUtils]: 255: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,954 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {40548#true} {41338#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0))} #50#return; {41338#(and (= (+ (- 1) main_~c~0) 34) (= 35 main_~y~0))} is VALID [2022-04-08 04:44:22,954 INFO L290 TraceCheckUtils]: 257: Hoare triple {41338#(and (= (+ (- 1) main_~c~0) 34) (= 35 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; {41360#(and (= 34 (+ (- 2) main_~c~0)) (= 35 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:44:22,954 INFO L290 TraceCheckUtils]: 258: Hoare triple {41360#(and (= 34 (+ (- 2) main_~c~0)) (= 35 (+ (- 1) main_~y~0)))} assume !false; {41360#(and (= 34 (+ (- 2) main_~c~0)) (= 35 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:44:22,954 INFO L272 TraceCheckUtils]: 259: Hoare triple {41360#(and (= 34 (+ (- 2) main_~c~0)) (= 35 (+ (- 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)); {40548#true} is VALID [2022-04-08 04:44:22,954 INFO L290 TraceCheckUtils]: 260: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,955 INFO L290 TraceCheckUtils]: 261: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,955 INFO L290 TraceCheckUtils]: 262: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,955 INFO L284 TraceCheckUtils]: 263: Hoare quadruple {40548#true} {41360#(and (= 34 (+ (- 2) main_~c~0)) (= 35 (+ (- 1) main_~y~0)))} #50#return; {41360#(and (= 34 (+ (- 2) main_~c~0)) (= 35 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:44:22,955 INFO L290 TraceCheckUtils]: 264: Hoare triple {41360#(and (= 34 (+ (- 2) main_~c~0)) (= 35 (+ (- 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; {41382#(and (= main_~c~0 37) (= main_~y~0 37))} is VALID [2022-04-08 04:44:22,956 INFO L290 TraceCheckUtils]: 265: Hoare triple {41382#(and (= main_~c~0 37) (= main_~y~0 37))} assume !false; {41382#(and (= main_~c~0 37) (= main_~y~0 37))} is VALID [2022-04-08 04:44:22,956 INFO L272 TraceCheckUtils]: 266: Hoare triple {41382#(and (= main_~c~0 37) (= main_~y~0 37))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 04:44:22,956 INFO L290 TraceCheckUtils]: 267: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,956 INFO L290 TraceCheckUtils]: 268: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,956 INFO L290 TraceCheckUtils]: 269: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,956 INFO L284 TraceCheckUtils]: 270: Hoare quadruple {40548#true} {41382#(and (= main_~c~0 37) (= main_~y~0 37))} #50#return; {41382#(and (= main_~c~0 37) (= main_~y~0 37))} is VALID [2022-04-08 04:44:22,957 INFO L290 TraceCheckUtils]: 271: Hoare triple {41382#(and (= main_~c~0 37) (= main_~y~0 37))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {41404#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~c~0 38))} is VALID [2022-04-08 04:44:22,957 INFO L290 TraceCheckUtils]: 272: Hoare triple {41404#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~c~0 38))} assume !false; {41404#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~c~0 38))} is VALID [2022-04-08 04:44:22,957 INFO L272 TraceCheckUtils]: 273: Hoare triple {41404#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~c~0 38))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40548#true} is VALID [2022-04-08 04:44:22,957 INFO L290 TraceCheckUtils]: 274: Hoare triple {40548#true} ~cond := #in~cond; {40548#true} is VALID [2022-04-08 04:44:22,957 INFO L290 TraceCheckUtils]: 275: Hoare triple {40548#true} assume !(0 == ~cond); {40548#true} is VALID [2022-04-08 04:44:22,957 INFO L290 TraceCheckUtils]: 276: Hoare triple {40548#true} assume true; {40548#true} is VALID [2022-04-08 04:44:22,958 INFO L284 TraceCheckUtils]: 277: Hoare quadruple {40548#true} {41404#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~c~0 38))} #50#return; {41404#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~c~0 38))} is VALID [2022-04-08 04:44:22,964 INFO L290 TraceCheckUtils]: 278: Hoare triple {41404#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~c~0 38))} assume !(~c~0 < ~k~0); {41426#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~k~0 38))} is VALID [2022-04-08 04:44:22,965 INFO L272 TraceCheckUtils]: 279: Hoare triple {41426#(and (= main_~y~0 38) (< 37 main_~k~0) (<= main_~k~0 38))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {41430#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:44:22,965 INFO L290 TraceCheckUtils]: 280: Hoare triple {41430#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {41434#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:44:22,965 INFO L290 TraceCheckUtils]: 281: Hoare triple {41434#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40549#false} is VALID [2022-04-08 04:44:22,966 INFO L290 TraceCheckUtils]: 282: Hoare triple {40549#false} assume !false; {40549#false} is VALID [2022-04-08 04:44:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5265 backedges. 78 proven. 2223 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2022-04-08 04:44:22,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:44:23,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:44:23,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179786630] [2022-04-08 04:44:23,509 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:44:23,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626519648] [2022-04-08 04:44:23,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626519648] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:44:23,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:44:23,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2022-04-08 04:44:23,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:44:23,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1128018561] [2022-04-08 04:44:23,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1128018561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:44:23,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:44:23,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-08 04:44:23,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902787756] [2022-04-08 04:44:23,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:44:23,511 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 41 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Word has length 283 [2022-04-08 04:44:23,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:44:23,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 41 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 04:44:24,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:44:24,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-08 04:44:24,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:44:24,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-08 04:44:24,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 04:44:24,666 INFO L87 Difference]: Start difference. First operand 136 states and 173 transitions. Second operand has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 41 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 04:45:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:27,852 INFO L93 Difference]: Finished difference Result 144 states and 182 transitions. [2022-04-08 04:45:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-08 04:45:27,852 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 41 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Word has length 283 [2022-04-08 04:45:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:45:27,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 41 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 04:45:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 178 transitions. [2022-04-08 04:45:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 41 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 04:45:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 178 transitions. [2022-04-08 04:45:27,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 178 transitions. [2022-04-08 04:45:29,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:45:29,287 INFO L225 Difference]: With dead ends: 144 [2022-04-08 04:45:29,287 INFO L226 Difference]: Without dead ends: 139 [2022-04-08 04:45:29,288 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=145, Invalid=2207, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 04:45:29,288 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 2 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 4967 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 4967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:45:29,288 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2267 Invalid, 4967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4967 Invalid, 0 Unknown, 0 Unchecked, 33.5s Time] [2022-04-08 04:45:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-08 04:45:29,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-04-08 04:45:29,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:45:29,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 43 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 04:45:29,452 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 43 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 04:45:29,452 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 43 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 04:45:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:29,455 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2022-04-08 04:45:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 177 transitions. [2022-04-08 04:45:29,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:45:29,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:45:29,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 43 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 139 states. [2022-04-08 04:45:29,455 INFO L87 Difference]: Start difference. First operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 43 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 139 states. [2022-04-08 04:45:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:45:29,458 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2022-04-08 04:45:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 177 transitions. [2022-04-08 04:45:29,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:45:29,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:45:29,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:45:29,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:45:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 43 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 04:45:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 177 transitions. [2022-04-08 04:45:29,461 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 177 transitions. Word has length 283 [2022-04-08 04:45:29,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:45:29,461 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 177 transitions. [2022-04-08 04:45:29,461 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 41 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 04:45:29,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 177 transitions. [2022-04-08 04:45:30,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:45:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 177 transitions. [2022-04-08 04:45:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2022-04-08 04:45:30,594 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:45:30,595 INFO L499 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:45:30,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-04-08 04:45:30,795 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-04-08 04:45:30,795 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:45:30,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:45:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash 925296901, now seen corresponding path program 77 times [2022-04-08 04:45:30,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:45:30,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [846574855] [2022-04-08 04:45:30,882 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:45:30,882 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:45:30,882 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:45:30,882 INFO L85 PathProgramCache]: Analyzing trace with hash 925296901, now seen corresponding path program 78 times [2022-04-08 04:45:30,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:45:30,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042892758] [2022-04-08 04:45:30,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:45:30,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:45:30,899 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:45:30,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1060805312] [2022-04-08 04:45:30,899 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:45:30,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:45:30,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:45:30,900 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:45:30,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-08 04:45:45,296 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2022-04-08 04:45:45,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:45:45,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 176 conjunts are in the unsatisfiable core [2022-04-08 04:45:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:45:45,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:45:47,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {42330#true} call ULTIMATE.init(); {42330#true} is VALID [2022-04-08 04:45:47,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {42330#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); {42330#true} is VALID [2022-04-08 04:45:47,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42330#true} {42330#true} #56#return; {42330#true} is VALID [2022-04-08 04:45:47,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {42330#true} call #t~ret5 := main(); {42330#true} is VALID [2022-04-08 04:45:47,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {42330#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; {42350#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:45:47,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {42350#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {42350#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:45:47,495 INFO L272 TraceCheckUtils]: 7: Hoare triple {42350#(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)); {42330#true} is VALID [2022-04-08 04:45:47,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,495 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {42330#true} {42350#(and (= main_~c~0 0) (= main_~y~0 0))} #50#return; {42350#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:45:47,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {42350#(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; {42372#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:45:47,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {42372#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {42372#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:45:47,496 INFO L272 TraceCheckUtils]: 14: Hoare triple {42372#(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)); {42330#true} is VALID [2022-04-08 04:45:47,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,497 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {42330#true} {42372#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #50#return; {42372#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:45:47,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {42372#(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; {42394#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 04:45:47,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {42394#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {42394#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 04:45:47,497 INFO L272 TraceCheckUtils]: 21: Hoare triple {42394#(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)); {42330#true} is VALID [2022-04-08 04:45:47,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,498 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {42330#true} {42394#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #50#return; {42394#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 04:45:47,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {42394#(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; {42416#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:45:47,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {42416#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {42416#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:45:47,499 INFO L272 TraceCheckUtils]: 28: Hoare triple {42416#(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)); {42330#true} is VALID [2022-04-08 04:45:47,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,499 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {42330#true} {42416#(and (= main_~y~0 3) (= main_~c~0 3))} #50#return; {42416#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 04:45:47,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {42416#(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; {42438#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 04:45:47,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {42438#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {42438#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 04:45:47,500 INFO L272 TraceCheckUtils]: 35: Hoare triple {42438#(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)); {42330#true} is VALID [2022-04-08 04:45:47,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,501 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {42330#true} {42438#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #50#return; {42438#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 04:45:47,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {42438#(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; {42460#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:45:47,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {42460#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {42460#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:45:47,501 INFO L272 TraceCheckUtils]: 42: Hoare triple {42460#(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)); {42330#true} is VALID [2022-04-08 04:45:47,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,502 INFO L290 TraceCheckUtils]: 45: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,502 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {42330#true} {42460#(and (= 5 main_~c~0) (= 5 main_~y~0))} #50#return; {42460#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:45:47,502 INFO L290 TraceCheckUtils]: 47: Hoare triple {42460#(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; {42482#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:45:47,503 INFO L290 TraceCheckUtils]: 48: Hoare triple {42482#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {42482#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:45:47,503 INFO L272 TraceCheckUtils]: 49: Hoare triple {42482#(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)); {42330#true} is VALID [2022-04-08 04:45:47,503 INFO L290 TraceCheckUtils]: 50: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,503 INFO L290 TraceCheckUtils]: 51: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,503 INFO L290 TraceCheckUtils]: 52: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,503 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {42330#true} {42482#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #50#return; {42482#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:45:47,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {42482#(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; {42504#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:45:47,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {42504#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {42504#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:45:47,504 INFO L272 TraceCheckUtils]: 56: Hoare triple {42504#(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)); {42330#true} is VALID [2022-04-08 04:45:47,504 INFO L290 TraceCheckUtils]: 57: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,504 INFO L290 TraceCheckUtils]: 58: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,504 INFO L290 TraceCheckUtils]: 59: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,505 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {42330#true} {42504#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #50#return; {42504#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 04:45:47,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {42504#(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; {42526#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 04:45:47,505 INFO L290 TraceCheckUtils]: 62: Hoare triple {42526#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {42526#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 04:45:47,505 INFO L272 TraceCheckUtils]: 63: Hoare triple {42526#(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)); {42330#true} is VALID [2022-04-08 04:45:47,506 INFO L290 TraceCheckUtils]: 64: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,506 INFO L290 TraceCheckUtils]: 66: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,506 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {42330#true} {42526#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #50#return; {42526#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 04:45:47,506 INFO L290 TraceCheckUtils]: 68: Hoare triple {42526#(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; {42548#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:45:47,507 INFO L290 TraceCheckUtils]: 69: Hoare triple {42548#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {42548#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:45:47,507 INFO L272 TraceCheckUtils]: 70: Hoare triple {42548#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 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)); {42330#true} is VALID [2022-04-08 04:45:47,507 INFO L290 TraceCheckUtils]: 71: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,507 INFO L290 TraceCheckUtils]: 72: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,507 INFO L290 TraceCheckUtils]: 73: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,507 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {42330#true} {42548#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #50#return; {42548#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 04:45:47,508 INFO L290 TraceCheckUtils]: 75: Hoare triple {42548#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 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; {42570#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 04:45:47,508 INFO L290 TraceCheckUtils]: 76: Hoare triple {42570#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !false; {42570#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 04:45:47,508 INFO L272 TraceCheckUtils]: 77: Hoare triple {42570#(and (= 7 (+ main_~y~0 (- 3))) (= 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)); {42330#true} is VALID [2022-04-08 04:45:47,508 INFO L290 TraceCheckUtils]: 78: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,508 INFO L290 TraceCheckUtils]: 79: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,508 INFO L290 TraceCheckUtils]: 80: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,509 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {42330#true} {42570#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} #50#return; {42570#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 04:45:47,510 INFO L290 TraceCheckUtils]: 82: Hoare triple {42570#(and (= 7 (+ main_~y~0 (- 3))) (= 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; {42592#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:45:47,511 INFO L290 TraceCheckUtils]: 83: Hoare triple {42592#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {42592#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:45:47,511 INFO L272 TraceCheckUtils]: 84: Hoare triple {42592#(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)); {42330#true} is VALID [2022-04-08 04:45:47,511 INFO L290 TraceCheckUtils]: 85: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,511 INFO L290 TraceCheckUtils]: 86: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,511 INFO L290 TraceCheckUtils]: 87: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,511 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {42330#true} {42592#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #50#return; {42592#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 04:45:47,512 INFO L290 TraceCheckUtils]: 89: Hoare triple {42592#(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; {42614#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:45:47,512 INFO L290 TraceCheckUtils]: 90: Hoare triple {42614#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {42614#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:45:47,512 INFO L272 TraceCheckUtils]: 91: Hoare triple {42614#(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)); {42330#true} is VALID [2022-04-08 04:45:47,512 INFO L290 TraceCheckUtils]: 92: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,512 INFO L290 TraceCheckUtils]: 93: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,512 INFO L290 TraceCheckUtils]: 94: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,513 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {42330#true} {42614#(and (= main_~y~0 12) (= main_~c~0 12))} #50#return; {42614#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 04:45:47,513 INFO L290 TraceCheckUtils]: 96: Hoare triple {42614#(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; {42636#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 04:45:47,513 INFO L290 TraceCheckUtils]: 97: Hoare triple {42636#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {42636#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 04:45:47,513 INFO L272 TraceCheckUtils]: 98: Hoare triple {42636#(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)); {42330#true} is VALID [2022-04-08 04:45:47,514 INFO L290 TraceCheckUtils]: 99: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,514 INFO L290 TraceCheckUtils]: 100: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,514 INFO L290 TraceCheckUtils]: 101: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,514 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {42330#true} {42636#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #50#return; {42636#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 04:45:47,514 INFO L290 TraceCheckUtils]: 103: Hoare triple {42636#(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; {42658#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:45:47,515 INFO L290 TraceCheckUtils]: 104: Hoare triple {42658#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} assume !false; {42658#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:45:47,515 INFO L272 TraceCheckUtils]: 105: Hoare triple {42658#(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)); {42330#true} is VALID [2022-04-08 04:45:47,515 INFO L290 TraceCheckUtils]: 106: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,515 INFO L290 TraceCheckUtils]: 107: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,515 INFO L290 TraceCheckUtils]: 108: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,515 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {42330#true} {42658#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} #50#return; {42658#(and (= 12 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 04:45:47,516 INFO L290 TraceCheckUtils]: 110: Hoare triple {42658#(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; {42680#(and (= main_~y~0 15) (= (+ main_~c~0 (- 3)) 12))} is VALID [2022-04-08 04:45:47,516 INFO L290 TraceCheckUtils]: 111: Hoare triple {42680#(and (= main_~y~0 15) (= (+ main_~c~0 (- 3)) 12))} assume !false; {42680#(and (= main_~y~0 15) (= (+ main_~c~0 (- 3)) 12))} is VALID [2022-04-08 04:45:47,516 INFO L272 TraceCheckUtils]: 112: Hoare triple {42680#(and (= main_~y~0 15) (= (+ 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)); {42330#true} is VALID [2022-04-08 04:45:47,516 INFO L290 TraceCheckUtils]: 113: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,516 INFO L290 TraceCheckUtils]: 114: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,516 INFO L290 TraceCheckUtils]: 115: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,517 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {42330#true} {42680#(and (= main_~y~0 15) (= (+ main_~c~0 (- 3)) 12))} #50#return; {42680#(and (= main_~y~0 15) (= (+ main_~c~0 (- 3)) 12))} is VALID [2022-04-08 04:45:47,517 INFO L290 TraceCheckUtils]: 117: Hoare triple {42680#(and (= main_~y~0 15) (= (+ 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; {42702#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:45:47,517 INFO L290 TraceCheckUtils]: 118: Hoare triple {42702#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {42702#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:45:47,517 INFO L272 TraceCheckUtils]: 119: Hoare triple {42702#(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)); {42330#true} is VALID [2022-04-08 04:45:47,517 INFO L290 TraceCheckUtils]: 120: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,518 INFO L290 TraceCheckUtils]: 121: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,518 INFO L290 TraceCheckUtils]: 122: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,518 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {42330#true} {42702#(and (= main_~c~0 16) (= main_~y~0 16))} #50#return; {42702#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 04:45:47,518 INFO L290 TraceCheckUtils]: 124: Hoare triple {42702#(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; {42724#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:45:47,519 INFO L290 TraceCheckUtils]: 125: Hoare triple {42724#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {42724#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:45:47,519 INFO L272 TraceCheckUtils]: 126: Hoare triple {42724#(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)); {42330#true} is VALID [2022-04-08 04:45:47,519 INFO L290 TraceCheckUtils]: 127: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,519 INFO L290 TraceCheckUtils]: 128: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,519 INFO L290 TraceCheckUtils]: 129: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,519 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {42330#true} {42724#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #50#return; {42724#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:45:47,520 INFO L290 TraceCheckUtils]: 131: Hoare triple {42724#(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; {42746#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 04:45:47,520 INFO L290 TraceCheckUtils]: 132: Hoare triple {42746#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} assume !false; {42746#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 04:45:47,520 INFO L272 TraceCheckUtils]: 133: Hoare triple {42746#(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)); {42330#true} is VALID [2022-04-08 04:45:47,520 INFO L290 TraceCheckUtils]: 134: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,520 INFO L290 TraceCheckUtils]: 135: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,520 INFO L290 TraceCheckUtils]: 136: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,521 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {42330#true} {42746#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} #50#return; {42746#(and (= (+ (- 2) main_~y~0) 16) (= (+ (- 1) main_~c~0) 17))} is VALID [2022-04-08 04:45:47,521 INFO L290 TraceCheckUtils]: 138: Hoare triple {42746#(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; {42768#(and (= (+ main_~y~0 (- 3)) 16) (= 17 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:45:47,521 INFO L290 TraceCheckUtils]: 139: Hoare triple {42768#(and (= (+ main_~y~0 (- 3)) 16) (= 17 (+ (- 2) main_~c~0)))} assume !false; {42768#(and (= (+ main_~y~0 (- 3)) 16) (= 17 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:45:47,522 INFO L272 TraceCheckUtils]: 140: Hoare triple {42768#(and (= (+ main_~y~0 (- 3)) 16) (= 17 (+ (- 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)); {42330#true} is VALID [2022-04-08 04:45:47,522 INFO L290 TraceCheckUtils]: 141: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,522 INFO L290 TraceCheckUtils]: 142: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,522 INFO L290 TraceCheckUtils]: 143: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,522 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {42330#true} {42768#(and (= (+ main_~y~0 (- 3)) 16) (= 17 (+ (- 2) main_~c~0)))} #50#return; {42768#(and (= (+ main_~y~0 (- 3)) 16) (= 17 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:45:47,522 INFO L290 TraceCheckUtils]: 145: Hoare triple {42768#(and (= (+ main_~y~0 (- 3)) 16) (= 17 (+ (- 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; {42790#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-08 04:45:47,523 INFO L290 TraceCheckUtils]: 146: Hoare triple {42790#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} assume !false; {42790#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-08 04:45:47,523 INFO L272 TraceCheckUtils]: 147: Hoare triple {42790#(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)); {42330#true} is VALID [2022-04-08 04:45:47,523 INFO L290 TraceCheckUtils]: 148: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,523 INFO L290 TraceCheckUtils]: 149: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,523 INFO L290 TraceCheckUtils]: 150: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,523 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {42330#true} {42790#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} #50#return; {42790#(and (= main_~c~0 20) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-08 04:45:47,524 INFO L290 TraceCheckUtils]: 152: Hoare triple {42790#(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; {42812#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 04:45:47,524 INFO L290 TraceCheckUtils]: 153: Hoare triple {42812#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} assume !false; {42812#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 04:45:47,524 INFO L272 TraceCheckUtils]: 154: Hoare triple {42812#(and (= main_~c~0 21) (= 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)); {42330#true} is VALID [2022-04-08 04:45:47,524 INFO L290 TraceCheckUtils]: 155: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,524 INFO L290 TraceCheckUtils]: 156: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,524 INFO L290 TraceCheckUtils]: 157: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,525 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {42330#true} {42812#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} #50#return; {42812#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 04:45:47,525 INFO L290 TraceCheckUtils]: 159: Hoare triple {42812#(and (= main_~c~0 21) (= 16 (+ 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; {42834#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 04:45:47,526 INFO L290 TraceCheckUtils]: 160: Hoare triple {42834#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} assume !false; {42834#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 04:45:47,526 INFO L272 TraceCheckUtils]: 161: Hoare triple {42834#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 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)); {42330#true} is VALID [2022-04-08 04:45:47,526 INFO L290 TraceCheckUtils]: 162: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,526 INFO L290 TraceCheckUtils]: 163: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,526 INFO L290 TraceCheckUtils]: 164: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,526 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {42330#true} {42834#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} #50#return; {42834#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 04:45:47,527 INFO L290 TraceCheckUtils]: 166: Hoare triple {42834#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 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; {42856#(and (= 16 (+ main_~y~0 (- 7))) (= 23 main_~c~0))} is VALID [2022-04-08 04:45:47,527 INFO L290 TraceCheckUtils]: 167: Hoare triple {42856#(and (= 16 (+ main_~y~0 (- 7))) (= 23 main_~c~0))} assume !false; {42856#(and (= 16 (+ main_~y~0 (- 7))) (= 23 main_~c~0))} is VALID [2022-04-08 04:45:47,527 INFO L272 TraceCheckUtils]: 168: Hoare triple {42856#(and (= 16 (+ main_~y~0 (- 7))) (= 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)); {42330#true} is VALID [2022-04-08 04:45:47,527 INFO L290 TraceCheckUtils]: 169: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,527 INFO L290 TraceCheckUtils]: 170: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,527 INFO L290 TraceCheckUtils]: 171: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,527 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {42330#true} {42856#(and (= 16 (+ main_~y~0 (- 7))) (= 23 main_~c~0))} #50#return; {42856#(and (= 16 (+ main_~y~0 (- 7))) (= 23 main_~c~0))} is VALID [2022-04-08 04:45:47,528 INFO L290 TraceCheckUtils]: 173: Hoare triple {42856#(and (= 16 (+ main_~y~0 (- 7))) (= 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; {42878#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:45:47,528 INFO L290 TraceCheckUtils]: 174: Hoare triple {42878#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !false; {42878#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:45:47,528 INFO L272 TraceCheckUtils]: 175: Hoare triple {42878#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 04:45:47,528 INFO L290 TraceCheckUtils]: 176: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,528 INFO L290 TraceCheckUtils]: 177: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,528 INFO L290 TraceCheckUtils]: 178: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,529 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {42330#true} {42878#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} #50#return; {42878#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 04:45:47,529 INFO L290 TraceCheckUtils]: 180: Hoare triple {42878#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42900#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 04:45:47,530 INFO L290 TraceCheckUtils]: 181: Hoare triple {42900#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} assume !false; {42900#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 04:45:47,530 INFO L272 TraceCheckUtils]: 182: Hoare triple {42900#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 04:45:47,530 INFO L290 TraceCheckUtils]: 183: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,530 INFO L290 TraceCheckUtils]: 184: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,530 INFO L290 TraceCheckUtils]: 185: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,530 INFO L284 TraceCheckUtils]: 186: Hoare quadruple {42330#true} {42900#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} #50#return; {42900#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 04:45:47,531 INFO L290 TraceCheckUtils]: 187: Hoare triple {42900#(and (= 23 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 24))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {42922#(and (= (+ (- 2) main_~y~0) 24) (= 23 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:45:47,531 INFO L290 TraceCheckUtils]: 188: Hoare triple {42922#(and (= (+ (- 2) main_~y~0) 24) (= 23 (+ main_~c~0 (- 3))))} assume !false; {42922#(and (= (+ (- 2) main_~y~0) 24) (= 23 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:45:47,531 INFO L272 TraceCheckUtils]: 189: Hoare triple {42922#(and (= (+ (- 2) main_~y~0) 24) (= 23 (+ 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)); {42330#true} is VALID [2022-04-08 04:45:47,531 INFO L290 TraceCheckUtils]: 190: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,531 INFO L290 TraceCheckUtils]: 191: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,531 INFO L290 TraceCheckUtils]: 192: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,532 INFO L284 TraceCheckUtils]: 193: Hoare quadruple {42330#true} {42922#(and (= (+ (- 2) main_~y~0) 24) (= 23 (+ main_~c~0 (- 3))))} #50#return; {42922#(and (= (+ (- 2) main_~y~0) 24) (= 23 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:45:47,532 INFO L290 TraceCheckUtils]: 194: Hoare triple {42922#(and (= (+ (- 2) main_~y~0) 24) (= 23 (+ 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; {42944#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27))} is VALID [2022-04-08 04:45:47,532 INFO L290 TraceCheckUtils]: 195: Hoare triple {42944#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27))} assume !false; {42944#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27))} is VALID [2022-04-08 04:45:47,532 INFO L272 TraceCheckUtils]: 196: Hoare triple {42944#(and (= (+ main_~y~0 (- 3)) 24) (= 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)); {42330#true} is VALID [2022-04-08 04:45:47,532 INFO L290 TraceCheckUtils]: 197: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,532 INFO L290 TraceCheckUtils]: 198: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,532 INFO L290 TraceCheckUtils]: 199: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,533 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {42330#true} {42944#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27))} #50#return; {42944#(and (= (+ main_~y~0 (- 3)) 24) (= main_~c~0 27))} is VALID [2022-04-08 04:45:47,533 INFO L290 TraceCheckUtils]: 201: Hoare triple {42944#(and (= (+ main_~y~0 (- 3)) 24) (= 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; {42966#(and (= (+ main_~y~0 (- 4)) 24) (= main_~c~0 28))} is VALID [2022-04-08 04:45:47,534 INFO L290 TraceCheckUtils]: 202: Hoare triple {42966#(and (= (+ main_~y~0 (- 4)) 24) (= main_~c~0 28))} assume !false; {42966#(and (= (+ main_~y~0 (- 4)) 24) (= main_~c~0 28))} is VALID [2022-04-08 04:45:47,534 INFO L272 TraceCheckUtils]: 203: Hoare triple {42966#(and (= (+ main_~y~0 (- 4)) 24) (= 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)); {42330#true} is VALID [2022-04-08 04:45:47,534 INFO L290 TraceCheckUtils]: 204: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,534 INFO L290 TraceCheckUtils]: 205: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,534 INFO L290 TraceCheckUtils]: 206: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,534 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {42330#true} {42966#(and (= (+ main_~y~0 (- 4)) 24) (= main_~c~0 28))} #50#return; {42966#(and (= (+ main_~y~0 (- 4)) 24) (= main_~c~0 28))} is VALID [2022-04-08 04:45:47,535 INFO L290 TraceCheckUtils]: 208: Hoare triple {42966#(and (= (+ main_~y~0 (- 4)) 24) (= 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; {42988#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 04:45:47,535 INFO L290 TraceCheckUtils]: 209: Hoare triple {42988#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} assume !false; {42988#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 04:45:47,535 INFO L272 TraceCheckUtils]: 210: Hoare triple {42988#(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)); {42330#true} is VALID [2022-04-08 04:45:47,535 INFO L290 TraceCheckUtils]: 211: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,535 INFO L290 TraceCheckUtils]: 212: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,535 INFO L290 TraceCheckUtils]: 213: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,536 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {42330#true} {42988#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} #50#return; {42988#(and (= 29 main_~y~0) (= (+ (- 1) main_~c~0) 28))} is VALID [2022-04-08 04:45:47,536 INFO L290 TraceCheckUtils]: 215: Hoare triple {42988#(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; {43010#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:45:47,536 INFO L290 TraceCheckUtils]: 216: Hoare triple {43010#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} assume !false; {43010#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:45:47,536 INFO L272 TraceCheckUtils]: 217: Hoare triple {43010#(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)); {42330#true} is VALID [2022-04-08 04:45:47,536 INFO L290 TraceCheckUtils]: 218: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,536 INFO L290 TraceCheckUtils]: 219: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,537 INFO L290 TraceCheckUtils]: 220: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,537 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {42330#true} {43010#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} #50#return; {43010#(and (= 28 (+ (- 2) main_~c~0)) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:45:47,537 INFO L290 TraceCheckUtils]: 222: Hoare triple {43010#(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; {43032#(and (= main_~y~0 31) (= (+ main_~c~0 (- 3)) 28))} is VALID [2022-04-08 04:45:47,538 INFO L290 TraceCheckUtils]: 223: Hoare triple {43032#(and (= main_~y~0 31) (= (+ main_~c~0 (- 3)) 28))} assume !false; {43032#(and (= main_~y~0 31) (= (+ main_~c~0 (- 3)) 28))} is VALID [2022-04-08 04:45:47,538 INFO L272 TraceCheckUtils]: 224: Hoare triple {43032#(and (= main_~y~0 31) (= (+ main_~c~0 (- 3)) 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)); {42330#true} is VALID [2022-04-08 04:45:47,538 INFO L290 TraceCheckUtils]: 225: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,538 INFO L290 TraceCheckUtils]: 226: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,538 INFO L290 TraceCheckUtils]: 227: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,538 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {42330#true} {43032#(and (= main_~y~0 31) (= (+ main_~c~0 (- 3)) 28))} #50#return; {43032#(and (= main_~y~0 31) (= (+ main_~c~0 (- 3)) 28))} is VALID [2022-04-08 04:45:47,539 INFO L290 TraceCheckUtils]: 229: Hoare triple {43032#(and (= main_~y~0 31) (= (+ main_~c~0 (- 3)) 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; {43054#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 04:45:47,539 INFO L290 TraceCheckUtils]: 230: Hoare triple {43054#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !false; {43054#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 04:45:47,539 INFO L272 TraceCheckUtils]: 231: Hoare triple {43054#(and (= 32 main_~y~0) (= 32 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 04:45:47,539 INFO L290 TraceCheckUtils]: 232: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,539 INFO L290 TraceCheckUtils]: 233: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,539 INFO L290 TraceCheckUtils]: 234: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,540 INFO L284 TraceCheckUtils]: 235: Hoare quadruple {42330#true} {43054#(and (= 32 main_~y~0) (= 32 main_~c~0))} #50#return; {43054#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 04:45:47,540 INFO L290 TraceCheckUtils]: 236: Hoare triple {43054#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {43076#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} is VALID [2022-04-08 04:45:47,540 INFO L290 TraceCheckUtils]: 237: Hoare triple {43076#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} assume !false; {43076#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} is VALID [2022-04-08 04:45:47,540 INFO L272 TraceCheckUtils]: 238: Hoare triple {43076#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 04:45:47,540 INFO L290 TraceCheckUtils]: 239: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,541 INFO L290 TraceCheckUtils]: 240: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,541 INFO L290 TraceCheckUtils]: 241: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,541 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {42330#true} {43076#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} #50#return; {43076#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} is VALID [2022-04-08 04:45:47,541 INFO L290 TraceCheckUtils]: 243: Hoare triple {43076#(and (= 32 (+ (- 1) main_~y~0)) (= main_~c~0 33))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {43098#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} is VALID [2022-04-08 04:45:47,542 INFO L290 TraceCheckUtils]: 244: Hoare triple {43098#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} assume !false; {43098#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} is VALID [2022-04-08 04:45:47,542 INFO L272 TraceCheckUtils]: 245: Hoare triple {43098#(and (= main_~c~0 34) (= (+ (- 2) main_~y~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)); {42330#true} is VALID [2022-04-08 04:45:47,542 INFO L290 TraceCheckUtils]: 246: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,542 INFO L290 TraceCheckUtils]: 247: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,542 INFO L290 TraceCheckUtils]: 248: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,542 INFO L284 TraceCheckUtils]: 249: Hoare quadruple {42330#true} {43098#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} #50#return; {43098#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} is VALID [2022-04-08 04:45:47,543 INFO L290 TraceCheckUtils]: 250: Hoare triple {43098#(and (= main_~c~0 34) (= (+ (- 2) main_~y~0) 32))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {43120#(and (= (+ main_~y~0 (- 3)) 32) (= 35 main_~c~0))} is VALID [2022-04-08 04:45:47,543 INFO L290 TraceCheckUtils]: 251: Hoare triple {43120#(and (= (+ main_~y~0 (- 3)) 32) (= 35 main_~c~0))} assume !false; {43120#(and (= (+ main_~y~0 (- 3)) 32) (= 35 main_~c~0))} is VALID [2022-04-08 04:45:47,543 INFO L272 TraceCheckUtils]: 252: Hoare triple {43120#(and (= (+ main_~y~0 (- 3)) 32) (= 35 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)); {42330#true} is VALID [2022-04-08 04:45:47,543 INFO L290 TraceCheckUtils]: 253: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,543 INFO L290 TraceCheckUtils]: 254: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,543 INFO L290 TraceCheckUtils]: 255: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,544 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {42330#true} {43120#(and (= (+ main_~y~0 (- 3)) 32) (= 35 main_~c~0))} #50#return; {43120#(and (= (+ main_~y~0 (- 3)) 32) (= 35 main_~c~0))} is VALID [2022-04-08 04:45:47,544 INFO L290 TraceCheckUtils]: 257: Hoare triple {43120#(and (= (+ main_~y~0 (- 3)) 32) (= 35 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; {43142#(and (= (+ (- 1) main_~c~0) 35) (= 32 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 04:45:47,544 INFO L290 TraceCheckUtils]: 258: Hoare triple {43142#(and (= (+ (- 1) main_~c~0) 35) (= 32 (+ main_~y~0 (- 4))))} assume !false; {43142#(and (= (+ (- 1) main_~c~0) 35) (= 32 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 04:45:47,544 INFO L272 TraceCheckUtils]: 259: Hoare triple {43142#(and (= (+ (- 1) main_~c~0) 35) (= 32 (+ 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)); {42330#true} is VALID [2022-04-08 04:45:47,545 INFO L290 TraceCheckUtils]: 260: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,545 INFO L290 TraceCheckUtils]: 261: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,545 INFO L290 TraceCheckUtils]: 262: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,545 INFO L284 TraceCheckUtils]: 263: Hoare quadruple {42330#true} {43142#(and (= (+ (- 1) main_~c~0) 35) (= 32 (+ main_~y~0 (- 4))))} #50#return; {43142#(and (= (+ (- 1) main_~c~0) 35) (= 32 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 04:45:47,545 INFO L290 TraceCheckUtils]: 264: Hoare triple {43142#(and (= (+ (- 1) main_~c~0) 35) (= 32 (+ 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; {43164#(and (= 35 (+ (- 2) main_~c~0)) (= main_~y~0 37))} is VALID [2022-04-08 04:45:47,546 INFO L290 TraceCheckUtils]: 265: Hoare triple {43164#(and (= 35 (+ (- 2) main_~c~0)) (= main_~y~0 37))} assume !false; {43164#(and (= 35 (+ (- 2) main_~c~0)) (= main_~y~0 37))} is VALID [2022-04-08 04:45:47,546 INFO L272 TraceCheckUtils]: 266: Hoare triple {43164#(and (= 35 (+ (- 2) main_~c~0)) (= main_~y~0 37))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 04:45:47,546 INFO L290 TraceCheckUtils]: 267: Hoare triple {42330#true} ~cond := #in~cond; {42330#true} is VALID [2022-04-08 04:45:47,546 INFO L290 TraceCheckUtils]: 268: Hoare triple {42330#true} assume !(0 == ~cond); {42330#true} is VALID [2022-04-08 04:45:47,546 INFO L290 TraceCheckUtils]: 269: Hoare triple {42330#true} assume true; {42330#true} is VALID [2022-04-08 04:45:47,546 INFO L284 TraceCheckUtils]: 270: Hoare quadruple {42330#true} {43164#(and (= 35 (+ (- 2) main_~c~0)) (= main_~y~0 37))} #50#return; {43164#(and (= 35 (+ (- 2) main_~c~0)) (= main_~y~0 37))} is VALID [2022-04-08 04:45:47,547 INFO L290 TraceCheckUtils]: 271: Hoare triple {43164#(and (= 35 (+ (- 2) main_~c~0)) (= main_~y~0 37))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {43186#(and (= main_~y~0 38) (= 35 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:45:47,547 INFO L290 TraceCheckUtils]: 272: Hoare triple {43186#(and (= main_~y~0 38) (= 35 (+ main_~c~0 (- 3))))} assume !false; {43186#(and (= main_~y~0 38) (= 35 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:45:47,547 INFO L272 TraceCheckUtils]: 273: Hoare triple {43186#(and (= main_~y~0 38) (= 35 (+ 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)); {42330#true} is VALID [2022-04-08 04:45:47,547 INFO L290 TraceCheckUtils]: 274: Hoare triple {42330#true} ~cond := #in~cond; {43196#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:45:47,548 INFO L290 TraceCheckUtils]: 275: Hoare triple {43196#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:45:47,548 INFO L290 TraceCheckUtils]: 276: Hoare triple {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:45:47,549 INFO L284 TraceCheckUtils]: 277: Hoare quadruple {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} {43186#(and (= main_~y~0 38) (= 35 (+ main_~c~0 (- 3))))} #50#return; {43207#(and (= main_~y~0 38) (= (+ (* 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)) (= 35 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 04:45:47,549 INFO L290 TraceCheckUtils]: 278: Hoare triple {43207#(and (= main_~y~0 38) (= (+ (* 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)) (= 35 (+ 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; {43211#(and (< 38 main_~k~0) (= (+ (* main_~x~0 4) (* (* (- 1) main_~y~0 main_~y~0 main_~y~0) 4)) 2196324) (= main_~y~0 39) (<= main_~c~0 39))} is VALID [2022-04-08 04:45:47,550 INFO L290 TraceCheckUtils]: 279: Hoare triple {43211#(and (< 38 main_~k~0) (= (+ (* main_~x~0 4) (* (* (- 1) main_~y~0 main_~y~0 main_~y~0) 4)) 2196324) (= main_~y~0 39) (<= main_~c~0 39))} assume !false; {43211#(and (< 38 main_~k~0) (= (+ (* main_~x~0 4) (* (* (- 1) main_~y~0 main_~y~0 main_~y~0) 4)) 2196324) (= main_~y~0 39) (<= main_~c~0 39))} is VALID [2022-04-08 04:45:47,550 INFO L272 TraceCheckUtils]: 280: Hoare triple {43211#(and (< 38 main_~k~0) (= (+ (* main_~x~0 4) (* (* (- 1) main_~y~0 main_~y~0 main_~y~0) 4)) 2196324) (= main_~y~0 39) (<= main_~c~0 39))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {42330#true} is VALID [2022-04-08 04:45:47,550 INFO L290 TraceCheckUtils]: 281: Hoare triple {42330#true} ~cond := #in~cond; {43196#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:45:47,550 INFO L290 TraceCheckUtils]: 282: Hoare triple {43196#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:45:47,550 INFO L290 TraceCheckUtils]: 283: Hoare triple {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:45:47,551 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {43200#(not (= |__VERIFIER_assert_#in~cond| 0))} {43211#(and (< 38 main_~k~0) (= (+ (* main_~x~0 4) (* (* (- 1) main_~y~0 main_~y~0 main_~y~0) 4)) 2196324) (= main_~y~0 39) (<= main_~c~0 39))} #50#return; {43230#(and (< 38 main_~k~0) (= main_~y~0 39) (<= main_~c~0 39))} is VALID [2022-04-08 04:45:47,564 INFO L290 TraceCheckUtils]: 285: Hoare triple {43230#(and (< 38 main_~k~0) (= main_~y~0 39) (<= main_~c~0 39))} assume !(~c~0 < ~k~0); {43234#(and (< 38 main_~k~0) (<= main_~k~0 39) (= main_~y~0 39))} is VALID [2022-04-08 04:45:47,565 INFO L272 TraceCheckUtils]: 286: Hoare triple {43234#(and (< 38 main_~k~0) (<= main_~k~0 39) (= main_~y~0 39))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {43238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:45:47,565 INFO L290 TraceCheckUtils]: 287: Hoare triple {43238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {43242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:45:47,565 INFO L290 TraceCheckUtils]: 288: Hoare triple {43242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42331#false} is VALID [2022-04-08 04:45:47,565 INFO L290 TraceCheckUtils]: 289: Hoare triple {42331#false} assume !false; {42331#false} is VALID [2022-04-08 04:45:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 5540 backedges. 306 proven. 2342 refuted. 0 times theorem prover too weak. 2892 trivial. 0 not checked. [2022-04-08 04:45:47,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:46:06,960 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= (mod (+ (* (- 1) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 1) c_main_~y~0 c_main_~y~0) (* (- 2) c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) is different from false [2022-04-08 04:46:06,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:46:06,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042892758] [2022-04-08 04:46:06,968 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:46:06,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060805312] [2022-04-08 04:46:06,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060805312] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:46:06,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:46:06,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2022-04-08 04:46:06,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:46:06,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [846574855] [2022-04-08 04:46:06,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [846574855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:46:06,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:46:06,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-08 04:46:06,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298570501] [2022-04-08 04:46:06,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:46:06,969 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 46 states have internal predecessors, (92), 42 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Word has length 290 [2022-04-08 04:46:06,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:46:06,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 46 states have internal predecessors, (92), 42 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 04:46:08,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:46:08,310 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-08 04:46:08,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:46:08,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-08 04:46:08,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2699, Unknown=1, NotChecked=104, Total=2970 [2022-04-08 04:46:08,311 INFO L87 Difference]: Start difference. First operand 139 states and 177 transitions. Second operand has 49 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 46 states have internal predecessors, (92), 42 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41)