/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-scaling/ps4-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 07:45:11,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 07:45:11,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 07:45:11,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 07:45:11,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 07:45:11,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 07:45:11,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 07:45:11,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 07:45:11,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 07:45:11,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 07:45:11,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 07:45:11,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 07:45:11,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 07:45:11,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 07:45:11,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 07:45:11,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 07:45:11,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 07:45:11,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 07:45:11,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 07:45:11,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 07:45:11,299 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 07:45:11,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 07:45:11,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 07:45:11,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 07:45:11,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 07:45:11,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 07:45:11,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 07:45:11,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 07:45:11,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 07:45:11,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 07:45:11,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 07:45:11,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 07:45:11,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 07:45:11,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 07:45:11,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 07:45:11,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 07:45:11,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 07:45:11,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 07:45:11,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 07:45:11,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 07:45:11,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 07:45:11,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 07:45:11,313 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 07:45:11,320 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 07:45:11,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 07:45:11,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 07:45:11,321 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 07:45:11,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 07:45:11,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 07:45:11,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 07:45:11,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 07:45:11,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 07:45:11,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 07:45:11,322 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 07:45:11,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 07:45:11,322 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 07:45:11,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 07:45:11,322 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 07:45:11,322 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 07:45:11,322 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 07:45:11,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 07:45:11,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:45:11,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 07:45:11,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 07:45:11,323 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 07:45:11,323 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 07:45:11,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 07:45:11,323 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 07:45:11,323 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 07:45:11,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 07:45:11,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 07:45:11,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 07:45:11,513 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 07:45:11,513 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 07:45:11,514 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c [2022-04-08 07:45:11,562 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1059de6e2/0b0008bdb03342289d8f984b7817f0f5/FLAG4ffa1e4aa [2022-04-08 07:45:11,912 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 07:45:11,913 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c [2022-04-08 07:45:11,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1059de6e2/0b0008bdb03342289d8f984b7817f0f5/FLAG4ffa1e4aa [2022-04-08 07:45:11,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1059de6e2/0b0008bdb03342289d8f984b7817f0f5 [2022-04-08 07:45:11,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 07:45:11,926 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 07:45:11,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 07:45:11,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 07:45:11,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 07:45:11,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:45:11" (1/1) ... [2022-04-08 07:45:11,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d38822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:11, skipping insertion in model container [2022-04-08 07:45:11,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:45:11" (1/1) ... [2022-04-08 07:45:11,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 07:45:11,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 07:45:12,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c[458,471] [2022-04-08 07:45:12,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:45:12,075 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 07:45:12,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c[458,471] [2022-04-08 07:45:12,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:45:12,099 INFO L208 MainTranslator]: Completed translation [2022-04-08 07:45:12,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:12 WrapperNode [2022-04-08 07:45:12,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 07:45:12,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 07:45:12,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 07:45:12,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 07:45:12,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:12" (1/1) ... [2022-04-08 07:45:12,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:12" (1/1) ... [2022-04-08 07:45:12,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:12" (1/1) ... [2022-04-08 07:45:12,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:12" (1/1) ... [2022-04-08 07:45:12,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:12" (1/1) ... [2022-04-08 07:45:12,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:12" (1/1) ... [2022-04-08 07:45:12,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:12" (1/1) ... [2022-04-08 07:45:12,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 07:45:12,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 07:45:12,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 07:45:12,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 07:45:12,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:12" (1/1) ... [2022-04-08 07:45:12,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:45:12,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:12,162 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 07:45:12,176 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 07:45:12,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 07:45:12,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 07:45:12,195 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 07:45:12,195 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 07:45:12,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 07:45:12,195 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 07:45:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 07:45:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 07:45:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 07:45:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 07:45:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 07:45:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 07:45:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 07:45:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 07:45:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 07:45:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 07:45:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 07:45:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 07:45:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 07:45:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 07:45:12,241 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 07:45:12,242 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 07:45:12,387 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 07:45:12,391 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 07:45:12,391 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 07:45:12,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:45:12 BoogieIcfgContainer [2022-04-08 07:45:12,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 07:45:12,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 07:45:12,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 07:45:12,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 07:45:12,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:45:11" (1/3) ... [2022-04-08 07:45:12,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c125bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:45:12, skipping insertion in model container [2022-04-08 07:45:12,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:45:12" (2/3) ... [2022-04-08 07:45:12,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c125bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:45:12, skipping insertion in model container [2022-04-08 07:45:12,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:45:12" (3/3) ... [2022-04-08 07:45:12,411 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound50.c [2022-04-08 07:45:12,414 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 07:45:12,414 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 07:45:12,453 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 07:45:12,473 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 07:45:12,474 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 07:45:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:45:12,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 07:45:12,510 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:12,510 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:12,511 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:12,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:12,515 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-08 07:45:12,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:12,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [237082794] [2022-04-08 07:45:12,531 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:45:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 2 times [2022-04-08 07:45:12,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:12,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002149142] [2022-04-08 07:45:12,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:12,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:12,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 07:45:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:12,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-08 07:45:12,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 07:45:12,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-08 07:45:12,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 07:45:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:12,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-08 07:45:12,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-08 07:45:12,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-08 07:45:12,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-08 07:45:12,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 07:45:12,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-08 07:45:12,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 07:45:12,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-08 07:45:12,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-08 07:45:12,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {31#true} is VALID [2022-04-08 07:45:12,757 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {31#true} is VALID [2022-04-08 07:45:12,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-08 07:45:12,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-08 07:45:12,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-08 07:45:12,760 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-08 07:45:12,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-08 07:45:12,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-08 07:45:12,761 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {32#false} is VALID [2022-04-08 07:45:12,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-08 07:45:12,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-08 07:45:12,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-08 07:45:12,763 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 07:45:12,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:12,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002149142] [2022-04-08 07:45:12,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002149142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:12,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:12,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:45:12,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:12,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [237082794] [2022-04-08 07:45:12,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [237082794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:12,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:12,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:45:12,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761829900] [2022-04-08 07:45:12,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:12,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 07:45:12,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:12,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:12,812 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 07:45:12,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 07:45:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:12,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 07:45:12,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:45:12,841 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:12,989 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-08 07:45:12,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 07:45:12,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 07:45:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-08 07:45:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-08 07:45:13,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-08 07:45:13,111 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 07:45:13,119 INFO L225 Difference]: With dead ends: 47 [2022-04-08 07:45:13,120 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 07:45:13,123 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:45:13,127 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:13,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:45:13,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 07:45:13,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 07:45:13,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:13,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:13,167 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:13,167 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:13,170 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 07:45:13,170 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 07:45:13,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:13,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:13,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-08 07:45:13,171 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-08 07:45:13,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:13,176 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 07:45:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 07:45:13,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:13,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:13,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:13,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:13,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-08 07:45:13,183 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-08 07:45:13,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:13,183 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-08 07:45:13,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:13,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-08 07:45:13,227 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 07:45:13,228 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 07:45:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 07:45:13,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:13,228 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:13,229 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 07:45:13,229 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:13,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:13,230 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-08 07:45:13,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:13,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2140440435] [2022-04-08 07:45:13,230 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:45:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 2 times [2022-04-08 07:45:13,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:13,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766144937] [2022-04-08 07:45:13,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:13,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:13,246 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:13,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112316976] [2022-04-08 07:45:13,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:45:13,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:13,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:13,249 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 07:45:13,279 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 07:45:13,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:45:13,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:13,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:45:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:13,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:13,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-08 07:45:13,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#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); {229#true} is VALID [2022-04-08 07:45:13,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-08 07:45:13,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #60#return; {229#true} is VALID [2022-04-08 07:45:13,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-08 07:45:13,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#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; {229#true} is VALID [2022-04-08 07:45:13,472 INFO L272 TraceCheckUtils]: 6: Hoare triple {229#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {229#true} is VALID [2022-04-08 07:45:13,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-08 07:45:13,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-08 07:45:13,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-08 07:45:13,473 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#true} {229#true} #52#return; {229#true} is VALID [2022-04-08 07:45:13,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:13,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:13,475 INFO L272 TraceCheckUtils]: 13: Hoare triple {267#(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)); {274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:13,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:13,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-08 07:45:13,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-08 07:45:13,477 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 07:45:13,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:45:13,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:13,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766144937] [2022-04-08 07:45:13,478 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:13,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112316976] [2022-04-08 07:45:13,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112316976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:13,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:13,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:45:13,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:13,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2140440435] [2022-04-08 07:45:13,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2140440435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:13,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:13,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:45:13,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791146349] [2022-04-08 07:45:13,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:13,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 07:45:13,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:13,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:13,498 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 07:45:13,499 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:45:13,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:13,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:45:13,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 07:45:13,500 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:13,640 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 07:45:13,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:45:13,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 07:45:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 07:45:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 07:45:13,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-08 07:45:13,683 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 07:45:13,685 INFO L225 Difference]: With dead ends: 34 [2022-04-08 07:45:13,685 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 07:45:13,686 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 07:45:13,688 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:13,691 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:45:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 07:45:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 07:45:13,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:13,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:13,706 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:13,706 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:13,709 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 07:45:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 07:45:13,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:13,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:13,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-08 07:45:13,711 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-08 07:45:13,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:13,714 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 07:45:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 07:45:13,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:13,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:13,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:13,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:13,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-08 07:45:13,724 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-08 07:45:13,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:13,724 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-08 07:45:13,724 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:45:13,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-08 07:45:13,756 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 07:45:13,758 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 07:45:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 07:45:13,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:13,761 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:13,781 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 07:45:13,975 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 07:45:13,976 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:13,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:13,976 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-08 07:45:13,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:13,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [598362073] [2022-04-08 07:45:14,181 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:14,182 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:14,182 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:14,182 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 2 times [2022-04-08 07:45:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:14,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216452535] [2022-04-08 07:45:14,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:14,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:14,212 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:14,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880472372] [2022-04-08 07:45:14,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:45:14,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:14,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:14,224 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 07:45:14,224 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 07:45:14,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:45:14,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:14,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 07:45:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:14,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:14,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-08 07:45:14,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-08 07:45:14,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:45:14,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-08 07:45:14,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-08 07:45:14,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#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; {474#true} is VALID [2022-04-08 07:45:14,402 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {474#true} is VALID [2022-04-08 07:45:14,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:45:14,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:45:14,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:45:14,406 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-08 07:45:14,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:14,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:14,410 INFO L272 TraceCheckUtils]: 13: Hoare triple {512#(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)); {474#true} is VALID [2022-04-08 07:45:14,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:45:14,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:45:14,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:45:14,411 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {512#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:14,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#(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; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 07:45:14,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 07:45:14,414 INFO L272 TraceCheckUtils]: 20: Hoare triple {534#(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)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:14,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:14,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-08 07:45:14,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-08 07:45:14,416 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 07:45:14,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:14,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-08 07:45:14,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-08 07:45:14,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:14,676 INFO L272 TraceCheckUtils]: 20: Hoare triple {561#(= (+ (* 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)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:14,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {561#(= (+ (* 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; {561#(= (+ (* 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 07:45:14,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {561#(= (+ (* 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; {561#(= (+ (* 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 07:45:14,948 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #54#return; {561#(= (+ (* 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 07:45:14,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:45:14,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:45:14,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:45:14,948 INFO L272 TraceCheckUtils]: 13: Hoare triple {561#(= (+ (* 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)); {474#true} is VALID [2022-04-08 07:45:14,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {561#(= (+ (* 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; {561#(= (+ (* 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 07:45:14,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {561#(= (+ (* 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 07:45:14,949 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-08 07:45:14,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:45:14,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:45:14,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:45:14,950 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {474#true} is VALID [2022-04-08 07:45:14,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#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; {474#true} is VALID [2022-04-08 07:45:14,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-08 07:45:14,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-08 07:45:14,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:45:14,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-08 07:45:14,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-08 07:45:14,951 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 07:45:14,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:14,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216452535] [2022-04-08 07:45:14,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:14,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880472372] [2022-04-08 07:45:14,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880472372] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:14,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:14,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 07:45:14,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:14,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [598362073] [2022-04-08 07:45:14,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [598362073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:14,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:14,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:45:14,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406678589] [2022-04-08 07:45:14,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:14,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-08 07:45:14,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:14,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:45:15,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:15,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:45:15,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:15,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:45:15,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 07:45:15,466 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:45:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:15,590 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-08 07:45:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:45:15,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-08 07:45:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:45:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-08 07:45:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:45:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-08 07:45:15,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-08 07:45:16,108 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 07:45:16,109 INFO L225 Difference]: With dead ends: 36 [2022-04-08 07:45:16,109 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 07:45:16,110 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 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 07:45:16,110 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:16,111 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:45:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 07:45:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 07:45:16,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:16,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:16,138 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:16,138 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:16,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:16,139 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 07:45:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 07:45:16,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:16,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:16,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 07:45:16,144 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 07:45:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:16,147 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 07:45:16,147 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 07:45:16,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:16,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:16,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:16,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:45:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-08 07:45:16,149 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-08 07:45:16,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:16,149 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-08 07:45:16,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:45:16,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-08 07:45:16,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 07:45:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 07:45:16,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:16,664 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:16,681 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 07:45:16,871 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 07:45:16,872 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:16,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:16,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-08 07:45:16,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:16,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [167653957] [2022-04-08 07:45:16,985 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:16,985 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:16,985 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:16,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 2 times [2022-04-08 07:45:16,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:16,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537635653] [2022-04-08 07:45:16,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:16,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:17,010 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:17,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [996102916] [2022-04-08 07:45:17,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:45:17,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:17,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:17,011 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 07:45:17,012 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 07:45:17,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:45:17,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:17,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 07:45:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:17,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:17,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2022-04-08 07:45:17,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#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); {822#true} is VALID [2022-04-08 07:45:17,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:45:17,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #60#return; {822#true} is VALID [2022-04-08 07:45:17,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret5 := main(); {822#true} is VALID [2022-04-08 07:45:17,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#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; {822#true} is VALID [2022-04-08 07:45:17,313 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {822#true} is VALID [2022-04-08 07:45:17,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-08 07:45:17,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-08 07:45:17,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:45:17,314 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #52#return; {822#true} is VALID [2022-04-08 07:45:17,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:17,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:17,315 INFO L272 TraceCheckUtils]: 13: Hoare triple {860#(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)); {822#true} is VALID [2022-04-08 07:45:17,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-08 07:45:17,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-08 07:45:17,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:45:17,317 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {822#true} {860#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:17,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(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; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:45:17,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:45:17,318 INFO L272 TraceCheckUtils]: 20: Hoare triple {882#(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)); {822#true} is VALID [2022-04-08 07:45:17,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-08 07:45:17,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-08 07:45:17,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:45:17,319 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {822#true} {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:45:17,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:45:17,321 INFO L272 TraceCheckUtils]: 26: Hoare triple {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:17,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:17,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {823#false} is VALID [2022-04-08 07:45:17,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-08 07:45:17,322 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 07:45:17,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:17,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:17,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537635653] [2022-04-08 07:45:17,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:17,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996102916] [2022-04-08 07:45:17,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996102916] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:17,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:17,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 07:45:17,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:17,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [167653957] [2022-04-08 07:45:17,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [167653957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:17,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:17,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 07:45:17,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961704818] [2022-04-08 07:45:17,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:17,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-08 07:45:17,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:17,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:45:17,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:17,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 07:45:17,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:17,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 07:45:17,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 07:45:17,570 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:45:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:17,736 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-08 07:45:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 07:45:17,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-08 07:45:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:45:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-08 07:45:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:45:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-08 07:45:17,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-08 07:45:17,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:17,760 INFO L225 Difference]: With dead ends: 39 [2022-04-08 07:45:17,760 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 07:45:17,760 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:45:17,761 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:17,761 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:45:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 07:45:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 07:45:17,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:17,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:17,780 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:17,780 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:17,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:17,782 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-08 07:45:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-08 07:45:17,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:17,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:17,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-08 07:45:17,782 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-08 07:45:17,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:17,784 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-08 07:45:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-08 07:45:17,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:17,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:17,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:17,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:45:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-08 07:45:17,786 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-08 07:45:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:17,786 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-08 07:45:17,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:45:17,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-08 07:45:18,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-08 07:45:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 07:45:18,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:18,268 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:18,285 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 07:45:18,480 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 07:45:18,480 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:18,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:18,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 3 times [2022-04-08 07:45:18,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:18,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1543030772] [2022-04-08 07:45:18,569 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:18,569 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:18,569 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:18,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 4 times [2022-04-08 07:45:18,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:18,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134536269] [2022-04-08 07:45:18,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:18,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:18,590 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:18,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068779909] [2022-04-08 07:45:18,590 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:45:18,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:18,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:18,591 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 07:45:18,612 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 07:45:18,635 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:45:18,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:18,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 07:45:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:18,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:18,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1178#true} is VALID [2022-04-08 07:45:18,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#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); {1178#true} is VALID [2022-04-08 07:45:18,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:45:18,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #60#return; {1178#true} is VALID [2022-04-08 07:45:18,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret5 := main(); {1178#true} is VALID [2022-04-08 07:45:18,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {1178#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; {1178#true} is VALID [2022-04-08 07:45:18,889 INFO L272 TraceCheckUtils]: 6: Hoare triple {1178#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1178#true} is VALID [2022-04-08 07:45:18,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-08 07:45:18,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-08 07:45:18,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:45:18,890 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1178#true} {1178#true} #52#return; {1178#true} is VALID [2022-04-08 07:45:18,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:18,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:18,899 INFO L272 TraceCheckUtils]: 13: Hoare triple {1216#(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)); {1178#true} is VALID [2022-04-08 07:45:18,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-08 07:45:18,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-08 07:45:18,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:45:18,900 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1178#true} {1216#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:18,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {1216#(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; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:45:18,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:45:18,901 INFO L272 TraceCheckUtils]: 20: Hoare triple {1238#(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)); {1178#true} is VALID [2022-04-08 07:45:18,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-08 07:45:18,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-08 07:45:18,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:45:18,901 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1178#true} {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:45:18,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {1238#(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; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-08 07:45:18,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !false; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-08 07:45:18,902 INFO L272 TraceCheckUtils]: 27: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 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)); {1178#true} is VALID [2022-04-08 07:45:18,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-08 07:45:18,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-08 07:45:18,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:45:18,903 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1178#true} {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #54#return; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-08 07:45:18,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1282#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-08 07:45:18,904 INFO L272 TraceCheckUtils]: 33: Hoare triple {1282#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1286#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:18,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {1286#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1290#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:18,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {1290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1179#false} is VALID [2022-04-08 07:45:18,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-08 07:45:18,905 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 07:45:18,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:19,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:19,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134536269] [2022-04-08 07:45:19,199 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:19,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068779909] [2022-04-08 07:45:19,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068779909] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:19,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:19,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 07:45:19,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:19,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1543030772] [2022-04-08 07:45:19,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1543030772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:19,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:19,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 07:45:19,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474776547] [2022-04-08 07:45:19,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:19,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-08 07:45:19,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:19,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:45:19,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:19,224 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 07:45:19,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:19,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 07:45:19,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 07:45:19,224 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:45:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:19,459 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-08 07:45:19,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 07:45:19,459 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-08 07:45:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:45:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-08 07:45:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:45:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-08 07:45:19,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-08 07:45:19,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:19,490 INFO L225 Difference]: With dead ends: 42 [2022-04-08 07:45:19,490 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 07:45:19,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-08 07:45:19,490 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:19,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:45:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 07:45:19,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 07:45:19,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:19,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:45:19,510 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:45:19,511 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:45:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:19,512 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-08 07:45:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-08 07:45:19,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:19,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:19,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-08 07:45:19,513 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-08 07:45:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:19,514 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-08 07:45:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-08 07:45:19,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:19,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:19,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:19,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:45:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-08 07:45:19,515 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 37 [2022-04-08 07:45:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:19,515 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-08 07:45:19,515 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:45:19,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-08 07:45:20,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:20,026 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-08 07:45:20,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 07:45:20,027 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:20,027 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:20,043 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 07:45:20,232 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 07:45:20,232 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:20,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:20,232 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 5 times [2022-04-08 07:45:20,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:20,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002569774] [2022-04-08 07:45:20,311 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:20,312 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:20,312 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:20,312 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 6 times [2022-04-08 07:45:20,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:20,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165137842] [2022-04-08 07:45:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:20,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:20,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:20,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [463532297] [2022-04-08 07:45:20,327 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:45:20,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:20,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:20,336 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 07:45:20,337 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 07:45:20,406 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 07:45:20,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:20,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 07:45:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:20,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:20,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2022-04-08 07:45:20,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#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); {1574#true} is VALID [2022-04-08 07:45:20,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-08 07:45:20,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #60#return; {1574#true} is VALID [2022-04-08 07:45:20,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret5 := main(); {1574#true} is VALID [2022-04-08 07:45:20,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {1574#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; {1574#true} is VALID [2022-04-08 07:45:20,705 INFO L272 TraceCheckUtils]: 6: Hoare triple {1574#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {1574#true} is VALID [2022-04-08 07:45:20,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-08 07:45:20,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-08 07:45:20,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-08 07:45:20,706 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1574#true} {1574#true} #52#return; {1574#true} is VALID [2022-04-08 07:45:20,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {1574#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:20,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {1612#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:20,707 INFO L272 TraceCheckUtils]: 13: Hoare triple {1612#(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)); {1574#true} is VALID [2022-04-08 07:45:20,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-08 07:45:20,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-08 07:45:20,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-08 07:45:20,708 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1574#true} {1612#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:20,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {1612#(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; {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:20,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:20,709 INFO L272 TraceCheckUtils]: 20: Hoare triple {1634#(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)); {1574#true} is VALID [2022-04-08 07:45:20,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-08 07:45:20,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-08 07:45:20,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-08 07:45:20,710 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1574#true} {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {1634#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:20,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {1634#(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; {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:20,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:20,711 INFO L272 TraceCheckUtils]: 27: Hoare triple {1656#(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)); {1574#true} is VALID [2022-04-08 07:45:20,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-08 07:45:20,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-08 07:45:20,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-08 07:45:20,711 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1574#true} {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1656#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:20,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {1656#(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; {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:20,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:20,713 INFO L272 TraceCheckUtils]: 34: Hoare triple {1678#(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)); {1574#true} is VALID [2022-04-08 07:45:20,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-08 07:45:20,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-08 07:45:20,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-08 07:45:20,713 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1574#true} {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #54#return; {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:20,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {1678#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1700#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:45:20,714 INFO L272 TraceCheckUtils]: 40: Hoare triple {1700#(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)); {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:20,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1708#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:20,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {1708#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1575#false} is VALID [2022-04-08 07:45:20,715 INFO L290 TraceCheckUtils]: 43: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-04-08 07:45:20,715 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 07:45:20,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:21,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:21,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165137842] [2022-04-08 07:45:21,016 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:21,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463532297] [2022-04-08 07:45:21,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463532297] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:21,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:21,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 07:45:21,017 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:21,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002569774] [2022-04-08 07:45:21,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002569774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:21,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:21,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 07:45:21,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941846837] [2022-04-08 07:45:21,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:21,018 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-08 07:45:21,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:21,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:45:21,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:21,045 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 07:45:21,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:21,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 07:45:21,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:45:21,046 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:45:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:21,328 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-08 07:45:21,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 07:45:21,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-08 07:45:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:45:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 07:45:21,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:45:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 07:45:21,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-08 07:45:21,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:21,362 INFO L225 Difference]: With dead ends: 45 [2022-04-08 07:45:21,362 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 07:45:21,362 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:45:21,363 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:21,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:45:21,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 07:45:21,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-08 07:45:21,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:21,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:45:21,385 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:45:21,385 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:45:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:21,386 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-08 07:45:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-08 07:45:21,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:21,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:21,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-08 07:45:21,387 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-08 07:45:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:21,388 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-08 07:45:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-08 07:45:21,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:21,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:21,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:21,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:45:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-08 07:45:21,390 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 44 [2022-04-08 07:45:21,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:21,390 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-08 07:45:21,390 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:45:21,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-08 07:45:21,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-08 07:45:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 07:45:21,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:21,936 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:21,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 07:45:22,136 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 07:45:22,136 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:22,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:22,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 7 times [2022-04-08 07:45:22,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:22,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [209943851] [2022-04-08 07:45:22,224 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:22,225 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:22,225 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 8 times [2022-04-08 07:45:22,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:22,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826907497] [2022-04-08 07:45:22,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:22,234 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:22,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1552863365] [2022-04-08 07:45:22,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:45:22,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:22,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:22,235 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 07:45:22,236 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 07:45:22,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:45:22,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:22,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 07:45:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:22,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:22,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {2010#true} call ULTIMATE.init(); {2010#true} is VALID [2022-04-08 07:45:22,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {2010#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); {2010#true} is VALID [2022-04-08 07:45:22,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-08 07:45:22,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2010#true} {2010#true} #60#return; {2010#true} is VALID [2022-04-08 07:45:22,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {2010#true} call #t~ret5 := main(); {2010#true} is VALID [2022-04-08 07:45:22,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {2010#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; {2010#true} is VALID [2022-04-08 07:45:22,673 INFO L272 TraceCheckUtils]: 6: Hoare triple {2010#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {2010#true} is VALID [2022-04-08 07:45:22,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-08 07:45:22,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-08 07:45:22,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-08 07:45:22,674 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2010#true} {2010#true} #52#return; {2010#true} is VALID [2022-04-08 07:45:22,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {2010#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:22,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {2048#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:22,675 INFO L272 TraceCheckUtils]: 13: Hoare triple {2048#(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)); {2010#true} is VALID [2022-04-08 07:45:22,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-08 07:45:22,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-08 07:45:22,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-08 07:45:22,676 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2010#true} {2048#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:22,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {2048#(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; {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:22,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:22,677 INFO L272 TraceCheckUtils]: 20: Hoare triple {2070#(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)); {2010#true} is VALID [2022-04-08 07:45:22,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-08 07:45:22,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-08 07:45:22,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-08 07:45:22,677 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2010#true} {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {2070#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:22,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {2070#(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; {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:22,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:22,678 INFO L272 TraceCheckUtils]: 27: Hoare triple {2092#(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)); {2010#true} is VALID [2022-04-08 07:45:22,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-08 07:45:22,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-08 07:45:22,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-08 07:45:22,679 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2010#true} {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {2092#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:22,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {2092#(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; {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:45:22,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:45:22,680 INFO L272 TraceCheckUtils]: 34: Hoare triple {2114#(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)); {2010#true} is VALID [2022-04-08 07:45:22,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-08 07:45:22,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-08 07:45:22,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-08 07:45:22,681 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2010#true} {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #54#return; {2114#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:45:22,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {2114#(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; {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:45:22,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:45:22,682 INFO L272 TraceCheckUtils]: 41: Hoare triple {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2010#true} is VALID [2022-04-08 07:45:22,686 INFO L290 TraceCheckUtils]: 42: Hoare triple {2010#true} ~cond := #in~cond; {2010#true} is VALID [2022-04-08 07:45:22,686 INFO L290 TraceCheckUtils]: 43: Hoare triple {2010#true} assume !(0 == ~cond); {2010#true} is VALID [2022-04-08 07:45:22,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {2010#true} assume true; {2010#true} is VALID [2022-04-08 07:45:22,688 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2010#true} {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:45:22,688 INFO L290 TraceCheckUtils]: 46: Hoare triple {2136#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2158#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 07:45:22,689 INFO L272 TraceCheckUtils]: 47: Hoare triple {2158#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:22,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2166#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:22,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {2166#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2011#false} is VALID [2022-04-08 07:45:22,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {2011#false} assume !false; {2011#false} is VALID [2022-04-08 07:45:22,691 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 07:45:22,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:22,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:22,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826907497] [2022-04-08 07:45:22,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:22,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552863365] [2022-04-08 07:45:22,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552863365] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:22,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:22,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 07:45:22,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:22,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [209943851] [2022-04-08 07:45:22,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [209943851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:22,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:22,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 07:45:22,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316329266] [2022-04-08 07:45:22,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:22,981 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-08 07:45:22,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:22,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:45:23,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:23,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 07:45:23,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:23,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 07:45:23,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 07:45:23,011 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:45:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:23,357 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-08 07:45:23,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 07:45:23,358 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-08 07:45:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:45:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-08 07:45:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:45:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-08 07:45:23,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-08 07:45:23,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:23,418 INFO L225 Difference]: With dead ends: 48 [2022-04-08 07:45:23,418 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 07:45:23,418 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-08 07:45:23,419 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:23,419 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:45:23,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 07:45:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-08 07:45:23,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:23,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:45:23,447 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:45:23,447 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:45:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:23,449 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-08 07:45:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-08 07:45:23,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:23,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:23,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-08 07:45:23,450 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 43 states. [2022-04-08 07:45:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:23,452 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-08 07:45:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-08 07:45:23,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:23,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:23,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:23,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:45:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-08 07:45:23,454 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 51 [2022-04-08 07:45:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:23,454 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-08 07:45:23,454 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:45:23,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-08 07:45:23,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-08 07:45:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 07:45:23,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:23,964 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:23,985 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 07:45:24,167 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 07:45:24,167 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:24,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:24,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 9 times [2022-04-08 07:45:24,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:24,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [956157292] [2022-04-08 07:45:24,270 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:24,271 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:24,271 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:24,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 10 times [2022-04-08 07:45:24,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:24,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356563437] [2022-04-08 07:45:24,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:24,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:24,281 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:24,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [516994288] [2022-04-08 07:45:24,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:45:24,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:24,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:24,282 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 07:45:24,283 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 07:45:24,386 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:45:24,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:24,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 07:45:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:24,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:24,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2022-04-08 07:45:24,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#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); {2486#true} is VALID [2022-04-08 07:45:24,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:24,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2486#true} #60#return; {2486#true} is VALID [2022-04-08 07:45:24,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {2486#true} call #t~ret5 := main(); {2486#true} is VALID [2022-04-08 07:45:24,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#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; {2486#true} is VALID [2022-04-08 07:45:24,762 INFO L272 TraceCheckUtils]: 6: Hoare triple {2486#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {2486#true} is VALID [2022-04-08 07:45:24,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-08 07:45:24,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-08 07:45:24,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:24,762 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2486#true} {2486#true} #52#return; {2486#true} is VALID [2022-04-08 07:45:24,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {2486#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:24,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {2524#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:24,768 INFO L272 TraceCheckUtils]: 13: Hoare triple {2524#(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)); {2486#true} is VALID [2022-04-08 07:45:24,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-08 07:45:24,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-08 07:45:24,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:24,769 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2486#true} {2524#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:24,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {2524#(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; {2546#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:24,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {2546#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {2546#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:24,770 INFO L272 TraceCheckUtils]: 20: Hoare triple {2546#(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)); {2486#true} is VALID [2022-04-08 07:45:24,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-08 07:45:24,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-08 07:45:24,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:24,770 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2486#true} {2546#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {2546#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:24,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {2546#(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; {2568#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:24,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {2568#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {2568#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:24,771 INFO L272 TraceCheckUtils]: 27: Hoare triple {2568#(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)); {2486#true} is VALID [2022-04-08 07:45:24,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-08 07:45:24,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-08 07:45:24,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:24,773 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2486#true} {2568#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {2568#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:24,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {2568#(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; {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:45:24,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:45:24,774 INFO L272 TraceCheckUtils]: 34: Hoare triple {2590#(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)); {2486#true} is VALID [2022-04-08 07:45:24,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-08 07:45:24,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-08 07:45:24,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:24,774 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2486#true} {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {2590#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:45:24,775 INFO L290 TraceCheckUtils]: 39: Hoare triple {2590#(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; {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:45:24,775 INFO L290 TraceCheckUtils]: 40: Hoare triple {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:45:24,775 INFO L272 TraceCheckUtils]: 41: Hoare triple {2612#(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)); {2486#true} is VALID [2022-04-08 07:45:24,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-08 07:45:24,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-08 07:45:24,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:24,776 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2486#true} {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {2612#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:45:24,777 INFO L290 TraceCheckUtils]: 46: Hoare triple {2612#(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; {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 07:45:24,777 INFO L290 TraceCheckUtils]: 47: Hoare triple {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 07:45:24,777 INFO L272 TraceCheckUtils]: 48: Hoare triple {2634#(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)); {2486#true} is VALID [2022-04-08 07:45:24,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-08 07:45:24,777 INFO L290 TraceCheckUtils]: 50: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-08 07:45:24,777 INFO L290 TraceCheckUtils]: 51: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 07:45:24,778 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2486#true} {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #54#return; {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 07:45:24,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {2634#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2656#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 07:45:24,779 INFO L272 TraceCheckUtils]: 54: Hoare triple {2656#(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)); {2660#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:24,780 INFO L290 TraceCheckUtils]: 55: Hoare triple {2660#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2664#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:24,780 INFO L290 TraceCheckUtils]: 56: Hoare triple {2664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2487#false} is VALID [2022-04-08 07:45:24,780 INFO L290 TraceCheckUtils]: 57: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-04-08 07:45:24,780 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 07:45:24,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:25,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:25,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356563437] [2022-04-08 07:45:25,040 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:25,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516994288] [2022-04-08 07:45:25,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516994288] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:25,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:25,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 07:45:25,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:25,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [956157292] [2022-04-08 07:45:25,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [956157292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:25,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:25,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 07:45:25,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240268566] [2022-04-08 07:45:25,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:25,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-08 07:45:25,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:25,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 07:45:25,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:25,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 07:45:25,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:25,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 07:45:25,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:45:25,086 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 07:45:25,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:25,619 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-08 07:45:25,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 07:45:25,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-08 07:45:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 07:45:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-08 07:45:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 07:45:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-08 07:45:25,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-08 07:45:25,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:25,663 INFO L225 Difference]: With dead ends: 51 [2022-04-08 07:45:25,663 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 07:45:25,664 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:45:25,664 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:25,664 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 239 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:45:25,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 07:45:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 07:45:25,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:25,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:45:25,691 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:45:25,691 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:45:25,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:25,693 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-08 07:45:25,693 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-08 07:45:25,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:25,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:25,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-08 07:45:25,693 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 46 states. [2022-04-08 07:45:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:25,694 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-08 07:45:25,695 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-08 07:45:25,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:25,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:25,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:25,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:45:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-08 07:45:25,697 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 58 [2022-04-08 07:45:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:25,697 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-08 07:45:25,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 07:45:25,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 51 transitions. [2022-04-08 07:45:26,213 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 07:45:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-08 07:45:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 07:45:26,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:26,214 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:26,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 07:45:26,417 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 07:45:26,418 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:26,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:26,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 11 times [2022-04-08 07:45:26,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:26,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1939839386] [2022-04-08 07:45:26,496 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:26,496 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:26,496 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:26,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 12 times [2022-04-08 07:45:26,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:26,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836386827] [2022-04-08 07:45:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:26,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:26,506 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:26,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740658704] [2022-04-08 07:45:26,506 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:45:26,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:26,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:26,507 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 07:45:26,508 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 07:45:26,658 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 07:45:26,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:26,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 07:45:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:26,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:27,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {3002#true} call ULTIMATE.init(); {3002#true} is VALID [2022-04-08 07:45:27,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {3002#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); {3002#true} is VALID [2022-04-08 07:45:27,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:27,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3002#true} {3002#true} #60#return; {3002#true} is VALID [2022-04-08 07:45:27,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {3002#true} call #t~ret5 := main(); {3002#true} is VALID [2022-04-08 07:45:27,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {3002#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; {3002#true} is VALID [2022-04-08 07:45:27,048 INFO L272 TraceCheckUtils]: 6: Hoare triple {3002#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {3002#true} is VALID [2022-04-08 07:45:27,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:27,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:27,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:27,048 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3002#true} {3002#true} #52#return; {3002#true} is VALID [2022-04-08 07:45:27,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {3002#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:27,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {3040#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:27,049 INFO L272 TraceCheckUtils]: 13: Hoare triple {3040#(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)); {3002#true} is VALID [2022-04-08 07:45:27,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:27,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:27,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:27,050 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3002#true} {3040#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3040#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:27,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {3040#(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; {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:45:27,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:45:27,051 INFO L272 TraceCheckUtils]: 20: Hoare triple {3062#(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)); {3002#true} is VALID [2022-04-08 07:45:27,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:27,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:27,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:27,051 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3002#true} {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {3062#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:45:27,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {3062#(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; {3084#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:27,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {3084#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {3084#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:27,052 INFO L272 TraceCheckUtils]: 27: Hoare triple {3084#(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)); {3002#true} is VALID [2022-04-08 07:45:27,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:27,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:27,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:27,053 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3002#true} {3084#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {3084#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:27,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {3084#(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; {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:45:27,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:45:27,054 INFO L272 TraceCheckUtils]: 34: Hoare triple {3106#(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)); {3002#true} is VALID [2022-04-08 07:45:27,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:27,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:27,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:27,054 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3002#true} {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #54#return; {3106#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:45:27,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {3106#(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; {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:45:27,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:45:27,055 INFO L272 TraceCheckUtils]: 41: Hoare triple {3128#(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)); {3002#true} is VALID [2022-04-08 07:45:27,055 INFO L290 TraceCheckUtils]: 42: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:27,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:27,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:27,056 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3002#true} {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {3128#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:45:27,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {3128#(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; {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:27,057 INFO L290 TraceCheckUtils]: 47: Hoare triple {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:27,057 INFO L272 TraceCheckUtils]: 48: Hoare triple {3150#(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)); {3002#true} is VALID [2022-04-08 07:45:27,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:27,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:27,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:27,057 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3002#true} {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {3150#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:27,058 INFO L290 TraceCheckUtils]: 53: Hoare triple {3150#(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; {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:27,058 INFO L290 TraceCheckUtils]: 54: Hoare triple {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:27,058 INFO L272 TraceCheckUtils]: 55: Hoare triple {3172#(and (< 5 main_~k~0) (<= 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)); {3002#true} is VALID [2022-04-08 07:45:27,058 INFO L290 TraceCheckUtils]: 56: Hoare triple {3002#true} ~cond := #in~cond; {3002#true} is VALID [2022-04-08 07:45:27,058 INFO L290 TraceCheckUtils]: 57: Hoare triple {3002#true} assume !(0 == ~cond); {3002#true} is VALID [2022-04-08 07:45:27,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {3002#true} assume true; {3002#true} is VALID [2022-04-08 07:45:27,059 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3002#true} {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:27,059 INFO L290 TraceCheckUtils]: 60: Hoare triple {3172#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !(~c~0 < ~k~0); {3194#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:27,060 INFO L272 TraceCheckUtils]: 61: Hoare triple {3194#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:27,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {3198#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:27,062 INFO L290 TraceCheckUtils]: 63: Hoare triple {3202#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3003#false} is VALID [2022-04-08 07:45:27,062 INFO L290 TraceCheckUtils]: 64: Hoare triple {3003#false} assume !false; {3003#false} is VALID [2022-04-08 07:45:27,062 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 07:45:27,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:27,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:27,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836386827] [2022-04-08 07:45:27,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:27,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740658704] [2022-04-08 07:45:27,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740658704] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:27,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:27,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 07:45:27,405 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:27,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1939839386] [2022-04-08 07:45:27,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1939839386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:27,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:27,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 07:45:27,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162338706] [2022-04-08 07:45:27,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:27,407 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-08 07:45:27,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:27,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 07:45:27,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:27,444 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 07:45:27,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:27,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 07:45:27,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 07:45:27,444 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 07:45:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:28,024 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-08 07:45:28,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 07:45:28,024 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-08 07:45:28,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:28,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 07:45:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-08 07:45:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 07:45:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-08 07:45:28,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-08 07:45:28,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:28,085 INFO L225 Difference]: With dead ends: 54 [2022-04-08 07:45:28,088 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 07:45:28,088 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:45:28,092 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:28,092 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:45:28,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 07:45:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-08 07:45:28,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:28,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:45:28,121 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:45:28,121 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:45:28,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:28,123 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-08 07:45:28,123 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-08 07:45:28,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:28,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:28,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-08 07:45:28,123 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 49 states. [2022-04-08 07:45:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:28,124 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-08 07:45:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-08 07:45:28,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:28,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:28,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:28,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:45:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-04-08 07:45:28,126 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 65 [2022-04-08 07:45:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:28,126 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-04-08 07:45:28,126 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 07:45:28,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 55 transitions. [2022-04-08 07:45:28,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-08 07:45:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-08 07:45:28,661 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:28,661 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:28,667 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 07:45:28,869 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 07:45:28,870 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:28,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 13 times [2022-04-08 07:45:28,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:28,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1603068973] [2022-04-08 07:45:28,942 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:28,942 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:28,942 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:28,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1734448024, now seen corresponding path program 14 times [2022-04-08 07:45:28,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:28,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129710912] [2022-04-08 07:45:28,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:28,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:28,957 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:28,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392350814] [2022-04-08 07:45:28,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:45:28,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:28,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:28,958 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 07:45:28,959 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 07:45:29,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:45:29,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:29,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 07:45:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:29,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:29,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {3558#true} call ULTIMATE.init(); {3558#true} is VALID [2022-04-08 07:45:29,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {3558#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); {3558#true} is VALID [2022-04-08 07:45:29,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:29,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3558#true} {3558#true} #60#return; {3558#true} is VALID [2022-04-08 07:45:29,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {3558#true} call #t~ret5 := main(); {3558#true} is VALID [2022-04-08 07:45:29,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {3558#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; {3558#true} is VALID [2022-04-08 07:45:29,610 INFO L272 TraceCheckUtils]: 6: Hoare triple {3558#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {3558#true} is VALID [2022-04-08 07:45:29,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:29,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:29,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:29,611 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3558#true} {3558#true} #52#return; {3558#true} is VALID [2022-04-08 07:45:29,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {3558#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3596#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:29,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {3596#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3596#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:29,614 INFO L272 TraceCheckUtils]: 13: Hoare triple {3596#(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)); {3558#true} is VALID [2022-04-08 07:45:29,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:29,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:29,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:29,615 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3558#true} {3596#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3596#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:29,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {3596#(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; {3618#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:29,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {3618#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {3618#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:29,616 INFO L272 TraceCheckUtils]: 20: Hoare triple {3618#(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)); {3558#true} is VALID [2022-04-08 07:45:29,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:29,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:29,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:29,617 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3558#true} {3618#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {3618#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:29,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {3618#(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; {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:45:29,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:45:29,618 INFO L272 TraceCheckUtils]: 27: Hoare triple {3640#(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)); {3558#true} is VALID [2022-04-08 07:45:29,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:29,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:29,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:29,619 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3558#true} {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {3640#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:45:29,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {3640#(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; {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:45:29,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:45:29,620 INFO L272 TraceCheckUtils]: 34: Hoare triple {3662#(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)); {3558#true} is VALID [2022-04-08 07:45:29,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:29,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:29,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:29,621 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3558#true} {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #54#return; {3662#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:45:29,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {3662#(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; {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:45:29,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:45:29,622 INFO L272 TraceCheckUtils]: 41: Hoare triple {3684#(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)); {3558#true} is VALID [2022-04-08 07:45:29,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:29,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:29,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:29,623 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3558#true} {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {3684#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:45:29,624 INFO L290 TraceCheckUtils]: 46: Hoare triple {3684#(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; {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:45:29,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:45:29,624 INFO L272 TraceCheckUtils]: 48: Hoare triple {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3558#true} is VALID [2022-04-08 07:45:29,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:29,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:29,625 INFO L290 TraceCheckUtils]: 51: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:29,625 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3558#true} {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #54#return; {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:45:29,626 INFO L290 TraceCheckUtils]: 53: Hoare triple {3706#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:29,626 INFO L290 TraceCheckUtils]: 54: Hoare triple {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:29,626 INFO L272 TraceCheckUtils]: 55: Hoare triple {3728#(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)); {3558#true} is VALID [2022-04-08 07:45:29,626 INFO L290 TraceCheckUtils]: 56: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:29,626 INFO L290 TraceCheckUtils]: 57: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:29,626 INFO L290 TraceCheckUtils]: 58: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:29,627 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3558#true} {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {3728#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:29,628 INFO L290 TraceCheckUtils]: 60: Hoare triple {3728#(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; {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:45:29,628 INFO L290 TraceCheckUtils]: 61: Hoare triple {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:45:29,628 INFO L272 TraceCheckUtils]: 62: Hoare triple {3750#(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)); {3558#true} is VALID [2022-04-08 07:45:29,628 INFO L290 TraceCheckUtils]: 63: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2022-04-08 07:45:29,628 INFO L290 TraceCheckUtils]: 64: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2022-04-08 07:45:29,628 INFO L290 TraceCheckUtils]: 65: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 07:45:29,629 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3558#true} {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #54#return; {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:45:29,630 INFO L290 TraceCheckUtils]: 67: Hoare triple {3750#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3772#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:45:29,630 INFO L272 TraceCheckUtils]: 68: Hoare triple {3772#(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)); {3776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:29,631 INFO L290 TraceCheckUtils]: 69: Hoare triple {3776#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:29,631 INFO L290 TraceCheckUtils]: 70: Hoare triple {3780#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3559#false} is VALID [2022-04-08 07:45:29,631 INFO L290 TraceCheckUtils]: 71: Hoare triple {3559#false} assume !false; {3559#false} is VALID [2022-04-08 07:45:29,632 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 07:45:29,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:29,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:29,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129710912] [2022-04-08 07:45:29,940 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:29,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392350814] [2022-04-08 07:45:29,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392350814] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:29,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:29,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 07:45:29,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:29,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1603068973] [2022-04-08 07:45:29,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1603068973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:29,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:29,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 07:45:29,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140716041] [2022-04-08 07:45:29,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:29,941 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 72 [2022-04-08 07:45:29,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:29,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 07:45:29,978 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 07:45:29,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 07:45:29,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:29,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 07:45:29,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:45:29,979 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 07:45:30,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:30,717 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-08 07:45:30,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 07:45:30,717 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 72 [2022-04-08 07:45:30,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 07:45:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-08 07:45:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 07:45:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-08 07:45:30,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-08 07:45:30,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:30,769 INFO L225 Difference]: With dead ends: 57 [2022-04-08 07:45:30,769 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 07:45:30,770 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 07:45:30,770 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:30,770 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 313 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 07:45:30,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 07:45:30,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 07:45:30,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:30,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:45:30,807 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:45:30,807 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:45:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:30,808 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-08 07:45:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-08 07:45:30,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:30,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:30,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-08 07:45:30,809 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 52 states. [2022-04-08 07:45:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:30,810 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-08 07:45:30,810 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-08 07:45:30,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:30,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:30,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:30,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:45:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-08 07:45:30,813 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 72 [2022-04-08 07:45:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:30,813 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-08 07:45:30,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 07:45:30,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 59 transitions. [2022-04-08 07:45:31,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-08 07:45:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 07:45:31,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:31,375 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:31,380 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 07:45:31,579 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 07:45:31,580 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:31,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 15 times [2022-04-08 07:45:31,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:31,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [755307441] [2022-04-08 07:45:31,685 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:31,685 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:31,685 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:31,685 INFO L85 PathProgramCache]: Analyzing trace with hash 708181929, now seen corresponding path program 16 times [2022-04-08 07:45:31,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:31,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099646988] [2022-04-08 07:45:31,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:31,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:31,705 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:31,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1792748798] [2022-04-08 07:45:31,705 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:45:31,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:31,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:31,706 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 07:45:31,741 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 07:45:32,145 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:45:32,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:32,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 07:45:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:32,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:32,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {4154#true} call ULTIMATE.init(); {4154#true} is VALID [2022-04-08 07:45:32,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {4154#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); {4154#true} is VALID [2022-04-08 07:45:32,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:32,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4154#true} {4154#true} #60#return; {4154#true} is VALID [2022-04-08 07:45:32,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {4154#true} call #t~ret5 := main(); {4154#true} is VALID [2022-04-08 07:45:32,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {4154#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; {4154#true} is VALID [2022-04-08 07:45:32,592 INFO L272 TraceCheckUtils]: 6: Hoare triple {4154#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {4154#true} is VALID [2022-04-08 07:45:32,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:32,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:32,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:32,593 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4154#true} {4154#true} #52#return; {4154#true} is VALID [2022-04-08 07:45:32,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {4154#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4192#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:32,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {4192#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4192#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:32,593 INFO L272 TraceCheckUtils]: 13: Hoare triple {4192#(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)); {4154#true} is VALID [2022-04-08 07:45:32,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:32,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:32,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:32,594 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4154#true} {4192#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4192#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:32,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {4192#(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; {4214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:32,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {4214#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {4214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:32,595 INFO L272 TraceCheckUtils]: 20: Hoare triple {4214#(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)); {4154#true} is VALID [2022-04-08 07:45:32,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:32,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:32,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:32,597 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4154#true} {4214#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {4214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:32,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {4214#(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; {4236#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:32,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {4236#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {4236#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:32,598 INFO L272 TraceCheckUtils]: 27: Hoare triple {4236#(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)); {4154#true} is VALID [2022-04-08 07:45:32,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:32,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:32,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:32,598 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4154#true} {4236#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {4236#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:32,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {4236#(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; {4258#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:45:32,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {4258#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4258#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:45:32,599 INFO L272 TraceCheckUtils]: 34: Hoare triple {4258#(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)); {4154#true} is VALID [2022-04-08 07:45:32,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:32,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:32,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:32,600 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4154#true} {4258#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {4258#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:45:32,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {4258#(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; {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:32,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:32,601 INFO L272 TraceCheckUtils]: 41: Hoare triple {4280#(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)); {4154#true} is VALID [2022-04-08 07:45:32,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:32,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:32,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:32,601 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4154#true} {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {4280#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:32,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {4280#(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; {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 07:45:32,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 07:45:32,602 INFO L272 TraceCheckUtils]: 48: Hoare triple {4302#(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)); {4154#true} is VALID [2022-04-08 07:45:32,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:32,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:32,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:32,603 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4154#true} {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #54#return; {4302#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 07:45:32,603 INFO L290 TraceCheckUtils]: 53: Hoare triple {4302#(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; {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:45:32,604 INFO L290 TraceCheckUtils]: 54: Hoare triple {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:45:32,604 INFO L272 TraceCheckUtils]: 55: Hoare triple {4324#(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)); {4154#true} is VALID [2022-04-08 07:45:32,604 INFO L290 TraceCheckUtils]: 56: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:32,604 INFO L290 TraceCheckUtils]: 57: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:32,604 INFO L290 TraceCheckUtils]: 58: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:32,607 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4154#true} {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {4324#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:45:32,608 INFO L290 TraceCheckUtils]: 60: Hoare triple {4324#(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; {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:32,608 INFO L290 TraceCheckUtils]: 61: Hoare triple {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !false; {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:32,608 INFO L272 TraceCheckUtils]: 62: Hoare triple {4346#(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)); {4154#true} is VALID [2022-04-08 07:45:32,608 INFO L290 TraceCheckUtils]: 63: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:32,608 INFO L290 TraceCheckUtils]: 64: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:32,611 INFO L290 TraceCheckUtils]: 65: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:32,612 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4154#true} {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} #54#return; {4346#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:32,612 INFO L290 TraceCheckUtils]: 67: Hoare triple {4346#(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; {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 07:45:32,613 INFO L290 TraceCheckUtils]: 68: Hoare triple {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} assume !false; {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 07:45:32,613 INFO L272 TraceCheckUtils]: 69: Hoare triple {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 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)); {4154#true} is VALID [2022-04-08 07:45:32,613 INFO L290 TraceCheckUtils]: 70: Hoare triple {4154#true} ~cond := #in~cond; {4154#true} is VALID [2022-04-08 07:45:32,613 INFO L290 TraceCheckUtils]: 71: Hoare triple {4154#true} assume !(0 == ~cond); {4154#true} is VALID [2022-04-08 07:45:32,613 INFO L290 TraceCheckUtils]: 72: Hoare triple {4154#true} assume true; {4154#true} is VALID [2022-04-08 07:45:32,613 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4154#true} {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} #54#return; {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 07:45:32,614 INFO L290 TraceCheckUtils]: 74: Hoare triple {4368#(and (< 7 main_~k~0) (<= main_~c~0 8) (= (+ (- 2) main_~y~0) 6))} assume !(~c~0 < ~k~0); {4390#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} is VALID [2022-04-08 07:45:32,615 INFO L272 TraceCheckUtils]: 75: Hoare triple {4390#(and (< 7 main_~k~0) (= (+ (- 2) main_~y~0) 6) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4394#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:32,615 INFO L290 TraceCheckUtils]: 76: Hoare triple {4394#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4398#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:32,615 INFO L290 TraceCheckUtils]: 77: Hoare triple {4398#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4155#false} is VALID [2022-04-08 07:45:32,615 INFO L290 TraceCheckUtils]: 78: Hoare triple {4155#false} assume !false; {4155#false} is VALID [2022-04-08 07:45:32,616 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 07:45:32,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:33,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:33,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099646988] [2022-04-08 07:45:33,009 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:33,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792748798] [2022-04-08 07:45:33,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792748798] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:33,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:33,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 07:45:33,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:33,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [755307441] [2022-04-08 07:45:33,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [755307441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:33,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:33,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 07:45:33,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586272441] [2022-04-08 07:45:33,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:33,010 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 79 [2022-04-08 07:45:33,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:33,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 07:45:33,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:33,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 07:45:33,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:33,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 07:45:33,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:45:33,051 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 07:45:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:33,832 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-08 07:45:33,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 07:45:33,832 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 79 [2022-04-08 07:45:33,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 07:45:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-08 07:45:33,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 07:45:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-08 07:45:33,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-08 07:45:33,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:33,881 INFO L225 Difference]: With dead ends: 60 [2022-04-08 07:45:33,881 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 07:45:33,882 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 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 07:45:33,882 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:33,882 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 353 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 07:45:33,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 07:45:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-08 07:45:33,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:33,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:45:33,912 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:45:33,913 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:45:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:33,918 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-08 07:45:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-08 07:45:33,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:33,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:33,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-08 07:45:33,919 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-08 07:45:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:33,920 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-08 07:45:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-08 07:45:33,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:33,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:33,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:33,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:45:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-04-08 07:45:33,922 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 79 [2022-04-08 07:45:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:33,922 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-04-08 07:45:33,922 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 07:45:33,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 63 transitions. [2022-04-08 07:45:34,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-08 07:45:34,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 07:45:34,442 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:34,442 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:34,448 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 07:45:34,642 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 07:45:34,642 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:34,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:34,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 17 times [2022-04-08 07:45:34,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:34,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1628268870] [2022-04-08 07:45:34,716 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:34,716 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:34,716 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:34,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1649446584, now seen corresponding path program 18 times [2022-04-08 07:45:34,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:34,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277216677] [2022-04-08 07:45:34,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:34,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:34,727 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:34,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [660288883] [2022-04-08 07:45:34,727 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:45:34,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:34,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:34,728 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 07:45:34,729 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 07:45:35,079 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 07:45:35,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:35,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 07:45:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:35,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:35,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {4790#true} call ULTIMATE.init(); {4790#true} is VALID [2022-04-08 07:45:35,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {4790#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); {4790#true} is VALID [2022-04-08 07:45:35,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:35,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4790#true} {4790#true} #60#return; {4790#true} is VALID [2022-04-08 07:45:35,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {4790#true} call #t~ret5 := main(); {4790#true} is VALID [2022-04-08 07:45:35,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {4790#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; {4790#true} is VALID [2022-04-08 07:45:35,541 INFO L272 TraceCheckUtils]: 6: Hoare triple {4790#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {4790#true} is VALID [2022-04-08 07:45:35,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:35,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:35,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:35,541 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4790#true} {4790#true} #52#return; {4790#true} is VALID [2022-04-08 07:45:35,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {4790#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:35,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {4828#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:35,542 INFO L272 TraceCheckUtils]: 13: Hoare triple {4828#(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)); {4790#true} is VALID [2022-04-08 07:45:35,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:35,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:35,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:35,543 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4790#true} {4828#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:35,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {4828#(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; {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:35,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:35,543 INFO L272 TraceCheckUtils]: 20: Hoare triple {4850#(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)); {4790#true} is VALID [2022-04-08 07:45:35,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:35,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:35,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:35,544 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4790#true} {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {4850#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:35,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {4850#(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; {4872#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:35,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {4872#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {4872#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:35,545 INFO L272 TraceCheckUtils]: 27: Hoare triple {4872#(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)); {4790#true} is VALID [2022-04-08 07:45:35,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:35,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:35,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:35,545 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4790#true} {4872#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {4872#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:45:35,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {4872#(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; {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:45:35,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:45:35,546 INFO L272 TraceCheckUtils]: 34: Hoare triple {4894#(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)); {4790#true} is VALID [2022-04-08 07:45:35,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:35,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:35,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:35,548 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4790#true} {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #54#return; {4894#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:45:35,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {4894#(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; {4916#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:45:35,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {4916#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {4916#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:45:35,551 INFO L272 TraceCheckUtils]: 41: Hoare triple {4916#(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)); {4790#true} is VALID [2022-04-08 07:45:35,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:35,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:35,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:35,551 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4790#true} {4916#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {4916#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:45:35,552 INFO L290 TraceCheckUtils]: 46: Hoare triple {4916#(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; {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:35,552 INFO L290 TraceCheckUtils]: 47: Hoare triple {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:35,552 INFO L272 TraceCheckUtils]: 48: Hoare triple {4938#(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)); {4790#true} is VALID [2022-04-08 07:45:35,552 INFO L290 TraceCheckUtils]: 49: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:35,552 INFO L290 TraceCheckUtils]: 50: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:35,553 INFO L290 TraceCheckUtils]: 51: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:35,553 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4790#true} {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {4938#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:35,553 INFO L290 TraceCheckUtils]: 53: Hoare triple {4938#(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; {4960#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:35,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {4960#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !false; {4960#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:35,554 INFO L272 TraceCheckUtils]: 55: Hoare triple {4960#(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)); {4790#true} is VALID [2022-04-08 07:45:35,554 INFO L290 TraceCheckUtils]: 56: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:35,554 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:35,554 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:35,555 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4790#true} {4960#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #54#return; {4960#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:35,555 INFO L290 TraceCheckUtils]: 60: Hoare triple {4960#(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; {4982#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:45:35,555 INFO L290 TraceCheckUtils]: 61: Hoare triple {4982#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {4982#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:45:35,555 INFO L272 TraceCheckUtils]: 62: Hoare triple {4982#(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)); {4790#true} is VALID [2022-04-08 07:45:35,555 INFO L290 TraceCheckUtils]: 63: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:35,556 INFO L290 TraceCheckUtils]: 64: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:35,556 INFO L290 TraceCheckUtils]: 65: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:35,556 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4790#true} {4982#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {4982#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:45:35,556 INFO L290 TraceCheckUtils]: 67: Hoare triple {4982#(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; {5004#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:45:35,557 INFO L290 TraceCheckUtils]: 68: Hoare triple {5004#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {5004#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:45:35,557 INFO L272 TraceCheckUtils]: 69: Hoare triple {5004#(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)); {4790#true} is VALID [2022-04-08 07:45:35,557 INFO L290 TraceCheckUtils]: 70: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:35,557 INFO L290 TraceCheckUtils]: 71: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:35,557 INFO L290 TraceCheckUtils]: 72: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:35,557 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4790#true} {5004#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {5004#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:45:35,558 INFO L290 TraceCheckUtils]: 74: Hoare triple {5004#(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; {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 07:45:35,558 INFO L290 TraceCheckUtils]: 75: Hoare triple {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 07:45:35,558 INFO L272 TraceCheckUtils]: 76: Hoare triple {5026#(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)); {4790#true} is VALID [2022-04-08 07:45:35,558 INFO L290 TraceCheckUtils]: 77: Hoare triple {4790#true} ~cond := #in~cond; {4790#true} is VALID [2022-04-08 07:45:35,558 INFO L290 TraceCheckUtils]: 78: Hoare triple {4790#true} assume !(0 == ~cond); {4790#true} is VALID [2022-04-08 07:45:35,558 INFO L290 TraceCheckUtils]: 79: Hoare triple {4790#true} assume true; {4790#true} is VALID [2022-04-08 07:45:35,559 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {4790#true} {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #54#return; {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 07:45:35,560 INFO L290 TraceCheckUtils]: 81: Hoare triple {5026#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5048#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 07:45:35,561 INFO L272 TraceCheckUtils]: 82: Hoare triple {5048#(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)); {5052#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:35,561 INFO L290 TraceCheckUtils]: 83: Hoare triple {5052#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5056#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:35,561 INFO L290 TraceCheckUtils]: 84: Hoare triple {5056#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4791#false} is VALID [2022-04-08 07:45:35,561 INFO L290 TraceCheckUtils]: 85: Hoare triple {4791#false} assume !false; {4791#false} is VALID [2022-04-08 07:45:35,562 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 07:45:35,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:35,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:35,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277216677] [2022-04-08 07:45:35,864 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:35,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660288883] [2022-04-08 07:45:35,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660288883] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:35,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:35,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 07:45:35,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:35,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1628268870] [2022-04-08 07:45:35,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1628268870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:35,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:35,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 07:45:35,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765361944] [2022-04-08 07:45:35,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:35,865 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 86 [2022-04-08 07:45:35,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:35,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 07:45:35,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:35,904 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 07:45:35,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:35,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 07:45:35,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-08 07:45:35,905 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 07:45:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:36,798 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-08 07:45:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 07:45:36,798 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 86 [2022-04-08 07:45:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 07:45:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-08 07:45:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 07:45:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2022-04-08 07:45:36,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 68 transitions. [2022-04-08 07:45:36,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:36,853 INFO L225 Difference]: With dead ends: 63 [2022-04-08 07:45:36,853 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 07:45:36,853 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 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 07:45:36,853 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:36,854 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 395 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 07:45:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 07:45:36,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-08 07:45:36,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:36,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:45:36,899 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:45:36,899 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:45:36,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:36,901 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-08 07:45:36,901 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-08 07:45:36,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:36,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:36,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-08 07:45:36,901 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-08 07:45:36,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:36,902 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-08 07:45:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-08 07:45:36,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:36,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:36,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:36,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:36,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:45:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-08 07:45:36,904 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 86 [2022-04-08 07:45:36,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:36,904 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-08 07:45:36,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 07:45:36,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 67 transitions. [2022-04-08 07:45:37,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-08 07:45:37,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-08 07:45:37,447 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:37,447 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:37,451 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 07:45:37,647 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 07:45:37,648 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:37,648 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 19 times [2022-04-08 07:45:37,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:37,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1937612715] [2022-04-08 07:45:37,728 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:37,728 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:37,728 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:37,728 INFO L85 PathProgramCache]: Analyzing trace with hash -373309751, now seen corresponding path program 20 times [2022-04-08 07:45:37,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:37,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103251584] [2022-04-08 07:45:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:37,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:37,739 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:37,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1677821867] [2022-04-08 07:45:37,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:45:37,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:37,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:37,740 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 07:45:37,741 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 07:45:38,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:45:38,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:38,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 07:45:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:38,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:38,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {5466#true} call ULTIMATE.init(); {5466#true} is VALID [2022-04-08 07:45:38,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {5466#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); {5466#true} is VALID [2022-04-08 07:45:38,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-08 07:45:38,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5466#true} {5466#true} #60#return; {5466#true} is VALID [2022-04-08 07:45:38,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {5466#true} call #t~ret5 := main(); {5466#true} is VALID [2022-04-08 07:45:38,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {5466#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; {5466#true} is VALID [2022-04-08 07:45:38,875 INFO L272 TraceCheckUtils]: 6: Hoare triple {5466#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {5466#true} is VALID [2022-04-08 07:45:38,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-08 07:45:38,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-08 07:45:38,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-08 07:45:38,875 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5466#true} {5466#true} #52#return; {5466#true} is VALID [2022-04-08 07:45:38,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {5466#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5504#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:38,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {5504#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5504#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:38,876 INFO L272 TraceCheckUtils]: 13: Hoare triple {5504#(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)); {5466#true} is VALID [2022-04-08 07:45:38,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-08 07:45:38,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-08 07:45:38,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-08 07:45:38,876 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5466#true} {5504#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {5504#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:38,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {5504#(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; {5526#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:38,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {5526#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {5526#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:38,877 INFO L272 TraceCheckUtils]: 20: Hoare triple {5526#(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)); {5466#true} is VALID [2022-04-08 07:45:38,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-08 07:45:38,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-08 07:45:38,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-08 07:45:38,878 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5466#true} {5526#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {5526#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:38,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {5526#(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; {5548#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:38,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {5548#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {5548#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:38,879 INFO L272 TraceCheckUtils]: 27: Hoare triple {5548#(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)); {5466#true} is VALID [2022-04-08 07:45:38,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-08 07:45:38,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-08 07:45:38,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-08 07:45:38,879 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5466#true} {5548#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {5548#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:38,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {5548#(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; {5570#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:45:38,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {5570#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {5570#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:45:38,880 INFO L272 TraceCheckUtils]: 34: Hoare triple {5570#(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)); {5466#true} is VALID [2022-04-08 07:45:38,880 INFO L290 TraceCheckUtils]: 35: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-08 07:45:38,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-08 07:45:38,881 INFO L290 TraceCheckUtils]: 37: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-08 07:45:38,883 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5466#true} {5570#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #54#return; {5570#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:45:38,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {5570#(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; {5592#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:45:38,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {5592#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} assume !false; {5592#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:45:38,884 INFO L272 TraceCheckUtils]: 41: Hoare triple {5592#(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)); {5466#true} is VALID [2022-04-08 07:45:38,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-08 07:45:38,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-08 07:45:38,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-08 07:45:38,885 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5466#true} {5592#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} #54#return; {5592#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:45:38,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {5592#(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; {5614#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:38,886 INFO L290 TraceCheckUtils]: 47: Hoare triple {5614#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {5614#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:38,886 INFO L272 TraceCheckUtils]: 48: Hoare triple {5614#(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)); {5466#true} is VALID [2022-04-08 07:45:38,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-08 07:45:38,900 INFO L290 TraceCheckUtils]: 50: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-08 07:45:38,900 INFO L290 TraceCheckUtils]: 51: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-08 07:45:38,903 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5466#true} {5614#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {5614#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:45:38,903 INFO L290 TraceCheckUtils]: 53: Hoare triple {5614#(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; {5636#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:45:38,903 INFO L290 TraceCheckUtils]: 54: Hoare triple {5636#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {5636#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:45:38,904 INFO L272 TraceCheckUtils]: 55: Hoare triple {5636#(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)); {5466#true} is VALID [2022-04-08 07:45:38,904 INFO L290 TraceCheckUtils]: 56: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-08 07:45:38,904 INFO L290 TraceCheckUtils]: 57: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-08 07:45:38,904 INFO L290 TraceCheckUtils]: 58: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-08 07:45:38,904 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5466#true} {5636#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {5636#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:45:38,905 INFO L290 TraceCheckUtils]: 60: Hoare triple {5636#(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; {5658#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:45:38,905 INFO L290 TraceCheckUtils]: 61: Hoare triple {5658#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {5658#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:45:38,905 INFO L272 TraceCheckUtils]: 62: Hoare triple {5658#(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)); {5466#true} is VALID [2022-04-08 07:45:38,905 INFO L290 TraceCheckUtils]: 63: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-08 07:45:38,905 INFO L290 TraceCheckUtils]: 64: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-08 07:45:38,905 INFO L290 TraceCheckUtils]: 65: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-08 07:45:38,906 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5466#true} {5658#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {5658#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:45:38,906 INFO L290 TraceCheckUtils]: 67: Hoare triple {5658#(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; {5680#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:45:38,907 INFO L290 TraceCheckUtils]: 68: Hoare triple {5680#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {5680#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:45:38,907 INFO L272 TraceCheckUtils]: 69: Hoare triple {5680#(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)); {5466#true} is VALID [2022-04-08 07:45:38,907 INFO L290 TraceCheckUtils]: 70: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-08 07:45:38,907 INFO L290 TraceCheckUtils]: 71: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-08 07:45:38,907 INFO L290 TraceCheckUtils]: 72: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-08 07:45:38,907 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5466#true} {5680#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {5680#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:45:38,908 INFO L290 TraceCheckUtils]: 74: Hoare triple {5680#(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; {5702#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:45:38,908 INFO L290 TraceCheckUtils]: 75: Hoare triple {5702#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {5702#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:45:38,908 INFO L272 TraceCheckUtils]: 76: Hoare triple {5702#(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)); {5466#true} is VALID [2022-04-08 07:45:38,908 INFO L290 TraceCheckUtils]: 77: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-08 07:45:38,908 INFO L290 TraceCheckUtils]: 78: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-08 07:45:38,909 INFO L290 TraceCheckUtils]: 79: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-08 07:45:38,909 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5466#true} {5702#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #54#return; {5702#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:45:38,909 INFO L290 TraceCheckUtils]: 81: Hoare triple {5702#(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; {5724#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:45:38,910 INFO L290 TraceCheckUtils]: 82: Hoare triple {5724#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {5724#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:45:38,910 INFO L272 TraceCheckUtils]: 83: Hoare triple {5724#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5466#true} is VALID [2022-04-08 07:45:38,910 INFO L290 TraceCheckUtils]: 84: Hoare triple {5466#true} ~cond := #in~cond; {5466#true} is VALID [2022-04-08 07:45:38,910 INFO L290 TraceCheckUtils]: 85: Hoare triple {5466#true} assume !(0 == ~cond); {5466#true} is VALID [2022-04-08 07:45:38,910 INFO L290 TraceCheckUtils]: 86: Hoare triple {5466#true} assume true; {5466#true} is VALID [2022-04-08 07:45:38,911 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {5466#true} {5724#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #54#return; {5724#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:45:38,911 INFO L290 TraceCheckUtils]: 88: Hoare triple {5724#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {5746#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:45:38,912 INFO L272 TraceCheckUtils]: 89: Hoare triple {5746#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5750#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:38,912 INFO L290 TraceCheckUtils]: 90: Hoare triple {5750#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5754#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:38,913 INFO L290 TraceCheckUtils]: 91: Hoare triple {5754#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5467#false} is VALID [2022-04-08 07:45:38,913 INFO L290 TraceCheckUtils]: 92: Hoare triple {5467#false} assume !false; {5467#false} is VALID [2022-04-08 07:45:38,913 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 07:45:38,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:39,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:39,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103251584] [2022-04-08 07:45:39,169 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:39,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677821867] [2022-04-08 07:45:39,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677821867] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:39,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:39,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-08 07:45:39,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:39,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1937612715] [2022-04-08 07:45:39,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1937612715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:39,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:39,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 07:45:39,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627500057] [2022-04-08 07:45:39,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:39,170 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-08 07:45:39,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:39,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 07:45:39,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:39,213 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 07:45:39,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:39,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 07:45:39,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-08 07:45:39,214 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 07:45:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:40,339 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-08 07:45:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 07:45:40,339 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 93 [2022-04-08 07:45:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 07:45:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-08 07:45:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 07:45:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-08 07:45:40,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 72 transitions. [2022-04-08 07:45:40,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:40,403 INFO L225 Difference]: With dead ends: 66 [2022-04-08 07:45:40,403 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 07:45:40,403 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-08 07:45:40,404 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:40,404 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 07:45:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 07:45:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-08 07:45:40,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:40,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:45:40,450 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:45:40,450 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:45:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:40,451 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-08 07:45:40,452 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-08 07:45:40,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:40,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:40,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 61 states. [2022-04-08 07:45:40,452 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 61 states. [2022-04-08 07:45:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:40,453 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-08 07:45:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-08 07:45:40,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:40,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:40,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:40,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:45:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-04-08 07:45:40,456 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 93 [2022-04-08 07:45:40,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:40,457 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-04-08 07:45:40,457 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 07:45:40,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 71 transitions. [2022-04-08 07:45:41,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:41,034 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-08 07:45:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-08 07:45:41,034 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:41,034 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:41,040 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 07:45:41,235 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 07:45:41,235 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:41,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:41,235 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 21 times [2022-04-08 07:45:41,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:41,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [248699770] [2022-04-08 07:45:41,321 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:41,321 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:41,321 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:41,321 INFO L85 PathProgramCache]: Analyzing trace with hash -22647256, now seen corresponding path program 22 times [2022-04-08 07:45:41,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:41,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980916065] [2022-04-08 07:45:41,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:41,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:41,332 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:41,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109395013] [2022-04-08 07:45:41,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:45:41,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:41,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:41,333 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 07:45:41,334 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 07:45:42,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:45:42,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:42,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 07:45:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:42,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:43,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {6182#true} call ULTIMATE.init(); {6182#true} is VALID [2022-04-08 07:45:43,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {6182#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); {6182#true} is VALID [2022-04-08 07:45:43,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-08 07:45:43,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6182#true} {6182#true} #60#return; {6182#true} is VALID [2022-04-08 07:45:43,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {6182#true} call #t~ret5 := main(); {6182#true} is VALID [2022-04-08 07:45:43,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {6182#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; {6182#true} is VALID [2022-04-08 07:45:43,013 INFO L272 TraceCheckUtils]: 6: Hoare triple {6182#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {6182#true} is VALID [2022-04-08 07:45:43,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-08 07:45:43,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-08 07:45:43,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-08 07:45:43,014 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6182#true} {6182#true} #52#return; {6182#true} is VALID [2022-04-08 07:45:43,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {6182#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:43,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {6220#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:43,015 INFO L272 TraceCheckUtils]: 13: Hoare triple {6220#(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)); {6182#true} is VALID [2022-04-08 07:45:43,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-08 07:45:43,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-08 07:45:43,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-08 07:45:43,015 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6182#true} {6220#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:43,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {6220#(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; {6242#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:43,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {6242#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {6242#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:43,016 INFO L272 TraceCheckUtils]: 20: Hoare triple {6242#(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)); {6182#true} is VALID [2022-04-08 07:45:43,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-08 07:45:43,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-08 07:45:43,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-08 07:45:43,019 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6182#true} {6242#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {6242#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:45:43,019 INFO L290 TraceCheckUtils]: 25: Hoare triple {6242#(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; {6264#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:45:43,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {6264#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {6264#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:45:43,020 INFO L272 TraceCheckUtils]: 27: Hoare triple {6264#(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)); {6182#true} is VALID [2022-04-08 07:45:43,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-08 07:45:43,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-08 07:45:43,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-08 07:45:43,020 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6182#true} {6264#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {6264#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:45:43,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {6264#(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; {6286#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:45:43,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {6286#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {6286#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:45:43,021 INFO L272 TraceCheckUtils]: 34: Hoare triple {6286#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6182#true} is VALID [2022-04-08 07:45:43,021 INFO L290 TraceCheckUtils]: 35: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-08 07:45:43,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-08 07:45:43,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-08 07:45:43,022 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6182#true} {6286#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {6286#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:45:43,022 INFO L290 TraceCheckUtils]: 39: Hoare triple {6286#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6308#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-08 07:45:43,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {6308#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !false; {6308#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-08 07:45:43,023 INFO L272 TraceCheckUtils]: 41: Hoare triple {6308#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6182#true} is VALID [2022-04-08 07:45:43,023 INFO L290 TraceCheckUtils]: 42: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-08 07:45:43,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-08 07:45:43,023 INFO L290 TraceCheckUtils]: 44: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-08 07:45:43,023 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6182#true} {6308#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #54#return; {6308#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-08 07:45:43,024 INFO L290 TraceCheckUtils]: 46: Hoare triple {6308#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6330#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:45:43,024 INFO L290 TraceCheckUtils]: 47: Hoare triple {6330#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} assume !false; {6330#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:45:43,024 INFO L272 TraceCheckUtils]: 48: Hoare triple {6330#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6182#true} is VALID [2022-04-08 07:45:43,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-08 07:45:43,025 INFO L290 TraceCheckUtils]: 50: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-08 07:45:43,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-08 07:45:43,025 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6182#true} {6330#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} #54#return; {6330#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:45:43,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {6330#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6352#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:45:43,026 INFO L290 TraceCheckUtils]: 54: Hoare triple {6352#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {6352#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:45:43,026 INFO L272 TraceCheckUtils]: 55: Hoare triple {6352#(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)); {6182#true} is VALID [2022-04-08 07:45:43,026 INFO L290 TraceCheckUtils]: 56: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-08 07:45:43,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-08 07:45:43,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-08 07:45:43,037 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6182#true} {6352#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {6352#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:45:43,038 INFO L290 TraceCheckUtils]: 60: Hoare triple {6352#(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; {6374#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:43,038 INFO L290 TraceCheckUtils]: 61: Hoare triple {6374#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {6374#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:43,038 INFO L272 TraceCheckUtils]: 62: Hoare triple {6374#(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)); {6182#true} is VALID [2022-04-08 07:45:43,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-08 07:45:43,039 INFO L290 TraceCheckUtils]: 64: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-08 07:45:43,039 INFO L290 TraceCheckUtils]: 65: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-08 07:45:43,039 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6182#true} {6374#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #54#return; {6374#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:45:43,040 INFO L290 TraceCheckUtils]: 67: Hoare triple {6374#(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; {6396#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 07:45:43,040 INFO L290 TraceCheckUtils]: 68: Hoare triple {6396#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {6396#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 07:45:43,040 INFO L272 TraceCheckUtils]: 69: Hoare triple {6396#(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)); {6182#true} is VALID [2022-04-08 07:45:43,040 INFO L290 TraceCheckUtils]: 70: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-08 07:45:43,040 INFO L290 TraceCheckUtils]: 71: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-08 07:45:43,040 INFO L290 TraceCheckUtils]: 72: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-08 07:45:43,041 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6182#true} {6396#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #54#return; {6396#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 07:45:43,041 INFO L290 TraceCheckUtils]: 74: Hoare triple {6396#(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; {6418#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:45:43,042 INFO L290 TraceCheckUtils]: 75: Hoare triple {6418#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {6418#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:45:43,042 INFO L272 TraceCheckUtils]: 76: Hoare triple {6418#(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)); {6182#true} is VALID [2022-04-08 07:45:43,042 INFO L290 TraceCheckUtils]: 77: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-08 07:45:43,042 INFO L290 TraceCheckUtils]: 78: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-08 07:45:43,042 INFO L290 TraceCheckUtils]: 79: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-08 07:45:43,042 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6182#true} {6418#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {6418#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:45:43,043 INFO L290 TraceCheckUtils]: 81: Hoare triple {6418#(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; {6440#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:45:43,043 INFO L290 TraceCheckUtils]: 82: Hoare triple {6440#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {6440#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:45:43,043 INFO L272 TraceCheckUtils]: 83: Hoare triple {6440#(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)); {6182#true} is VALID [2022-04-08 07:45:43,043 INFO L290 TraceCheckUtils]: 84: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-08 07:45:43,044 INFO L290 TraceCheckUtils]: 85: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-08 07:45:43,044 INFO L290 TraceCheckUtils]: 86: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-08 07:45:43,044 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {6182#true} {6440#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {6440#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:45:43,045 INFO L290 TraceCheckUtils]: 88: Hoare triple {6440#(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; {6462#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-08 07:45:43,045 INFO L290 TraceCheckUtils]: 89: Hoare triple {6462#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !false; {6462#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-08 07:45:43,045 INFO L272 TraceCheckUtils]: 90: Hoare triple {6462#(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)); {6182#true} is VALID [2022-04-08 07:45:43,045 INFO L290 TraceCheckUtils]: 91: Hoare triple {6182#true} ~cond := #in~cond; {6182#true} is VALID [2022-04-08 07:45:43,045 INFO L290 TraceCheckUtils]: 92: Hoare triple {6182#true} assume !(0 == ~cond); {6182#true} is VALID [2022-04-08 07:45:43,045 INFO L290 TraceCheckUtils]: 93: Hoare triple {6182#true} assume true; {6182#true} is VALID [2022-04-08 07:45:43,046 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6182#true} {6462#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} #54#return; {6462#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-08 07:45:43,047 INFO L290 TraceCheckUtils]: 95: Hoare triple {6462#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !(~c~0 < ~k~0); {6484#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} is VALID [2022-04-08 07:45:43,047 INFO L272 TraceCheckUtils]: 96: Hoare triple {6484#(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)); {6488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:43,048 INFO L290 TraceCheckUtils]: 97: Hoare triple {6488#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:43,048 INFO L290 TraceCheckUtils]: 98: Hoare triple {6492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6183#false} is VALID [2022-04-08 07:45:43,048 INFO L290 TraceCheckUtils]: 99: Hoare triple {6183#false} assume !false; {6183#false} is VALID [2022-04-08 07:45:43,048 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 07:45:43,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:45:43,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:45:43,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980916065] [2022-04-08 07:45:43,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:45:43,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109395013] [2022-04-08 07:45:43,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109395013] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:45:43,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:45:43,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-08 07:45:43,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:45:43,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [248699770] [2022-04-08 07:45:43,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [248699770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:45:43,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:45:43,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 07:45:43,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167195582] [2022-04-08 07:45:43,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:45:43,365 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-08 07:45:43,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:45:43,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 07:45:43,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:43,417 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 07:45:43,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:43,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 07:45:43,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-08 07:45:43,418 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 07:45:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:44,816 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-08 07:45:44,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 07:45:44,817 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 100 [2022-04-08 07:45:44,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:45:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 07:45:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-08 07:45:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 07:45:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-08 07:45:44,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 76 transitions. [2022-04-08 07:45:44,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:44,883 INFO L225 Difference]: With dead ends: 69 [2022-04-08 07:45:44,884 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 07:45:44,884 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-08 07:45:44,884 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 07:45:44,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 485 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 07:45:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 07:45:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-08 07:45:44,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:45:44,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 07:45:44,928 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 07:45:44,928 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 07:45:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:44,929 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-08 07:45:44,929 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-08 07:45:44,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:44,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:44,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 64 states. [2022-04-08 07:45:44,930 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 64 states. [2022-04-08 07:45:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:45:44,931 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-08 07:45:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-08 07:45:44,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:45:44,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:45:44,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:45:44,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:45:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 07:45:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-04-08 07:45:44,933 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 100 [2022-04-08 07:45:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:45:44,933 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-04-08 07:45:44,933 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 07:45:44,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 75 transitions. [2022-04-08 07:45:45,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:45,477 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-08 07:45:45,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-08 07:45:45,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:45,478 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:45,490 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 07:45:45,683 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 07:45:45,684 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:45,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:45,684 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 23 times [2022-04-08 07:45:45,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:45,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1599115200] [2022-04-08 07:45:45,765 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:45:45,765 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:45:45,765 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:45:45,765 INFO L85 PathProgramCache]: Analyzing trace with hash 893158889, now seen corresponding path program 24 times [2022-04-08 07:45:45,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:45,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581720061] [2022-04-08 07:45:45,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:45,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:45,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:45,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [340395012] [2022-04-08 07:45:45,785 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:45:45,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:45,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:45,785 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 07:45:45,787 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 07:45:46,076 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 07:45:46,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:46,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-08 07:45:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:46,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:46,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {6938#true} call ULTIMATE.init(); {6938#true} is VALID [2022-04-08 07:45:46,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {6938#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); {6938#true} is VALID [2022-04-08 07:45:46,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-08 07:45:46,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6938#true} {6938#true} #60#return; {6938#true} is VALID [2022-04-08 07:45:46,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {6938#true} call #t~ret5 := main(); {6938#true} is VALID [2022-04-08 07:45:46,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {6938#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; {6938#true} is VALID [2022-04-08 07:45:46,941 INFO L272 TraceCheckUtils]: 6: Hoare triple {6938#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {6938#true} is VALID [2022-04-08 07:45:46,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-08 07:45:46,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-08 07:45:46,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-08 07:45:46,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6938#true} {6938#true} #52#return; {6938#true} is VALID [2022-04-08 07:45:46,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {6938#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6976#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:46,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {6976#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6976#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:46,942 INFO L272 TraceCheckUtils]: 13: Hoare triple {6976#(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)); {6938#true} is VALID [2022-04-08 07:45:46,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-08 07:45:46,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-08 07:45:46,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-08 07:45:46,943 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6938#true} {6976#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {6976#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:45:46,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {6976#(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; {6998#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:46,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {6998#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {6998#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:46,944 INFO L272 TraceCheckUtils]: 20: Hoare triple {6998#(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)); {6938#true} is VALID [2022-04-08 07:45:46,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-08 07:45:46,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-08 07:45:46,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-08 07:45:46,945 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6938#true} {6998#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {6998#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:45:46,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {6998#(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; {7020#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:45:46,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {7020#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {7020#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:45:46,945 INFO L272 TraceCheckUtils]: 27: Hoare triple {7020#(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)); {6938#true} is VALID [2022-04-08 07:45:46,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-08 07:45:46,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-08 07:45:46,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-08 07:45:46,946 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6938#true} {7020#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {7020#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:45:46,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {7020#(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; {7042#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:45:46,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {7042#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {7042#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:45:46,947 INFO L272 TraceCheckUtils]: 34: Hoare triple {7042#(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)); {6938#true} is VALID [2022-04-08 07:45:46,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-08 07:45:46,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-08 07:45:46,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-08 07:45:46,948 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6938#true} {7042#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {7042#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:45:46,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {7042#(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; {7064#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-08 07:45:46,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {7064#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} assume !false; {7064#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-08 07:45:46,948 INFO L272 TraceCheckUtils]: 41: Hoare triple {7064#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 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)); {6938#true} is VALID [2022-04-08 07:45:46,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-08 07:45:46,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-08 07:45:46,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-08 07:45:46,949 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6938#true} {7064#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} #54#return; {7064#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-08 07:45:46,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {7064#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 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; {7086#(and (= (+ main_~y~0 (- 4)) 1) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:46,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {7086#(and (= (+ main_~y~0 (- 4)) 1) (= 3 (+ (- 2) main_~c~0)))} assume !false; {7086#(and (= (+ main_~y~0 (- 4)) 1) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:46,950 INFO L272 TraceCheckUtils]: 48: Hoare triple {7086#(and (= (+ main_~y~0 (- 4)) 1) (= 3 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6938#true} is VALID [2022-04-08 07:45:46,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-08 07:45:46,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-08 07:45:46,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-08 07:45:46,951 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6938#true} {7086#(and (= (+ main_~y~0 (- 4)) 1) (= 3 (+ (- 2) main_~c~0)))} #54#return; {7086#(and (= (+ main_~y~0 (- 4)) 1) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:45:46,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {7086#(and (= (+ main_~y~0 (- 4)) 1) (= 3 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7108#(and (= main_~c~0 6) (< 5 main_~k~0) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-08 07:45:46,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {7108#(and (= main_~c~0 6) (< 5 main_~k~0) (= (+ main_~y~0 (- 5)) 1))} assume !false; {7108#(and (= main_~c~0 6) (< 5 main_~k~0) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-08 07:45:46,951 INFO L272 TraceCheckUtils]: 55: Hoare triple {7108#(and (= main_~c~0 6) (< 5 main_~k~0) (= (+ 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)); {6938#true} is VALID [2022-04-08 07:45:46,952 INFO L290 TraceCheckUtils]: 56: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-08 07:45:46,952 INFO L290 TraceCheckUtils]: 57: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-08 07:45:46,952 INFO L290 TraceCheckUtils]: 58: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-08 07:45:46,952 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6938#true} {7108#(and (= main_~c~0 6) (< 5 main_~k~0) (= (+ main_~y~0 (- 5)) 1))} #54#return; {7108#(and (= main_~c~0 6) (< 5 main_~k~0) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-08 07:45:46,953 INFO L290 TraceCheckUtils]: 60: Hoare triple {7108#(and (= main_~c~0 6) (< 5 main_~k~0) (= (+ 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; {7130#(and (= 7 main_~c~0) (< 5 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-08 07:45:46,953 INFO L290 TraceCheckUtils]: 61: Hoare triple {7130#(and (= 7 main_~c~0) (< 5 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} assume !false; {7130#(and (= 7 main_~c~0) (< 5 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-08 07:45:46,953 INFO L272 TraceCheckUtils]: 62: Hoare triple {7130#(and (= 7 main_~c~0) (< 5 main_~k~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)); {6938#true} is VALID [2022-04-08 07:45:46,953 INFO L290 TraceCheckUtils]: 63: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-08 07:45:46,953 INFO L290 TraceCheckUtils]: 64: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-08 07:45:46,953 INFO L290 TraceCheckUtils]: 65: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-08 07:45:46,954 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6938#true} {7130#(and (= 7 main_~c~0) (< 5 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} #54#return; {7130#(and (= 7 main_~c~0) (< 5 main_~k~0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-08 07:45:46,954 INFO L290 TraceCheckUtils]: 67: Hoare triple {7130#(and (= 7 main_~c~0) (< 5 main_~k~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; {7152#(and (= (+ main_~y~0 (- 7)) 1) (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0))} is VALID [2022-04-08 07:45:46,955 INFO L290 TraceCheckUtils]: 68: Hoare triple {7152#(and (= (+ main_~y~0 (- 7)) 1) (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0))} assume !false; {7152#(and (= (+ main_~y~0 (- 7)) 1) (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0))} is VALID [2022-04-08 07:45:46,955 INFO L272 TraceCheckUtils]: 69: Hoare triple {7152#(and (= (+ main_~y~0 (- 7)) 1) (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6938#true} is VALID [2022-04-08 07:45:46,955 INFO L290 TraceCheckUtils]: 70: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-08 07:45:46,955 INFO L290 TraceCheckUtils]: 71: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-08 07:45:46,955 INFO L290 TraceCheckUtils]: 72: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-08 07:45:46,955 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6938#true} {7152#(and (= (+ main_~y~0 (- 7)) 1) (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0))} #54#return; {7152#(and (= (+ main_~y~0 (- 7)) 1) (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0))} is VALID [2022-04-08 07:45:46,956 INFO L290 TraceCheckUtils]: 74: Hoare triple {7152#(and (= (+ main_~y~0 (- 7)) 1) (= 7 (+ (- 1) main_~c~0)) (< 5 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7174#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-08 07:45:46,956 INFO L290 TraceCheckUtils]: 75: Hoare triple {7174#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} assume !false; {7174#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-08 07:45:46,956 INFO L272 TraceCheckUtils]: 76: Hoare triple {7174#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6938#true} is VALID [2022-04-08 07:45:46,956 INFO L290 TraceCheckUtils]: 77: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-08 07:45:46,956 INFO L290 TraceCheckUtils]: 78: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-08 07:45:46,957 INFO L290 TraceCheckUtils]: 79: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-08 07:45:46,957 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6938#true} {7174#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} #54#return; {7174#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-08 07:45:46,957 INFO L290 TraceCheckUtils]: 81: Hoare triple {7174#(and (= main_~y~0 9) (< 5 main_~k~0) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7196#(and (= main_~y~0 10) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:45:46,958 INFO L290 TraceCheckUtils]: 82: Hoare triple {7196#(and (= main_~y~0 10) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} assume !false; {7196#(and (= main_~y~0 10) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:45:46,958 INFO L272 TraceCheckUtils]: 83: Hoare triple {7196#(and (= main_~y~0 10) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6938#true} is VALID [2022-04-08 07:45:46,958 INFO L290 TraceCheckUtils]: 84: Hoare triple {6938#true} ~cond := #in~cond; {6938#true} is VALID [2022-04-08 07:45:46,958 INFO L290 TraceCheckUtils]: 85: Hoare triple {6938#true} assume !(0 == ~cond); {6938#true} is VALID [2022-04-08 07:45:46,958 INFO L290 TraceCheckUtils]: 86: Hoare triple {6938#true} assume true; {6938#true} is VALID [2022-04-08 07:45:46,959 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {6938#true} {7196#(and (= main_~y~0 10) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} #54#return; {7196#(and (= main_~y~0 10) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:45:46,959 INFO L290 TraceCheckUtils]: 88: Hoare triple {7196#(and (= main_~y~0 10) (< 5 main_~k~0) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7218#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 07:45:46,959 INFO L290 TraceCheckUtils]: 89: Hoare triple {7218#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} assume !false; {7218#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} is VALID [2022-04-08 07:45:46,959 INFO L272 TraceCheckUtils]: 90: Hoare triple {7218#(and (< 5 main_~k~0) (= 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)); {6938#true} is VALID [2022-04-08 07:45:46,960 INFO L290 TraceCheckUtils]: 91: Hoare triple {6938#true} ~cond := #in~cond; {7228#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:46,960 INFO L290 TraceCheckUtils]: 92: Hoare triple {7228#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:45:46,960 INFO L290 TraceCheckUtils]: 93: Hoare triple {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:45:46,961 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} {7218#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11))} #54#return; {7239#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} is VALID [2022-04-08 07:45:46,962 INFO L290 TraceCheckUtils]: 95: Hoare triple {7239#(and (< 5 main_~k~0) (= 9 (+ (- 2) main_~c~0)) (= main_~y~0 11) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7243#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 11 main_~k~0))} is VALID [2022-04-08 07:45:46,963 INFO L290 TraceCheckUtils]: 96: Hoare triple {7243#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 11 main_~k~0))} assume !false; {7243#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 11 main_~k~0))} is VALID [2022-04-08 07:45:46,963 INFO L272 TraceCheckUtils]: 97: Hoare triple {7243#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 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)); {6938#true} is VALID [2022-04-08 07:45:46,963 INFO L290 TraceCheckUtils]: 98: Hoare triple {6938#true} ~cond := #in~cond; {7228#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:46,964 INFO L290 TraceCheckUtils]: 99: Hoare triple {7228#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:45:46,964 INFO L290 TraceCheckUtils]: 100: Hoare triple {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:45:46,965 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7232#(not (= |__VERIFIER_assert_#in~cond| 0))} {7243#(and (= main_~y~0 12) (<= main_~c~0 12) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0) (< 11 main_~k~0))} #54#return; {7262#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 07:45:46,965 INFO L290 TraceCheckUtils]: 102: Hoare triple {7262#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {7266#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-08 07:45:46,966 INFO L272 TraceCheckUtils]: 103: Hoare triple {7266#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:45:46,966 INFO L290 TraceCheckUtils]: 104: Hoare triple {7270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:45:46,967 INFO L290 TraceCheckUtils]: 105: Hoare triple {7274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6939#false} is VALID [2022-04-08 07:45:46,967 INFO L290 TraceCheckUtils]: 106: Hoare triple {6939#false} assume !false; {6939#false} is VALID [2022-04-08 07:45:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 90 proven. 236 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-04-08 07:45:46,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:46:05,379 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse2 (* 13 c_main_~y~0 c_main_~y~0)) (.cse3 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (or (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 c_main_~k~0) (* .cse0 .cse0))) (not (<= (+ (* c_main_~y~0 c_main_~y~0 c_main_~y~0) c_main_~x~0 1 (* 3 (* c_main_~y~0 c_main_~y~0))) (div (+ .cse1 .cse2 4 .cse3) 4))) (not (= 0 (mod (+ .cse1 .cse2 .cse3) 4))) (< (+ c_main_~c~0 1) c_main_~k~0) (not (< c_main_~c~0 c_main_~k~0)))) is different from false [2022-04-08 07:46:09,516 WARN L833 $PredicateComparison]: unable to prove that (or (= (+ (* c_main_~y~0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) (* c_main_~y~0 c_main_~y~0) 1)) (<= c_main_~k~0 c_main_~c~0) (not (= 0 (mod (+ (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 13 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4))) (< (+ c_main_~c~0 1) c_main_~k~0)) is different from false [2022-04-08 07:46:15,571 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~y~0 1))) (or (= (+ (* .cse0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) 3 (* .cse0 .cse0))) (< (+ 2 c_main_~c~0) c_main_~k~0) (<= c_main_~k~0 (+ c_main_~c~0 1)) (not (= (mod (+ (* 6 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 .cse0) (* 13 .cse0 .cse0)) 4) 0)))) is different from false [2022-04-08 07:47:20,146 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 c_main_~y~0))) (or (not (= (mod (+ (* .cse0 .cse0 .cse0 6) (* .cse0 .cse0 13) (* .cse0 .cse0 .cse0 .cse0)) 4) 0)) (= (+ (* .cse0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) 9 (* .cse0 .cse0))) (<= c_main_~k~0 (+ c_main_~c~0 4)) (< (+ 5 c_main_~c~0) c_main_~k~0))) is different from false [2022-04-08 07:47:28,228 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 5 c_main_~y~0))) (or (< (+ 6 c_main_~c~0) c_main_~k~0) (= (+ (* .cse0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) (* .cse0 .cse0) 11)) (not (= (mod (+ (* .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 13) (* 6 .cse0 .cse0 .cse0)) 4) 0)) (<= c_main_~k~0 (+ 5 c_main_~c~0)))) is different from false [2022-04-08 07:47:37,907 WARN L833 $PredicateComparison]: unable to prove that (or (not (= (mod (let ((.cse0 (+ 6 c_main_~y~0))) (+ (* .cse0 .cse0 .cse0 6) (* .cse0 .cse0 13) (* .cse0 .cse0 .cse0 .cse0))) 4) 0)) (forall ((main_~k~0 Int)) (or (<= main_~k~0 (+ 6 c_main_~c~0)) (< (+ 7 c_main_~c~0) main_~k~0) (= (+ (* 7 main_~k~0) (* main_~k~0 c_main_~y~0)) (+ (* 14 c_main_~y~0) 49 (* c_main_~y~0 c_main_~y~0)))))) is different from false [2022-04-08 07:47:39,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:47:39,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581720061] [2022-04-08 07:47:39,966 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:47:39,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340395012] [2022-04-08 07:47:39,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340395012] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:47:39,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:47:39,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-08 07:47:39,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:47:39,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1599115200] [2022-04-08 07:47:39,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1599115200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:47:39,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:47:39,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 07:47:39,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691985374] [2022-04-08 07:47:39,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:47:39,967 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-08 07:47:39,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:47:39,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 07:47:40,019 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 07:47:40,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 07:47:40,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:47:40,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 07:47:40,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=653, Unknown=15, NotChecked=342, Total=1122 [2022-04-08 07:47:40,020 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 07:47:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:47:42,016 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-08 07:47:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 07:47:42,016 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 107 [2022-04-08 07:47:42,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:47:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 07:47:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-08 07:47:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 07:47:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-08 07:47:42,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 80 transitions. [2022-04-08 07:47:42,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:47:42,083 INFO L225 Difference]: With dead ends: 72 [2022-04-08 07:47:42,083 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 07:47:42,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 56.7s TimeCoverageRelationStatistics Valid=133, Invalid=806, Unknown=15, NotChecked=378, Total=1332 [2022-04-08 07:47:42,084 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 8 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 07:47:42,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 515 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 07:47:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 07:47:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-08 07:47:42,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:47:42,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 07:47:42,149 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 07:47:42,149 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 07:47:42,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:47:42,150 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-08 07:47:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-08 07:47:42,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:47:42,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:47:42,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-08 07:47:42,151 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-08 07:47:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:47:42,152 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-08 07:47:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-08 07:47:42,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:47:42,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:47:42,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:47:42,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:47:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 07:47:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-04-08 07:47:42,154 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 107 [2022-04-08 07:47:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:47:42,154 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-04-08 07:47:42,155 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 15 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 07:47:42,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 79 transitions. [2022-04-08 07:47:42,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:47:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-08 07:47:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-08 07:47:42,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:47:42,691 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:47:42,698 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 07:47:42,895 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 07:47:42,896 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:47:42,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:47:42,897 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 25 times [2022-04-08 07:47:42,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:47:42,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1047221793] [2022-04-08 07:47:42,970 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:47:42,970 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:47:42,970 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:47:42,970 INFO L85 PathProgramCache]: Analyzing trace with hash 363946760, now seen corresponding path program 26 times [2022-04-08 07:47:42,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:47:42,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588943625] [2022-04-08 07:47:42,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:47:42,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:47:42,991 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:47:42,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [720499701] [2022-04-08 07:47:42,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:47:42,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:47:42,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:47:42,992 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 07:47:42,993 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 07:47:43,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:47:43,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:47:43,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-08 07:47:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:47:43,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:47:44,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {7875#true} call ULTIMATE.init(); {7875#true} is VALID [2022-04-08 07:47:44,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {7875#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); {7875#true} is VALID [2022-04-08 07:47:44,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7875#true} {7875#true} #60#return; {7875#true} is VALID [2022-04-08 07:47:44,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {7875#true} call #t~ret5 := main(); {7875#true} is VALID [2022-04-08 07:47:44,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {7875#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; {7875#true} is VALID [2022-04-08 07:47:44,376 INFO L272 TraceCheckUtils]: 6: Hoare triple {7875#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {7875#true} is VALID [2022-04-08 07:47:44,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-08 07:47:44,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-08 07:47:44,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,376 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7875#true} {7875#true} #52#return; {7875#true} is VALID [2022-04-08 07:47:44,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {7875#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7913#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:47:44,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {7913#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7913#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:47:44,377 INFO L272 TraceCheckUtils]: 13: Hoare triple {7913#(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)); {7875#true} is VALID [2022-04-08 07:47:44,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-08 07:47:44,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-08 07:47:44,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,377 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7875#true} {7913#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {7913#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:47:44,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {7913#(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; {7935#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:47:44,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {7935#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7935#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:47:44,378 INFO L272 TraceCheckUtils]: 20: Hoare triple {7935#(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)); {7875#true} is VALID [2022-04-08 07:47:44,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-08 07:47:44,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-08 07:47:44,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,379 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7875#true} {7935#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {7935#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:47:44,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {7935#(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; {7957#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:47:44,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {7957#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {7957#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:47:44,379 INFO L272 TraceCheckUtils]: 27: Hoare triple {7957#(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)); {7875#true} is VALID [2022-04-08 07:47:44,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-08 07:47:44,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-08 07:47:44,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,380 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7875#true} {7957#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {7957#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:47:44,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {7957#(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; {7979#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:47:44,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {7979#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {7979#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:47:44,381 INFO L272 TraceCheckUtils]: 34: Hoare triple {7979#(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)); {7875#true} is VALID [2022-04-08 07:47:44,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-08 07:47:44,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-08 07:47:44,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,381 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7875#true} {7979#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {7979#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:47:44,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {7979#(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; {8001#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:47:44,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {8001#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {8001#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:47:44,382 INFO L272 TraceCheckUtils]: 41: Hoare triple {8001#(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)); {7875#true} is VALID [2022-04-08 07:47:44,382 INFO L290 TraceCheckUtils]: 42: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-08 07:47:44,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-08 07:47:44,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,383 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7875#true} {8001#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {8001#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:47:44,383 INFO L290 TraceCheckUtils]: 46: Hoare triple {8001#(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; {8023#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:47:44,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {8023#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {8023#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:47:44,383 INFO L272 TraceCheckUtils]: 48: Hoare triple {8023#(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)); {7875#true} is VALID [2022-04-08 07:47:44,384 INFO L290 TraceCheckUtils]: 49: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-08 07:47:44,384 INFO L290 TraceCheckUtils]: 50: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-08 07:47:44,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,384 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7875#true} {8023#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {8023#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:47:44,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {8023#(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; {8045#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:47:44,385 INFO L290 TraceCheckUtils]: 54: Hoare triple {8045#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {8045#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:47:44,385 INFO L272 TraceCheckUtils]: 55: Hoare triple {8045#(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)); {7875#true} is VALID [2022-04-08 07:47:44,385 INFO L290 TraceCheckUtils]: 56: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-08 07:47:44,385 INFO L290 TraceCheckUtils]: 57: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-08 07:47:44,385 INFO L290 TraceCheckUtils]: 58: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,385 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7875#true} {8045#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #54#return; {8045#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:47:44,386 INFO L290 TraceCheckUtils]: 60: Hoare triple {8045#(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; {8067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:47:44,386 INFO L290 TraceCheckUtils]: 61: Hoare triple {8067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {8067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:47:44,386 INFO L272 TraceCheckUtils]: 62: Hoare triple {8067#(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)); {7875#true} is VALID [2022-04-08 07:47:44,386 INFO L290 TraceCheckUtils]: 63: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-08 07:47:44,386 INFO L290 TraceCheckUtils]: 64: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-08 07:47:44,386 INFO L290 TraceCheckUtils]: 65: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,387 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7875#true} {8067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #54#return; {8067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:47:44,387 INFO L290 TraceCheckUtils]: 67: Hoare triple {8067#(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; {8089#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:47:44,388 INFO L290 TraceCheckUtils]: 68: Hoare triple {8089#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {8089#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:47:44,388 INFO L272 TraceCheckUtils]: 69: Hoare triple {8089#(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)); {7875#true} is VALID [2022-04-08 07:47:44,388 INFO L290 TraceCheckUtils]: 70: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-08 07:47:44,388 INFO L290 TraceCheckUtils]: 71: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-08 07:47:44,388 INFO L290 TraceCheckUtils]: 72: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,388 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7875#true} {8089#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {8089#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:47:44,389 INFO L290 TraceCheckUtils]: 74: Hoare triple {8089#(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; {8111#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:47:44,389 INFO L290 TraceCheckUtils]: 75: Hoare triple {8111#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {8111#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:47:44,389 INFO L272 TraceCheckUtils]: 76: Hoare triple {8111#(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)); {7875#true} is VALID [2022-04-08 07:47:44,389 INFO L290 TraceCheckUtils]: 77: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-08 07:47:44,389 INFO L290 TraceCheckUtils]: 78: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-08 07:47:44,389 INFO L290 TraceCheckUtils]: 79: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,390 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7875#true} {8111#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #54#return; {8111#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:47:44,391 INFO L290 TraceCheckUtils]: 81: Hoare triple {8111#(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; {8133#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:47:44,391 INFO L290 TraceCheckUtils]: 82: Hoare triple {8133#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {8133#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:47:44,391 INFO L272 TraceCheckUtils]: 83: Hoare triple {8133#(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)); {7875#true} is VALID [2022-04-08 07:47:44,391 INFO L290 TraceCheckUtils]: 84: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-08 07:47:44,391 INFO L290 TraceCheckUtils]: 85: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-08 07:47:44,391 INFO L290 TraceCheckUtils]: 86: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,392 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {7875#true} {8133#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {8133#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:47:44,392 INFO L290 TraceCheckUtils]: 88: Hoare triple {8133#(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; {8155#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:47:44,392 INFO L290 TraceCheckUtils]: 89: Hoare triple {8155#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {8155#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:47:44,392 INFO L272 TraceCheckUtils]: 90: Hoare triple {8155#(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)); {7875#true} is VALID [2022-04-08 07:47:44,392 INFO L290 TraceCheckUtils]: 91: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-08 07:47:44,393 INFO L290 TraceCheckUtils]: 92: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-08 07:47:44,393 INFO L290 TraceCheckUtils]: 93: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,393 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7875#true} {8155#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {8155#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:47:44,393 INFO L290 TraceCheckUtils]: 95: Hoare triple {8155#(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; {8177#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:47:44,394 INFO L290 TraceCheckUtils]: 96: Hoare triple {8177#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} assume !false; {8177#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:47:44,394 INFO L272 TraceCheckUtils]: 97: Hoare triple {8177#(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)); {7875#true} is VALID [2022-04-08 07:47:44,394 INFO L290 TraceCheckUtils]: 98: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-08 07:47:44,394 INFO L290 TraceCheckUtils]: 99: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-08 07:47:44,394 INFO L290 TraceCheckUtils]: 100: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,394 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {7875#true} {8177#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} #54#return; {8177#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:47:44,395 INFO L290 TraceCheckUtils]: 102: Hoare triple {8177#(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; {8199#(and (< 12 main_~k~0) (<= main_~c~0 13) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-08 07:47:44,395 INFO L290 TraceCheckUtils]: 103: Hoare triple {8199#(and (< 12 main_~k~0) (<= main_~c~0 13) (= (+ (- 2) main_~y~0) 11))} assume !false; {8199#(and (< 12 main_~k~0) (<= main_~c~0 13) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-08 07:47:44,395 INFO L272 TraceCheckUtils]: 104: Hoare triple {8199#(and (< 12 main_~k~0) (<= main_~c~0 13) (= (+ (- 2) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7875#true} is VALID [2022-04-08 07:47:44,395 INFO L290 TraceCheckUtils]: 105: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-04-08 07:47:44,395 INFO L290 TraceCheckUtils]: 106: Hoare triple {7875#true} assume !(0 == ~cond); {7875#true} is VALID [2022-04-08 07:47:44,395 INFO L290 TraceCheckUtils]: 107: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-04-08 07:47:44,396 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {7875#true} {8199#(and (< 12 main_~k~0) (<= main_~c~0 13) (= (+ (- 2) main_~y~0) 11))} #54#return; {8199#(and (< 12 main_~k~0) (<= main_~c~0 13) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-08 07:47:44,396 INFO L290 TraceCheckUtils]: 109: Hoare triple {8199#(and (< 12 main_~k~0) (<= main_~c~0 13) (= (+ (- 2) main_~y~0) 11))} assume !(~c~0 < ~k~0); {8221#(and (< 12 main_~k~0) (<= main_~k~0 13) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-08 07:47:44,397 INFO L272 TraceCheckUtils]: 110: Hoare triple {8221#(and (< 12 main_~k~0) (<= main_~k~0 13) (= (+ (- 2) main_~y~0) 11))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:47:44,397 INFO L290 TraceCheckUtils]: 111: Hoare triple {8225#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8229#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:47:44,397 INFO L290 TraceCheckUtils]: 112: Hoare triple {8229#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7876#false} is VALID [2022-04-08 07:47:44,398 INFO L290 TraceCheckUtils]: 113: Hoare triple {7876#false} assume !false; {7876#false} is VALID [2022-04-08 07:47:44,398 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 07:47:44,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:47:44,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:47:44,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588943625] [2022-04-08 07:47:44,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:47:44,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720499701] [2022-04-08 07:47:44,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720499701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:47:44,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:47:44,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-08 07:47:44,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:47:44,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1047221793] [2022-04-08 07:47:44,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1047221793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:47:44,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:47:44,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 07:47:44,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393026555] [2022-04-08 07:47:44,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:47:44,699 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 114 [2022-04-08 07:47:44,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:47:44,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 07:47:44,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:47:44,758 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 07:47:44,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:47:44,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 07:47:44,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-08 07:47:44,759 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 07:47:46,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:47:46,464 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-04-08 07:47:46,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 07:47:46,464 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 114 [2022-04-08 07:47:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:47:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 07:47:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 84 transitions. [2022-04-08 07:47:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 07:47:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 84 transitions. [2022-04-08 07:47:46,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 84 transitions. [2022-04-08 07:47:46,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:47:46,532 INFO L225 Difference]: With dead ends: 75 [2022-04-08 07:47:46,532 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 07:47:46,532 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-04-08 07:47:46,532 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 07:47:46,532 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 583 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 07:47:46,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 07:47:46,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 07:47:46,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:47:46,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 07:47:46,584 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 07:47:46,584 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 07:47:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:47:46,586 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-08 07:47:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-08 07:47:46,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:47:46,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:47:46,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 70 states. [2022-04-08 07:47:46,587 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 70 states. [2022-04-08 07:47:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:47:46,589 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-08 07:47:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-08 07:47:46,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:47:46,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:47:46,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:47:46,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:47:46,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 07:47:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-04-08 07:47:46,590 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 114 [2022-04-08 07:47:46,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:47:46,591 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-04-08 07:47:46,591 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 16 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 07:47:46,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 83 transitions. [2022-04-08 07:47:47,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:47:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-08 07:47:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-08 07:47:47,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:47:47,134 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:47:47,138 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 07:47:47,334 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 07:47:47,334 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:47:47,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:47:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 27 times [2022-04-08 07:47:47,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:47:47,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1936634868] [2022-04-08 07:47:47,405 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:47:47,405 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:47:47,405 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:47:47,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2101455607, now seen corresponding path program 28 times [2022-04-08 07:47:47,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:47:47,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804918742] [2022-04-08 07:47:47,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:47:47,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:47:47,418 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:47:47,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311565394] [2022-04-08 07:47:47,418 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:47:47,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:47:47,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:47:47,419 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 07:47:47,419 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 07:47:48,292 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:47:48,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:47:48,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-08 07:47:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:47:48,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:47:48,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {8711#true} call ULTIMATE.init(); {8711#true} is VALID [2022-04-08 07:47:48,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {8711#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); {8711#true} is VALID [2022-04-08 07:47:48,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8711#true} {8711#true} #60#return; {8711#true} is VALID [2022-04-08 07:47:48,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {8711#true} call #t~ret5 := main(); {8711#true} is VALID [2022-04-08 07:47:48,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {8711#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; {8711#true} is VALID [2022-04-08 07:47:48,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {8711#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {8711#true} is VALID [2022-04-08 07:47:48,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,914 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8711#true} {8711#true} #52#return; {8711#true} is VALID [2022-04-08 07:47:48,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {8711#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8749#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:47:48,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {8749#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {8749#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:47:48,915 INFO L272 TraceCheckUtils]: 13: Hoare triple {8749#(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)); {8711#true} is VALID [2022-04-08 07:47:48,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,916 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8711#true} {8749#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {8749#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:47:48,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {8749#(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; {8771#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:47:48,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {8771#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {8771#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:47:48,917 INFO L272 TraceCheckUtils]: 20: Hoare triple {8771#(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)); {8711#true} is VALID [2022-04-08 07:47:48,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,917 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8711#true} {8771#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {8771#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:47:48,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {8771#(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; {8793#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:47:48,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {8793#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {8793#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:47:48,918 INFO L272 TraceCheckUtils]: 27: Hoare triple {8793#(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)); {8711#true} is VALID [2022-04-08 07:47:48,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,919 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8711#true} {8793#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {8793#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:47:48,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {8793#(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; {8815#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:47:48,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {8815#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {8815#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:47:48,920 INFO L272 TraceCheckUtils]: 34: Hoare triple {8815#(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)); {8711#true} is VALID [2022-04-08 07:47:48,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,920 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8711#true} {8815#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {8815#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:47:48,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {8815#(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; {8837#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:47:48,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {8837#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {8837#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:47:48,921 INFO L272 TraceCheckUtils]: 41: Hoare triple {8837#(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)); {8711#true} is VALID [2022-04-08 07:47:48,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,921 INFO L290 TraceCheckUtils]: 43: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,922 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8711#true} {8837#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {8837#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:47:48,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {8837#(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; {8859#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:47:48,922 INFO L290 TraceCheckUtils]: 47: Hoare triple {8859#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {8859#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:47:48,923 INFO L272 TraceCheckUtils]: 48: Hoare triple {8859#(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)); {8711#true} is VALID [2022-04-08 07:47:48,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,923 INFO L290 TraceCheckUtils]: 51: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,923 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8711#true} {8859#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {8859#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:47:48,923 INFO L290 TraceCheckUtils]: 53: Hoare triple {8859#(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; {8881#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:47:48,924 INFO L290 TraceCheckUtils]: 54: Hoare triple {8881#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {8881#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:47:48,924 INFO L272 TraceCheckUtils]: 55: Hoare triple {8881#(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)); {8711#true} is VALID [2022-04-08 07:47:48,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,925 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8711#true} {8881#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {8881#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:47:48,925 INFO L290 TraceCheckUtils]: 60: Hoare triple {8881#(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; {8903#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:47:48,925 INFO L290 TraceCheckUtils]: 61: Hoare triple {8903#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} assume !false; {8903#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:47:48,925 INFO L272 TraceCheckUtils]: 62: Hoare triple {8903#(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)); {8711#true} is VALID [2022-04-08 07:47:48,925 INFO L290 TraceCheckUtils]: 63: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,926 INFO L290 TraceCheckUtils]: 64: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,926 INFO L290 TraceCheckUtils]: 65: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,926 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8711#true} {8903#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} #54#return; {8903#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:47:48,926 INFO L290 TraceCheckUtils]: 67: Hoare triple {8903#(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; {8925#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 07:47:48,927 INFO L290 TraceCheckUtils]: 68: Hoare triple {8925#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {8925#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 07:47:48,927 INFO L272 TraceCheckUtils]: 69: Hoare triple {8925#(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)); {8711#true} is VALID [2022-04-08 07:47:48,927 INFO L290 TraceCheckUtils]: 70: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,927 INFO L290 TraceCheckUtils]: 71: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,927 INFO L290 TraceCheckUtils]: 72: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,927 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8711#true} {8925#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {8925#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 07:47:48,928 INFO L290 TraceCheckUtils]: 74: Hoare triple {8925#(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; {8947#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:47:48,928 INFO L290 TraceCheckUtils]: 75: Hoare triple {8947#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {8947#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:47:48,928 INFO L272 TraceCheckUtils]: 76: Hoare triple {8947#(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)); {8711#true} is VALID [2022-04-08 07:47:48,928 INFO L290 TraceCheckUtils]: 77: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,928 INFO L290 TraceCheckUtils]: 78: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,929 INFO L290 TraceCheckUtils]: 79: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,929 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {8711#true} {8947#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #54#return; {8947#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:47:48,929 INFO L290 TraceCheckUtils]: 81: Hoare triple {8947#(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; {8969#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:47:48,930 INFO L290 TraceCheckUtils]: 82: Hoare triple {8969#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {8969#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:47:48,930 INFO L272 TraceCheckUtils]: 83: Hoare triple {8969#(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)); {8711#true} is VALID [2022-04-08 07:47:48,930 INFO L290 TraceCheckUtils]: 84: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,930 INFO L290 TraceCheckUtils]: 85: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,930 INFO L290 TraceCheckUtils]: 86: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,930 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8711#true} {8969#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {8969#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:47:48,931 INFO L290 TraceCheckUtils]: 88: Hoare triple {8969#(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; {8991#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 07:47:48,931 INFO L290 TraceCheckUtils]: 89: Hoare triple {8991#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {8991#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 07:47:48,931 INFO L272 TraceCheckUtils]: 90: Hoare triple {8991#(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)); {8711#true} is VALID [2022-04-08 07:47:48,931 INFO L290 TraceCheckUtils]: 91: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,931 INFO L290 TraceCheckUtils]: 92: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,931 INFO L290 TraceCheckUtils]: 93: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,932 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8711#true} {8991#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {8991#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 07:47:48,932 INFO L290 TraceCheckUtils]: 95: Hoare triple {8991#(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; {9013#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:47:48,933 INFO L290 TraceCheckUtils]: 96: Hoare triple {9013#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {9013#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:47:48,933 INFO L272 TraceCheckUtils]: 97: Hoare triple {9013#(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)); {8711#true} is VALID [2022-04-08 07:47:48,933 INFO L290 TraceCheckUtils]: 98: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,933 INFO L290 TraceCheckUtils]: 99: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,933 INFO L290 TraceCheckUtils]: 100: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,933 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {8711#true} {9013#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #54#return; {9013#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:47:48,934 INFO L290 TraceCheckUtils]: 102: Hoare triple {9013#(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; {9035#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-08 07:47:48,934 INFO L290 TraceCheckUtils]: 103: Hoare triple {9035#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} assume !false; {9035#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-08 07:47:48,934 INFO L272 TraceCheckUtils]: 104: Hoare triple {9035#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8711#true} is VALID [2022-04-08 07:47:48,934 INFO L290 TraceCheckUtils]: 105: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,934 INFO L290 TraceCheckUtils]: 106: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,934 INFO L290 TraceCheckUtils]: 107: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,935 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {8711#true} {9035#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} #54#return; {9035#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-08 07:47:48,935 INFO L290 TraceCheckUtils]: 109: Hoare triple {9035#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9057#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 07:47:48,936 INFO L290 TraceCheckUtils]: 110: Hoare triple {9057#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !false; {9057#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 07:47:48,936 INFO L272 TraceCheckUtils]: 111: Hoare triple {9057#(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)); {8711#true} is VALID [2022-04-08 07:47:48,936 INFO L290 TraceCheckUtils]: 112: Hoare triple {8711#true} ~cond := #in~cond; {8711#true} is VALID [2022-04-08 07:47:48,936 INFO L290 TraceCheckUtils]: 113: Hoare triple {8711#true} assume !(0 == ~cond); {8711#true} is VALID [2022-04-08 07:47:48,936 INFO L290 TraceCheckUtils]: 114: Hoare triple {8711#true} assume true; {8711#true} is VALID [2022-04-08 07:47:48,936 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {8711#true} {9057#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} #54#return; {9057#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 07:47:48,937 INFO L290 TraceCheckUtils]: 116: Hoare triple {9057#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {9079#(and (= main_~y~0 14) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-08 07:47:48,938 INFO L272 TraceCheckUtils]: 117: Hoare triple {9079#(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)); {9083#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:47:48,938 INFO L290 TraceCheckUtils]: 118: Hoare triple {9083#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9087#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:47:48,938 INFO L290 TraceCheckUtils]: 119: Hoare triple {9087#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8712#false} is VALID [2022-04-08 07:47:48,938 INFO L290 TraceCheckUtils]: 120: Hoare triple {8712#false} assume !false; {8712#false} is VALID [2022-04-08 07:47:48,939 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 07:47:48,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:47:49,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:47:49,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804918742] [2022-04-08 07:47:49,210 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:47:49,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311565394] [2022-04-08 07:47:49,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311565394] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:47:49,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:47:49,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-08 07:47:49,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:47:49,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1936634868] [2022-04-08 07:47:49,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1936634868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:47:49,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:47:49,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 07:47:49,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852777505] [2022-04-08 07:47:49,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:47:49,211 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) Word has length 121 [2022-04-08 07:47:49,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:47:49,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 07:47:49,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:47:49,270 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 07:47:49,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:47:49,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 07:47:49,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-08 07:47:49,271 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 07:47:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:47:51,418 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2022-04-08 07:47:51,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 07:47:51,419 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) Word has length 121 [2022-04-08 07:47:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:47:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 07:47:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-08 07:47:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 07:47:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 88 transitions. [2022-04-08 07:47:51,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 88 transitions. [2022-04-08 07:47:51,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:47:51,492 INFO L225 Difference]: With dead ends: 78 [2022-04-08 07:47:51,493 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 07:47:51,493 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-08 07:47:51,493 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:47:51,493 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 635 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 07:47:51,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 07:47:51,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-08 07:47:51,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:47:51,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 07:47:51,550 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 07:47:51,550 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 07:47:51,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:47:51,551 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-08 07:47:51,551 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-08 07:47:51,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:47:51,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:47:51,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-08 07:47:51,552 INFO L87 Difference]: Start difference. First operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-08 07:47:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:47:51,553 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-08 07:47:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-08 07:47:51,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:47:51,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:47:51,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:47:51,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:47:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 20 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 07:47:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2022-04-08 07:47:51,555 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 121 [2022-04-08 07:47:51,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:47:51,555 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2022-04-08 07:47:51,556 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 17 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 07:47:51,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 87 transitions. [2022-04-08 07:47:52,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:47:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-08 07:47:52,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-08 07:47:52,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:47:52,152 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:47:52,157 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 07:47:52,352 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 07:47:52,352 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:47:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:47:52,353 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 29 times [2022-04-08 07:47:52,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:47:52,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1578329936] [2022-04-08 07:47:52,421 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:47:52,421 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:47:52,421 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:47:52,421 INFO L85 PathProgramCache]: Analyzing trace with hash -729919512, now seen corresponding path program 30 times [2022-04-08 07:47:52,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:47:52,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281775891] [2022-04-08 07:47:52,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:47:52,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:47:52,432 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:47:52,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134719225] [2022-04-08 07:47:52,432 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:47:52,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:47:52,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:47:52,433 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 07:47:52,434 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 07:47:52,747 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-08 07:47:52,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:47:52,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-08 07:47:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:47:52,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:47:53,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {9587#true} call ULTIMATE.init(); {9587#true} is VALID [2022-04-08 07:47:53,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {9587#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); {9587#true} is VALID [2022-04-08 07:47:53,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9587#true} {9587#true} #60#return; {9587#true} is VALID [2022-04-08 07:47:53,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {9587#true} call #t~ret5 := main(); {9587#true} is VALID [2022-04-08 07:47:53,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {9587#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; {9587#true} is VALID [2022-04-08 07:47:53,389 INFO L272 TraceCheckUtils]: 6: Hoare triple {9587#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {9587#true} is VALID [2022-04-08 07:47:53,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,389 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9587#true} {9587#true} #52#return; {9587#true} is VALID [2022-04-08 07:47:53,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {9587#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9625#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:47:53,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {9625#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {9625#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:47:53,390 INFO L272 TraceCheckUtils]: 13: Hoare triple {9625#(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)); {9587#true} is VALID [2022-04-08 07:47:53,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,391 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9587#true} {9625#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {9625#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:47:53,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {9625#(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; {9647#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:47:53,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {9647#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {9647#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:47:53,392 INFO L272 TraceCheckUtils]: 20: Hoare triple {9647#(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)); {9587#true} is VALID [2022-04-08 07:47:53,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,393 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9587#true} {9647#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {9647#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:47:53,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {9647#(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; {9669#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:47:53,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {9669#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {9669#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:47:53,393 INFO L272 TraceCheckUtils]: 27: Hoare triple {9669#(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)); {9587#true} is VALID [2022-04-08 07:47:53,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,394 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9587#true} {9669#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {9669#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:47:53,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {9669#(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; {9691#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:47:53,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {9691#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !false; {9691#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:47:53,402 INFO L272 TraceCheckUtils]: 34: Hoare triple {9691#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9587#true} is VALID [2022-04-08 07:47:53,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,403 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9587#true} {9691#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #54#return; {9691#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:47:53,404 INFO L290 TraceCheckUtils]: 39: Hoare triple {9691#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9713#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:47:53,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {9713#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {9713#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:47:53,404 INFO L272 TraceCheckUtils]: 41: Hoare triple {9713#(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)); {9587#true} is VALID [2022-04-08 07:47:53,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,405 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9587#true} {9713#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {9713#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:47:53,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {9713#(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; {9735#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:47:53,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {9735#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} assume !false; {9735#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:47:53,406 INFO L272 TraceCheckUtils]: 48: Hoare triple {9735#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9587#true} is VALID [2022-04-08 07:47:53,406 INFO L290 TraceCheckUtils]: 49: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,406 INFO L290 TraceCheckUtils]: 50: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,406 INFO L290 TraceCheckUtils]: 51: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,406 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9587#true} {9735#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} #54#return; {9735#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:47:53,407 INFO L290 TraceCheckUtils]: 53: Hoare triple {9735#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9757#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:47:53,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {9757#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} assume !false; {9757#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:47:53,407 INFO L272 TraceCheckUtils]: 55: Hoare triple {9757#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9587#true} is VALID [2022-04-08 07:47:53,407 INFO L290 TraceCheckUtils]: 56: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,407 INFO L290 TraceCheckUtils]: 57: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,408 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9587#true} {9757#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} #54#return; {9757#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:47:53,408 INFO L290 TraceCheckUtils]: 60: Hoare triple {9757#(and (= (+ main_~y~0 (- 4)) 2) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9779#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:47:53,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {9779#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {9779#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:47:53,408 INFO L272 TraceCheckUtils]: 62: Hoare triple {9779#(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)); {9587#true} is VALID [2022-04-08 07:47:53,409 INFO L290 TraceCheckUtils]: 63: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,409 INFO L290 TraceCheckUtils]: 64: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,409 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9587#true} {9779#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {9779#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:47:53,409 INFO L290 TraceCheckUtils]: 67: Hoare triple {9779#(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; {9801#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:47:53,410 INFO L290 TraceCheckUtils]: 68: Hoare triple {9801#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {9801#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:47:53,410 INFO L272 TraceCheckUtils]: 69: Hoare triple {9801#(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)); {9587#true} is VALID [2022-04-08 07:47:53,410 INFO L290 TraceCheckUtils]: 70: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,410 INFO L290 TraceCheckUtils]: 71: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,410 INFO L290 TraceCheckUtils]: 72: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,410 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9587#true} {9801#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {9801#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:47:53,411 INFO L290 TraceCheckUtils]: 74: Hoare triple {9801#(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; {9823#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:47:53,411 INFO L290 TraceCheckUtils]: 75: Hoare triple {9823#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {9823#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:47:53,411 INFO L272 TraceCheckUtils]: 76: Hoare triple {9823#(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)); {9587#true} is VALID [2022-04-08 07:47:53,411 INFO L290 TraceCheckUtils]: 77: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,411 INFO L290 TraceCheckUtils]: 78: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,412 INFO L290 TraceCheckUtils]: 79: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,412 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9587#true} {9823#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {9823#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:47:53,412 INFO L290 TraceCheckUtils]: 81: Hoare triple {9823#(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; {9845#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:47:53,413 INFO L290 TraceCheckUtils]: 82: Hoare triple {9845#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {9845#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:47:53,413 INFO L272 TraceCheckUtils]: 83: Hoare triple {9845#(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)); {9587#true} is VALID [2022-04-08 07:47:53,413 INFO L290 TraceCheckUtils]: 84: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,413 INFO L290 TraceCheckUtils]: 85: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,413 INFO L290 TraceCheckUtils]: 86: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,413 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {9587#true} {9845#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #54#return; {9845#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:47:53,414 INFO L290 TraceCheckUtils]: 88: Hoare triple {9845#(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; {9867#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 07:47:53,414 INFO L290 TraceCheckUtils]: 89: Hoare triple {9867#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} assume !false; {9867#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 07:47:53,414 INFO L272 TraceCheckUtils]: 90: Hoare triple {9867#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9587#true} is VALID [2022-04-08 07:47:53,414 INFO L290 TraceCheckUtils]: 91: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,414 INFO L290 TraceCheckUtils]: 92: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,415 INFO L290 TraceCheckUtils]: 93: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,415 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {9587#true} {9867#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} #54#return; {9867#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 07:47:53,415 INFO L290 TraceCheckUtils]: 95: Hoare triple {9867#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9889#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:47:53,416 INFO L290 TraceCheckUtils]: 96: Hoare triple {9889#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {9889#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:47:53,416 INFO L272 TraceCheckUtils]: 97: Hoare triple {9889#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9587#true} is VALID [2022-04-08 07:47:53,416 INFO L290 TraceCheckUtils]: 98: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,416 INFO L290 TraceCheckUtils]: 99: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,416 INFO L290 TraceCheckUtils]: 100: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,416 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9587#true} {9889#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {9889#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:47:53,417 INFO L290 TraceCheckUtils]: 102: Hoare triple {9889#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9911#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:47:53,417 INFO L290 TraceCheckUtils]: 103: Hoare triple {9911#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {9911#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:47:53,417 INFO L272 TraceCheckUtils]: 104: Hoare triple {9911#(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)); {9587#true} is VALID [2022-04-08 07:47:53,417 INFO L290 TraceCheckUtils]: 105: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,417 INFO L290 TraceCheckUtils]: 106: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,417 INFO L290 TraceCheckUtils]: 107: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,418 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {9587#true} {9911#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {9911#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:47:53,418 INFO L290 TraceCheckUtils]: 109: Hoare triple {9911#(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; {9933#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:47:53,418 INFO L290 TraceCheckUtils]: 110: Hoare triple {9933#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} assume !false; {9933#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:47:53,419 INFO L272 TraceCheckUtils]: 111: Hoare triple {9933#(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)); {9587#true} is VALID [2022-04-08 07:47:53,419 INFO L290 TraceCheckUtils]: 112: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,419 INFO L290 TraceCheckUtils]: 113: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,419 INFO L290 TraceCheckUtils]: 114: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,419 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {9587#true} {9933#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} #54#return; {9933#(and (= (+ (- 1) main_~c~0) 13) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:47:53,420 INFO L290 TraceCheckUtils]: 116: Hoare triple {9933#(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; {9955#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} is VALID [2022-04-08 07:47:53,420 INFO L290 TraceCheckUtils]: 117: Hoare triple {9955#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} assume !false; {9955#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} is VALID [2022-04-08 07:47:53,420 INFO L272 TraceCheckUtils]: 118: Hoare triple {9955#(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)); {9587#true} is VALID [2022-04-08 07:47:53,420 INFO L290 TraceCheckUtils]: 119: Hoare triple {9587#true} ~cond := #in~cond; {9587#true} is VALID [2022-04-08 07:47:53,420 INFO L290 TraceCheckUtils]: 120: Hoare triple {9587#true} assume !(0 == ~cond); {9587#true} is VALID [2022-04-08 07:47:53,420 INFO L290 TraceCheckUtils]: 121: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-08 07:47:53,421 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9587#true} {9955#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} #54#return; {9955#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} is VALID [2022-04-08 07:47:53,421 INFO L290 TraceCheckUtils]: 123: Hoare triple {9955#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~c~0 15))} assume !(~c~0 < ~k~0); {9977#(and (< 14 main_~k~0) (= (+ (- 2) main_~y~0) 13) (<= main_~k~0 15))} is VALID [2022-04-08 07:47:53,422 INFO L272 TraceCheckUtils]: 124: Hoare triple {9977#(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)); {9981#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:47:53,422 INFO L290 TraceCheckUtils]: 125: Hoare triple {9981#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9985#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:47:53,423 INFO L290 TraceCheckUtils]: 126: Hoare triple {9985#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9588#false} is VALID [2022-04-08 07:47:53,423 INFO L290 TraceCheckUtils]: 127: Hoare triple {9588#false} assume !false; {9588#false} is VALID [2022-04-08 07:47:53,423 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 07:47:53,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:47:53,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:47:53,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281775891] [2022-04-08 07:47:53,682 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:47:53,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134719225] [2022-04-08 07:47:53,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134719225] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:47:53,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:47:53,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-08 07:47:53,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:47:53,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1578329936] [2022-04-08 07:47:53,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1578329936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:47:53,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:47:53,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 07:47:53,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676141079] [2022-04-08 07:47:53,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:47:53,683 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) Word has length 128 [2022-04-08 07:47:53,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:47:53,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 07:47:53,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:47:53,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 07:47:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:47:53,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 07:47:53,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-04-08 07:47:53,749 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 07:47:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:47:55,969 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2022-04-08 07:47:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 07:47:55,969 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) Word has length 128 [2022-04-08 07:47:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:47:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 07:47:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-08 07:47:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 07:47:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2022-04-08 07:47:55,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 92 transitions. [2022-04-08 07:47:56,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:47:56,068 INFO L225 Difference]: With dead ends: 81 [2022-04-08 07:47:56,068 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 07:47:56,068 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 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 07:47:56,068 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:47:56,069 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 689 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 07:47:56,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 07:47:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-08 07:47:56,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:47:56,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 07:47:56,133 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 07:47:56,133 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 07:47:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:47:56,134 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-08 07:47:56,134 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-08 07:47:56,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:47:56,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:47:56,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 76 states. [2022-04-08 07:47:56,135 INFO L87 Difference]: Start difference. First operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 76 states. [2022-04-08 07:47:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:47:56,136 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-08 07:47:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-08 07:47:56,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:47:56,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:47:56,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:47:56,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:47:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 07:47:56,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2022-04-08 07:47:56,138 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 128 [2022-04-08 07:47:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:47:56,138 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2022-04-08 07:47:56,138 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 18 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 07:47:56,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 91 transitions. [2022-04-08 07:47:56,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:47:56,696 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-08 07:47:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-08 07:47:56,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:47:56,697 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:47:56,702 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 07:47:56,897 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 07:47:56,898 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:47:56,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:47:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 31 times [2022-04-08 07:47:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:47:56,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [989975593] [2022-04-08 07:47:56,968 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:47:56,968 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:47:56,968 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:47:56,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843369, now seen corresponding path program 32 times [2022-04-08 07:47:56,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:47:56,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713171851] [2022-04-08 07:47:56,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:47:56,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:47:56,979 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:47:56,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [215353734] [2022-04-08 07:47:56,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:47:56,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:47:56,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:47:56,980 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 07:47:56,981 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 07:47:57,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:47:57,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:47:57,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-08 07:47:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:47:57,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:47:58,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {10503#true} call ULTIMATE.init(); {10503#true} is VALID [2022-04-08 07:47:58,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {10503#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); {10503#true} is VALID [2022-04-08 07:47:58,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10503#true} {10503#true} #60#return; {10503#true} is VALID [2022-04-08 07:47:58,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {10503#true} call #t~ret5 := main(); {10503#true} is VALID [2022-04-08 07:47:58,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {10503#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; {10503#true} is VALID [2022-04-08 07:47:58,474 INFO L272 TraceCheckUtils]: 6: Hoare triple {10503#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {10503#true} is VALID [2022-04-08 07:47:58,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,474 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10503#true} {10503#true} #52#return; {10503#true} is VALID [2022-04-08 07:47:58,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {10503#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10541#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:47:58,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {10541#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {10541#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:47:58,475 INFO L272 TraceCheckUtils]: 13: Hoare triple {10541#(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)); {10503#true} is VALID [2022-04-08 07:47:58,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,476 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10503#true} {10541#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {10541#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:47:58,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {10541#(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; {10563#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:47:58,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {10563#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {10563#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:47:58,477 INFO L272 TraceCheckUtils]: 20: Hoare triple {10563#(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)); {10503#true} is VALID [2022-04-08 07:47:58,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,477 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10503#true} {10563#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {10563#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:47:58,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {10563#(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; {10585#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {10585#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} assume !false; {10585#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,478 INFO L272 TraceCheckUtils]: 27: Hoare triple {10585#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 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)); {10503#true} is VALID [2022-04-08 07:47:58,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,479 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10503#true} {10585#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} #54#return; {10585#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,479 INFO L290 TraceCheckUtils]: 32: Hoare triple {10585#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 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; {10607#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {10607#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} assume !false; {10607#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,480 INFO L272 TraceCheckUtils]: 34: Hoare triple {10607#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 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)); {10503#true} is VALID [2022-04-08 07:47:58,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,480 INFO L290 TraceCheckUtils]: 36: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,480 INFO L290 TraceCheckUtils]: 37: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,480 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10503#true} {10607#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} #54#return; {10607#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {10607#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 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; {10629#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {10629#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4) (< 0 main_~k~0))} assume !false; {10629#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,481 INFO L272 TraceCheckUtils]: 41: Hoare triple {10629#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10503#true} is VALID [2022-04-08 07:47:58,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,481 INFO L290 TraceCheckUtils]: 44: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,482 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10503#true} {10629#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4) (< 0 main_~k~0))} #54#return; {10629#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {10629#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10651#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {10651#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {10651#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,483 INFO L272 TraceCheckUtils]: 48: Hoare triple {10651#(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)); {10503#true} is VALID [2022-04-08 07:47:58,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,483 INFO L290 TraceCheckUtils]: 50: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,483 INFO L290 TraceCheckUtils]: 51: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,483 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10503#true} {10651#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} #54#return; {10651#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,484 INFO L290 TraceCheckUtils]: 53: Hoare triple {10651#(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; {10673#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,484 INFO L290 TraceCheckUtils]: 54: Hoare triple {10673#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !false; {10673#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,484 INFO L272 TraceCheckUtils]: 55: Hoare triple {10673#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10503#true} is VALID [2022-04-08 07:47:58,484 INFO L290 TraceCheckUtils]: 56: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,484 INFO L290 TraceCheckUtils]: 57: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,484 INFO L290 TraceCheckUtils]: 58: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,485 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10503#true} {10673#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #54#return; {10673#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,485 INFO L290 TraceCheckUtils]: 60: Hoare triple {10673#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10695#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,485 INFO L290 TraceCheckUtils]: 61: Hoare triple {10695#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {10695#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,485 INFO L272 TraceCheckUtils]: 62: Hoare triple {10695#(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)); {10503#true} is VALID [2022-04-08 07:47:58,485 INFO L290 TraceCheckUtils]: 63: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,486 INFO L290 TraceCheckUtils]: 64: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,486 INFO L290 TraceCheckUtils]: 65: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,486 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10503#true} {10695#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {10695#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,486 INFO L290 TraceCheckUtils]: 67: Hoare triple {10695#(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; {10717#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,487 INFO L290 TraceCheckUtils]: 68: Hoare triple {10717#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} assume !false; {10717#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,487 INFO L272 TraceCheckUtils]: 69: Hoare triple {10717#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10503#true} is VALID [2022-04-08 07:47:58,487 INFO L290 TraceCheckUtils]: 70: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,487 INFO L290 TraceCheckUtils]: 71: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,487 INFO L290 TraceCheckUtils]: 72: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,488 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10503#true} {10717#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} #54#return; {10717#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,488 INFO L290 TraceCheckUtils]: 74: Hoare triple {10717#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10739#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,488 INFO L290 TraceCheckUtils]: 75: Hoare triple {10739#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {10739#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,488 INFO L272 TraceCheckUtils]: 76: Hoare triple {10739#(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)); {10503#true} is VALID [2022-04-08 07:47:58,488 INFO L290 TraceCheckUtils]: 77: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,489 INFO L290 TraceCheckUtils]: 78: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,489 INFO L290 TraceCheckUtils]: 79: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,489 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10503#true} {10739#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} #54#return; {10739#(and (= (+ main_~y~0 (- 3)) 6) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,489 INFO L290 TraceCheckUtils]: 81: Hoare triple {10739#(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; {10761#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,490 INFO L290 TraceCheckUtils]: 82: Hoare triple {10761#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !false; {10761#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,490 INFO L272 TraceCheckUtils]: 83: Hoare triple {10761#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10503#true} is VALID [2022-04-08 07:47:58,490 INFO L290 TraceCheckUtils]: 84: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,490 INFO L290 TraceCheckUtils]: 85: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,490 INFO L290 TraceCheckUtils]: 86: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,491 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {10503#true} {10761#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} #54#return; {10761#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,491 INFO L290 TraceCheckUtils]: 88: Hoare triple {10761#(and (= (+ main_~y~0 (- 4)) 6) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10783#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,491 INFO L290 TraceCheckUtils]: 89: Hoare triple {10783#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} assume !false; {10783#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,491 INFO L272 TraceCheckUtils]: 90: Hoare triple {10783#(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)); {10503#true} is VALID [2022-04-08 07:47:58,491 INFO L290 TraceCheckUtils]: 91: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,491 INFO L290 TraceCheckUtils]: 92: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,492 INFO L290 TraceCheckUtils]: 93: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,492 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {10503#true} {10783#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} #54#return; {10783#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,492 INFO L290 TraceCheckUtils]: 95: Hoare triple {10783#(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; {10805#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,493 INFO L290 TraceCheckUtils]: 96: Hoare triple {10805#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} assume !false; {10805#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,493 INFO L272 TraceCheckUtils]: 97: Hoare triple {10805#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 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)); {10503#true} is VALID [2022-04-08 07:47:58,493 INFO L290 TraceCheckUtils]: 98: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,493 INFO L290 TraceCheckUtils]: 99: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,493 INFO L290 TraceCheckUtils]: 100: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,493 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10503#true} {10805#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} #54#return; {10805#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,494 INFO L290 TraceCheckUtils]: 102: Hoare triple {10805#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 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; {10827#(and (= 11 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 07:47:58,494 INFO L290 TraceCheckUtils]: 103: Hoare triple {10827#(and (= 11 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= main_~y~0 13))} assume !false; {10827#(and (= 11 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 07:47:58,494 INFO L272 TraceCheckUtils]: 104: Hoare triple {10827#(and (= 11 (+ (- 2) main_~c~0)) (< 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)); {10503#true} is VALID [2022-04-08 07:47:58,494 INFO L290 TraceCheckUtils]: 105: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,494 INFO L290 TraceCheckUtils]: 106: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,495 INFO L290 TraceCheckUtils]: 107: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,495 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {10503#true} {10827#(and (= 11 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= main_~y~0 13))} #54#return; {10827#(and (= 11 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 07:47:58,496 INFO L290 TraceCheckUtils]: 109: Hoare triple {10827#(and (= 11 (+ (- 2) main_~c~0)) (< 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; {10849#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,497 INFO L290 TraceCheckUtils]: 110: Hoare triple {10849#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} assume !false; {10849#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,497 INFO L272 TraceCheckUtils]: 111: Hoare triple {10849#(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)); {10503#true} is VALID [2022-04-08 07:47:58,497 INFO L290 TraceCheckUtils]: 112: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,497 INFO L290 TraceCheckUtils]: 113: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,497 INFO L290 TraceCheckUtils]: 114: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,497 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {10503#true} {10849#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} #54#return; {10849#(and (= main_~y~0 14) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,498 INFO L290 TraceCheckUtils]: 116: Hoare triple {10849#(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; {10871#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,498 INFO L290 TraceCheckUtils]: 117: Hoare triple {10871#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} assume !false; {10871#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,498 INFO L272 TraceCheckUtils]: 118: Hoare triple {10871#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10503#true} is VALID [2022-04-08 07:47:58,498 INFO L290 TraceCheckUtils]: 119: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,498 INFO L290 TraceCheckUtils]: 120: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,498 INFO L290 TraceCheckUtils]: 121: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,499 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {10503#true} {10871#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} #54#return; {10871#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} is VALID [2022-04-08 07:47:58,499 INFO L290 TraceCheckUtils]: 123: Hoare triple {10871#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10893#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 07:47:58,499 INFO L290 TraceCheckUtils]: 124: Hoare triple {10893#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !false; {10893#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 07:47:58,500 INFO L272 TraceCheckUtils]: 125: Hoare triple {10893#(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)); {10503#true} is VALID [2022-04-08 07:47:58,500 INFO L290 TraceCheckUtils]: 126: Hoare triple {10503#true} ~cond := #in~cond; {10503#true} is VALID [2022-04-08 07:47:58,500 INFO L290 TraceCheckUtils]: 127: Hoare triple {10503#true} assume !(0 == ~cond); {10503#true} is VALID [2022-04-08 07:47:58,500 INFO L290 TraceCheckUtils]: 128: Hoare triple {10503#true} assume true; {10503#true} is VALID [2022-04-08 07:47:58,500 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {10503#true} {10893#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} #54#return; {10893#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 07:47:58,501 INFO L290 TraceCheckUtils]: 130: Hoare triple {10893#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} assume !(~c~0 < ~k~0); {10915#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} is VALID [2022-04-08 07:47:58,502 INFO L272 TraceCheckUtils]: 131: Hoare triple {10915#(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)); {10919#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:47:58,502 INFO L290 TraceCheckUtils]: 132: Hoare triple {10919#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10923#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:47:58,502 INFO L290 TraceCheckUtils]: 133: Hoare triple {10923#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10504#false} is VALID [2022-04-08 07:47:58,502 INFO L290 TraceCheckUtils]: 134: Hoare triple {10504#false} assume !false; {10504#false} is VALID [2022-04-08 07:47:58,503 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 07:47:58,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:00,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:00,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713171851] [2022-04-08 07:48:00,126 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:00,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215353734] [2022-04-08 07:48:00,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215353734] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:00,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:00,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-08 07:48:00,127 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:00,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [989975593] [2022-04-08 07:48:00,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [989975593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:00,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:00,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 07:48:00,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026566980] [2022-04-08 07:48:00,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:00,127 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) Word has length 135 [2022-04-08 07:48:00,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:00,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 07:48:00,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:00,198 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 07:48:00,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:00,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 07:48:00,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1220, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 07:48:00,199 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 07:48:02,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:02,787 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-04-08 07:48:02,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 07:48:02,787 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) Word has length 135 [2022-04-08 07:48:02,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 07:48:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2022-04-08 07:48:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 07:48:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2022-04-08 07:48:02,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 96 transitions. [2022-04-08 07:48:02,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:02,873 INFO L225 Difference]: With dead ends: 84 [2022-04-08 07:48:02,874 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 07:48:02,874 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=350, Invalid=1372, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 07:48:02,874 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:02,875 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 730 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 07:48:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 07:48:02,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-08 07:48:02,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:02,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 07:48:02,947 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 07:48:02,947 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 07:48:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:02,949 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-08 07:48:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-08 07:48:02,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:02,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:02,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-08 07:48:02,949 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 79 states. [2022-04-08 07:48:02,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:02,951 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-08 07:48:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-08 07:48:02,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:02,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:02,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:02,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 07:48:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-08 07:48:02,952 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 135 [2022-04-08 07:48:02,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:02,953 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-08 07:48:02,953 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 19 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 07:48:02,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 95 transitions. [2022-04-08 07:48:03,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-08 07:48:03,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-04-08 07:48:03,541 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:03,541 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:03,546 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 07:48:03,746 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 07:48:03,746 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:03,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:03,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 33 times [2022-04-08 07:48:03,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:03,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1506882931] [2022-04-08 07:48:03,819 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:48:03,819 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:48:03,819 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:48:03,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1539623736, now seen corresponding path program 34 times [2022-04-08 07:48:03,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:03,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659414790] [2022-04-08 07:48:03,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:03,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:03,830 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:03,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416743718] [2022-04-08 07:48:03,830 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:48:03,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:03,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:03,831 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 07:48:03,832 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 07:48:04,350 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:48:04,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:04,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-08 07:48:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:04,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:05,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {11789#true} call ULTIMATE.init(); {11789#true} is VALID [2022-04-08 07:48:05,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {11789#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); {11789#true} is VALID [2022-04-08 07:48:05,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11789#true} {11789#true} #60#return; {11789#true} is VALID [2022-04-08 07:48:05,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {11789#true} call #t~ret5 := main(); {11789#true} is VALID [2022-04-08 07:48:05,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {11789#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; {11789#true} is VALID [2022-04-08 07:48:05,052 INFO L272 TraceCheckUtils]: 6: Hoare triple {11789#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {11789#true} is VALID [2022-04-08 07:48:05,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,052 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11789#true} {11789#true} #52#return; {11789#true} is VALID [2022-04-08 07:48:05,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {11789#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11827#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:05,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {11827#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {11827#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:05,053 INFO L272 TraceCheckUtils]: 13: Hoare triple {11827#(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)); {11789#true} is VALID [2022-04-08 07:48:05,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,053 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11789#true} {11827#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {11827#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:05,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {11827#(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; {11849#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:48:05,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {11849#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {11849#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:48:05,054 INFO L272 TraceCheckUtils]: 20: Hoare triple {11849#(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)); {11789#true} is VALID [2022-04-08 07:48:05,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,055 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11789#true} {11849#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {11849#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:48:05,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {11849#(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; {11871#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 07:48:05,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {11871#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !false; {11871#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 07:48:05,055 INFO L272 TraceCheckUtils]: 27: Hoare triple {11871#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11789#true} is VALID [2022-04-08 07:48:05,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,056 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11789#true} {11871#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #54#return; {11871#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 07:48:05,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {11871#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {11893#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:48:05,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {11893#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {11893#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:48:05,057 INFO L272 TraceCheckUtils]: 34: Hoare triple {11893#(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)); {11789#true} is VALID [2022-04-08 07:48:05,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,057 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11789#true} {11893#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {11893#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:48:05,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {11893#(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; {11915#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:48:05,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {11915#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {11915#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:48:05,058 INFO L272 TraceCheckUtils]: 41: Hoare triple {11915#(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)); {11789#true} is VALID [2022-04-08 07:48:05,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,059 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11789#true} {11915#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {11915#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:48:05,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {11915#(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; {11937#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:48:05,060 INFO L290 TraceCheckUtils]: 47: Hoare triple {11937#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {11937#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:48:05,060 INFO L272 TraceCheckUtils]: 48: Hoare triple {11937#(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)); {11789#true} is VALID [2022-04-08 07:48:05,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,060 INFO L290 TraceCheckUtils]: 51: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,063 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11789#true} {11937#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #54#return; {11937#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:48:05,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {11937#(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; {11959#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:05,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {11959#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {11959#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:05,064 INFO L272 TraceCheckUtils]: 55: Hoare triple {11959#(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)); {11789#true} is VALID [2022-04-08 07:48:05,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,064 INFO L290 TraceCheckUtils]: 57: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,065 INFO L290 TraceCheckUtils]: 58: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,065 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11789#true} {11959#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {11959#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:05,065 INFO L290 TraceCheckUtils]: 60: Hoare triple {11959#(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; {11981#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:05,066 INFO L290 TraceCheckUtils]: 61: Hoare triple {11981#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {11981#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:05,066 INFO L272 TraceCheckUtils]: 62: Hoare triple {11981#(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)); {11789#true} is VALID [2022-04-08 07:48:05,066 INFO L290 TraceCheckUtils]: 63: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,066 INFO L290 TraceCheckUtils]: 64: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,066 INFO L290 TraceCheckUtils]: 65: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,067 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11789#true} {11981#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {11981#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:05,067 INFO L290 TraceCheckUtils]: 67: Hoare triple {11981#(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; {12003#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 07:48:05,068 INFO L290 TraceCheckUtils]: 68: Hoare triple {12003#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {12003#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 07:48:05,068 INFO L272 TraceCheckUtils]: 69: Hoare triple {12003#(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)); {11789#true} is VALID [2022-04-08 07:48:05,068 INFO L290 TraceCheckUtils]: 70: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,068 INFO L290 TraceCheckUtils]: 71: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,068 INFO L290 TraceCheckUtils]: 72: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,068 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11789#true} {12003#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #54#return; {12003#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 07:48:05,069 INFO L290 TraceCheckUtils]: 74: Hoare triple {12003#(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; {12025#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:48:05,069 INFO L290 TraceCheckUtils]: 75: Hoare triple {12025#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {12025#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:48:05,069 INFO L272 TraceCheckUtils]: 76: Hoare triple {12025#(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)); {11789#true} is VALID [2022-04-08 07:48:05,069 INFO L290 TraceCheckUtils]: 77: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,069 INFO L290 TraceCheckUtils]: 78: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,069 INFO L290 TraceCheckUtils]: 79: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,070 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {11789#true} {12025#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {12025#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:48:05,070 INFO L290 TraceCheckUtils]: 81: Hoare triple {12025#(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; {12047#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:48:05,071 INFO L290 TraceCheckUtils]: 82: Hoare triple {12047#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {12047#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:48:05,071 INFO L272 TraceCheckUtils]: 83: Hoare triple {12047#(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)); {11789#true} is VALID [2022-04-08 07:48:05,071 INFO L290 TraceCheckUtils]: 84: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,071 INFO L290 TraceCheckUtils]: 85: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,071 INFO L290 TraceCheckUtils]: 86: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,071 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11789#true} {12047#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {12047#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:48:05,072 INFO L290 TraceCheckUtils]: 88: Hoare triple {12047#(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; {12069#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 07:48:05,072 INFO L290 TraceCheckUtils]: 89: Hoare triple {12069#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {12069#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 07:48:05,072 INFO L272 TraceCheckUtils]: 90: Hoare triple {12069#(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)); {11789#true} is VALID [2022-04-08 07:48:05,072 INFO L290 TraceCheckUtils]: 91: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,072 INFO L290 TraceCheckUtils]: 92: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,072 INFO L290 TraceCheckUtils]: 93: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,073 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11789#true} {12069#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {12069#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 07:48:05,073 INFO L290 TraceCheckUtils]: 95: Hoare triple {12069#(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; {12091#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:48:05,073 INFO L290 TraceCheckUtils]: 96: Hoare triple {12091#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {12091#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:48:05,073 INFO L272 TraceCheckUtils]: 97: Hoare triple {12091#(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)); {11789#true} is VALID [2022-04-08 07:48:05,074 INFO L290 TraceCheckUtils]: 98: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,074 INFO L290 TraceCheckUtils]: 99: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,074 INFO L290 TraceCheckUtils]: 100: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,074 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11789#true} {12091#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #54#return; {12091#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:48:05,074 INFO L290 TraceCheckUtils]: 102: Hoare triple {12091#(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; {12113#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 07:48:05,075 INFO L290 TraceCheckUtils]: 103: Hoare triple {12113#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !false; {12113#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 07:48:05,075 INFO L272 TraceCheckUtils]: 104: Hoare triple {12113#(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)); {11789#true} is VALID [2022-04-08 07:48:05,075 INFO L290 TraceCheckUtils]: 105: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,075 INFO L290 TraceCheckUtils]: 106: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,075 INFO L290 TraceCheckUtils]: 107: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,075 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {11789#true} {12113#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #54#return; {12113#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 07:48:05,076 INFO L290 TraceCheckUtils]: 109: Hoare triple {12113#(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; {12135#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 07:48:05,076 INFO L290 TraceCheckUtils]: 110: Hoare triple {12135#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} assume !false; {12135#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 07:48:05,076 INFO L272 TraceCheckUtils]: 111: Hoare triple {12135#(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)); {11789#true} is VALID [2022-04-08 07:48:05,076 INFO L290 TraceCheckUtils]: 112: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,076 INFO L290 TraceCheckUtils]: 113: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,076 INFO L290 TraceCheckUtils]: 114: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,077 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {11789#true} {12135#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} #54#return; {12135#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 07:48:05,077 INFO L290 TraceCheckUtils]: 116: Hoare triple {12135#(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; {12157#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:05,078 INFO L290 TraceCheckUtils]: 117: Hoare triple {12157#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} assume !false; {12157#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:05,078 INFO L272 TraceCheckUtils]: 118: Hoare triple {12157#(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)); {11789#true} is VALID [2022-04-08 07:48:05,078 INFO L290 TraceCheckUtils]: 119: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,078 INFO L290 TraceCheckUtils]: 120: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,078 INFO L290 TraceCheckUtils]: 121: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,078 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {11789#true} {12157#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} #54#return; {12157#(and (= main_~y~0 15) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:05,079 INFO L290 TraceCheckUtils]: 123: Hoare triple {12157#(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; {12179#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:48:05,079 INFO L290 TraceCheckUtils]: 124: Hoare triple {12179#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {12179#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:48:05,079 INFO L272 TraceCheckUtils]: 125: Hoare triple {12179#(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)); {11789#true} is VALID [2022-04-08 07:48:05,079 INFO L290 TraceCheckUtils]: 126: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,079 INFO L290 TraceCheckUtils]: 127: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,079 INFO L290 TraceCheckUtils]: 128: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,080 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {11789#true} {12179#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {12179#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:48:05,080 INFO L290 TraceCheckUtils]: 130: Hoare triple {12179#(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; {12201#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 07:48:05,080 INFO L290 TraceCheckUtils]: 131: Hoare triple {12201#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} assume !false; {12201#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 07:48:05,080 INFO L272 TraceCheckUtils]: 132: Hoare triple {12201#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {11789#true} is VALID [2022-04-08 07:48:05,080 INFO L290 TraceCheckUtils]: 133: Hoare triple {11789#true} ~cond := #in~cond; {11789#true} is VALID [2022-04-08 07:48:05,080 INFO L290 TraceCheckUtils]: 134: Hoare triple {11789#true} assume !(0 == ~cond); {11789#true} is VALID [2022-04-08 07:48:05,081 INFO L290 TraceCheckUtils]: 135: Hoare triple {11789#true} assume true; {11789#true} is VALID [2022-04-08 07:48:05,081 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {11789#true} {12201#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} #54#return; {12201#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 07:48:05,082 INFO L290 TraceCheckUtils]: 137: Hoare triple {12201#(and (<= main_~c~0 17) (< 16 main_~k~0) (= main_~y~0 17))} assume !(~c~0 < ~k~0); {12223#(and (<= main_~k~0 17) (< 16 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 07:48:05,083 INFO L272 TraceCheckUtils]: 138: Hoare triple {12223#(and (<= main_~k~0 17) (< 16 main_~k~0) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12227#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:05,083 INFO L290 TraceCheckUtils]: 139: Hoare triple {12227#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12231#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:05,084 INFO L290 TraceCheckUtils]: 140: Hoare triple {12231#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11790#false} is VALID [2022-04-08 07:48:05,084 INFO L290 TraceCheckUtils]: 141: Hoare triple {11790#false} assume !false; {11790#false} is VALID [2022-04-08 07:48:05,084 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 07:48:05,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:05,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:05,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659414790] [2022-04-08 07:48:05,351 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:05,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416743718] [2022-04-08 07:48:05,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416743718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:05,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:05,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-04-08 07:48:05,351 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:05,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1506882931] [2022-04-08 07:48:05,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1506882931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:05,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:05,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 07:48:05,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597598971] [2022-04-08 07:48:05,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:05,352 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 142 [2022-04-08 07:48:05,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:05,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 07:48:05,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:05,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 07:48:05,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:05,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 07:48:05,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-08 07:48:05,430 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 07:48:08,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:08,326 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-08 07:48:08,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 07:48:08,327 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 142 [2022-04-08 07:48:08,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 07:48:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-08 07:48:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 07:48:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 100 transitions. [2022-04-08 07:48:08,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 100 transitions. [2022-04-08 07:48:08,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:08,429 INFO L225 Difference]: With dead ends: 87 [2022-04-08 07:48:08,429 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 07:48:08,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2022-04-08 07:48:08,429 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:08,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 803 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 07:48:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 07:48:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-08 07:48:08,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:08,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 07:48:08,502 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 07:48:08,502 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 07:48:08,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:08,504 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-08 07:48:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-08 07:48:08,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:08,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:08,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-08 07:48:08,504 INFO L87 Difference]: Start difference. First operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-08 07:48:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:08,506 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-08 07:48:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-08 07:48:08,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:08,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:08,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:08,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 07:48:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-04-08 07:48:08,508 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 142 [2022-04-08 07:48:08,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:08,508 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-04-08 07:48:08,508 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 20 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 07:48:08,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 99 transitions. [2022-04-08 07:48:09,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-08 07:48:09,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-08 07:48:09,148 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:09,148 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:09,154 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 07:48:09,348 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 07:48:09,348 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:09,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:09,349 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 35 times [2022-04-08 07:48:09,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:09,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1242549488] [2022-04-08 07:48:09,415 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:48:09,416 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:48:09,416 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:48:09,416 INFO L85 PathProgramCache]: Analyzing trace with hash -157742263, now seen corresponding path program 36 times [2022-04-08 07:48:09,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:09,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741694081] [2022-04-08 07:48:09,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:09,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:09,439 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:09,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [667822400] [2022-04-08 07:48:09,439 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:48:09,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:09,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:09,440 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 07:48:09,441 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 07:48:12,356 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-08 07:48:12,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:12,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 81 conjunts are in the unsatisfiable core [2022-04-08 07:48:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:12,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:13,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {12785#true} call ULTIMATE.init(); {12785#true} is VALID [2022-04-08 07:48:13,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {12785#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); {12785#true} is VALID [2022-04-08 07:48:13,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12785#true} {12785#true} #60#return; {12785#true} is VALID [2022-04-08 07:48:13,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {12785#true} call #t~ret5 := main(); {12785#true} is VALID [2022-04-08 07:48:13,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {12785#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; {12785#true} is VALID [2022-04-08 07:48:13,271 INFO L272 TraceCheckUtils]: 6: Hoare triple {12785#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {12785#true} is VALID [2022-04-08 07:48:13,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,271 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12785#true} {12785#true} #52#return; {12785#true} is VALID [2022-04-08 07:48:13,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {12785#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:13,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {12823#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {12823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:13,272 INFO L272 TraceCheckUtils]: 13: Hoare triple {12823#(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)); {12785#true} is VALID [2022-04-08 07:48:13,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,272 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12785#true} {12823#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {12823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:13,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {12823#(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; {12845#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:48:13,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {12845#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {12845#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:48:13,273 INFO L272 TraceCheckUtils]: 20: Hoare triple {12845#(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)); {12785#true} is VALID [2022-04-08 07:48:13,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,274 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {12785#true} {12845#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {12845#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:48:13,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {12845#(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; {12867#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:48:13,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {12867#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {12867#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:48:13,275 INFO L272 TraceCheckUtils]: 27: Hoare triple {12867#(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)); {12785#true} is VALID [2022-04-08 07:48:13,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,275 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12785#true} {12867#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {12867#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:48:13,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {12867#(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; {12889#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:48:13,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {12889#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {12889#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:48:13,276 INFO L272 TraceCheckUtils]: 34: Hoare triple {12889#(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)); {12785#true} is VALID [2022-04-08 07:48:13,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,276 INFO L290 TraceCheckUtils]: 37: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,277 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12785#true} {12889#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {12889#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:48:13,277 INFO L290 TraceCheckUtils]: 39: Hoare triple {12889#(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; {12911#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:48:13,277 INFO L290 TraceCheckUtils]: 40: Hoare triple {12911#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {12911#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:48:13,277 INFO L272 TraceCheckUtils]: 41: Hoare triple {12911#(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)); {12785#true} is VALID [2022-04-08 07:48:13,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,277 INFO L290 TraceCheckUtils]: 43: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,281 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12785#true} {12911#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {12911#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:48:13,282 INFO L290 TraceCheckUtils]: 46: Hoare triple {12911#(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; {12933#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 07:48:13,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {12933#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !false; {12933#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 07:48:13,282 INFO L272 TraceCheckUtils]: 48: Hoare triple {12933#(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)); {12785#true} is VALID [2022-04-08 07:48:13,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,282 INFO L290 TraceCheckUtils]: 50: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,283 INFO L290 TraceCheckUtils]: 51: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,283 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12785#true} {12933#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #54#return; {12933#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 07:48:13,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {12933#(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; {12955#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:13,284 INFO L290 TraceCheckUtils]: 54: Hoare triple {12955#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {12955#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:13,284 INFO L272 TraceCheckUtils]: 55: Hoare triple {12955#(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)); {12785#true} is VALID [2022-04-08 07:48:13,284 INFO L290 TraceCheckUtils]: 56: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,284 INFO L290 TraceCheckUtils]: 57: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,284 INFO L290 TraceCheckUtils]: 58: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,284 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12785#true} {12955#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {12955#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:13,285 INFO L290 TraceCheckUtils]: 60: Hoare triple {12955#(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; {12977#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:13,285 INFO L290 TraceCheckUtils]: 61: Hoare triple {12977#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {12977#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:13,285 INFO L272 TraceCheckUtils]: 62: Hoare triple {12977#(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)); {12785#true} is VALID [2022-04-08 07:48:13,285 INFO L290 TraceCheckUtils]: 63: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,285 INFO L290 TraceCheckUtils]: 64: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,285 INFO L290 TraceCheckUtils]: 65: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,286 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12785#true} {12977#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #54#return; {12977#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:13,286 INFO L290 TraceCheckUtils]: 67: Hoare triple {12977#(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; {12999#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:48:13,286 INFO L290 TraceCheckUtils]: 68: Hoare triple {12999#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {12999#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:48:13,287 INFO L272 TraceCheckUtils]: 69: Hoare triple {12999#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 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)); {12785#true} is VALID [2022-04-08 07:48:13,287 INFO L290 TraceCheckUtils]: 70: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,287 INFO L290 TraceCheckUtils]: 71: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,287 INFO L290 TraceCheckUtils]: 72: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,287 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12785#true} {12999#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< main_~c~0 (+ main_~k~0 1)))} #54#return; {12999#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:48:13,289 INFO L290 TraceCheckUtils]: 74: Hoare triple {12999#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8) (< 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; {13021#(and (< 7 main_~k~0) (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:48:13,289 INFO L290 TraceCheckUtils]: 75: Hoare triple {13021#(and (< 7 main_~k~0) (= main_~y~0 9) (= main_~c~0 9))} assume !false; {13021#(and (< 7 main_~k~0) (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:48:13,289 INFO L272 TraceCheckUtils]: 76: Hoare triple {13021#(and (< 7 main_~k~0) (= 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)); {12785#true} is VALID [2022-04-08 07:48:13,289 INFO L290 TraceCheckUtils]: 77: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,289 INFO L290 TraceCheckUtils]: 78: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,289 INFO L290 TraceCheckUtils]: 79: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,290 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12785#true} {13021#(and (< 7 main_~k~0) (= main_~y~0 9) (= main_~c~0 9))} #54#return; {13021#(and (< 7 main_~k~0) (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:48:13,290 INFO L290 TraceCheckUtils]: 81: Hoare triple {13021#(and (< 7 main_~k~0) (= 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; {13043#(and (< 7 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:48:13,290 INFO L290 TraceCheckUtils]: 82: Hoare triple {13043#(and (< 7 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} assume !false; {13043#(and (< 7 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:48:13,290 INFO L272 TraceCheckUtils]: 83: Hoare triple {13043#(and (< 7 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12785#true} is VALID [2022-04-08 07:48:13,290 INFO L290 TraceCheckUtils]: 84: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,291 INFO L290 TraceCheckUtils]: 85: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,291 INFO L290 TraceCheckUtils]: 86: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,291 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {12785#true} {13043#(and (< 7 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} #54#return; {13043#(and (< 7 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:48:13,291 INFO L290 TraceCheckUtils]: 88: Hoare triple {13043#(and (< 7 main_~k~0) (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13065#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:48:13,292 INFO L290 TraceCheckUtils]: 89: Hoare triple {13065#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !false; {13065#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:48:13,292 INFO L272 TraceCheckUtils]: 90: Hoare triple {13065#(and (< 7 main_~k~0) (= (+ (- 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)); {12785#true} is VALID [2022-04-08 07:48:13,292 INFO L290 TraceCheckUtils]: 91: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,292 INFO L290 TraceCheckUtils]: 92: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,292 INFO L290 TraceCheckUtils]: 93: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,292 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {12785#true} {13065#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #54#return; {13065#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:48:13,293 INFO L290 TraceCheckUtils]: 95: Hoare triple {13065#(and (< 7 main_~k~0) (= (+ (- 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; {13087#(and (< 7 main_~k~0) (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:48:13,293 INFO L290 TraceCheckUtils]: 96: Hoare triple {13087#(and (< 7 main_~k~0) (= main_~y~0 12) (= main_~c~0 12))} assume !false; {13087#(and (< 7 main_~k~0) (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:48:13,293 INFO L272 TraceCheckUtils]: 97: Hoare triple {13087#(and (< 7 main_~k~0) (= 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)); {12785#true} is VALID [2022-04-08 07:48:13,293 INFO L290 TraceCheckUtils]: 98: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,293 INFO L290 TraceCheckUtils]: 99: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,294 INFO L290 TraceCheckUtils]: 100: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,294 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {12785#true} {13087#(and (< 7 main_~k~0) (= main_~y~0 12) (= main_~c~0 12))} #54#return; {13087#(and (< 7 main_~k~0) (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:48:13,294 INFO L290 TraceCheckUtils]: 102: Hoare triple {13087#(and (< 7 main_~k~0) (= 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; {13109#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 07:48:13,295 INFO L290 TraceCheckUtils]: 103: Hoare triple {13109#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {13109#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 07:48:13,295 INFO L272 TraceCheckUtils]: 104: Hoare triple {13109#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {12785#true} is VALID [2022-04-08 07:48:13,295 INFO L290 TraceCheckUtils]: 105: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,295 INFO L290 TraceCheckUtils]: 106: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,295 INFO L290 TraceCheckUtils]: 107: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,296 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {12785#true} {13109#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #54#return; {13109#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 07:48:13,297 INFO L290 TraceCheckUtils]: 109: Hoare triple {13109#(and (< 7 main_~k~0) (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {13131#(and (< 7 main_~k~0) (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:13,297 INFO L290 TraceCheckUtils]: 110: Hoare triple {13131#(and (< 7 main_~k~0) (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} assume !false; {13131#(and (< 7 main_~k~0) (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:13,297 INFO L272 TraceCheckUtils]: 111: Hoare triple {13131#(and (< 7 main_~k~0) (= main_~y~0 14) (= 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)); {12785#true} is VALID [2022-04-08 07:48:13,297 INFO L290 TraceCheckUtils]: 112: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,297 INFO L290 TraceCheckUtils]: 113: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,297 INFO L290 TraceCheckUtils]: 114: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,298 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {12785#true} {13131#(and (< 7 main_~k~0) (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} #54#return; {13131#(and (< 7 main_~k~0) (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:13,298 INFO L290 TraceCheckUtils]: 116: Hoare triple {13131#(and (< 7 main_~k~0) (= main_~y~0 14) (= 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; {13153#(and (< 7 main_~k~0) (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:13,298 INFO L290 TraceCheckUtils]: 117: Hoare triple {13153#(and (< 7 main_~k~0) (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {13153#(and (< 7 main_~k~0) (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:13,299 INFO L272 TraceCheckUtils]: 118: Hoare triple {13153#(and (< 7 main_~k~0) (= 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)); {12785#true} is VALID [2022-04-08 07:48:13,299 INFO L290 TraceCheckUtils]: 119: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,299 INFO L290 TraceCheckUtils]: 120: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,299 INFO L290 TraceCheckUtils]: 121: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,299 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12785#true} {13153#(and (< 7 main_~k~0) (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {13153#(and (< 7 main_~k~0) (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:13,300 INFO L290 TraceCheckUtils]: 123: Hoare triple {13153#(and (< 7 main_~k~0) (= 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; {13175#(and (< 7 main_~k~0) (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 07:48:13,300 INFO L290 TraceCheckUtils]: 124: Hoare triple {13175#(and (< 7 main_~k~0) (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !false; {13175#(and (< 7 main_~k~0) (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 07:48:13,300 INFO L272 TraceCheckUtils]: 125: Hoare triple {13175#(and (< 7 main_~k~0) (= 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)); {12785#true} is VALID [2022-04-08 07:48:13,300 INFO L290 TraceCheckUtils]: 126: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,300 INFO L290 TraceCheckUtils]: 127: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,300 INFO L290 TraceCheckUtils]: 128: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,301 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {12785#true} {13175#(and (< 7 main_~k~0) (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} #54#return; {13175#(and (< 7 main_~k~0) (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 07:48:13,301 INFO L290 TraceCheckUtils]: 130: Hoare triple {13175#(and (< 7 main_~k~0) (= 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; {13197#(and (< 7 main_~k~0) (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:13,301 INFO L290 TraceCheckUtils]: 131: Hoare triple {13197#(and (< 7 main_~k~0) (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} assume !false; {13197#(and (< 7 main_~k~0) (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:13,301 INFO L272 TraceCheckUtils]: 132: Hoare triple {13197#(and (< 7 main_~k~0) (= 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)); {12785#true} is VALID [2022-04-08 07:48:13,302 INFO L290 TraceCheckUtils]: 133: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,302 INFO L290 TraceCheckUtils]: 134: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,302 INFO L290 TraceCheckUtils]: 135: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,302 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {12785#true} {13197#(and (< 7 main_~k~0) (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} #54#return; {13197#(and (< 7 main_~k~0) (= 16 (+ (- 1) main_~y~0)) (= 15 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:13,302 INFO L290 TraceCheckUtils]: 137: Hoare triple {13197#(and (< 7 main_~k~0) (= 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; {13219#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:48:13,303 INFO L290 TraceCheckUtils]: 138: Hoare triple {13219#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !false; {13219#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:48:13,303 INFO L272 TraceCheckUtils]: 139: Hoare triple {13219#(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)); {12785#true} is VALID [2022-04-08 07:48:13,303 INFO L290 TraceCheckUtils]: 140: Hoare triple {12785#true} ~cond := #in~cond; {12785#true} is VALID [2022-04-08 07:48:13,303 INFO L290 TraceCheckUtils]: 141: Hoare triple {12785#true} assume !(0 == ~cond); {12785#true} is VALID [2022-04-08 07:48:13,303 INFO L290 TraceCheckUtils]: 142: Hoare triple {12785#true} assume true; {12785#true} is VALID [2022-04-08 07:48:13,304 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {12785#true} {13219#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} #54#return; {13219#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:48:13,304 INFO L290 TraceCheckUtils]: 144: Hoare triple {13219#(and (< 17 main_~k~0) (<= main_~c~0 18) (= main_~y~0 18))} assume !(~c~0 < ~k~0); {13241#(and (< 17 main_~k~0) (<= main_~k~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:48:13,305 INFO L272 TraceCheckUtils]: 145: Hoare triple {13241#(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)); {13245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:13,305 INFO L290 TraceCheckUtils]: 146: Hoare triple {13245#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:13,305 INFO L290 TraceCheckUtils]: 147: Hoare triple {13249#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12786#false} is VALID [2022-04-08 07:48:13,305 INFO L290 TraceCheckUtils]: 148: Hoare triple {12786#false} assume !false; {12786#false} is VALID [2022-04-08 07:48:13,306 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 07:48:13,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:14,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:14,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741694081] [2022-04-08 07:48:14,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:14,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667822400] [2022-04-08 07:48:14,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667822400] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:14,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:14,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-04-08 07:48:14,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:14,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1242549488] [2022-04-08 07:48:14,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1242549488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:14,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:14,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 07:48:14,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694792417] [2022-04-08 07:48:14,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:14,498 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) Word has length 149 [2022-04-08 07:48:14,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:14,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 07:48:14,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:14,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 07:48:14,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:14,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 07:48:14,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1056, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 07:48:14,595 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 07:48:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:17,853 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2022-04-08 07:48:17,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 07:48:17,853 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) Word has length 149 [2022-04-08 07:48:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 07:48:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-08 07:48:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 07:48:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2022-04-08 07:48:17,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 104 transitions. [2022-04-08 07:48:17,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:17,962 INFO L225 Difference]: With dead ends: 90 [2022-04-08 07:48:17,962 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 07:48:17,963 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 07:48:17,963 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:17,963 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 853 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-08 07:48:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 07:48:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-08 07:48:18,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:18,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 07:48:18,054 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 07:48:18,054 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 07:48:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:18,055 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-08 07:48:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-08 07:48:18,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:18,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:18,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 85 states. [2022-04-08 07:48:18,056 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 85 states. [2022-04-08 07:48:18,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:18,057 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-08 07:48:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-08 07:48:18,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:18,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:18,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:18,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 24 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 07:48:18,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-04-08 07:48:18,059 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 149 [2022-04-08 07:48:18,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:18,059 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-04-08 07:48:18,059 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 21 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 07:48:18,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 103 transitions. [2022-04-08 07:48:18,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-08 07:48:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-08 07:48:18,655 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:18,655 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:18,665 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 07:48:18,861 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 07:48:18,861 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:18,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:18,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 37 times [2022-04-08 07:48:18,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:18,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1252964151] [2022-04-08 07:48:18,937 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:48:18,938 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:48:18,938 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:48:18,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1167462824, now seen corresponding path program 38 times [2022-04-08 07:48:18,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:18,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154721694] [2022-04-08 07:48:18,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:18,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:18,950 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:18,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1502643990] [2022-04-08 07:48:18,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:48:18,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:18,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:18,952 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 07:48:18,952 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 07:48:19,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:48:19,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:19,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-08 07:48:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:19,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:20,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {14041#true} call ULTIMATE.init(); {14041#true} is VALID [2022-04-08 07:48:20,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {14041#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); {14041#true} is VALID [2022-04-08 07:48:20,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14041#true} {14041#true} #60#return; {14041#true} is VALID [2022-04-08 07:48:20,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {14041#true} call #t~ret5 := main(); {14041#true} is VALID [2022-04-08 07:48:20,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {14041#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; {14041#true} is VALID [2022-04-08 07:48:20,441 INFO L272 TraceCheckUtils]: 6: Hoare triple {14041#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {14041#true} is VALID [2022-04-08 07:48:20,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,442 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14041#true} {14041#true} #52#return; {14041#true} is VALID [2022-04-08 07:48:20,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {14041#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {14079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:20,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {14079#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {14079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:20,442 INFO L272 TraceCheckUtils]: 13: Hoare triple {14079#(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)); {14041#true} is VALID [2022-04-08 07:48:20,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,443 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14041#true} {14079#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {14079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:20,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {14079#(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; {14101#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:48:20,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {14101#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {14101#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:48:20,444 INFO L272 TraceCheckUtils]: 20: Hoare triple {14101#(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)); {14041#true} is VALID [2022-04-08 07:48:20,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,444 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {14041#true} {14101#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #54#return; {14101#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:48:20,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {14101#(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; {14123#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {14123#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !false; {14123#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,445 INFO L272 TraceCheckUtils]: 27: Hoare triple {14123#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14041#true} is VALID [2022-04-08 07:48:20,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,446 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14041#true} {14123#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} #54#return; {14123#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {14123#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14145#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 07:48:20,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {14145#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {14145#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 07:48:20,447 INFO L272 TraceCheckUtils]: 34: Hoare triple {14145#(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)); {14041#true} is VALID [2022-04-08 07:48:20,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,447 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14041#true} {14145#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #54#return; {14145#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 07:48:20,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {14145#(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; {14167#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {14167#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {14167#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,448 INFO L272 TraceCheckUtils]: 41: Hoare triple {14167#(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)); {14041#true} is VALID [2022-04-08 07:48:20,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,448 INFO L290 TraceCheckUtils]: 43: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,449 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14041#true} {14167#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {14167#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {14167#(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; {14189#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {14189#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} assume !false; {14189#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,450 INFO L272 TraceCheckUtils]: 48: Hoare triple {14189#(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)); {14041#true} is VALID [2022-04-08 07:48:20,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,450 INFO L290 TraceCheckUtils]: 50: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,450 INFO L290 TraceCheckUtils]: 51: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,454 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14041#true} {14189#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} #54#return; {14189#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,455 INFO L290 TraceCheckUtils]: 53: Hoare triple {14189#(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; {14211#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,455 INFO L290 TraceCheckUtils]: 54: Hoare triple {14211#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !false; {14211#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,455 INFO L272 TraceCheckUtils]: 55: Hoare triple {14211#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14041#true} is VALID [2022-04-08 07:48:20,455 INFO L290 TraceCheckUtils]: 56: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,456 INFO L290 TraceCheckUtils]: 57: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,456 INFO L290 TraceCheckUtils]: 58: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,456 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14041#true} {14211#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} #54#return; {14211#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,457 INFO L290 TraceCheckUtils]: 60: Hoare triple {14211#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {14233#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,457 INFO L290 TraceCheckUtils]: 61: Hoare triple {14233#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} assume !false; {14233#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,457 INFO L272 TraceCheckUtils]: 62: Hoare triple {14233#(and (= 5 (+ (- 2) 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)); {14041#true} is VALID [2022-04-08 07:48:20,457 INFO L290 TraceCheckUtils]: 63: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,457 INFO L290 TraceCheckUtils]: 64: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,457 INFO L290 TraceCheckUtils]: 65: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,458 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14041#true} {14233#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} #54#return; {14233#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,458 INFO L290 TraceCheckUtils]: 67: Hoare triple {14233#(and (= 5 (+ (- 2) 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; {14255#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,459 INFO L290 TraceCheckUtils]: 68: Hoare triple {14255#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {14255#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,459 INFO L272 TraceCheckUtils]: 69: Hoare triple {14255#(and (= (+ (- 2) main_~y~0) 6) (= 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)); {14041#true} is VALID [2022-04-08 07:48:20,459 INFO L290 TraceCheckUtils]: 70: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,459 INFO L290 TraceCheckUtils]: 71: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,459 INFO L290 TraceCheckUtils]: 72: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,459 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {14041#true} {14255#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} #54#return; {14255#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,460 INFO L290 TraceCheckUtils]: 74: Hoare triple {14255#(and (= (+ (- 2) main_~y~0) 6) (= 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; {14277#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,460 INFO L290 TraceCheckUtils]: 75: Hoare triple {14277#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} assume !false; {14277#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,460 INFO L272 TraceCheckUtils]: 76: Hoare triple {14277#(and (= main_~y~0 9) (= (+ (- 1) 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)); {14041#true} is VALID [2022-04-08 07:48:20,460 INFO L290 TraceCheckUtils]: 77: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,460 INFO L290 TraceCheckUtils]: 78: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,461 INFO L290 TraceCheckUtils]: 79: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,461 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {14041#true} {14277#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} #54#return; {14277#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,461 INFO L290 TraceCheckUtils]: 81: Hoare triple {14277#(and (= main_~y~0 9) (= (+ (- 1) 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; {14299#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,462 INFO L290 TraceCheckUtils]: 82: Hoare triple {14299#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} assume !false; {14299#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,462 INFO L272 TraceCheckUtils]: 83: Hoare triple {14299#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 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)); {14041#true} is VALID [2022-04-08 07:48:20,462 INFO L290 TraceCheckUtils]: 84: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,462 INFO L290 TraceCheckUtils]: 85: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,462 INFO L290 TraceCheckUtils]: 86: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,462 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14041#true} {14299#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} #54#return; {14299#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,463 INFO L290 TraceCheckUtils]: 88: Hoare triple {14299#(and (= 9 (+ (- 1) main_~y~0)) (= 8 (+ (- 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; {14321#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,463 INFO L290 TraceCheckUtils]: 89: Hoare triple {14321#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9) (< 0 main_~k~0))} assume !false; {14321#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,463 INFO L272 TraceCheckUtils]: 90: Hoare triple {14321#(and (= main_~c~0 11) (= (+ (- 2) main_~y~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)); {14041#true} is VALID [2022-04-08 07:48:20,463 INFO L290 TraceCheckUtils]: 91: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,463 INFO L290 TraceCheckUtils]: 92: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,463 INFO L290 TraceCheckUtils]: 93: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,464 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {14041#true} {14321#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9) (< 0 main_~k~0))} #54#return; {14321#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,464 INFO L290 TraceCheckUtils]: 95: Hoare triple {14321#(and (= main_~c~0 11) (= (+ (- 2) main_~y~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; {14343#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,465 INFO L290 TraceCheckUtils]: 96: Hoare triple {14343#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9) (< 0 main_~k~0))} assume !false; {14343#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,465 INFO L272 TraceCheckUtils]: 97: Hoare triple {14343#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 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)); {14041#true} is VALID [2022-04-08 07:48:20,465 INFO L290 TraceCheckUtils]: 98: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,465 INFO L290 TraceCheckUtils]: 99: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,465 INFO L290 TraceCheckUtils]: 100: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,465 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {14041#true} {14343#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9) (< 0 main_~k~0))} #54#return; {14343#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,466 INFO L290 TraceCheckUtils]: 102: Hoare triple {14343#(and (= (+ (- 1) main_~c~0) 11) (= (+ main_~y~0 (- 3)) 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; {14365#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,466 INFO L290 TraceCheckUtils]: 103: Hoare triple {14365#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 9) (< 0 main_~k~0))} assume !false; {14365#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,466 INFO L272 TraceCheckUtils]: 104: Hoare triple {14365#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 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)); {14041#true} is VALID [2022-04-08 07:48:20,466 INFO L290 TraceCheckUtils]: 105: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,466 INFO L290 TraceCheckUtils]: 106: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,466 INFO L290 TraceCheckUtils]: 107: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,467 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {14041#true} {14365#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 9) (< 0 main_~k~0))} #54#return; {14365#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 9) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,467 INFO L290 TraceCheckUtils]: 109: Hoare triple {14365#(and (= 11 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 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; {14387#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,468 INFO L290 TraceCheckUtils]: 110: Hoare triple {14387#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14) (< 0 main_~k~0))} assume !false; {14387#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,468 INFO L272 TraceCheckUtils]: 111: Hoare triple {14387#(and (= 9 (+ main_~y~0 (- 5))) (= 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)); {14041#true} is VALID [2022-04-08 07:48:20,468 INFO L290 TraceCheckUtils]: 112: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,468 INFO L290 TraceCheckUtils]: 113: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,468 INFO L290 TraceCheckUtils]: 114: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,468 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {14041#true} {14387#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14) (< 0 main_~k~0))} #54#return; {14387#(and (= 9 (+ main_~y~0 (- 5))) (= main_~c~0 14) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,469 INFO L290 TraceCheckUtils]: 116: Hoare triple {14387#(and (= 9 (+ main_~y~0 (- 5))) (= 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; {14409#(and (= (+ main_~y~0 (- 6)) 9) (= main_~c~0 15) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,469 INFO L290 TraceCheckUtils]: 117: Hoare triple {14409#(and (= (+ main_~y~0 (- 6)) 9) (= main_~c~0 15) (< 0 main_~k~0))} assume !false; {14409#(and (= (+ main_~y~0 (- 6)) 9) (= main_~c~0 15) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,469 INFO L272 TraceCheckUtils]: 118: Hoare triple {14409#(and (= (+ main_~y~0 (- 6)) 9) (= 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)); {14041#true} is VALID [2022-04-08 07:48:20,469 INFO L290 TraceCheckUtils]: 119: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,469 INFO L290 TraceCheckUtils]: 120: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,469 INFO L290 TraceCheckUtils]: 121: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,470 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {14041#true} {14409#(and (= (+ main_~y~0 (- 6)) 9) (= main_~c~0 15) (< 0 main_~k~0))} #54#return; {14409#(and (= (+ main_~y~0 (- 6)) 9) (= main_~c~0 15) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,470 INFO L290 TraceCheckUtils]: 123: Hoare triple {14409#(and (= (+ main_~y~0 (- 6)) 9) (= 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; {14431#(and (= (+ (- 1) main_~c~0) 15) (= 9 (+ main_~y~0 (- 7))) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,470 INFO L290 TraceCheckUtils]: 124: Hoare triple {14431#(and (= (+ (- 1) main_~c~0) 15) (= 9 (+ main_~y~0 (- 7))) (< 0 main_~k~0))} assume !false; {14431#(and (= (+ (- 1) main_~c~0) 15) (= 9 (+ main_~y~0 (- 7))) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,471 INFO L272 TraceCheckUtils]: 125: Hoare triple {14431#(and (= (+ (- 1) main_~c~0) 15) (= 9 (+ main_~y~0 (- 7))) (< 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)); {14041#true} is VALID [2022-04-08 07:48:20,471 INFO L290 TraceCheckUtils]: 126: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,471 INFO L290 TraceCheckUtils]: 127: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,471 INFO L290 TraceCheckUtils]: 128: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,471 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {14041#true} {14431#(and (= (+ (- 1) main_~c~0) 15) (= 9 (+ main_~y~0 (- 7))) (< 0 main_~k~0))} #54#return; {14431#(and (= (+ (- 1) main_~c~0) 15) (= 9 (+ main_~y~0 (- 7))) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:20,472 INFO L290 TraceCheckUtils]: 130: Hoare triple {14431#(and (= (+ (- 1) main_~c~0) 15) (= 9 (+ main_~y~0 (- 7))) (< 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; {14453#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 07:48:20,472 INFO L290 TraceCheckUtils]: 131: Hoare triple {14453#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} assume !false; {14453#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 07:48:20,472 INFO L272 TraceCheckUtils]: 132: Hoare triple {14453#(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)); {14041#true} is VALID [2022-04-08 07:48:20,472 INFO L290 TraceCheckUtils]: 133: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,473 INFO L290 TraceCheckUtils]: 134: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,473 INFO L290 TraceCheckUtils]: 135: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,473 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {14041#true} {14453#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} #54#return; {14453#(and (= main_~c~0 17) (< 0 main_~k~0) (= main_~y~0 17))} is VALID [2022-04-08 07:48:20,473 INFO L290 TraceCheckUtils]: 137: Hoare triple {14453#(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; {14475#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 07:48:20,474 INFO L290 TraceCheckUtils]: 138: Hoare triple {14475#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} assume !false; {14475#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 07:48:20,474 INFO L272 TraceCheckUtils]: 139: Hoare triple {14475#(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)); {14041#true} is VALID [2022-04-08 07:48:20,474 INFO L290 TraceCheckUtils]: 140: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,474 INFO L290 TraceCheckUtils]: 141: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,474 INFO L290 TraceCheckUtils]: 142: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,474 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {14041#true} {14475#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} #54#return; {14475#(and (= main_~c~0 18) (< 0 main_~k~0) (= main_~y~0 18))} is VALID [2022-04-08 07:48:20,475 INFO L290 TraceCheckUtils]: 144: Hoare triple {14475#(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; {14497#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-08 07:48:20,475 INFO L290 TraceCheckUtils]: 145: Hoare triple {14497#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} assume !false; {14497#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-08 07:48:20,475 INFO L272 TraceCheckUtils]: 146: Hoare triple {14497#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 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)); {14041#true} is VALID [2022-04-08 07:48:20,475 INFO L290 TraceCheckUtils]: 147: Hoare triple {14041#true} ~cond := #in~cond; {14041#true} is VALID [2022-04-08 07:48:20,475 INFO L290 TraceCheckUtils]: 148: Hoare triple {14041#true} assume !(0 == ~cond); {14041#true} is VALID [2022-04-08 07:48:20,476 INFO L290 TraceCheckUtils]: 149: Hoare triple {14041#true} assume true; {14041#true} is VALID [2022-04-08 07:48:20,476 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {14041#true} {14497#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} #54#return; {14497#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} is VALID [2022-04-08 07:48:20,477 INFO L290 TraceCheckUtils]: 151: Hoare triple {14497#(and (< 18 main_~k~0) (<= main_~c~0 19) (= 19 main_~y~0))} assume !(~c~0 < ~k~0); {14519#(and (< 18 main_~k~0) (<= main_~k~0 19) (= 19 main_~y~0))} is VALID [2022-04-08 07:48:20,478 INFO L272 TraceCheckUtils]: 152: Hoare triple {14519#(and (< 18 main_~k~0) (<= main_~k~0 19) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {14523#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:20,478 INFO L290 TraceCheckUtils]: 153: Hoare triple {14523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:20,478 INFO L290 TraceCheckUtils]: 154: Hoare triple {14527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14042#false} is VALID [2022-04-08 07:48:20,479 INFO L290 TraceCheckUtils]: 155: Hoare triple {14042#false} assume !false; {14042#false} is VALID [2022-04-08 07:48:20,479 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 07:48:20,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:22,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:22,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154721694] [2022-04-08 07:48:22,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:22,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502643990] [2022-04-08 07:48:22,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502643990] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:22,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:22,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-04-08 07:48:22,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:22,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1252964151] [2022-04-08 07:48:22,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1252964151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:22,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:22,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 07:48:22,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249317960] [2022-04-08 07:48:22,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:22,575 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) Word has length 156 [2022-04-08 07:48:22,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:22,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 07:48:22,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:22,680 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 07:48:22,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:22,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 07:48:22,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1613, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 07:48:22,682 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 07:48:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:26,587 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-04-08 07:48:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 07:48:26,587 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) Word has length 156 [2022-04-08 07:48:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 07:48:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-08 07:48:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 07:48:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 108 transitions. [2022-04-08 07:48:26,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 108 transitions. [2022-04-08 07:48:26,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:26,757 INFO L225 Difference]: With dead ends: 93 [2022-04-08 07:48:26,757 INFO L226 Difference]: Without dead ends: 88 [2022-04-08 07:48:26,758 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=467, Invalid=1789, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 07:48:26,758 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:26,758 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 907 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-08 07:48:26,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-08 07:48:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-08 07:48:26,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:26,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 07:48:26,857 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 07:48:26,857 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 07:48:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:26,858 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-08 07:48:26,858 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-08 07:48:26,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:26,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:26,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 88 states. [2022-04-08 07:48:26,859 INFO L87 Difference]: Start difference. First operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 88 states. [2022-04-08 07:48:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:26,860 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-08 07:48:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-08 07:48:26,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:26,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:26,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:26,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 25 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 07:48:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-04-08 07:48:26,867 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 156 [2022-04-08 07:48:26,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:26,867 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-04-08 07:48:26,867 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 07:48:26,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 107 transitions. [2022-04-08 07:48:27,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-08 07:48:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-08 07:48:27,487 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:27,488 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:27,492 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 07:48:27,692 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 07:48:27,693 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:27,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:27,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 39 times [2022-04-08 07:48:27,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:27,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2107877409] [2022-04-08 07:48:27,759 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:48:27,759 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:48:27,759 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:48:27,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1670771305, now seen corresponding path program 40 times [2022-04-08 07:48:27,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:27,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895596982] [2022-04-08 07:48:27,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:27,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:27,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:27,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1024612145] [2022-04-08 07:48:27,772 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:48:27,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:27,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:27,773 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 07:48:27,774 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 07:48:28,261 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:48:28,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:28,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-08 07:48:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:28,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:29,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {15513#true} call ULTIMATE.init(); {15513#true} is VALID [2022-04-08 07:48:29,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {15513#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); {15513#true} is VALID [2022-04-08 07:48:29,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15513#true} {15513#true} #60#return; {15513#true} is VALID [2022-04-08 07:48:29,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {15513#true} call #t~ret5 := main(); {15513#true} is VALID [2022-04-08 07:48:29,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {15513#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; {15513#true} is VALID [2022-04-08 07:48:29,075 INFO L272 TraceCheckUtils]: 6: Hoare triple {15513#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {15513#true} is VALID [2022-04-08 07:48:29,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,076 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15513#true} {15513#true} #52#return; {15513#true} is VALID [2022-04-08 07:48:29,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {15513#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15551#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:29,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {15551#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {15551#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:29,082 INFO L272 TraceCheckUtils]: 13: Hoare triple {15551#(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)); {15513#true} is VALID [2022-04-08 07:48:29,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,083 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15513#true} {15551#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {15551#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:29,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {15551#(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; {15573#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:48:29,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {15573#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {15573#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:48:29,084 INFO L272 TraceCheckUtils]: 20: Hoare triple {15573#(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)); {15513#true} is VALID [2022-04-08 07:48:29,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,084 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15513#true} {15573#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {15573#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:48:29,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {15573#(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; {15595#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:29,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {15595#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {15595#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:29,085 INFO L272 TraceCheckUtils]: 27: Hoare triple {15595#(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)); {15513#true} is VALID [2022-04-08 07:48:29,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,086 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15513#true} {15595#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {15595#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:29,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {15595#(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; {15617#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:48:29,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {15617#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !false; {15617#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:48:29,086 INFO L272 TraceCheckUtils]: 34: Hoare triple {15617#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15513#true} is VALID [2022-04-08 07:48:29,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,087 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15513#true} {15617#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #54#return; {15617#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:48:29,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {15617#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15639#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:48:29,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {15639#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !false; {15639#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:48:29,088 INFO L272 TraceCheckUtils]: 41: Hoare triple {15639#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15513#true} is VALID [2022-04-08 07:48:29,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,088 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15513#true} {15639#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #54#return; {15639#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:48:29,089 INFO L290 TraceCheckUtils]: 46: Hoare triple {15639#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15661#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:48:29,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {15661#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} assume !false; {15661#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:48:29,089 INFO L272 TraceCheckUtils]: 48: Hoare triple {15661#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {15513#true} is VALID [2022-04-08 07:48:29,089 INFO L290 TraceCheckUtils]: 49: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,089 INFO L290 TraceCheckUtils]: 50: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,089 INFO L290 TraceCheckUtils]: 51: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,090 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15513#true} {15661#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} #54#return; {15661#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:48:29,090 INFO L290 TraceCheckUtils]: 53: Hoare triple {15661#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {15683#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:29,090 INFO L290 TraceCheckUtils]: 54: Hoare triple {15683#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {15683#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:29,090 INFO L272 TraceCheckUtils]: 55: Hoare triple {15683#(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)); {15513#true} is VALID [2022-04-08 07:48:29,091 INFO L290 TraceCheckUtils]: 56: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,091 INFO L290 TraceCheckUtils]: 57: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,091 INFO L290 TraceCheckUtils]: 58: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,091 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15513#true} {15683#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {15683#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:29,091 INFO L290 TraceCheckUtils]: 60: Hoare triple {15683#(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; {15705#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:29,092 INFO L290 TraceCheckUtils]: 61: Hoare triple {15705#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {15705#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:29,092 INFO L272 TraceCheckUtils]: 62: Hoare triple {15705#(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)); {15513#true} is VALID [2022-04-08 07:48:29,092 INFO L290 TraceCheckUtils]: 63: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,092 INFO L290 TraceCheckUtils]: 64: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,092 INFO L290 TraceCheckUtils]: 65: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,092 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15513#true} {15705#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {15705#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:29,093 INFO L290 TraceCheckUtils]: 67: Hoare triple {15705#(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; {15727#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 07:48:29,093 INFO L290 TraceCheckUtils]: 68: Hoare triple {15727#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {15727#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 07:48:29,093 INFO L272 TraceCheckUtils]: 69: Hoare triple {15727#(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)); {15513#true} is VALID [2022-04-08 07:48:29,093 INFO L290 TraceCheckUtils]: 70: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,093 INFO L290 TraceCheckUtils]: 71: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,093 INFO L290 TraceCheckUtils]: 72: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,094 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15513#true} {15727#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #54#return; {15727#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 07:48:29,094 INFO L290 TraceCheckUtils]: 74: Hoare triple {15727#(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; {15749#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:48:29,094 INFO L290 TraceCheckUtils]: 75: Hoare triple {15749#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {15749#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:48:29,095 INFO L272 TraceCheckUtils]: 76: Hoare triple {15749#(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)); {15513#true} is VALID [2022-04-08 07:48:29,095 INFO L290 TraceCheckUtils]: 77: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,095 INFO L290 TraceCheckUtils]: 78: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,095 INFO L290 TraceCheckUtils]: 79: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,096 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15513#true} {15749#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {15749#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:48:29,097 INFO L290 TraceCheckUtils]: 81: Hoare triple {15749#(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; {15771#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:48:29,097 INFO L290 TraceCheckUtils]: 82: Hoare triple {15771#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {15771#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:48:29,097 INFO L272 TraceCheckUtils]: 83: Hoare triple {15771#(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)); {15513#true} is VALID [2022-04-08 07:48:29,097 INFO L290 TraceCheckUtils]: 84: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,097 INFO L290 TraceCheckUtils]: 85: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,097 INFO L290 TraceCheckUtils]: 86: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,097 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {15513#true} {15771#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {15771#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:48:29,098 INFO L290 TraceCheckUtils]: 88: Hoare triple {15771#(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; {15793#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:48:29,098 INFO L290 TraceCheckUtils]: 89: Hoare triple {15793#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {15793#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:48:29,098 INFO L272 TraceCheckUtils]: 90: Hoare triple {15793#(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)); {15513#true} is VALID [2022-04-08 07:48:29,098 INFO L290 TraceCheckUtils]: 91: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,098 INFO L290 TraceCheckUtils]: 92: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,098 INFO L290 TraceCheckUtils]: 93: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,099 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {15513#true} {15793#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {15793#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:48:29,099 INFO L290 TraceCheckUtils]: 95: Hoare triple {15793#(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; {15815#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:48:29,100 INFO L290 TraceCheckUtils]: 96: Hoare triple {15815#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {15815#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:48:29,100 INFO L272 TraceCheckUtils]: 97: Hoare triple {15815#(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)); {15513#true} is VALID [2022-04-08 07:48:29,100 INFO L290 TraceCheckUtils]: 98: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,100 INFO L290 TraceCheckUtils]: 99: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,100 INFO L290 TraceCheckUtils]: 100: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,100 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15513#true} {15815#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {15815#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:48:29,101 INFO L290 TraceCheckUtils]: 102: Hoare triple {15815#(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; {15837#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:48:29,101 INFO L290 TraceCheckUtils]: 103: Hoare triple {15837#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {15837#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:48:29,101 INFO L272 TraceCheckUtils]: 104: Hoare triple {15837#(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)); {15513#true} is VALID [2022-04-08 07:48:29,101 INFO L290 TraceCheckUtils]: 105: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,101 INFO L290 TraceCheckUtils]: 106: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,101 INFO L290 TraceCheckUtils]: 107: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,102 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15513#true} {15837#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {15837#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:48:29,102 INFO L290 TraceCheckUtils]: 109: Hoare triple {15837#(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; {15859#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 07:48:29,102 INFO L290 TraceCheckUtils]: 110: Hoare triple {15859#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {15859#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 07:48:29,102 INFO L272 TraceCheckUtils]: 111: Hoare triple {15859#(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)); {15513#true} is VALID [2022-04-08 07:48:29,102 INFO L290 TraceCheckUtils]: 112: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,102 INFO L290 TraceCheckUtils]: 113: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,103 INFO L290 TraceCheckUtils]: 114: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,103 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {15513#true} {15859#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {15859#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 07:48:29,103 INFO L290 TraceCheckUtils]: 116: Hoare triple {15859#(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; {15881#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:29,104 INFO L290 TraceCheckUtils]: 117: Hoare triple {15881#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {15881#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:29,104 INFO L272 TraceCheckUtils]: 118: Hoare triple {15881#(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)); {15513#true} is VALID [2022-04-08 07:48:29,104 INFO L290 TraceCheckUtils]: 119: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,104 INFO L290 TraceCheckUtils]: 120: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,104 INFO L290 TraceCheckUtils]: 121: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,104 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {15513#true} {15881#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {15881#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:29,105 INFO L290 TraceCheckUtils]: 123: Hoare triple {15881#(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; {15903#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:48:29,105 INFO L290 TraceCheckUtils]: 124: Hoare triple {15903#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {15903#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:48:29,105 INFO L272 TraceCheckUtils]: 125: Hoare triple {15903#(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)); {15513#true} is VALID [2022-04-08 07:48:29,105 INFO L290 TraceCheckUtils]: 126: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,105 INFO L290 TraceCheckUtils]: 127: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,105 INFO L290 TraceCheckUtils]: 128: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,106 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15513#true} {15903#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {15903#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:48:29,106 INFO L290 TraceCheckUtils]: 130: Hoare triple {15903#(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; {15925#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-08 07:48:29,106 INFO L290 TraceCheckUtils]: 131: Hoare triple {15925#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {15925#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-08 07:48:29,106 INFO L272 TraceCheckUtils]: 132: Hoare triple {15925#(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)); {15513#true} is VALID [2022-04-08 07:48:29,106 INFO L290 TraceCheckUtils]: 133: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,107 INFO L290 TraceCheckUtils]: 134: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,107 INFO L290 TraceCheckUtils]: 135: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,107 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {15513#true} {15925#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #54#return; {15925#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-08 07:48:29,107 INFO L290 TraceCheckUtils]: 137: Hoare triple {15925#(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; {15947#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:48:29,108 INFO L290 TraceCheckUtils]: 138: Hoare triple {15947#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {15947#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:48:29,108 INFO L272 TraceCheckUtils]: 139: Hoare triple {15947#(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)); {15513#true} is VALID [2022-04-08 07:48:29,108 INFO L290 TraceCheckUtils]: 140: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,108 INFO L290 TraceCheckUtils]: 141: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,108 INFO L290 TraceCheckUtils]: 142: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,108 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {15513#true} {15947#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #54#return; {15947#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:48:29,109 INFO L290 TraceCheckUtils]: 144: Hoare triple {15947#(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; {15969#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:48:29,109 INFO L290 TraceCheckUtils]: 145: Hoare triple {15969#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {15969#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:48:29,109 INFO L272 TraceCheckUtils]: 146: Hoare triple {15969#(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)); {15513#true} is VALID [2022-04-08 07:48:29,109 INFO L290 TraceCheckUtils]: 147: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,109 INFO L290 TraceCheckUtils]: 148: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,109 INFO L290 TraceCheckUtils]: 149: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,110 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {15513#true} {15969#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {15969#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:48:29,110 INFO L290 TraceCheckUtils]: 151: Hoare triple {15969#(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; {15991#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} is VALID [2022-04-08 07:48:29,111 INFO L290 TraceCheckUtils]: 152: Hoare triple {15991#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} assume !false; {15991#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} is VALID [2022-04-08 07:48:29,111 INFO L272 TraceCheckUtils]: 153: Hoare triple {15991#(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)); {15513#true} is VALID [2022-04-08 07:48:29,111 INFO L290 TraceCheckUtils]: 154: Hoare triple {15513#true} ~cond := #in~cond; {15513#true} is VALID [2022-04-08 07:48:29,111 INFO L290 TraceCheckUtils]: 155: Hoare triple {15513#true} assume !(0 == ~cond); {15513#true} is VALID [2022-04-08 07:48:29,111 INFO L290 TraceCheckUtils]: 156: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-04-08 07:48:29,111 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {15513#true} {15991#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} #54#return; {15991#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} is VALID [2022-04-08 07:48:29,112 INFO L290 TraceCheckUtils]: 158: Hoare triple {15991#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~c~0 20) (< 19 main_~k~0))} assume !(~c~0 < ~k~0); {16013#(and (= 19 (+ (- 1) main_~y~0)) (<= main_~k~0 20) (< 19 main_~k~0))} is VALID [2022-04-08 07:48:29,113 INFO L272 TraceCheckUtils]: 159: Hoare triple {16013#(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)); {16017#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:29,113 INFO L290 TraceCheckUtils]: 160: Hoare triple {16017#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16021#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:29,113 INFO L290 TraceCheckUtils]: 161: Hoare triple {16021#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15514#false} is VALID [2022-04-08 07:48:29,113 INFO L290 TraceCheckUtils]: 162: Hoare triple {15514#false} assume !false; {15514#false} is VALID [2022-04-08 07:48:29,114 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 07:48:29,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:29,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:29,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895596982] [2022-04-08 07:48:29,391 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:29,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024612145] [2022-04-08 07:48:29,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024612145] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:29,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:29,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-04-08 07:48:29,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:29,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2107877409] [2022-04-08 07:48:29,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2107877409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:29,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:29,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 07:48:29,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142325008] [2022-04-08 07:48:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:29,392 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Word has length 163 [2022-04-08 07:48:29,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:29,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 07:48:29,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:29,487 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 07:48:29,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:29,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 07:48:29,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-08 07:48:29,488 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 07:48:34,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:34,155 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-04-08 07:48:34,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 07:48:34,155 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Word has length 163 [2022-04-08 07:48:34,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 07:48:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-08 07:48:34,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 07:48:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 112 transitions. [2022-04-08 07:48:34,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 112 transitions. [2022-04-08 07:48:34,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:34,299 INFO L225 Difference]: With dead ends: 96 [2022-04-08 07:48:34,299 INFO L226 Difference]: Without dead ends: 91 [2022-04-08 07:48:34,299 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2022-04-08 07:48:34,300 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:34,300 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 989 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 07:48:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-08 07:48:34,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-08 07:48:34,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:34,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 07:48:34,410 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 07:48:34,410 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 07:48:34,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:34,411 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-08 07:48:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-08 07:48:34,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:34,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:34,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 91 states. [2022-04-08 07:48:34,412 INFO L87 Difference]: Start difference. First operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 91 states. [2022-04-08 07:48:34,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:34,413 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-08 07:48:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-08 07:48:34,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:34,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:34,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:34,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 26 states have call successors, (26), 6 states have call predecessors, (26), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 07:48:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-04-08 07:48:34,415 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 163 [2022-04-08 07:48:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:34,416 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-04-08 07:48:34,416 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 23 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 07:48:34,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 111 transitions. [2022-04-08 07:48:35,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-08 07:48:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-04-08 07:48:35,071 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:35,071 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:35,076 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 07:48:35,272 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 07:48:35,272 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:35,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1329797496, now seen corresponding path program 41 times [2022-04-08 07:48:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:35,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [75129976] [2022-04-08 07:48:35,344 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:48:35,344 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:48:35,344 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:48:35,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1329797496, now seen corresponding path program 42 times [2022-04-08 07:48:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:35,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535646401] [2022-04-08 07:48:35,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:35,361 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:35,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [477873755] [2022-04-08 07:48:35,361 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:48:35,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:35,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:35,367 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 07:48:35,367 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 07:48:37,257 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-08 07:48:37,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:37,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-08 07:48:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:37,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:38,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {16629#true} call ULTIMATE.init(); {16629#true} is VALID [2022-04-08 07:48:38,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {16629#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); {16629#true} is VALID [2022-04-08 07:48:38,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16629#true} {16629#true} #60#return; {16629#true} is VALID [2022-04-08 07:48:38,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {16629#true} call #t~ret5 := main(); {16629#true} is VALID [2022-04-08 07:48:38,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {16629#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; {16629#true} is VALID [2022-04-08 07:48:38,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {16629#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {16629#true} is VALID [2022-04-08 07:48:38,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16629#true} {16629#true} #52#return; {16629#true} is VALID [2022-04-08 07:48:38,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {16629#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {16667#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:38,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {16667#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {16667#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:38,230 INFO L272 TraceCheckUtils]: 13: Hoare triple {16667#(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)); {16629#true} is VALID [2022-04-08 07:48:38,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,231 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16629#true} {16667#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {16667#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:38,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {16667#(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; {16689#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:48:38,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {16689#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {16689#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:48:38,232 INFO L272 TraceCheckUtils]: 20: Hoare triple {16689#(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)); {16629#true} is VALID [2022-04-08 07:48:38,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,233 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {16629#true} {16689#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {16689#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:48:38,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {16689#(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; {16711#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:48:38,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {16711#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {16711#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:48:38,233 INFO L272 TraceCheckUtils]: 27: Hoare triple {16711#(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)); {16629#true} is VALID [2022-04-08 07:48:38,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,234 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16629#true} {16711#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {16711#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:48:38,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {16711#(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; {16733#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:48:38,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {16733#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {16733#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:48:38,235 INFO L272 TraceCheckUtils]: 34: Hoare triple {16733#(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)); {16629#true} is VALID [2022-04-08 07:48:38,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,236 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16629#true} {16733#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {16733#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:48:38,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {16733#(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; {16755#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:38,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {16755#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {16755#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:38,236 INFO L272 TraceCheckUtils]: 41: Hoare triple {16755#(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)); {16629#true} is VALID [2022-04-08 07:48:38,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,237 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16629#true} {16755#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {16755#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:38,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {16755#(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; {16777#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:48:38,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {16777#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {16777#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:48:38,238 INFO L272 TraceCheckUtils]: 48: Hoare triple {16777#(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)); {16629#true} is VALID [2022-04-08 07:48:38,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,239 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16629#true} {16777#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {16777#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:48:38,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {16777#(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; {16799#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:38,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {16799#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {16799#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:38,239 INFO L272 TraceCheckUtils]: 55: Hoare triple {16799#(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)); {16629#true} is VALID [2022-04-08 07:48:38,240 INFO L290 TraceCheckUtils]: 56: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,240 INFO L290 TraceCheckUtils]: 58: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,240 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16629#true} {16799#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {16799#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:38,241 INFO L290 TraceCheckUtils]: 60: Hoare triple {16799#(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; {16821#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:48:38,241 INFO L290 TraceCheckUtils]: 61: Hoare triple {16821#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {16821#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:48:38,241 INFO L272 TraceCheckUtils]: 62: Hoare triple {16821#(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)); {16629#true} is VALID [2022-04-08 07:48:38,241 INFO L290 TraceCheckUtils]: 63: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,241 INFO L290 TraceCheckUtils]: 64: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,241 INFO L290 TraceCheckUtils]: 65: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,242 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16629#true} {16821#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {16821#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:48:38,242 INFO L290 TraceCheckUtils]: 67: Hoare triple {16821#(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; {16843#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:38,242 INFO L290 TraceCheckUtils]: 68: Hoare triple {16843#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !false; {16843#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:38,242 INFO L272 TraceCheckUtils]: 69: Hoare triple {16843#(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)); {16629#true} is VALID [2022-04-08 07:48:38,243 INFO L290 TraceCheckUtils]: 70: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,243 INFO L290 TraceCheckUtils]: 71: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,243 INFO L290 TraceCheckUtils]: 72: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,243 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16629#true} {16843#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #54#return; {16843#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:38,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {16843#(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; {16865#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:48:38,244 INFO L290 TraceCheckUtils]: 75: Hoare triple {16865#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} assume !false; {16865#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:48:38,244 INFO L272 TraceCheckUtils]: 76: Hoare triple {16865#(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)); {16629#true} is VALID [2022-04-08 07:48:38,244 INFO L290 TraceCheckUtils]: 77: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,244 INFO L290 TraceCheckUtils]: 78: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,244 INFO L290 TraceCheckUtils]: 79: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,245 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16629#true} {16865#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} #54#return; {16865#(and (= (+ main_~c~0 (- 3)) 6) (= 7 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:48:38,245 INFO L290 TraceCheckUtils]: 81: Hoare triple {16865#(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; {16887#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 07:48:38,245 INFO L290 TraceCheckUtils]: 82: Hoare triple {16887#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !false; {16887#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 07:48:38,245 INFO L272 TraceCheckUtils]: 83: Hoare triple {16887#(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)); {16629#true} is VALID [2022-04-08 07:48:38,246 INFO L290 TraceCheckUtils]: 84: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,246 INFO L290 TraceCheckUtils]: 85: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,246 INFO L290 TraceCheckUtils]: 86: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,246 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {16629#true} {16887#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} #54#return; {16887#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 07:48:38,247 INFO L290 TraceCheckUtils]: 88: Hoare triple {16887#(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; {16909#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 07:48:38,247 INFO L290 TraceCheckUtils]: 89: Hoare triple {16909#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} assume !false; {16909#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 07:48:38,247 INFO L272 TraceCheckUtils]: 90: Hoare triple {16909#(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)); {16629#true} is VALID [2022-04-08 07:48:38,247 INFO L290 TraceCheckUtils]: 91: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,247 INFO L290 TraceCheckUtils]: 92: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,247 INFO L290 TraceCheckUtils]: 93: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,248 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {16629#true} {16909#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} #54#return; {16909#(and (= main_~c~0 11) (= 7 (+ main_~y~0 (- 4))))} is VALID [2022-04-08 07:48:38,248 INFO L290 TraceCheckUtils]: 95: Hoare triple {16909#(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; {16931#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:48:38,249 INFO L290 TraceCheckUtils]: 96: Hoare triple {16931#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {16931#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:48:38,249 INFO L272 TraceCheckUtils]: 97: Hoare triple {16931#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16629#true} is VALID [2022-04-08 07:48:38,249 INFO L290 TraceCheckUtils]: 98: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,249 INFO L290 TraceCheckUtils]: 99: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,249 INFO L290 TraceCheckUtils]: 100: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,249 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {16629#true} {16931#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {16931#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:48:38,250 INFO L290 TraceCheckUtils]: 102: Hoare triple {16931#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16953#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:38,250 INFO L290 TraceCheckUtils]: 103: Hoare triple {16953#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} assume !false; {16953#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:38,250 INFO L272 TraceCheckUtils]: 104: Hoare triple {16953#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16629#true} is VALID [2022-04-08 07:48:38,250 INFO L290 TraceCheckUtils]: 105: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,250 INFO L290 TraceCheckUtils]: 106: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,251 INFO L290 TraceCheckUtils]: 107: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,251 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16629#true} {16953#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} #54#return; {16953#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:38,251 INFO L290 TraceCheckUtils]: 109: Hoare triple {16953#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16975#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 07:48:38,252 INFO L290 TraceCheckUtils]: 110: Hoare triple {16975#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} assume !false; {16975#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 07:48:38,252 INFO L272 TraceCheckUtils]: 111: Hoare triple {16975#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16629#true} is VALID [2022-04-08 07:48:38,252 INFO L290 TraceCheckUtils]: 112: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,252 INFO L290 TraceCheckUtils]: 113: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,252 INFO L290 TraceCheckUtils]: 114: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,253 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {16629#true} {16975#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} #54#return; {16975#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 07:48:38,253 INFO L290 TraceCheckUtils]: 116: Hoare triple {16975#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {16997#(and (= 11 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 07:48:38,253 INFO L290 TraceCheckUtils]: 117: Hoare triple {16997#(and (= 11 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 12))} assume !false; {16997#(and (= 11 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 07:48:38,253 INFO L272 TraceCheckUtils]: 118: Hoare triple {16997#(and (= 11 (+ main_~c~0 (- 4))) (= (+ 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)); {16629#true} is VALID [2022-04-08 07:48:38,254 INFO L290 TraceCheckUtils]: 119: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,254 INFO L290 TraceCheckUtils]: 120: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,254 INFO L290 TraceCheckUtils]: 121: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,254 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {16629#true} {16997#(and (= 11 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 12))} #54#return; {16997#(and (= 11 (+ main_~c~0 (- 4))) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 07:48:38,255 INFO L290 TraceCheckUtils]: 123: Hoare triple {16997#(and (= 11 (+ main_~c~0 (- 4))) (= (+ 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; {17019#(and (= main_~y~0 16) (= (+ main_~c~0 (- 5)) 11))} is VALID [2022-04-08 07:48:38,255 INFO L290 TraceCheckUtils]: 124: Hoare triple {17019#(and (= main_~y~0 16) (= (+ main_~c~0 (- 5)) 11))} assume !false; {17019#(and (= main_~y~0 16) (= (+ main_~c~0 (- 5)) 11))} is VALID [2022-04-08 07:48:38,255 INFO L272 TraceCheckUtils]: 125: Hoare triple {17019#(and (= main_~y~0 16) (= (+ main_~c~0 (- 5)) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {16629#true} is VALID [2022-04-08 07:48:38,255 INFO L290 TraceCheckUtils]: 126: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,255 INFO L290 TraceCheckUtils]: 127: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,255 INFO L290 TraceCheckUtils]: 128: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,256 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {16629#true} {17019#(and (= main_~y~0 16) (= (+ main_~c~0 (- 5)) 11))} #54#return; {17019#(and (= main_~y~0 16) (= (+ main_~c~0 (- 5)) 11))} is VALID [2022-04-08 07:48:38,256 INFO L290 TraceCheckUtils]: 130: Hoare triple {17019#(and (= main_~y~0 16) (= (+ main_~c~0 (- 5)) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {17041#(and (= (+ main_~c~0 (- 6)) 11) (= main_~y~0 17))} is VALID [2022-04-08 07:48:38,256 INFO L290 TraceCheckUtils]: 131: Hoare triple {17041#(and (= (+ main_~c~0 (- 6)) 11) (= main_~y~0 17))} assume !false; {17041#(and (= (+ main_~c~0 (- 6)) 11) (= main_~y~0 17))} is VALID [2022-04-08 07:48:38,256 INFO L272 TraceCheckUtils]: 132: Hoare triple {17041#(and (= (+ main_~c~0 (- 6)) 11) (= 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)); {16629#true} is VALID [2022-04-08 07:48:38,257 INFO L290 TraceCheckUtils]: 133: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,257 INFO L290 TraceCheckUtils]: 134: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,257 INFO L290 TraceCheckUtils]: 135: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,257 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {16629#true} {17041#(and (= (+ main_~c~0 (- 6)) 11) (= main_~y~0 17))} #54#return; {17041#(and (= (+ main_~c~0 (- 6)) 11) (= main_~y~0 17))} is VALID [2022-04-08 07:48:38,258 INFO L290 TraceCheckUtils]: 137: Hoare triple {17041#(and (= (+ main_~c~0 (- 6)) 11) (= 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; {17063#(and (= (+ main_~c~0 (- 7)) 11) (= main_~y~0 18))} is VALID [2022-04-08 07:48:38,258 INFO L290 TraceCheckUtils]: 138: Hoare triple {17063#(and (= (+ main_~c~0 (- 7)) 11) (= main_~y~0 18))} assume !false; {17063#(and (= (+ main_~c~0 (- 7)) 11) (= main_~y~0 18))} is VALID [2022-04-08 07:48:38,258 INFO L272 TraceCheckUtils]: 139: Hoare triple {17063#(and (= (+ main_~c~0 (- 7)) 11) (= 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)); {16629#true} is VALID [2022-04-08 07:48:38,258 INFO L290 TraceCheckUtils]: 140: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,258 INFO L290 TraceCheckUtils]: 141: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,258 INFO L290 TraceCheckUtils]: 142: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,259 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {16629#true} {17063#(and (= (+ main_~c~0 (- 7)) 11) (= main_~y~0 18))} #54#return; {17063#(and (= (+ main_~c~0 (- 7)) 11) (= main_~y~0 18))} is VALID [2022-04-08 07:48:38,259 INFO L290 TraceCheckUtils]: 144: Hoare triple {17063#(and (= (+ main_~c~0 (- 7)) 11) (= 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; {17085#(and (= 18 (+ (- 1) main_~y~0)) (= 11 (+ main_~c~0 (- 8))))} is VALID [2022-04-08 07:48:38,259 INFO L290 TraceCheckUtils]: 145: Hoare triple {17085#(and (= 18 (+ (- 1) main_~y~0)) (= 11 (+ main_~c~0 (- 8))))} assume !false; {17085#(and (= 18 (+ (- 1) main_~y~0)) (= 11 (+ main_~c~0 (- 8))))} is VALID [2022-04-08 07:48:38,260 INFO L272 TraceCheckUtils]: 146: Hoare triple {17085#(and (= 18 (+ (- 1) main_~y~0)) (= 11 (+ 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)); {16629#true} is VALID [2022-04-08 07:48:38,260 INFO L290 TraceCheckUtils]: 147: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,260 INFO L290 TraceCheckUtils]: 148: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,260 INFO L290 TraceCheckUtils]: 149: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,260 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {16629#true} {17085#(and (= 18 (+ (- 1) main_~y~0)) (= 11 (+ main_~c~0 (- 8))))} #54#return; {17085#(and (= 18 (+ (- 1) main_~y~0)) (= 11 (+ main_~c~0 (- 8))))} is VALID [2022-04-08 07:48:38,261 INFO L290 TraceCheckUtils]: 151: Hoare triple {17085#(and (= 18 (+ (- 1) main_~y~0)) (= 11 (+ 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; {17107#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-08 07:48:38,261 INFO L290 TraceCheckUtils]: 152: Hoare triple {17107#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} assume !false; {17107#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-08 07:48:38,261 INFO L272 TraceCheckUtils]: 153: Hoare triple {17107#(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)); {16629#true} is VALID [2022-04-08 07:48:38,261 INFO L290 TraceCheckUtils]: 154: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,261 INFO L290 TraceCheckUtils]: 155: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,261 INFO L290 TraceCheckUtils]: 156: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,262 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {16629#true} {17107#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} #54#return; {17107#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-08 07:48:38,262 INFO L290 TraceCheckUtils]: 158: Hoare triple {17107#(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; {17129#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-08 07:48:38,263 INFO L290 TraceCheckUtils]: 159: Hoare triple {17129#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} assume !false; {17129#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-08 07:48:38,263 INFO L272 TraceCheckUtils]: 160: Hoare triple {17129#(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)); {16629#true} is VALID [2022-04-08 07:48:38,263 INFO L290 TraceCheckUtils]: 161: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-08 07:48:38,263 INFO L290 TraceCheckUtils]: 162: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-08 07:48:38,263 INFO L290 TraceCheckUtils]: 163: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-08 07:48:38,263 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {16629#true} {17129#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} #54#return; {17129#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} is VALID [2022-04-08 07:48:38,265 INFO L290 TraceCheckUtils]: 165: Hoare triple {17129#(and (<= main_~c~0 21) (< 20 main_~k~0) (= main_~y~0 21))} assume !(~c~0 < ~k~0); {17151#(and (< 20 main_~k~0) (= main_~y~0 21) (<= main_~k~0 21))} is VALID [2022-04-08 07:48:38,266 INFO L272 TraceCheckUtils]: 166: Hoare triple {17151#(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)); {17155#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:38,266 INFO L290 TraceCheckUtils]: 167: Hoare triple {17155#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17159#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:38,266 INFO L290 TraceCheckUtils]: 168: Hoare triple {17159#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16630#false} is VALID [2022-04-08 07:48:38,266 INFO L290 TraceCheckUtils]: 169: Hoare triple {16630#false} assume !false; {16630#false} is VALID [2022-04-08 07:48:38,268 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 07:48:38,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:38,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:38,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535646401] [2022-04-08 07:48:38,580 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:38,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477873755] [2022-04-08 07:48:38,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477873755] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:38,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:38,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-04-08 07:48:38,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:38,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [75129976] [2022-04-08 07:48:38,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [75129976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:38,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:38,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 07:48:38,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757419110] [2022-04-08 07:48:38,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:38,581 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-08 07:48:38,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:38,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-08 07:48:38,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:38,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 07:48:38,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:38,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 07:48:38,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-04-08 07:48:38,713 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-08 07:48:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:43,980 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2022-04-08 07:48:43,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 07:48:43,980 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Word has length 170 [2022-04-08 07:48:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-08 07:48:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 116 transitions. [2022-04-08 07:48:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-08 07:48:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 116 transitions. [2022-04-08 07:48:43,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 116 transitions. [2022-04-08 07:48:44,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:44,117 INFO L225 Difference]: With dead ends: 99 [2022-04-08 07:48:44,117 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 07:48:44,118 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 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 07:48:44,118 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 2 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:44,118 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1055 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-08 07:48:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 07:48:44,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-08 07:48:44,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:44,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 07:48:44,233 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 07:48:44,233 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 07:48:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:44,235 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-08 07:48:44,235 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-08 07:48:44,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:44,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:44,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 94 states. [2022-04-08 07:48:44,236 INFO L87 Difference]: Start difference. First operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 94 states. [2022-04-08 07:48:44,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:44,238 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-08 07:48:44,238 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-08 07:48:44,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:44,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:44,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:44,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 27 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 07:48:44,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2022-04-08 07:48:44,241 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 170 [2022-04-08 07:48:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:44,242 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2022-04-08 07:48:44,242 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 24 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2022-04-08 07:48:44,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 115 transitions. [2022-04-08 07:48:45,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-08 07:48:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-04-08 07:48:45,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:45,029 INFO L499 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:45,036 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 07:48:45,229 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 07:48:45,229 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:45,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:45,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1612717687, now seen corresponding path program 43 times [2022-04-08 07:48:45,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:45,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [200712238] [2022-04-08 07:48:45,304 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:48:45,304 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:48:45,304 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:48:45,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1612717687, now seen corresponding path program 44 times [2022-04-08 07:48:45,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:45,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561924508] [2022-04-08 07:48:45,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:45,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:45,318 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:45,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1071520418] [2022-04-08 07:48:45,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:48:45,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:45,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:45,319 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 07:48:45,320 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 07:48:45,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:48:45,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:45,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-08 07:48:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:45,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:46,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {17785#true} call ULTIMATE.init(); {17785#true} is VALID [2022-04-08 07:48:46,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {17785#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); {17785#true} is VALID [2022-04-08 07:48:46,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17785#true} {17785#true} #60#return; {17785#true} is VALID [2022-04-08 07:48:46,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {17785#true} call #t~ret5 := main(); {17785#true} is VALID [2022-04-08 07:48:46,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {17785#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; {17785#true} is VALID [2022-04-08 07:48:46,825 INFO L272 TraceCheckUtils]: 6: Hoare triple {17785#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {17785#true} is VALID [2022-04-08 07:48:46,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,825 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17785#true} {17785#true} #52#return; {17785#true} is VALID [2022-04-08 07:48:46,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {17785#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:46,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {17823#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {17823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:46,826 INFO L272 TraceCheckUtils]: 13: Hoare triple {17823#(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)); {17785#true} is VALID [2022-04-08 07:48:46,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,826 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17785#true} {17823#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {17823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:46,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {17823#(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; {17845#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:48:46,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {17845#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {17845#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:48:46,827 INFO L272 TraceCheckUtils]: 20: Hoare triple {17845#(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)); {17785#true} is VALID [2022-04-08 07:48:46,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,828 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {17785#true} {17845#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {17845#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:48:46,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {17845#(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; {17867#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 07:48:46,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {17867#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {17867#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 07:48:46,828 INFO L272 TraceCheckUtils]: 27: Hoare triple {17867#(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)); {17785#true} is VALID [2022-04-08 07:48:46,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,829 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17785#true} {17867#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {17867#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 07:48:46,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {17867#(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; {17889#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 07:48:46,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {17889#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {17889#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 07:48:46,830 INFO L272 TraceCheckUtils]: 34: Hoare triple {17889#(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)); {17785#true} is VALID [2022-04-08 07:48:46,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,831 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17785#true} {17889#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {17889#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 07:48:46,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {17889#(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; {17911#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-08 07:48:46,831 INFO L290 TraceCheckUtils]: 40: Hoare triple {17911#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} assume !false; {17911#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-08 07:48:46,831 INFO L272 TraceCheckUtils]: 41: Hoare triple {17911#(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)); {17785#true} is VALID [2022-04-08 07:48:46,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,832 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17785#true} {17911#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} #54#return; {17911#(and (= (+ main_~y~0 (- 4)) 0) (= main_~c~0 4))} is VALID [2022-04-08 07:48:46,833 INFO L290 TraceCheckUtils]: 46: Hoare triple {17911#(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; {17933#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:48:46,833 INFO L290 TraceCheckUtils]: 47: Hoare triple {17933#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {17933#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:48:46,833 INFO L272 TraceCheckUtils]: 48: Hoare triple {17933#(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)); {17785#true} is VALID [2022-04-08 07:48:46,833 INFO L290 TraceCheckUtils]: 49: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,833 INFO L290 TraceCheckUtils]: 50: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,833 INFO L290 TraceCheckUtils]: 51: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,834 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17785#true} {17933#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #54#return; {17933#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:48:46,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {17933#(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; {17955#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:46,834 INFO L290 TraceCheckUtils]: 54: Hoare triple {17955#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !false; {17955#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:46,834 INFO L272 TraceCheckUtils]: 55: Hoare triple {17955#(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)); {17785#true} is VALID [2022-04-08 07:48:46,835 INFO L290 TraceCheckUtils]: 56: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,835 INFO L290 TraceCheckUtils]: 57: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,835 INFO L290 TraceCheckUtils]: 58: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,835 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17785#true} {17955#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #54#return; {17955#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:46,836 INFO L290 TraceCheckUtils]: 60: Hoare triple {17955#(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; {17977#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 07:48:46,836 INFO L290 TraceCheckUtils]: 61: Hoare triple {17977#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {17977#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 07:48:46,836 INFO L272 TraceCheckUtils]: 62: Hoare triple {17977#(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)); {17785#true} is VALID [2022-04-08 07:48:46,836 INFO L290 TraceCheckUtils]: 63: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,836 INFO L290 TraceCheckUtils]: 64: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,836 INFO L290 TraceCheckUtils]: 65: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,837 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17785#true} {17977#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #54#return; {17977#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 07:48:46,837 INFO L290 TraceCheckUtils]: 67: Hoare triple {17977#(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; {17999#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:48:46,837 INFO L290 TraceCheckUtils]: 68: Hoare triple {17999#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {17999#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:48:46,837 INFO L272 TraceCheckUtils]: 69: Hoare triple {17999#(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)); {17785#true} is VALID [2022-04-08 07:48:46,837 INFO L290 TraceCheckUtils]: 70: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,838 INFO L290 TraceCheckUtils]: 71: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,838 INFO L290 TraceCheckUtils]: 72: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,838 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17785#true} {17999#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {17999#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:48:46,838 INFO L290 TraceCheckUtils]: 74: Hoare triple {17999#(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; {18021#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:48:46,839 INFO L290 TraceCheckUtils]: 75: Hoare triple {18021#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} assume !false; {18021#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:48:46,839 INFO L272 TraceCheckUtils]: 76: Hoare triple {18021#(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)); {17785#true} is VALID [2022-04-08 07:48:46,839 INFO L290 TraceCheckUtils]: 77: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,839 INFO L290 TraceCheckUtils]: 78: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,839 INFO L290 TraceCheckUtils]: 79: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,840 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {17785#true} {18021#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} #54#return; {18021#(and (= main_~y~0 9) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:48:46,840 INFO L290 TraceCheckUtils]: 81: Hoare triple {18021#(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; {18043#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:46,840 INFO L290 TraceCheckUtils]: 82: Hoare triple {18043#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} assume !false; {18043#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:46,840 INFO L272 TraceCheckUtils]: 83: Hoare triple {18043#(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)); {17785#true} is VALID [2022-04-08 07:48:46,840 INFO L290 TraceCheckUtils]: 84: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,841 INFO L290 TraceCheckUtils]: 85: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,841 INFO L290 TraceCheckUtils]: 86: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,841 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {17785#true} {18043#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} #54#return; {18043#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:46,841 INFO L290 TraceCheckUtils]: 88: Hoare triple {18043#(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; {18065#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:48:46,842 INFO L290 TraceCheckUtils]: 89: Hoare triple {18065#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {18065#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:48:46,842 INFO L272 TraceCheckUtils]: 90: Hoare triple {18065#(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)); {17785#true} is VALID [2022-04-08 07:48:46,842 INFO L290 TraceCheckUtils]: 91: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,842 INFO L290 TraceCheckUtils]: 92: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,842 INFO L290 TraceCheckUtils]: 93: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,842 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {17785#true} {18065#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #54#return; {18065#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:48:46,843 INFO L290 TraceCheckUtils]: 95: Hoare triple {18065#(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; {18087#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:48:46,843 INFO L290 TraceCheckUtils]: 96: Hoare triple {18087#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {18087#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:48:46,843 INFO L272 TraceCheckUtils]: 97: Hoare triple {18087#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17785#true} is VALID [2022-04-08 07:48:46,843 INFO L290 TraceCheckUtils]: 98: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,843 INFO L290 TraceCheckUtils]: 99: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,844 INFO L290 TraceCheckUtils]: 100: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,844 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17785#true} {18087#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {18087#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:48:46,844 INFO L290 TraceCheckUtils]: 102: Hoare triple {18087#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18109#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:46,845 INFO L290 TraceCheckUtils]: 103: Hoare triple {18109#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {18109#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:46,845 INFO L272 TraceCheckUtils]: 104: Hoare triple {18109#(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)); {17785#true} is VALID [2022-04-08 07:48:46,845 INFO L290 TraceCheckUtils]: 105: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,845 INFO L290 TraceCheckUtils]: 106: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,845 INFO L290 TraceCheckUtils]: 107: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,845 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17785#true} {18109#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {18109#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:46,846 INFO L290 TraceCheckUtils]: 109: Hoare triple {18109#(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; {18131#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 07:48:46,846 INFO L290 TraceCheckUtils]: 110: Hoare triple {18131#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {18131#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 07:48:46,846 INFO L272 TraceCheckUtils]: 111: Hoare triple {18131#(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)); {17785#true} is VALID [2022-04-08 07:48:46,846 INFO L290 TraceCheckUtils]: 112: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,846 INFO L290 TraceCheckUtils]: 113: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,846 INFO L290 TraceCheckUtils]: 114: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,847 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {17785#true} {18131#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {18131#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 07:48:46,847 INFO L290 TraceCheckUtils]: 116: Hoare triple {18131#(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; {18153#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:46,848 INFO L290 TraceCheckUtils]: 117: Hoare triple {18153#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !false; {18153#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:46,848 INFO L272 TraceCheckUtils]: 118: Hoare triple {18153#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17785#true} is VALID [2022-04-08 07:48:46,848 INFO L290 TraceCheckUtils]: 119: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,848 INFO L290 TraceCheckUtils]: 120: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,848 INFO L290 TraceCheckUtils]: 121: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,848 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {17785#true} {18153#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} #54#return; {18153#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:46,849 INFO L290 TraceCheckUtils]: 123: Hoare triple {18153#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18175#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 07:48:46,849 INFO L290 TraceCheckUtils]: 124: Hoare triple {18175#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} assume !false; {18175#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 07:48:46,849 INFO L272 TraceCheckUtils]: 125: Hoare triple {18175#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 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)); {17785#true} is VALID [2022-04-08 07:48:46,849 INFO L290 TraceCheckUtils]: 126: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,849 INFO L290 TraceCheckUtils]: 127: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,849 INFO L290 TraceCheckUtils]: 128: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,850 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17785#true} {18175#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} #54#return; {18175#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 07:48:46,850 INFO L290 TraceCheckUtils]: 130: Hoare triple {18175#(and (= 14 (+ (- 2) main_~c~0)) (= (+ (- 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; {18197#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:48:46,851 INFO L290 TraceCheckUtils]: 131: Hoare triple {18197#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {18197#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:48:46,851 INFO L272 TraceCheckUtils]: 132: Hoare triple {18197#(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)); {17785#true} is VALID [2022-04-08 07:48:46,851 INFO L290 TraceCheckUtils]: 133: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,851 INFO L290 TraceCheckUtils]: 134: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,851 INFO L290 TraceCheckUtils]: 135: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,851 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {17785#true} {18197#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {18197#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:48:46,852 INFO L290 TraceCheckUtils]: 137: Hoare triple {18197#(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; {18219#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 07:48:46,852 INFO L290 TraceCheckUtils]: 138: Hoare triple {18219#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !false; {18219#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 07:48:46,852 INFO L272 TraceCheckUtils]: 139: Hoare triple {18219#(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)); {17785#true} is VALID [2022-04-08 07:48:46,852 INFO L290 TraceCheckUtils]: 140: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,852 INFO L290 TraceCheckUtils]: 141: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,852 INFO L290 TraceCheckUtils]: 142: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,853 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {17785#true} {18219#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} #54#return; {18219#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 07:48:46,853 INFO L290 TraceCheckUtils]: 144: Hoare triple {18219#(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; {18241#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:48:46,854 INFO L290 TraceCheckUtils]: 145: Hoare triple {18241#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {18241#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:48:46,854 INFO L272 TraceCheckUtils]: 146: Hoare triple {18241#(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)); {17785#true} is VALID [2022-04-08 07:48:46,854 INFO L290 TraceCheckUtils]: 147: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,854 INFO L290 TraceCheckUtils]: 148: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,854 INFO L290 TraceCheckUtils]: 149: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,854 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {17785#true} {18241#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {18241#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:48:46,855 INFO L290 TraceCheckUtils]: 151: Hoare triple {18241#(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; {18263#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:48:46,855 INFO L290 TraceCheckUtils]: 152: Hoare triple {18263#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {18263#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:48:46,855 INFO L272 TraceCheckUtils]: 153: Hoare triple {18263#(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)); {17785#true} is VALID [2022-04-08 07:48:46,855 INFO L290 TraceCheckUtils]: 154: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,855 INFO L290 TraceCheckUtils]: 155: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,856 INFO L290 TraceCheckUtils]: 156: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,856 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {17785#true} {18263#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #54#return; {18263#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:48:46,856 INFO L290 TraceCheckUtils]: 158: Hoare triple {18263#(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; {18285#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:48:46,857 INFO L290 TraceCheckUtils]: 159: Hoare triple {18285#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !false; {18285#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:48:46,857 INFO L272 TraceCheckUtils]: 160: Hoare triple {18285#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17785#true} is VALID [2022-04-08 07:48:46,857 INFO L290 TraceCheckUtils]: 161: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,857 INFO L290 TraceCheckUtils]: 162: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,857 INFO L290 TraceCheckUtils]: 163: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,857 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {17785#true} {18285#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} #54#return; {18285#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:48:46,858 INFO L290 TraceCheckUtils]: 165: Hoare triple {18285#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {18307#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~c~0 22) (< 21 main_~k~0))} is VALID [2022-04-08 07:48:46,858 INFO L290 TraceCheckUtils]: 166: Hoare triple {18307#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~c~0 22) (< 21 main_~k~0))} assume !false; {18307#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~c~0 22) (< 21 main_~k~0))} is VALID [2022-04-08 07:48:46,858 INFO L272 TraceCheckUtils]: 167: Hoare triple {18307#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~c~0 22) (< 21 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {17785#true} is VALID [2022-04-08 07:48:46,858 INFO L290 TraceCheckUtils]: 168: Hoare triple {17785#true} ~cond := #in~cond; {17785#true} is VALID [2022-04-08 07:48:46,858 INFO L290 TraceCheckUtils]: 169: Hoare triple {17785#true} assume !(0 == ~cond); {17785#true} is VALID [2022-04-08 07:48:46,859 INFO L290 TraceCheckUtils]: 170: Hoare triple {17785#true} assume true; {17785#true} is VALID [2022-04-08 07:48:46,859 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {17785#true} {18307#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~c~0 22) (< 21 main_~k~0))} #54#return; {18307#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~c~0 22) (< 21 main_~k~0))} is VALID [2022-04-08 07:48:46,860 INFO L290 TraceCheckUtils]: 172: Hoare triple {18307#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~c~0 22) (< 21 main_~k~0))} assume !(~c~0 < ~k~0); {18329#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~k~0 22) (< 21 main_~k~0))} is VALID [2022-04-08 07:48:46,860 INFO L272 TraceCheckUtils]: 173: Hoare triple {18329#(and (= 19 (+ main_~y~0 (- 3))) (<= main_~k~0 22) (< 21 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18333#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:46,861 INFO L290 TraceCheckUtils]: 174: Hoare triple {18333#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18337#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:46,861 INFO L290 TraceCheckUtils]: 175: Hoare triple {18337#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17786#false} is VALID [2022-04-08 07:48:46,861 INFO L290 TraceCheckUtils]: 176: Hoare triple {17786#false} assume !false; {17786#false} is VALID [2022-04-08 07:48:46,862 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 07:48:46,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:47,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:47,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561924508] [2022-04-08 07:48:47,190 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:47,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071520418] [2022-04-08 07:48:47,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071520418] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:47,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:47,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-04-08 07:48:47,190 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:47,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [200712238] [2022-04-08 07:48:47,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [200712238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:47,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:47,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 07:48:47,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953064671] [2022-04-08 07:48:47,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:47,191 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) Word has length 177 [2022-04-08 07:48:47,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:47,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-08 07:48:47,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:47,320 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 07:48:47,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:47,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 07:48:47,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-04-08 07:48:47,321 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-08 07:48:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:53,000 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-04-08 07:48:53,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 07:48:53,000 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) Word has length 177 [2022-04-08 07:48:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-08 07:48:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-08 07:48:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-08 07:48:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-08 07:48:53,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 120 transitions. [2022-04-08 07:48:53,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:53,152 INFO L225 Difference]: With dead ends: 102 [2022-04-08 07:48:53,152 INFO L226 Difference]: Without dead ends: 97 [2022-04-08 07:48:53,152 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 07:48:53,152 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:53,152 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1123 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-08 07:48:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-08 07:48:53,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-04-08 07:48:53,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:53,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 07:48:53,281 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 07:48:53,281 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 07:48:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:53,282 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-08 07:48:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-08 07:48:53,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:53,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:53,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 97 states. [2022-04-08 07:48:53,283 INFO L87 Difference]: Start difference. First operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 97 states. [2022-04-08 07:48:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:53,285 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-08 07:48:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-08 07:48:53,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:53,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:53,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:53,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 28 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 07:48:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2022-04-08 07:48:53,287 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 177 [2022-04-08 07:48:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:53,287 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2022-04-08 07:48:53,287 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 25 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-04-08 07:48:53,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 119 transitions. [2022-04-08 07:48:53,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-08 07:48:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-04-08 07:48:53,959 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:53,959 INFO L499 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:53,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 07:48:54,160 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 07:48:54,160 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash -178408600, now seen corresponding path program 45 times [2022-04-08 07:48:54,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:54,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1975134152] [2022-04-08 07:48:54,233 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:48:54,233 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:48:54,233 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:48:54,234 INFO L85 PathProgramCache]: Analyzing trace with hash -178408600, now seen corresponding path program 46 times [2022-04-08 07:48:54,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:54,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106734470] [2022-04-08 07:48:54,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:54,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:54,248 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:54,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [684552377] [2022-04-08 07:48:54,248 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:48:54,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:54,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:54,249 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 07:48:54,250 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 07:48:54,765 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:48:54,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:54,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-08 07:48:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:54,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:55,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {18981#true} call ULTIMATE.init(); {18981#true} is VALID [2022-04-08 07:48:55,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {18981#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); {18981#true} is VALID [2022-04-08 07:48:55,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18981#true} {18981#true} #60#return; {18981#true} is VALID [2022-04-08 07:48:55,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {18981#true} call #t~ret5 := main(); {18981#true} is VALID [2022-04-08 07:48:55,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {18981#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; {18981#true} is VALID [2022-04-08 07:48:55,853 INFO L272 TraceCheckUtils]: 6: Hoare triple {18981#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {18981#true} is VALID [2022-04-08 07:48:55,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,853 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18981#true} {18981#true} #52#return; {18981#true} is VALID [2022-04-08 07:48:55,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {18981#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {19019#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:55,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {19019#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {19019#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:55,854 INFO L272 TraceCheckUtils]: 13: Hoare triple {19019#(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)); {18981#true} is VALID [2022-04-08 07:48:55,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,854 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18981#true} {19019#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {19019#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:55,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {19019#(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; {19041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:48:55,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {19041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:48:55,855 INFO L272 TraceCheckUtils]: 20: Hoare triple {19041#(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)); {18981#true} is VALID [2022-04-08 07:48:55,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,856 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {18981#true} {19041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {19041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:48:55,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {19041#(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; {19063#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:55,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {19063#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {19063#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:55,857 INFO L272 TraceCheckUtils]: 27: Hoare triple {19063#(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)); {18981#true} is VALID [2022-04-08 07:48:55,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,857 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18981#true} {19063#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {19063#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:48:55,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {19063#(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; {19085#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:48:55,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {19085#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !false; {19085#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:48:55,858 INFO L272 TraceCheckUtils]: 34: Hoare triple {19085#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18981#true} is VALID [2022-04-08 07:48:55,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,858 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {18981#true} {19085#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #54#return; {19085#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:48:55,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {19085#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19107#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:48:55,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {19107#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !false; {19107#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:48:55,859 INFO L272 TraceCheckUtils]: 41: Hoare triple {19107#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18981#true} is VALID [2022-04-08 07:48:55,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,860 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {18981#true} {19107#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #54#return; {19107#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:48:55,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {19107#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19129#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:48:55,861 INFO L290 TraceCheckUtils]: 47: Hoare triple {19129#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} assume !false; {19129#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:48:55,861 INFO L272 TraceCheckUtils]: 48: Hoare triple {19129#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18981#true} is VALID [2022-04-08 07:48:55,861 INFO L290 TraceCheckUtils]: 49: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,861 INFO L290 TraceCheckUtils]: 50: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,861 INFO L290 TraceCheckUtils]: 51: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,861 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18981#true} {19129#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} #54#return; {19129#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:48:55,862 INFO L290 TraceCheckUtils]: 53: Hoare triple {19129#(and (= (+ main_~c~0 (- 5)) 0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19151#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:55,862 INFO L290 TraceCheckUtils]: 54: Hoare triple {19151#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {19151#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:55,862 INFO L272 TraceCheckUtils]: 55: Hoare triple {19151#(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)); {18981#true} is VALID [2022-04-08 07:48:55,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,862 INFO L290 TraceCheckUtils]: 58: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,862 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18981#true} {19151#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {19151#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:55,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {19151#(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; {19173#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:55,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {19173#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {19173#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:55,863 INFO L272 TraceCheckUtils]: 62: Hoare triple {19173#(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)); {18981#true} is VALID [2022-04-08 07:48:55,863 INFO L290 TraceCheckUtils]: 63: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,863 INFO L290 TraceCheckUtils]: 64: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,863 INFO L290 TraceCheckUtils]: 65: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,864 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18981#true} {19173#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {19173#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:55,864 INFO L290 TraceCheckUtils]: 67: Hoare triple {19173#(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; {19195#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 07:48:55,864 INFO L290 TraceCheckUtils]: 68: Hoare triple {19195#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !false; {19195#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 07:48:55,865 INFO L272 TraceCheckUtils]: 69: Hoare triple {19195#(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)); {18981#true} is VALID [2022-04-08 07:48:55,865 INFO L290 TraceCheckUtils]: 70: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,865 INFO L290 TraceCheckUtils]: 71: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,865 INFO L290 TraceCheckUtils]: 72: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,865 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {18981#true} {19195#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #54#return; {19195#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 07:48:55,865 INFO L290 TraceCheckUtils]: 74: Hoare triple {19195#(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; {19217#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:48:55,866 INFO L290 TraceCheckUtils]: 75: Hoare triple {19217#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {19217#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:48:55,866 INFO L272 TraceCheckUtils]: 76: Hoare triple {19217#(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)); {18981#true} is VALID [2022-04-08 07:48:55,866 INFO L290 TraceCheckUtils]: 77: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,866 INFO L290 TraceCheckUtils]: 78: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,866 INFO L290 TraceCheckUtils]: 79: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,866 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18981#true} {19217#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {19217#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:48:55,867 INFO L290 TraceCheckUtils]: 81: Hoare triple {19217#(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; {19239#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:48:55,867 INFO L290 TraceCheckUtils]: 82: Hoare triple {19239#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {19239#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:48:55,867 INFO L272 TraceCheckUtils]: 83: Hoare triple {19239#(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)); {18981#true} is VALID [2022-04-08 07:48:55,867 INFO L290 TraceCheckUtils]: 84: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,867 INFO L290 TraceCheckUtils]: 85: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,867 INFO L290 TraceCheckUtils]: 86: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,868 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {18981#true} {19239#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {19239#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:48:55,868 INFO L290 TraceCheckUtils]: 88: Hoare triple {19239#(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; {19261#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 07:48:55,868 INFO L290 TraceCheckUtils]: 89: Hoare triple {19261#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} assume !false; {19261#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 07:48:55,869 INFO L272 TraceCheckUtils]: 90: Hoare triple {19261#(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)); {18981#true} is VALID [2022-04-08 07:48:55,869 INFO L290 TraceCheckUtils]: 91: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,869 INFO L290 TraceCheckUtils]: 92: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,869 INFO L290 TraceCheckUtils]: 93: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,869 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {18981#true} {19261#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} #54#return; {19261#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 07:48:55,869 INFO L290 TraceCheckUtils]: 95: Hoare triple {19261#(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; {19283#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 07:48:55,870 INFO L290 TraceCheckUtils]: 96: Hoare triple {19283#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} assume !false; {19283#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 07:48:55,870 INFO L272 TraceCheckUtils]: 97: Hoare triple {19283#(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)); {18981#true} is VALID [2022-04-08 07:48:55,870 INFO L290 TraceCheckUtils]: 98: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,870 INFO L290 TraceCheckUtils]: 99: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,870 INFO L290 TraceCheckUtils]: 100: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,870 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {18981#true} {19283#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} #54#return; {19283#(and (= 10 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 07:48:55,871 INFO L290 TraceCheckUtils]: 102: Hoare triple {19283#(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; {19305#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-08 07:48:55,871 INFO L290 TraceCheckUtils]: 103: Hoare triple {19305#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} assume !false; {19305#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-08 07:48:55,871 INFO L272 TraceCheckUtils]: 104: Hoare triple {19305#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18981#true} is VALID [2022-04-08 07:48:55,871 INFO L290 TraceCheckUtils]: 105: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,871 INFO L290 TraceCheckUtils]: 106: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,871 INFO L290 TraceCheckUtils]: 107: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,872 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18981#true} {19305#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} #54#return; {19305#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} is VALID [2022-04-08 07:48:55,872 INFO L290 TraceCheckUtils]: 109: Hoare triple {19305#(and (= (+ main_~c~0 (- 3)) 10) (= main_~y~0 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19327#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:48:55,872 INFO L290 TraceCheckUtils]: 110: Hoare triple {19327#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} assume !false; {19327#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:48:55,873 INFO L272 TraceCheckUtils]: 111: Hoare triple {19327#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18981#true} is VALID [2022-04-08 07:48:55,873 INFO L290 TraceCheckUtils]: 112: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,873 INFO L290 TraceCheckUtils]: 113: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,873 INFO L290 TraceCheckUtils]: 114: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,873 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {18981#true} {19327#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} #54#return; {19327#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:48:55,874 INFO L290 TraceCheckUtils]: 116: Hoare triple {19327#(and (= 10 (+ main_~c~0 (- 4))) (= (+ (- 1) main_~y~0) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19349#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 07:48:55,874 INFO L290 TraceCheckUtils]: 117: Hoare triple {19349#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {19349#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 07:48:55,874 INFO L272 TraceCheckUtils]: 118: Hoare triple {19349#(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)); {18981#true} is VALID [2022-04-08 07:48:55,874 INFO L290 TraceCheckUtils]: 119: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,874 INFO L290 TraceCheckUtils]: 120: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,874 INFO L290 TraceCheckUtils]: 121: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,874 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {18981#true} {19349#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {19349#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 07:48:55,875 INFO L290 TraceCheckUtils]: 123: Hoare triple {19349#(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; {19371#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:48:55,875 INFO L290 TraceCheckUtils]: 124: Hoare triple {19371#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {19371#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:48:55,875 INFO L272 TraceCheckUtils]: 125: Hoare triple {19371#(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)); {18981#true} is VALID [2022-04-08 07:48:55,875 INFO L290 TraceCheckUtils]: 126: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,875 INFO L290 TraceCheckUtils]: 127: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,875 INFO L290 TraceCheckUtils]: 128: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,876 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {18981#true} {19371#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {19371#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:48:55,876 INFO L290 TraceCheckUtils]: 130: Hoare triple {19371#(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; {19393#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:48:55,876 INFO L290 TraceCheckUtils]: 131: Hoare triple {19393#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {19393#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:48:55,877 INFO L272 TraceCheckUtils]: 132: Hoare triple {19393#(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)); {18981#true} is VALID [2022-04-08 07:48:55,877 INFO L290 TraceCheckUtils]: 133: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,877 INFO L290 TraceCheckUtils]: 134: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,877 INFO L290 TraceCheckUtils]: 135: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,877 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {18981#true} {19393#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {19393#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:48:55,877 INFO L290 TraceCheckUtils]: 137: Hoare triple {19393#(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; {19415#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 07:48:55,878 INFO L290 TraceCheckUtils]: 138: Hoare triple {19415#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !false; {19415#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 07:48:55,878 INFO L272 TraceCheckUtils]: 139: Hoare triple {19415#(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)); {18981#true} is VALID [2022-04-08 07:48:55,878 INFO L290 TraceCheckUtils]: 140: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,878 INFO L290 TraceCheckUtils]: 141: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,878 INFO L290 TraceCheckUtils]: 142: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,878 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {18981#true} {19415#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} #54#return; {19415#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 07:48:55,879 INFO L290 TraceCheckUtils]: 144: Hoare triple {19415#(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; {19437#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:55,879 INFO L290 TraceCheckUtils]: 145: Hoare triple {19437#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} assume !false; {19437#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:55,879 INFO L272 TraceCheckUtils]: 146: Hoare triple {19437#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {18981#true} is VALID [2022-04-08 07:48:55,879 INFO L290 TraceCheckUtils]: 147: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,879 INFO L290 TraceCheckUtils]: 148: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,879 INFO L290 TraceCheckUtils]: 149: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,880 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {18981#true} {19437#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} #54#return; {19437#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:55,880 INFO L290 TraceCheckUtils]: 151: Hoare triple {19437#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {19459#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-08 07:48:55,880 INFO L290 TraceCheckUtils]: 152: Hoare triple {19459#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} assume !false; {19459#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-08 07:48:55,881 INFO L272 TraceCheckUtils]: 153: Hoare triple {19459#(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)); {18981#true} is VALID [2022-04-08 07:48:55,881 INFO L290 TraceCheckUtils]: 154: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,881 INFO L290 TraceCheckUtils]: 155: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,881 INFO L290 TraceCheckUtils]: 156: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,881 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {18981#true} {19459#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} #54#return; {19459#(and (= (+ main_~c~0 (- 3)) 17) (= main_~y~0 20))} is VALID [2022-04-08 07:48:55,882 INFO L290 TraceCheckUtils]: 158: Hoare triple {19459#(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; {19481#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:55,882 INFO L290 TraceCheckUtils]: 159: Hoare triple {19481#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} assume !false; {19481#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:55,882 INFO L272 TraceCheckUtils]: 160: Hoare triple {19481#(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)); {18981#true} is VALID [2022-04-08 07:48:55,882 INFO L290 TraceCheckUtils]: 161: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,882 INFO L290 TraceCheckUtils]: 162: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,882 INFO L290 TraceCheckUtils]: 163: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,882 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {18981#true} {19481#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} #54#return; {19481#(and (= 17 (+ main_~c~0 (- 4))) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:55,883 INFO L290 TraceCheckUtils]: 165: Hoare triple {19481#(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; {19503#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 07:48:55,883 INFO L290 TraceCheckUtils]: 166: Hoare triple {19503#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} assume !false; {19503#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 07:48:55,883 INFO L272 TraceCheckUtils]: 167: Hoare triple {19503#(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)); {18981#true} is VALID [2022-04-08 07:48:55,883 INFO L290 TraceCheckUtils]: 168: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,883 INFO L290 TraceCheckUtils]: 169: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,884 INFO L290 TraceCheckUtils]: 170: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,884 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {18981#true} {19503#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} #54#return; {19503#(and (= (+ main_~c~0 (- 5)) 17) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 07:48:55,884 INFO L290 TraceCheckUtils]: 172: Hoare triple {19503#(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; {19525#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} is VALID [2022-04-08 07:48:55,885 INFO L290 TraceCheckUtils]: 173: Hoare triple {19525#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} assume !false; {19525#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} is VALID [2022-04-08 07:48:55,885 INFO L272 TraceCheckUtils]: 174: Hoare triple {19525#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 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)); {18981#true} is VALID [2022-04-08 07:48:55,885 INFO L290 TraceCheckUtils]: 175: Hoare triple {18981#true} ~cond := #in~cond; {18981#true} is VALID [2022-04-08 07:48:55,885 INFO L290 TraceCheckUtils]: 176: Hoare triple {18981#true} assume !(0 == ~cond); {18981#true} is VALID [2022-04-08 07:48:55,885 INFO L290 TraceCheckUtils]: 177: Hoare triple {18981#true} assume true; {18981#true} is VALID [2022-04-08 07:48:55,885 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {18981#true} {19525#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} #54#return; {19525#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} is VALID [2022-04-08 07:48:55,887 INFO L290 TraceCheckUtils]: 179: Hoare triple {19525#(and (< 22 main_~k~0) (<= main_~c~0 23) (= (+ main_~y~0 (- 3)) 20))} assume !(~c~0 < ~k~0); {19547#(and (< 22 main_~k~0) (<= main_~k~0 23) (= (+ main_~y~0 (- 3)) 20))} is VALID [2022-04-08 07:48:55,888 INFO L272 TraceCheckUtils]: 180: Hoare triple {19547#(and (< 22 main_~k~0) (<= main_~k~0 23) (= (+ main_~y~0 (- 3)) 20))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {19551#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:55,888 INFO L290 TraceCheckUtils]: 181: Hoare triple {19551#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19555#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:55,888 INFO L290 TraceCheckUtils]: 182: Hoare triple {19555#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18982#false} is VALID [2022-04-08 07:48:55,889 INFO L290 TraceCheckUtils]: 183: Hoare triple {18982#false} assume !false; {18982#false} is VALID [2022-04-08 07:48:55,889 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 07:48:55,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:56,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:56,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106734470] [2022-04-08 07:48:56,262 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:56,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684552377] [2022-04-08 07:48:56,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684552377] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:56,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:56,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2022-04-08 07:48:56,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:56,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1975134152] [2022-04-08 07:48:56,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1975134152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:56,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:56,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 07:48:56,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949840569] [2022-04-08 07:48:56,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:56,264 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) Word has length 184 [2022-04-08 07:48:56,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:56,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-08 07:48:56,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:56,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-08 07:48:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:56,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-08 07:48:56,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-04-08 07:48:56,424 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-08 07:49:03,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:03,051 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2022-04-08 07:49:03,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 07:49:03,051 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) Word has length 184 [2022-04-08 07:49:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:49:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-08 07:49:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-08 07:49:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-08 07:49:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2022-04-08 07:49:03,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 124 transitions. [2022-04-08 07:49:03,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:03,268 INFO L225 Difference]: With dead ends: 105 [2022-04-08 07:49:03,268 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 07:49:03,269 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 07:49:03,269 INFO L913 BasicCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:49:03,269 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1193 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-08 07:49:03,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 07:49:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-08 07:49:03,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:49:03,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-08 07:49:03,382 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-08 07:49:03,382 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-08 07:49:03,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:03,384 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-08 07:49:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-08 07:49:03,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:03,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:03,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 100 states. [2022-04-08 07:49:03,385 INFO L87 Difference]: Start difference. First operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 100 states. [2022-04-08 07:49:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:03,386 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-08 07:49:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-08 07:49:03,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:03,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:03,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:49:03,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:49:03,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 29 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-08 07:49:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2022-04-08 07:49:03,388 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 184 [2022-04-08 07:49:03,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:49:03,389 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2022-04-08 07:49:03,389 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 26 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-04-08 07:49:03,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 123 transitions. [2022-04-08 07:49:04,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-08 07:49:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-04-08 07:49:04,115 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:49:04,115 INFO L499 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:49:04,120 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 07:49:04,320 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 07:49:04,320 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:49:04,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:49:04,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1007212713, now seen corresponding path program 47 times [2022-04-08 07:49:04,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:04,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [441682257] [2022-04-08 07:49:04,391 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:49:04,391 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:49:04,392 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:49:04,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1007212713, now seen corresponding path program 48 times [2022-04-08 07:49:04,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:49:04,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454915674] [2022-04-08 07:49:04,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:49:04,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:49:04,438 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:49:04,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1427753373] [2022-04-08 07:49:04,438 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:49:04,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:04,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:49:04,442 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 07:49:04,443 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 07:49:05,223 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-08 07:49:05,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:49:05,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-08 07:49:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:05,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:49:06,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {20217#true} call ULTIMATE.init(); {20217#true} is VALID [2022-04-08 07:49:06,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {20217#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); {20217#true} is VALID [2022-04-08 07:49:06,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20217#true} {20217#true} #60#return; {20217#true} is VALID [2022-04-08 07:49:06,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {20217#true} call #t~ret5 := main(); {20217#true} is VALID [2022-04-08 07:49:06,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {20217#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; {20217#true} is VALID [2022-04-08 07:49:06,286 INFO L272 TraceCheckUtils]: 6: Hoare triple {20217#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {20217#true} is VALID [2022-04-08 07:49:06,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,286 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20217#true} {20217#true} #52#return; {20217#true} is VALID [2022-04-08 07:49:06,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {20217#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {20255#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:06,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {20255#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {20255#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:06,287 INFO L272 TraceCheckUtils]: 13: Hoare triple {20255#(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)); {20217#true} is VALID [2022-04-08 07:49:06,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,288 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20217#true} {20255#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {20255#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:06,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {20255#(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; {20277#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:49:06,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {20277#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {20277#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:49:06,288 INFO L272 TraceCheckUtils]: 20: Hoare triple {20277#(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)); {20217#true} is VALID [2022-04-08 07:49:06,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,289 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {20217#true} {20277#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {20277#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:49:06,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {20277#(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; {20299#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:49:06,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {20299#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {20299#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:49:06,290 INFO L272 TraceCheckUtils]: 27: Hoare triple {20299#(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)); {20217#true} is VALID [2022-04-08 07:49:06,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,291 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20217#true} {20299#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {20299#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:49:06,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {20299#(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; {20321#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 07:49:06,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {20321#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !false; {20321#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 07:49:06,291 INFO L272 TraceCheckUtils]: 34: Hoare triple {20321#(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)); {20217#true} is VALID [2022-04-08 07:49:06,292 INFO L290 TraceCheckUtils]: 35: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,292 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20217#true} {20321#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #54#return; {20321#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 07:49:06,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {20321#(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; {20343#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 07:49:06,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {20343#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !false; {20343#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 07:49:06,293 INFO L272 TraceCheckUtils]: 41: Hoare triple {20343#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20217#true} is VALID [2022-04-08 07:49:06,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,294 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20217#true} {20343#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #54#return; {20343#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 07:49:06,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {20343#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20365#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:49:06,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {20365#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {20365#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:49:06,302 INFO L272 TraceCheckUtils]: 48: Hoare triple {20365#(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)); {20217#true} is VALID [2022-04-08 07:49:06,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,303 INFO L290 TraceCheckUtils]: 51: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,305 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20217#true} {20365#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {20365#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:49:06,306 INFO L290 TraceCheckUtils]: 53: Hoare triple {20365#(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; {20387#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:49:06,306 INFO L290 TraceCheckUtils]: 54: Hoare triple {20387#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {20387#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:49:06,306 INFO L272 TraceCheckUtils]: 55: Hoare triple {20387#(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)); {20217#true} is VALID [2022-04-08 07:49:06,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,306 INFO L290 TraceCheckUtils]: 57: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,306 INFO L290 TraceCheckUtils]: 58: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,307 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20217#true} {20387#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {20387#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:49:06,307 INFO L290 TraceCheckUtils]: 60: Hoare triple {20387#(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; {20409#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:49:06,308 INFO L290 TraceCheckUtils]: 61: Hoare triple {20409#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {20409#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:49:06,308 INFO L272 TraceCheckUtils]: 62: Hoare triple {20409#(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)); {20217#true} is VALID [2022-04-08 07:49:06,308 INFO L290 TraceCheckUtils]: 63: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,308 INFO L290 TraceCheckUtils]: 64: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,308 INFO L290 TraceCheckUtils]: 65: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,308 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20217#true} {20409#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {20409#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:49:06,309 INFO L290 TraceCheckUtils]: 67: Hoare triple {20409#(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; {20431#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:06,309 INFO L290 TraceCheckUtils]: 68: Hoare triple {20431#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {20431#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:06,309 INFO L272 TraceCheckUtils]: 69: Hoare triple {20431#(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)); {20217#true} is VALID [2022-04-08 07:49:06,309 INFO L290 TraceCheckUtils]: 70: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,309 INFO L290 TraceCheckUtils]: 71: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,309 INFO L290 TraceCheckUtils]: 72: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,310 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20217#true} {20431#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #54#return; {20431#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:06,310 INFO L290 TraceCheckUtils]: 74: Hoare triple {20431#(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; {20453#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:49:06,311 INFO L290 TraceCheckUtils]: 75: Hoare triple {20453#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {20453#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:49:06,311 INFO L272 TraceCheckUtils]: 76: Hoare triple {20453#(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)); {20217#true} is VALID [2022-04-08 07:49:06,311 INFO L290 TraceCheckUtils]: 77: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,311 INFO L290 TraceCheckUtils]: 78: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,311 INFO L290 TraceCheckUtils]: 79: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,311 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {20217#true} {20453#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {20453#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:49:06,312 INFO L290 TraceCheckUtils]: 81: Hoare triple {20453#(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; {20475#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:49:06,312 INFO L290 TraceCheckUtils]: 82: Hoare triple {20475#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {20475#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:49:06,312 INFO L272 TraceCheckUtils]: 83: Hoare triple {20475#(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)); {20217#true} is VALID [2022-04-08 07:49:06,312 INFO L290 TraceCheckUtils]: 84: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,312 INFO L290 TraceCheckUtils]: 85: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,312 INFO L290 TraceCheckUtils]: 86: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,313 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {20217#true} {20475#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {20475#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:49:06,313 INFO L290 TraceCheckUtils]: 88: Hoare triple {20475#(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; {20497#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:49:06,314 INFO L290 TraceCheckUtils]: 89: Hoare triple {20497#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !false; {20497#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:49:06,314 INFO L272 TraceCheckUtils]: 90: Hoare triple {20497#(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)); {20217#true} is VALID [2022-04-08 07:49:06,314 INFO L290 TraceCheckUtils]: 91: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,314 INFO L290 TraceCheckUtils]: 92: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,314 INFO L290 TraceCheckUtils]: 93: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,314 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {20217#true} {20497#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #54#return; {20497#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:49:06,315 INFO L290 TraceCheckUtils]: 95: Hoare triple {20497#(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; {20519#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:49:06,315 INFO L290 TraceCheckUtils]: 96: Hoare triple {20519#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {20519#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:49:06,315 INFO L272 TraceCheckUtils]: 97: Hoare triple {20519#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20217#true} is VALID [2022-04-08 07:49:06,315 INFO L290 TraceCheckUtils]: 98: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,315 INFO L290 TraceCheckUtils]: 99: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,315 INFO L290 TraceCheckUtils]: 100: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,316 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {20217#true} {20519#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {20519#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:49:06,316 INFO L290 TraceCheckUtils]: 102: Hoare triple {20519#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20541#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:06,316 INFO L290 TraceCheckUtils]: 103: Hoare triple {20541#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} assume !false; {20541#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:06,316 INFO L272 TraceCheckUtils]: 104: Hoare triple {20541#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20217#true} is VALID [2022-04-08 07:49:06,317 INFO L290 TraceCheckUtils]: 105: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,317 INFO L290 TraceCheckUtils]: 106: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,317 INFO L290 TraceCheckUtils]: 107: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,317 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {20217#true} {20541#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} #54#return; {20541#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:06,317 INFO L290 TraceCheckUtils]: 109: Hoare triple {20541#(and (= 11 (+ (- 2) main_~c~0)) (= 12 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20563#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 07:49:06,318 INFO L290 TraceCheckUtils]: 110: Hoare triple {20563#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} assume !false; {20563#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 07:49:06,318 INFO L272 TraceCheckUtils]: 111: Hoare triple {20563#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20217#true} is VALID [2022-04-08 07:49:06,318 INFO L290 TraceCheckUtils]: 112: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,318 INFO L290 TraceCheckUtils]: 113: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,318 INFO L290 TraceCheckUtils]: 114: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,318 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {20217#true} {20563#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} #54#return; {20563#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 07:49:06,319 INFO L290 TraceCheckUtils]: 116: Hoare triple {20563#(and (= (+ (- 2) main_~y~0) 12) (= (+ main_~c~0 (- 3)) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20585#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 07:49:06,319 INFO L290 TraceCheckUtils]: 117: Hoare triple {20585#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {20585#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 07:49:06,319 INFO L272 TraceCheckUtils]: 118: Hoare triple {20585#(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)); {20217#true} is VALID [2022-04-08 07:49:06,319 INFO L290 TraceCheckUtils]: 119: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,319 INFO L290 TraceCheckUtils]: 120: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,319 INFO L290 TraceCheckUtils]: 121: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,320 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {20217#true} {20585#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {20585#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 07:49:06,320 INFO L290 TraceCheckUtils]: 123: Hoare triple {20585#(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; {20607#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:06,320 INFO L290 TraceCheckUtils]: 124: Hoare triple {20607#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} assume !false; {20607#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:06,321 INFO L272 TraceCheckUtils]: 125: Hoare triple {20607#(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)); {20217#true} is VALID [2022-04-08 07:49:06,321 INFO L290 TraceCheckUtils]: 126: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,321 INFO L290 TraceCheckUtils]: 127: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,321 INFO L290 TraceCheckUtils]: 128: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,321 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {20217#true} {20607#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} #54#return; {20607#(and (= main_~c~0 16) (= 15 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:06,321 INFO L290 TraceCheckUtils]: 130: Hoare triple {20607#(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; {20629#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:49:06,322 INFO L290 TraceCheckUtils]: 131: Hoare triple {20629#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {20629#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:49:06,322 INFO L272 TraceCheckUtils]: 132: Hoare triple {20629#(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)); {20217#true} is VALID [2022-04-08 07:49:06,322 INFO L290 TraceCheckUtils]: 133: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,322 INFO L290 TraceCheckUtils]: 134: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,322 INFO L290 TraceCheckUtils]: 135: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,322 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {20217#true} {20629#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {20629#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:49:06,323 INFO L290 TraceCheckUtils]: 137: Hoare triple {20629#(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; {20651#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:49:06,323 INFO L290 TraceCheckUtils]: 138: Hoare triple {20651#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} assume !false; {20651#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:49:06,323 INFO L272 TraceCheckUtils]: 139: Hoare triple {20651#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20217#true} is VALID [2022-04-08 07:49:06,323 INFO L290 TraceCheckUtils]: 140: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,323 INFO L290 TraceCheckUtils]: 141: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,323 INFO L290 TraceCheckUtils]: 142: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,324 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {20217#true} {20651#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} #54#return; {20651#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:49:06,324 INFO L290 TraceCheckUtils]: 144: Hoare triple {20651#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20673#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:49:06,324 INFO L290 TraceCheckUtils]: 145: Hoare triple {20673#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {20673#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:49:06,325 INFO L272 TraceCheckUtils]: 146: Hoare triple {20673#(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)); {20217#true} is VALID [2022-04-08 07:49:06,325 INFO L290 TraceCheckUtils]: 147: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,325 INFO L290 TraceCheckUtils]: 148: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,325 INFO L290 TraceCheckUtils]: 149: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,325 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {20217#true} {20673#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {20673#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:49:06,325 INFO L290 TraceCheckUtils]: 151: Hoare triple {20673#(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; {20695#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-08 07:49:06,326 INFO L290 TraceCheckUtils]: 152: Hoare triple {20695#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} assume !false; {20695#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-08 07:49:06,326 INFO L272 TraceCheckUtils]: 153: Hoare triple {20695#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {20217#true} is VALID [2022-04-08 07:49:06,326 INFO L290 TraceCheckUtils]: 154: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,326 INFO L290 TraceCheckUtils]: 155: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,326 INFO L290 TraceCheckUtils]: 156: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,326 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {20217#true} {20695#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} #54#return; {20695#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-08 07:49:06,327 INFO L290 TraceCheckUtils]: 158: Hoare triple {20695#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {20717#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-08 07:49:06,327 INFO L290 TraceCheckUtils]: 159: Hoare triple {20717#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} assume !false; {20717#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-08 07:49:06,327 INFO L272 TraceCheckUtils]: 160: Hoare triple {20717#(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)); {20217#true} is VALID [2022-04-08 07:49:06,327 INFO L290 TraceCheckUtils]: 161: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,327 INFO L290 TraceCheckUtils]: 162: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,327 INFO L290 TraceCheckUtils]: 163: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,328 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {20217#true} {20717#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} #54#return; {20717#(and (= (+ (- 1) main_~c~0) 20) (= main_~y~0 21))} is VALID [2022-04-08 07:49:06,328 INFO L290 TraceCheckUtils]: 165: Hoare triple {20717#(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; {20739#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:06,328 INFO L290 TraceCheckUtils]: 166: Hoare triple {20739#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} assume !false; {20739#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:06,329 INFO L272 TraceCheckUtils]: 167: Hoare triple {20739#(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)); {20217#true} is VALID [2022-04-08 07:49:06,329 INFO L290 TraceCheckUtils]: 168: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,329 INFO L290 TraceCheckUtils]: 169: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,329 INFO L290 TraceCheckUtils]: 170: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,329 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {20217#true} {20739#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} #54#return; {20739#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:06,329 INFO L290 TraceCheckUtils]: 172: Hoare triple {20739#(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; {20761#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:06,330 INFO L290 TraceCheckUtils]: 173: Hoare triple {20761#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} assume !false; {20761#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:06,330 INFO L272 TraceCheckUtils]: 174: Hoare triple {20761#(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)); {20217#true} is VALID [2022-04-08 07:49:06,330 INFO L290 TraceCheckUtils]: 175: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,330 INFO L290 TraceCheckUtils]: 176: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,330 INFO L290 TraceCheckUtils]: 177: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,330 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {20217#true} {20761#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} #54#return; {20761#(and (= 23 main_~c~0) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:06,331 INFO L290 TraceCheckUtils]: 179: Hoare triple {20761#(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; {20783#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-08 07:49:06,331 INFO L290 TraceCheckUtils]: 180: Hoare triple {20783#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !false; {20783#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-08 07:49:06,331 INFO L272 TraceCheckUtils]: 181: Hoare triple {20783#(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)); {20217#true} is VALID [2022-04-08 07:49:06,331 INFO L290 TraceCheckUtils]: 182: Hoare triple {20217#true} ~cond := #in~cond; {20217#true} is VALID [2022-04-08 07:49:06,331 INFO L290 TraceCheckUtils]: 183: Hoare triple {20217#true} assume !(0 == ~cond); {20217#true} is VALID [2022-04-08 07:49:06,331 INFO L290 TraceCheckUtils]: 184: Hoare triple {20217#true} assume true; {20217#true} is VALID [2022-04-08 07:49:06,332 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {20217#true} {20783#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} #54#return; {20783#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} is VALID [2022-04-08 07:49:06,333 INFO L290 TraceCheckUtils]: 186: Hoare triple {20783#(and (< 23 main_~k~0) (= main_~y~0 24) (<= main_~c~0 24))} assume !(~c~0 < ~k~0); {20805#(and (<= main_~k~0 24) (< 23 main_~k~0) (= main_~y~0 24))} is VALID [2022-04-08 07:49:06,333 INFO L272 TraceCheckUtils]: 187: Hoare triple {20805#(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)); {20809#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:49:06,334 INFO L290 TraceCheckUtils]: 188: Hoare triple {20809#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20813#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:49:06,334 INFO L290 TraceCheckUtils]: 189: Hoare triple {20813#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20218#false} is VALID [2022-04-08 07:49:06,334 INFO L290 TraceCheckUtils]: 190: Hoare triple {20218#false} assume !false; {20218#false} is VALID [2022-04-08 07:49:06,335 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 07:49:06,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:49:06,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:49:06,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454915674] [2022-04-08 07:49:06,715 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:49:06,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427753373] [2022-04-08 07:49:06,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427753373] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:49:06,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:49:06,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2022-04-08 07:49:06,715 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:49:06,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [441682257] [2022-04-08 07:49:06,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [441682257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:06,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:06,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-08 07:49:06,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870327164] [2022-04-08 07:49:06,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:49:06,716 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) Word has length 191 [2022-04-08 07:49:06,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:49:06,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-08 07:49:06,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:06,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-08 07:49:06,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:06,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-08 07:49:06,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 07:49:06,899 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-08 07:49:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:14,124 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2022-04-08 07:49:14,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 07:49:14,124 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) Word has length 191 [2022-04-08 07:49:14,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:49:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-08 07:49:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 128 transitions. [2022-04-08 07:49:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-08 07:49:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 128 transitions. [2022-04-08 07:49:14,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 128 transitions. [2022-04-08 07:49:14,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:14,383 INFO L225 Difference]: With dead ends: 108 [2022-04-08 07:49:14,383 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 07:49:14,384 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 07:49:14,384 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-08 07:49:14,384 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1265 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2167 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 07:49:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 07:49:14,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-08 07:49:14,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:49:14,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 07:49:14,495 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 07:49:14,495 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 07:49:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:14,497 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-08 07:49:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-08 07:49:14,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:14,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:14,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 103 states. [2022-04-08 07:49:14,498 INFO L87 Difference]: Start difference. First operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 103 states. [2022-04-08 07:49:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:14,500 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-08 07:49:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-08 07:49:14,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:14,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:14,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:49:14,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:49:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 30 states have call successors, (30), 6 states have call predecessors, (30), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 07:49:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2022-04-08 07:49:14,502 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 191 [2022-04-08 07:49:14,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:49:14,502 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2022-04-08 07:49:14,502 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 27 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 26 states have call predecessors, (27), 26 states have call successors, (27) [2022-04-08 07:49:14,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 127 transitions. [2022-04-08 07:49:15,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-08 07:49:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-04-08 07:49:15,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:49:15,224 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:49:15,231 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 07:49:15,425 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 07:49:15,425 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:49:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:49:15,425 INFO L85 PathProgramCache]: Analyzing trace with hash 447117384, now seen corresponding path program 49 times [2022-04-08 07:49:15,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:15,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1811854894] [2022-04-08 07:49:15,505 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:49:15,505 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:49:15,505 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:49:15,505 INFO L85 PathProgramCache]: Analyzing trace with hash 447117384, now seen corresponding path program 50 times [2022-04-08 07:49:15,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:49:15,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767557416] [2022-04-08 07:49:15,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:49:15,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:49:15,532 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:49:15,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825959829] [2022-04-08 07:49:15,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:49:15,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:15,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:49:15,533 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 07:49:15,535 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 07:49:16,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:49:16,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:49:16,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-08 07:49:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:16,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:49:17,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {21493#true} call ULTIMATE.init(); {21493#true} is VALID [2022-04-08 07:49:17,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {21493#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); {21493#true} is VALID [2022-04-08 07:49:17,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21493#true} {21493#true} #60#return; {21493#true} is VALID [2022-04-08 07:49:17,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {21493#true} call #t~ret5 := main(); {21493#true} is VALID [2022-04-08 07:49:17,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {21493#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; {21493#true} is VALID [2022-04-08 07:49:17,885 INFO L272 TraceCheckUtils]: 6: Hoare triple {21493#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {21493#true} is VALID [2022-04-08 07:49:17,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,885 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21493#true} {21493#true} #52#return; {21493#true} is VALID [2022-04-08 07:49:17,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {21493#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {21531#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:17,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {21531#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {21531#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:17,887 INFO L272 TraceCheckUtils]: 13: Hoare triple {21531#(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)); {21493#true} is VALID [2022-04-08 07:49:17,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,887 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21493#true} {21531#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {21531#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:17,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {21531#(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; {21553#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:49:17,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {21553#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {21553#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:49:17,888 INFO L272 TraceCheckUtils]: 20: Hoare triple {21553#(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)); {21493#true} is VALID [2022-04-08 07:49:17,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,889 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {21493#true} {21553#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {21553#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:49:17,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {21553#(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; {21575#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:17,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {21575#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {21575#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:17,890 INFO L272 TraceCheckUtils]: 27: Hoare triple {21575#(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)); {21493#true} is VALID [2022-04-08 07:49:17,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,890 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21493#true} {21575#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {21575#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:17,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {21575#(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; {21597#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:49:17,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {21597#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {21597#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:49:17,891 INFO L272 TraceCheckUtils]: 34: Hoare triple {21597#(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)); {21493#true} is VALID [2022-04-08 07:49:17,891 INFO L290 TraceCheckUtils]: 35: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,891 INFO L290 TraceCheckUtils]: 36: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,892 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21493#true} {21597#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {21597#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:49:17,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {21597#(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; {21619#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:17,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {21619#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {21619#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:17,893 INFO L272 TraceCheckUtils]: 41: Hoare triple {21619#(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)); {21493#true} is VALID [2022-04-08 07:49:17,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,893 INFO L290 TraceCheckUtils]: 43: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,893 INFO L290 TraceCheckUtils]: 44: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,893 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {21493#true} {21619#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {21619#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:17,894 INFO L290 TraceCheckUtils]: 46: Hoare triple {21619#(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; {21641#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:17,894 INFO L290 TraceCheckUtils]: 47: Hoare triple {21641#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} assume !false; {21641#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:17,894 INFO L272 TraceCheckUtils]: 48: Hoare triple {21641#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21493#true} is VALID [2022-04-08 07:49:17,894 INFO L290 TraceCheckUtils]: 49: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,895 INFO L290 TraceCheckUtils]: 50: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,895 INFO L290 TraceCheckUtils]: 51: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,895 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21493#true} {21641#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} #54#return; {21641#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:17,896 INFO L290 TraceCheckUtils]: 53: Hoare triple {21641#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21663#(and (= (+ main_~c~0 (- 3)) 3) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-08 07:49:17,897 INFO L290 TraceCheckUtils]: 54: Hoare triple {21663#(and (= (+ main_~c~0 (- 3)) 3) (= (+ main_~y~0 (- 3)) 3))} assume !false; {21663#(and (= (+ main_~c~0 (- 3)) 3) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-08 07:49:17,897 INFO L272 TraceCheckUtils]: 55: Hoare triple {21663#(and (= (+ main_~c~0 (- 3)) 3) (= (+ main_~y~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21493#true} is VALID [2022-04-08 07:49:17,897 INFO L290 TraceCheckUtils]: 56: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,897 INFO L290 TraceCheckUtils]: 57: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,897 INFO L290 TraceCheckUtils]: 58: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,897 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21493#true} {21663#(and (= (+ main_~c~0 (- 3)) 3) (= (+ main_~y~0 (- 3)) 3))} #54#return; {21663#(and (= (+ main_~c~0 (- 3)) 3) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-08 07:49:17,898 INFO L290 TraceCheckUtils]: 60: Hoare triple {21663#(and (= (+ main_~c~0 (- 3)) 3) (= (+ main_~y~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21685#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-08 07:49:17,898 INFO L290 TraceCheckUtils]: 61: Hoare triple {21685#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !false; {21685#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-08 07:49:17,898 INFO L272 TraceCheckUtils]: 62: Hoare triple {21685#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21493#true} is VALID [2022-04-08 07:49:17,898 INFO L290 TraceCheckUtils]: 63: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,898 INFO L290 TraceCheckUtils]: 64: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,899 INFO L290 TraceCheckUtils]: 65: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,899 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {21493#true} {21685#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} #54#return; {21685#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-08 07:49:17,899 INFO L290 TraceCheckUtils]: 67: Hoare triple {21685#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21707#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:17,900 INFO L290 TraceCheckUtils]: 68: Hoare triple {21707#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {21707#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:17,900 INFO L272 TraceCheckUtils]: 69: Hoare triple {21707#(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)); {21493#true} is VALID [2022-04-08 07:49:17,900 INFO L290 TraceCheckUtils]: 70: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,900 INFO L290 TraceCheckUtils]: 71: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,900 INFO L290 TraceCheckUtils]: 72: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,900 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {21493#true} {21707#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #54#return; {21707#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:17,901 INFO L290 TraceCheckUtils]: 74: Hoare triple {21707#(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; {21729#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:49:17,901 INFO L290 TraceCheckUtils]: 75: Hoare triple {21729#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {21729#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:49:17,901 INFO L272 TraceCheckUtils]: 76: Hoare triple {21729#(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)); {21493#true} is VALID [2022-04-08 07:49:17,901 INFO L290 TraceCheckUtils]: 77: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,901 INFO L290 TraceCheckUtils]: 78: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,901 INFO L290 TraceCheckUtils]: 79: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,902 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {21493#true} {21729#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {21729#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:49:17,902 INFO L290 TraceCheckUtils]: 81: Hoare triple {21729#(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; {21751#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:49:17,903 INFO L290 TraceCheckUtils]: 82: Hoare triple {21751#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {21751#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:49:17,903 INFO L272 TraceCheckUtils]: 83: Hoare triple {21751#(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)); {21493#true} is VALID [2022-04-08 07:49:17,903 INFO L290 TraceCheckUtils]: 84: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,903 INFO L290 TraceCheckUtils]: 85: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,903 INFO L290 TraceCheckUtils]: 86: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,903 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {21493#true} {21751#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #54#return; {21751#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:49:17,904 INFO L290 TraceCheckUtils]: 88: Hoare triple {21751#(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; {21773#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:49:17,904 INFO L290 TraceCheckUtils]: 89: Hoare triple {21773#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {21773#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:49:17,904 INFO L272 TraceCheckUtils]: 90: Hoare triple {21773#(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)); {21493#true} is VALID [2022-04-08 07:49:17,904 INFO L290 TraceCheckUtils]: 91: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,904 INFO L290 TraceCheckUtils]: 92: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,904 INFO L290 TraceCheckUtils]: 93: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,905 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21493#true} {21773#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {21773#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:49:17,905 INFO L290 TraceCheckUtils]: 95: Hoare triple {21773#(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; {21795#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:49:17,906 INFO L290 TraceCheckUtils]: 96: Hoare triple {21795#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {21795#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:49:17,906 INFO L272 TraceCheckUtils]: 97: Hoare triple {21795#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21493#true} is VALID [2022-04-08 07:49:17,906 INFO L290 TraceCheckUtils]: 98: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,906 INFO L290 TraceCheckUtils]: 99: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,906 INFO L290 TraceCheckUtils]: 100: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,906 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {21493#true} {21795#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {21795#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:49:17,907 INFO L290 TraceCheckUtils]: 102: Hoare triple {21795#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21817#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:49:17,907 INFO L290 TraceCheckUtils]: 103: Hoare triple {21817#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {21817#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:49:17,907 INFO L272 TraceCheckUtils]: 104: Hoare triple {21817#(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)); {21493#true} is VALID [2022-04-08 07:49:17,907 INFO L290 TraceCheckUtils]: 105: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,907 INFO L290 TraceCheckUtils]: 106: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,907 INFO L290 TraceCheckUtils]: 107: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,908 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21493#true} {21817#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {21817#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:49:17,908 INFO L290 TraceCheckUtils]: 109: Hoare triple {21817#(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; {21839#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 07:49:17,908 INFO L290 TraceCheckUtils]: 110: Hoare triple {21839#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {21839#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 07:49:17,909 INFO L272 TraceCheckUtils]: 111: Hoare triple {21839#(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)); {21493#true} is VALID [2022-04-08 07:49:17,909 INFO L290 TraceCheckUtils]: 112: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,909 INFO L290 TraceCheckUtils]: 113: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,909 INFO L290 TraceCheckUtils]: 114: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,909 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {21493#true} {21839#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #54#return; {21839#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 07:49:17,910 INFO L290 TraceCheckUtils]: 116: Hoare triple {21839#(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; {21861#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:17,910 INFO L290 TraceCheckUtils]: 117: Hoare triple {21861#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} assume !false; {21861#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:17,910 INFO L272 TraceCheckUtils]: 118: Hoare triple {21861#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21493#true} is VALID [2022-04-08 07:49:17,910 INFO L290 TraceCheckUtils]: 119: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,910 INFO L290 TraceCheckUtils]: 120: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,910 INFO L290 TraceCheckUtils]: 121: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,911 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {21493#true} {21861#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} #54#return; {21861#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:17,911 INFO L290 TraceCheckUtils]: 123: Hoare triple {21861#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21883#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-08 07:49:17,911 INFO L290 TraceCheckUtils]: 124: Hoare triple {21883#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} assume !false; {21883#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-08 07:49:17,912 INFO L272 TraceCheckUtils]: 125: Hoare triple {21883#(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)); {21493#true} is VALID [2022-04-08 07:49:17,912 INFO L290 TraceCheckUtils]: 126: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,912 INFO L290 TraceCheckUtils]: 127: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,912 INFO L290 TraceCheckUtils]: 128: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,912 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {21493#true} {21883#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} #54#return; {21883#(and (= main_~y~0 16) (= (+ main_~c~0 (- 3)) 13))} is VALID [2022-04-08 07:49:17,913 INFO L290 TraceCheckUtils]: 130: Hoare triple {21883#(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; {21905#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:49:17,913 INFO L290 TraceCheckUtils]: 131: Hoare triple {21905#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {21905#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:49:17,913 INFO L272 TraceCheckUtils]: 132: Hoare triple {21905#(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)); {21493#true} is VALID [2022-04-08 07:49:17,913 INFO L290 TraceCheckUtils]: 133: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,913 INFO L290 TraceCheckUtils]: 134: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,913 INFO L290 TraceCheckUtils]: 135: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,914 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {21493#true} {21905#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {21905#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:49:17,914 INFO L290 TraceCheckUtils]: 137: Hoare triple {21905#(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; {21927#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:49:17,915 INFO L290 TraceCheckUtils]: 138: Hoare triple {21927#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {21927#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:49:17,915 INFO L272 TraceCheckUtils]: 139: Hoare triple {21927#(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)); {21493#true} is VALID [2022-04-08 07:49:17,915 INFO L290 TraceCheckUtils]: 140: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,915 INFO L290 TraceCheckUtils]: 141: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,915 INFO L290 TraceCheckUtils]: 142: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,915 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {21493#true} {21927#(and (= main_~c~0 18) (= main_~y~0 18))} #54#return; {21927#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:49:17,916 INFO L290 TraceCheckUtils]: 144: Hoare triple {21927#(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; {21949#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 07:49:17,916 INFO L290 TraceCheckUtils]: 145: Hoare triple {21949#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} assume !false; {21949#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 07:49:17,916 INFO L272 TraceCheckUtils]: 146: Hoare triple {21949#(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)); {21493#true} is VALID [2022-04-08 07:49:17,916 INFO L290 TraceCheckUtils]: 147: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,916 INFO L290 TraceCheckUtils]: 148: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,916 INFO L290 TraceCheckUtils]: 149: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,917 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {21493#true} {21949#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} #54#return; {21949#(and (= 18 (+ (- 1) main_~y~0)) (= 19 main_~c~0))} is VALID [2022-04-08 07:49:17,917 INFO L290 TraceCheckUtils]: 151: Hoare triple {21949#(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; {21971#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} is VALID [2022-04-08 07:49:17,917 INFO L290 TraceCheckUtils]: 152: Hoare triple {21971#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} assume !false; {21971#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} is VALID [2022-04-08 07:49:17,918 INFO L272 TraceCheckUtils]: 153: Hoare triple {21971#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21493#true} is VALID [2022-04-08 07:49:17,918 INFO L290 TraceCheckUtils]: 154: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,918 INFO L290 TraceCheckUtils]: 155: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,918 INFO L290 TraceCheckUtils]: 156: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,918 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21493#true} {21971#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} #54#return; {21971#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} is VALID [2022-04-08 07:49:17,919 INFO L290 TraceCheckUtils]: 158: Hoare triple {21971#(and (= 19 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 18))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {21993#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 07:49:17,919 INFO L290 TraceCheckUtils]: 159: Hoare triple {21993#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {21993#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 07:49:17,919 INFO L272 TraceCheckUtils]: 160: Hoare triple {21993#(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)); {21493#true} is VALID [2022-04-08 07:49:17,919 INFO L290 TraceCheckUtils]: 161: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,919 INFO L290 TraceCheckUtils]: 162: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,919 INFO L290 TraceCheckUtils]: 163: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,920 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {21493#true} {21993#(and (= main_~c~0 21) (= main_~y~0 21))} #54#return; {21993#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 07:49:17,920 INFO L290 TraceCheckUtils]: 165: Hoare triple {21993#(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; {22015#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:49:17,920 INFO L290 TraceCheckUtils]: 166: Hoare triple {22015#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} assume !false; {22015#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:49:17,921 INFO L272 TraceCheckUtils]: 167: Hoare triple {22015#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {21493#true} is VALID [2022-04-08 07:49:17,921 INFO L290 TraceCheckUtils]: 168: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,921 INFO L290 TraceCheckUtils]: 169: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,921 INFO L290 TraceCheckUtils]: 170: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,921 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {21493#true} {22015#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} #54#return; {22015#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:49:17,922 INFO L290 TraceCheckUtils]: 172: Hoare triple {22015#(and (= 21 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 21))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {22037#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:49:17,922 INFO L290 TraceCheckUtils]: 173: Hoare triple {22037#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {22037#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:49:17,922 INFO L272 TraceCheckUtils]: 174: Hoare triple {22037#(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)); {21493#true} is VALID [2022-04-08 07:49:17,922 INFO L290 TraceCheckUtils]: 175: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,922 INFO L290 TraceCheckUtils]: 176: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,922 INFO L290 TraceCheckUtils]: 177: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,923 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {21493#true} {22037#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {22037#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:49:17,923 INFO L290 TraceCheckUtils]: 179: Hoare triple {22037#(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; {22059#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:17,923 INFO L290 TraceCheckUtils]: 180: Hoare triple {22059#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !false; {22059#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:17,923 INFO L272 TraceCheckUtils]: 181: Hoare triple {22059#(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)); {21493#true} is VALID [2022-04-08 07:49:17,924 INFO L290 TraceCheckUtils]: 182: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,924 INFO L290 TraceCheckUtils]: 183: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,924 INFO L290 TraceCheckUtils]: 184: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,924 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {21493#true} {22059#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} #54#return; {22059#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:17,925 INFO L290 TraceCheckUtils]: 186: Hoare triple {22059#(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; {22081#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} is VALID [2022-04-08 07:49:17,925 INFO L290 TraceCheckUtils]: 187: Hoare triple {22081#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} assume !false; {22081#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} is VALID [2022-04-08 07:49:17,925 INFO L272 TraceCheckUtils]: 188: Hoare triple {22081#(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)); {21493#true} is VALID [2022-04-08 07:49:17,925 INFO L290 TraceCheckUtils]: 189: Hoare triple {21493#true} ~cond := #in~cond; {21493#true} is VALID [2022-04-08 07:49:17,925 INFO L290 TraceCheckUtils]: 190: Hoare triple {21493#true} assume !(0 == ~cond); {21493#true} is VALID [2022-04-08 07:49:17,925 INFO L290 TraceCheckUtils]: 191: Hoare triple {21493#true} assume true; {21493#true} is VALID [2022-04-08 07:49:17,926 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {21493#true} {22081#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} #54#return; {22081#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} is VALID [2022-04-08 07:49:17,928 INFO L290 TraceCheckUtils]: 193: Hoare triple {22081#(and (< 24 main_~k~0) (= main_~y~0 25) (<= main_~c~0 25))} assume !(~c~0 < ~k~0); {22103#(and (<= main_~k~0 25) (< 24 main_~k~0) (= main_~y~0 25))} is VALID [2022-04-08 07:49:17,928 INFO L272 TraceCheckUtils]: 194: Hoare triple {22103#(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)); {22107#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:49:17,929 INFO L290 TraceCheckUtils]: 195: Hoare triple {22107#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22111#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:49:17,929 INFO L290 TraceCheckUtils]: 196: Hoare triple {22111#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21494#false} is VALID [2022-04-08 07:49:17,929 INFO L290 TraceCheckUtils]: 197: Hoare triple {21494#false} assume !false; {21494#false} is VALID [2022-04-08 07:49:17,930 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 07:49:17,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:49:18,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:49:18,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767557416] [2022-04-08 07:49:18,315 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:49:18,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825959829] [2022-04-08 07:49:18,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825959829] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:49:18,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:49:18,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2022-04-08 07:49:18,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:49:18,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1811854894] [2022-04-08 07:49:18,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1811854894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:18,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:18,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-08 07:49:18,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078839119] [2022-04-08 07:49:18,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:49:18,316 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) Word has length 198 [2022-04-08 07:49:18,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:49:18,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-08 07:49:18,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:18,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-08 07:49:18,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:18,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-08 07:49:18,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 07:49:18,495 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-08 07:49:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:26,697 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-04-08 07:49:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 07:49:26,697 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) Word has length 198 [2022-04-08 07:49:26,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:49:26,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-08 07:49:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 132 transitions. [2022-04-08 07:49:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-08 07:49:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 132 transitions. [2022-04-08 07:49:26,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 132 transitions. [2022-04-08 07:49:27,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:27,037 INFO L225 Difference]: With dead ends: 111 [2022-04-08 07:49:27,037 INFO L226 Difference]: Without dead ends: 106 [2022-04-08 07:49:27,037 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 177 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 07:49:27,038 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:49:27,038 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1339 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-08 07:49:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-08 07:49:27,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-08 07:49:27,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:49:27,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 07:49:27,156 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 07:49:27,156 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 07:49:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:27,158 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-04-08 07:49:27,159 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-08 07:49:27,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:27,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:27,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 106 states. [2022-04-08 07:49:27,159 INFO L87 Difference]: Start difference. First operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 106 states. [2022-04-08 07:49:27,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:27,162 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-04-08 07:49:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-08 07:49:27,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:27,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:27,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:49:27,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:49:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 07:49:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-08 07:49:27,165 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 198 [2022-04-08 07:49:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:49:27,165 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-08 07:49:27,165 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 28 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-04-08 07:49:27,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 131 transitions. [2022-04-08 07:49:27,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-08 07:49:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-04-08 07:49:27,979 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:49:27,979 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:49:27,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 07:49:28,180 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 07:49:28,180 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:49:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:49:28,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1629673417, now seen corresponding path program 51 times [2022-04-08 07:49:28,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:28,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1604771844] [2022-04-08 07:49:28,262 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:49:28,262 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:49:28,262 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:49:28,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1629673417, now seen corresponding path program 52 times [2022-04-08 07:49:28,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:49:28,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270766369] [2022-04-08 07:49:28,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:49:28,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:49:28,275 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:49:28,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731087423] [2022-04-08 07:49:28,275 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:49:28,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:28,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:49:28,276 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 07:49:28,277 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 07:49:28,920 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:49:28,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:49:28,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-08 07:49:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:28,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:49:30,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {22809#true} call ULTIMATE.init(); {22809#true} is VALID [2022-04-08 07:49:30,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {22809#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); {22809#true} is VALID [2022-04-08 07:49:30,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22809#true} {22809#true} #60#return; {22809#true} is VALID [2022-04-08 07:49:30,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {22809#true} call #t~ret5 := main(); {22809#true} is VALID [2022-04-08 07:49:30,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {22809#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; {22809#true} is VALID [2022-04-08 07:49:30,007 INFO L272 TraceCheckUtils]: 6: Hoare triple {22809#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {22809#true} is VALID [2022-04-08 07:49:30,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,007 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22809#true} {22809#true} #52#return; {22809#true} is VALID [2022-04-08 07:49:30,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {22809#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {22847#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:30,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {22847#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {22847#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:30,008 INFO L272 TraceCheckUtils]: 13: Hoare triple {22847#(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)); {22809#true} is VALID [2022-04-08 07:49:30,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,009 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22809#true} {22847#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {22847#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:30,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {22847#(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; {22869#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:49:30,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {22869#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {22869#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:49:30,009 INFO L272 TraceCheckUtils]: 20: Hoare triple {22869#(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)); {22809#true} is VALID [2022-04-08 07:49:30,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,010 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {22809#true} {22869#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {22869#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:49:30,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {22869#(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; {22891#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:49:30,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {22891#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {22891#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:49:30,011 INFO L272 TraceCheckUtils]: 27: Hoare triple {22891#(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)); {22809#true} is VALID [2022-04-08 07:49:30,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,011 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22809#true} {22891#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #54#return; {22891#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:49:30,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {22891#(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; {22913#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:49:30,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {22913#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !false; {22913#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:49:30,012 INFO L272 TraceCheckUtils]: 34: Hoare triple {22913#(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)); {22809#true} is VALID [2022-04-08 07:49:30,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,013 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22809#true} {22913#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #54#return; {22913#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 07:49:30,013 INFO L290 TraceCheckUtils]: 39: Hoare triple {22913#(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; {22935#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-08 07:49:30,013 INFO L290 TraceCheckUtils]: 40: Hoare triple {22935#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} assume !false; {22935#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-08 07:49:30,013 INFO L272 TraceCheckUtils]: 41: Hoare triple {22935#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 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)); {22809#true} is VALID [2022-04-08 07:49:30,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,014 INFO L290 TraceCheckUtils]: 43: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,014 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {22809#true} {22935#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} #54#return; {22935#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-08 07:49:30,014 INFO L290 TraceCheckUtils]: 46: Hoare triple {22935#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 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; {22957#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:49:30,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {22957#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {22957#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:49:30,015 INFO L272 TraceCheckUtils]: 48: Hoare triple {22957#(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)); {22809#true} is VALID [2022-04-08 07:49:30,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,015 INFO L290 TraceCheckUtils]: 50: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,015 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22809#true} {22957#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {22957#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:49:30,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {22957#(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; {22979#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:49:30,016 INFO L290 TraceCheckUtils]: 54: Hoare triple {22979#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {22979#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:49:30,016 INFO L272 TraceCheckUtils]: 55: Hoare triple {22979#(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)); {22809#true} is VALID [2022-04-08 07:49:30,016 INFO L290 TraceCheckUtils]: 56: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,016 INFO L290 TraceCheckUtils]: 58: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,017 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22809#true} {22979#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {22979#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:49:30,017 INFO L290 TraceCheckUtils]: 60: Hoare triple {22979#(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; {23001#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:49:30,017 INFO L290 TraceCheckUtils]: 61: Hoare triple {23001#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {23001#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:49:30,018 INFO L272 TraceCheckUtils]: 62: Hoare triple {23001#(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)); {22809#true} is VALID [2022-04-08 07:49:30,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,018 INFO L290 TraceCheckUtils]: 64: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,018 INFO L290 TraceCheckUtils]: 65: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,018 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22809#true} {23001#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #54#return; {23001#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:49:30,019 INFO L290 TraceCheckUtils]: 67: Hoare triple {23001#(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; {23023#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 07:49:30,019 INFO L290 TraceCheckUtils]: 68: Hoare triple {23023#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {23023#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 07:49:30,019 INFO L272 TraceCheckUtils]: 69: Hoare triple {23023#(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)); {22809#true} is VALID [2022-04-08 07:49:30,019 INFO L290 TraceCheckUtils]: 70: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,019 INFO L290 TraceCheckUtils]: 71: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,019 INFO L290 TraceCheckUtils]: 72: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,020 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {22809#true} {23023#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #54#return; {23023#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 07:49:30,035 INFO L290 TraceCheckUtils]: 74: Hoare triple {23023#(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; {23045#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:30,036 INFO L290 TraceCheckUtils]: 75: Hoare triple {23045#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} assume !false; {23045#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:30,036 INFO L272 TraceCheckUtils]: 76: Hoare triple {23045#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22809#true} is VALID [2022-04-08 07:49:30,036 INFO L290 TraceCheckUtils]: 77: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,036 INFO L290 TraceCheckUtils]: 78: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,036 INFO L290 TraceCheckUtils]: 79: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,036 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22809#true} {23045#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} #54#return; {23045#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:30,037 INFO L290 TraceCheckUtils]: 81: Hoare triple {23045#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23067#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-08 07:49:30,037 INFO L290 TraceCheckUtils]: 82: Hoare triple {23067#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} assume !false; {23067#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-08 07:49:30,037 INFO L272 TraceCheckUtils]: 83: Hoare triple {23067#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22809#true} is VALID [2022-04-08 07:49:30,037 INFO L290 TraceCheckUtils]: 84: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,037 INFO L290 TraceCheckUtils]: 85: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,037 INFO L290 TraceCheckUtils]: 86: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,038 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {22809#true} {23067#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} #54#return; {23067#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-08 07:49:30,038 INFO L290 TraceCheckUtils]: 88: Hoare triple {23067#(and (= 6 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23089#(and (= (+ main_~y~0 (- 3)) 8) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-08 07:49:30,038 INFO L290 TraceCheckUtils]: 89: Hoare triple {23089#(and (= (+ main_~y~0 (- 3)) 8) (= 6 (+ main_~c~0 (- 5))))} assume !false; {23089#(and (= (+ main_~y~0 (- 3)) 8) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-08 07:49:30,039 INFO L272 TraceCheckUtils]: 90: Hoare triple {23089#(and (= (+ main_~y~0 (- 3)) 8) (= 6 (+ main_~c~0 (- 5))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22809#true} is VALID [2022-04-08 07:49:30,039 INFO L290 TraceCheckUtils]: 91: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,039 INFO L290 TraceCheckUtils]: 92: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,039 INFO L290 TraceCheckUtils]: 93: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,039 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22809#true} {23089#(and (= (+ main_~y~0 (- 3)) 8) (= 6 (+ main_~c~0 (- 5))))} #54#return; {23089#(and (= (+ main_~y~0 (- 3)) 8) (= 6 (+ main_~c~0 (- 5))))} is VALID [2022-04-08 07:49:30,040 INFO L290 TraceCheckUtils]: 95: Hoare triple {23089#(and (= (+ main_~y~0 (- 3)) 8) (= 6 (+ main_~c~0 (- 5))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23111#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-08 07:49:30,040 INFO L290 TraceCheckUtils]: 96: Hoare triple {23111#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} assume !false; {23111#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-08 07:49:30,040 INFO L272 TraceCheckUtils]: 97: Hoare triple {23111#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22809#true} is VALID [2022-04-08 07:49:30,040 INFO L290 TraceCheckUtils]: 98: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,040 INFO L290 TraceCheckUtils]: 99: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,040 INFO L290 TraceCheckUtils]: 100: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,041 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {22809#true} {23111#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} #54#return; {23111#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} is VALID [2022-04-08 07:49:30,041 INFO L290 TraceCheckUtils]: 102: Hoare triple {23111#(and (= main_~c~0 12) (= (+ main_~y~0 (- 4)) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23133#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:49:30,041 INFO L290 TraceCheckUtils]: 103: Hoare triple {23133#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {23133#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:49:30,041 INFO L272 TraceCheckUtils]: 104: Hoare triple {23133#(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)); {22809#true} is VALID [2022-04-08 07:49:30,041 INFO L290 TraceCheckUtils]: 105: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,042 INFO L290 TraceCheckUtils]: 106: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,042 INFO L290 TraceCheckUtils]: 107: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,042 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {22809#true} {23133#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {23133#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:49:30,042 INFO L290 TraceCheckUtils]: 109: Hoare triple {23133#(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; {23155#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:49:30,043 INFO L290 TraceCheckUtils]: 110: Hoare triple {23155#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {23155#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:49:30,043 INFO L272 TraceCheckUtils]: 111: Hoare triple {23155#(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)); {22809#true} is VALID [2022-04-08 07:49:30,043 INFO L290 TraceCheckUtils]: 112: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,043 INFO L290 TraceCheckUtils]: 113: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,043 INFO L290 TraceCheckUtils]: 114: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,043 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {22809#true} {23155#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #54#return; {23155#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:49:30,044 INFO L290 TraceCheckUtils]: 116: Hoare triple {23155#(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; {23177#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 07:49:30,044 INFO L290 TraceCheckUtils]: 117: Hoare triple {23177#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} assume !false; {23177#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 07:49:30,044 INFO L272 TraceCheckUtils]: 118: Hoare triple {23177#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22809#true} is VALID [2022-04-08 07:49:30,044 INFO L290 TraceCheckUtils]: 119: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,044 INFO L290 TraceCheckUtils]: 120: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,044 INFO L290 TraceCheckUtils]: 121: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,045 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {22809#true} {23177#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} #54#return; {23177#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 07:49:30,045 INFO L290 TraceCheckUtils]: 123: Hoare triple {23177#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23199#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-08 07:49:30,046 INFO L290 TraceCheckUtils]: 124: Hoare triple {23199#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} assume !false; {23199#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-08 07:49:30,046 INFO L272 TraceCheckUtils]: 125: Hoare triple {23199#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22809#true} is VALID [2022-04-08 07:49:30,046 INFO L290 TraceCheckUtils]: 126: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,046 INFO L290 TraceCheckUtils]: 127: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,046 INFO L290 TraceCheckUtils]: 128: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,046 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {22809#true} {23199#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} #54#return; {23199#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-08 07:49:30,047 INFO L290 TraceCheckUtils]: 130: Hoare triple {23199#(and (= 14 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 13))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23221#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-08 07:49:30,047 INFO L290 TraceCheckUtils]: 131: Hoare triple {23221#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} assume !false; {23221#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-08 07:49:30,047 INFO L272 TraceCheckUtils]: 132: Hoare triple {23221#(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)); {22809#true} is VALID [2022-04-08 07:49:30,047 INFO L290 TraceCheckUtils]: 133: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,047 INFO L290 TraceCheckUtils]: 134: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,047 INFO L290 TraceCheckUtils]: 135: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,048 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {22809#true} {23221#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} #54#return; {23221#(and (= (+ main_~c~0 (- 3)) 14) (= main_~y~0 17))} is VALID [2022-04-08 07:49:30,048 INFO L290 TraceCheckUtils]: 137: Hoare triple {23221#(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; {23243#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:49:30,048 INFO L290 TraceCheckUtils]: 138: Hoare triple {23243#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {23243#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:49:30,048 INFO L272 TraceCheckUtils]: 139: Hoare triple {23243#(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)); {22809#true} is VALID [2022-04-08 07:49:30,048 INFO L290 TraceCheckUtils]: 140: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,048 INFO L290 TraceCheckUtils]: 141: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,049 INFO L290 TraceCheckUtils]: 142: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,049 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {22809#true} {23243#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #54#return; {23243#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:49:30,049 INFO L290 TraceCheckUtils]: 144: Hoare triple {23243#(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; {23265#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:49:30,050 INFO L290 TraceCheckUtils]: 145: Hoare triple {23265#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {23265#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:49:30,050 INFO L272 TraceCheckUtils]: 146: Hoare triple {23265#(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)); {22809#true} is VALID [2022-04-08 07:49:30,050 INFO L290 TraceCheckUtils]: 147: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,050 INFO L290 TraceCheckUtils]: 148: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,050 INFO L290 TraceCheckUtils]: 149: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,050 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {22809#true} {23265#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {23265#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:49:30,051 INFO L290 TraceCheckUtils]: 151: Hoare triple {23265#(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; {23287#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:30,051 INFO L290 TraceCheckUtils]: 152: Hoare triple {23287#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {23287#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:30,051 INFO L272 TraceCheckUtils]: 153: Hoare triple {23287#(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)); {22809#true} is VALID [2022-04-08 07:49:30,051 INFO L290 TraceCheckUtils]: 154: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,051 INFO L290 TraceCheckUtils]: 155: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,051 INFO L290 TraceCheckUtils]: 156: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,052 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {22809#true} {23287#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #54#return; {23287#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:30,052 INFO L290 TraceCheckUtils]: 158: Hoare triple {23287#(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; {23309#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:30,053 INFO L290 TraceCheckUtils]: 159: Hoare triple {23309#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} assume !false; {23309#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:30,053 INFO L272 TraceCheckUtils]: 160: Hoare triple {23309#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22809#true} is VALID [2022-04-08 07:49:30,053 INFO L290 TraceCheckUtils]: 161: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,053 INFO L290 TraceCheckUtils]: 162: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,053 INFO L290 TraceCheckUtils]: 163: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,053 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {22809#true} {23309#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} #54#return; {23309#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:30,054 INFO L290 TraceCheckUtils]: 165: Hoare triple {23309#(and (= main_~y~0 21) (= 19 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23331#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:30,054 INFO L290 TraceCheckUtils]: 166: Hoare triple {23331#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} assume !false; {23331#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:30,054 INFO L272 TraceCheckUtils]: 167: Hoare triple {23331#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22809#true} is VALID [2022-04-08 07:49:30,059 INFO L290 TraceCheckUtils]: 168: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,059 INFO L290 TraceCheckUtils]: 169: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,059 INFO L290 TraceCheckUtils]: 170: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,060 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {22809#true} {23331#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} #54#return; {23331#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:30,060 INFO L290 TraceCheckUtils]: 172: Hoare triple {23331#(and (= 19 (+ main_~c~0 (- 3))) (= 21 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {23353#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:49:30,061 INFO L290 TraceCheckUtils]: 173: Hoare triple {23353#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {23353#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:49:30,061 INFO L272 TraceCheckUtils]: 174: Hoare triple {23353#(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)); {22809#true} is VALID [2022-04-08 07:49:30,061 INFO L290 TraceCheckUtils]: 175: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,061 INFO L290 TraceCheckUtils]: 176: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,061 INFO L290 TraceCheckUtils]: 177: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,061 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {22809#true} {23353#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {23353#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:49:30,062 INFO L290 TraceCheckUtils]: 179: Hoare triple {23353#(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; {23375#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-08 07:49:30,062 INFO L290 TraceCheckUtils]: 180: Hoare triple {23375#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} assume !false; {23375#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-08 07:49:30,062 INFO L272 TraceCheckUtils]: 181: Hoare triple {23375#(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)); {22809#true} is VALID [2022-04-08 07:49:30,062 INFO L290 TraceCheckUtils]: 182: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,062 INFO L290 TraceCheckUtils]: 183: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,062 INFO L290 TraceCheckUtils]: 184: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,063 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {22809#true} {23375#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} #54#return; {23375#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-08 07:49:30,063 INFO L290 TraceCheckUtils]: 186: Hoare triple {23375#(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; {23397#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 07:49:30,063 INFO L290 TraceCheckUtils]: 187: Hoare triple {23397#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} assume !false; {23397#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 07:49:30,064 INFO L272 TraceCheckUtils]: 188: Hoare triple {23397#(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)); {22809#true} is VALID [2022-04-08 07:49:30,064 INFO L290 TraceCheckUtils]: 189: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,064 INFO L290 TraceCheckUtils]: 190: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,064 INFO L290 TraceCheckUtils]: 191: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,064 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {22809#true} {23397#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} #54#return; {23397#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 07:49:30,064 INFO L290 TraceCheckUtils]: 193: Hoare triple {23397#(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; {23419#(and (<= main_~c~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 07:49:30,065 INFO L290 TraceCheckUtils]: 194: Hoare triple {23419#(and (<= main_~c~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} assume !false; {23419#(and (<= main_~c~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 07:49:30,065 INFO L272 TraceCheckUtils]: 195: Hoare triple {23419#(and (<= main_~c~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {22809#true} is VALID [2022-04-08 07:49:30,065 INFO L290 TraceCheckUtils]: 196: Hoare triple {22809#true} ~cond := #in~cond; {22809#true} is VALID [2022-04-08 07:49:30,065 INFO L290 TraceCheckUtils]: 197: Hoare triple {22809#true} assume !(0 == ~cond); {22809#true} is VALID [2022-04-08 07:49:30,065 INFO L290 TraceCheckUtils]: 198: Hoare triple {22809#true} assume true; {22809#true} is VALID [2022-04-08 07:49:30,066 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {22809#true} {23419#(and (<= main_~c~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} #54#return; {23419#(and (<= main_~c~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 07:49:30,067 INFO L290 TraceCheckUtils]: 200: Hoare triple {23419#(and (<= main_~c~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} assume !(~c~0 < ~k~0); {23441#(and (<= main_~k~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 07:49:30,067 INFO L272 TraceCheckUtils]: 201: Hoare triple {23441#(and (<= main_~k~0 26) (< 25 main_~k~0) (= (+ (- 1) main_~y~0) 25))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {23445#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:49:30,068 INFO L290 TraceCheckUtils]: 202: Hoare triple {23445#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23449#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:49:30,068 INFO L290 TraceCheckUtils]: 203: Hoare triple {23449#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22810#false} is VALID [2022-04-08 07:49:30,068 INFO L290 TraceCheckUtils]: 204: Hoare triple {22810#false} assume !false; {22810#false} is VALID [2022-04-08 07:49:30,069 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 07:49:30,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:49:30,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:49:30,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270766369] [2022-04-08 07:49:30,423 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:49:30,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731087423] [2022-04-08 07:49:30,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731087423] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:49:30,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:49:30,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2022-04-08 07:49:30,424 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:49:30,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1604771844] [2022-04-08 07:49:30,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1604771844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:30,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:30,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-08 07:49:30,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822541109] [2022-04-08 07:49:30,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:49:30,430 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) Word has length 205 [2022-04-08 07:49:30,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:49:30,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-08 07:49:30,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:30,621 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-08 07:49:30,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:30,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-08 07:49:30,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 07:49:30,622 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-08 07:49:39,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:39,150 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-08 07:49:39,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 07:49:39,151 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) Word has length 205 [2022-04-08 07:49:39,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:49:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-08 07:49:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 136 transitions. [2022-04-08 07:49:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-08 07:49:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 136 transitions. [2022-04-08 07:49:39,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 136 transitions. [2022-04-08 07:49:39,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:39,463 INFO L225 Difference]: With dead ends: 114 [2022-04-08 07:49:39,463 INFO L226 Difference]: Without dead ends: 109 [2022-04-08 07:49:39,464 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 183 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 07:49:39,464 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-08 07:49:39,464 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1415 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-08 07:49:39,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-08 07:49:39,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-08 07:49:39,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:49:39,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 07:49:39,582 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 07:49:39,582 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 07:49:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:39,585 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-08 07:49:39,585 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-08 07:49:39,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:39,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:39,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 109 states. [2022-04-08 07:49:39,585 INFO L87 Difference]: Start difference. First operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 109 states. [2022-04-08 07:49:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:39,588 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-08 07:49:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-08 07:49:39,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:39,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:39,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:49:39,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:49:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 32 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 07:49:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-08 07:49:39,591 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 205 [2022-04-08 07:49:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:49:39,591 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-08 07:49:39,591 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 29 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-04-08 07:49:39,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 135 transitions. [2022-04-08 07:49:40,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-08 07:49:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-04-08 07:49:40,353 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:49:40,353 INFO L499 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:49:40,358 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 07:49:40,553 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 07:49:40,554 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:49:40,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:49:40,554 INFO L85 PathProgramCache]: Analyzing trace with hash -12241624, now seen corresponding path program 53 times [2022-04-08 07:49:40,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:40,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855839461] [2022-04-08 07:49:40,614 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:49:40,614 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:49:40,614 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:49:40,614 INFO L85 PathProgramCache]: Analyzing trace with hash -12241624, now seen corresponding path program 54 times [2022-04-08 07:49:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:49:40,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132263342] [2022-04-08 07:49:40,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:49:40,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:49:40,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:49:40,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621163924] [2022-04-08 07:49:40,628 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:49:40,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:40,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:49:40,629 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 07:49:40,630 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 07:49:53,730 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-08 07:49:53,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:49:53,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 116 conjunts are in the unsatisfiable core [2022-04-08 07:49:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:53,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:49:54,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {24165#true} call ULTIMATE.init(); {24165#true} is VALID [2022-04-08 07:49:54,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {24165#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); {24165#true} is VALID [2022-04-08 07:49:54,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24165#true} {24165#true} #60#return; {24165#true} is VALID [2022-04-08 07:49:54,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {24165#true} call #t~ret5 := main(); {24165#true} is VALID [2022-04-08 07:49:54,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {24165#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; {24165#true} is VALID [2022-04-08 07:49:54,824 INFO L272 TraceCheckUtils]: 6: Hoare triple {24165#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {24165#true} is VALID [2022-04-08 07:49:54,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,824 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24165#true} {24165#true} #52#return; {24165#true} is VALID [2022-04-08 07:49:54,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {24165#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {24203#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:54,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {24203#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {24203#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:54,825 INFO L272 TraceCheckUtils]: 13: Hoare triple {24203#(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)); {24165#true} is VALID [2022-04-08 07:49:54,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,825 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24165#true} {24203#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {24203#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:54,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {24203#(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; {24225#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:49:54,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {24225#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {24225#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:49:54,826 INFO L272 TraceCheckUtils]: 20: Hoare triple {24225#(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)); {24165#true} is VALID [2022-04-08 07:49:54,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,827 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {24165#true} {24225#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {24225#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:49:54,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {24225#(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; {24247#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:54,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {24247#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {24247#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:54,828 INFO L272 TraceCheckUtils]: 27: Hoare triple {24247#(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)); {24165#true} is VALID [2022-04-08 07:49:54,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,828 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {24165#true} {24247#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {24247#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:54,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {24247#(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; {24269#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 07:49:54,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {24269#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !false; {24269#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 07:49:54,829 INFO L272 TraceCheckUtils]: 34: Hoare triple {24269#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24165#true} is VALID [2022-04-08 07:49:54,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,830 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {24165#true} {24269#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} #54#return; {24269#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-08 07:49:54,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {24269#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24291#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:49:54,830 INFO L290 TraceCheckUtils]: 40: Hoare triple {24291#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {24291#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:49:54,830 INFO L272 TraceCheckUtils]: 41: Hoare triple {24291#(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)); {24165#true} is VALID [2022-04-08 07:49:54,830 INFO L290 TraceCheckUtils]: 42: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,831 INFO L290 TraceCheckUtils]: 44: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,835 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {24165#true} {24291#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {24291#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:49:54,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {24291#(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; {24313#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:49:54,836 INFO L290 TraceCheckUtils]: 47: Hoare triple {24313#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {24313#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:49:54,836 INFO L272 TraceCheckUtils]: 48: Hoare triple {24313#(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)); {24165#true} is VALID [2022-04-08 07:49:54,836 INFO L290 TraceCheckUtils]: 49: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,836 INFO L290 TraceCheckUtils]: 50: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,836 INFO L290 TraceCheckUtils]: 51: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,837 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {24165#true} {24313#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {24313#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:49:54,837 INFO L290 TraceCheckUtils]: 53: Hoare triple {24313#(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; {24335#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:54,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {24335#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {24335#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:54,837 INFO L272 TraceCheckUtils]: 55: Hoare triple {24335#(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)); {24165#true} is VALID [2022-04-08 07:49:54,838 INFO L290 TraceCheckUtils]: 56: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,838 INFO L290 TraceCheckUtils]: 57: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,838 INFO L290 TraceCheckUtils]: 58: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,838 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24165#true} {24335#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {24335#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:54,838 INFO L290 TraceCheckUtils]: 60: Hoare triple {24335#(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; {24357#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:49:54,839 INFO L290 TraceCheckUtils]: 61: Hoare triple {24357#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !false; {24357#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:49:54,839 INFO L272 TraceCheckUtils]: 62: Hoare triple {24357#(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)); {24165#true} is VALID [2022-04-08 07:49:54,839 INFO L290 TraceCheckUtils]: 63: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,839 INFO L290 TraceCheckUtils]: 64: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,839 INFO L290 TraceCheckUtils]: 65: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,839 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24165#true} {24357#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #54#return; {24357#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:49:54,840 INFO L290 TraceCheckUtils]: 67: Hoare triple {24357#(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; {24379#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 07:49:54,840 INFO L290 TraceCheckUtils]: 68: Hoare triple {24379#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {24379#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 07:49:54,840 INFO L272 TraceCheckUtils]: 69: Hoare triple {24379#(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)); {24165#true} is VALID [2022-04-08 07:49:54,840 INFO L290 TraceCheckUtils]: 70: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,840 INFO L290 TraceCheckUtils]: 71: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,840 INFO L290 TraceCheckUtils]: 72: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,841 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {24165#true} {24379#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #54#return; {24379#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 07:49:54,841 INFO L290 TraceCheckUtils]: 74: Hoare triple {24379#(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; {24401#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:49:54,841 INFO L290 TraceCheckUtils]: 75: Hoare triple {24401#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {24401#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:49:54,842 INFO L272 TraceCheckUtils]: 76: Hoare triple {24401#(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)); {24165#true} is VALID [2022-04-08 07:49:54,842 INFO L290 TraceCheckUtils]: 77: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,842 INFO L290 TraceCheckUtils]: 78: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,842 INFO L290 TraceCheckUtils]: 79: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,842 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24165#true} {24401#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {24401#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:49:54,843 INFO L290 TraceCheckUtils]: 81: Hoare triple {24401#(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; {24423#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:49:54,843 INFO L290 TraceCheckUtils]: 82: Hoare triple {24423#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {24423#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:49:54,843 INFO L272 TraceCheckUtils]: 83: Hoare triple {24423#(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)); {24165#true} is VALID [2022-04-08 07:49:54,843 INFO L290 TraceCheckUtils]: 84: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,843 INFO L290 TraceCheckUtils]: 85: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,843 INFO L290 TraceCheckUtils]: 86: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,843 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {24165#true} {24423#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {24423#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:49:54,847 INFO L290 TraceCheckUtils]: 88: Hoare triple {24423#(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; {24445#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:49:54,847 INFO L290 TraceCheckUtils]: 89: Hoare triple {24445#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {24445#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:49:54,848 INFO L272 TraceCheckUtils]: 90: Hoare triple {24445#(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)); {24165#true} is VALID [2022-04-08 07:49:54,848 INFO L290 TraceCheckUtils]: 91: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,848 INFO L290 TraceCheckUtils]: 92: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,848 INFO L290 TraceCheckUtils]: 93: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,848 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {24165#true} {24445#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {24445#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:49:54,849 INFO L290 TraceCheckUtils]: 95: Hoare triple {24445#(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; {24467#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:49:54,849 INFO L290 TraceCheckUtils]: 96: Hoare triple {24467#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {24467#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:49:54,849 INFO L272 TraceCheckUtils]: 97: Hoare triple {24467#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24165#true} is VALID [2022-04-08 07:49:54,849 INFO L290 TraceCheckUtils]: 98: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,849 INFO L290 TraceCheckUtils]: 99: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,849 INFO L290 TraceCheckUtils]: 100: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,850 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {24165#true} {24467#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {24467#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:49:54,850 INFO L290 TraceCheckUtils]: 102: Hoare triple {24467#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24489#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:54,850 INFO L290 TraceCheckUtils]: 103: Hoare triple {24489#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !false; {24489#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:54,850 INFO L272 TraceCheckUtils]: 104: Hoare triple {24489#(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)); {24165#true} is VALID [2022-04-08 07:49:54,850 INFO L290 TraceCheckUtils]: 105: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,850 INFO L290 TraceCheckUtils]: 106: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,851 INFO L290 TraceCheckUtils]: 107: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,851 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {24165#true} {24489#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #54#return; {24489#(and (= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:54,851 INFO L290 TraceCheckUtils]: 109: Hoare triple {24489#(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; {24511#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 07:49:54,852 INFO L290 TraceCheckUtils]: 110: Hoare triple {24511#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {24511#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 07:49:54,852 INFO L272 TraceCheckUtils]: 111: Hoare triple {24511#(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)); {24165#true} is VALID [2022-04-08 07:49:54,852 INFO L290 TraceCheckUtils]: 112: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,852 INFO L290 TraceCheckUtils]: 113: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,852 INFO L290 TraceCheckUtils]: 114: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,852 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {24165#true} {24511#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {24511#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 07:49:54,853 INFO L290 TraceCheckUtils]: 116: Hoare triple {24511#(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; {24533#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 07:49:54,853 INFO L290 TraceCheckUtils]: 117: Hoare triple {24533#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {24533#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 07:49:54,853 INFO L272 TraceCheckUtils]: 118: Hoare triple {24533#(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)); {24165#true} is VALID [2022-04-08 07:49:54,853 INFO L290 TraceCheckUtils]: 119: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,853 INFO L290 TraceCheckUtils]: 120: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,853 INFO L290 TraceCheckUtils]: 121: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,854 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {24165#true} {24533#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {24533#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 07:49:54,854 INFO L290 TraceCheckUtils]: 123: Hoare triple {24533#(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; {24555#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 07:49:54,854 INFO L290 TraceCheckUtils]: 124: Hoare triple {24555#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} assume !false; {24555#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 07:49:54,854 INFO L272 TraceCheckUtils]: 125: Hoare triple {24555#(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)); {24165#true} is VALID [2022-04-08 07:49:54,855 INFO L290 TraceCheckUtils]: 126: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,855 INFO L290 TraceCheckUtils]: 127: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,855 INFO L290 TraceCheckUtils]: 128: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,855 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {24165#true} {24555#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} #54#return; {24555#(and (= 15 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 07:49:54,856 INFO L290 TraceCheckUtils]: 130: Hoare triple {24555#(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; {24577#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-08 07:49:54,856 INFO L290 TraceCheckUtils]: 131: Hoare triple {24577#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} assume !false; {24577#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-08 07:49:54,856 INFO L272 TraceCheckUtils]: 132: Hoare triple {24577#(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)); {24165#true} is VALID [2022-04-08 07:49:54,856 INFO L290 TraceCheckUtils]: 133: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,856 INFO L290 TraceCheckUtils]: 134: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,856 INFO L290 TraceCheckUtils]: 135: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,857 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {24165#true} {24577#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} #54#return; {24577#(and (= main_~c~0 17) (= (+ (- 2) main_~y~0) 15))} is VALID [2022-04-08 07:49:54,857 INFO L290 TraceCheckUtils]: 137: Hoare triple {24577#(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; {24599#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 07:49:54,857 INFO L290 TraceCheckUtils]: 138: Hoare triple {24599#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !false; {24599#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 07:49:54,857 INFO L272 TraceCheckUtils]: 139: Hoare triple {24599#(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)); {24165#true} is VALID [2022-04-08 07:49:54,857 INFO L290 TraceCheckUtils]: 140: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,858 INFO L290 TraceCheckUtils]: 141: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,858 INFO L290 TraceCheckUtils]: 142: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,858 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {24165#true} {24599#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} #54#return; {24599#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 07:49:54,858 INFO L290 TraceCheckUtils]: 144: Hoare triple {24599#(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; {24621#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:49:54,859 INFO L290 TraceCheckUtils]: 145: Hoare triple {24621#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {24621#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:49:54,859 INFO L272 TraceCheckUtils]: 146: Hoare triple {24621#(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)); {24165#true} is VALID [2022-04-08 07:49:54,859 INFO L290 TraceCheckUtils]: 147: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,859 INFO L290 TraceCheckUtils]: 148: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,859 INFO L290 TraceCheckUtils]: 149: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,859 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {24165#true} {24621#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {24621#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:49:54,860 INFO L290 TraceCheckUtils]: 151: Hoare triple {24621#(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; {24643#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:54,860 INFO L290 TraceCheckUtils]: 152: Hoare triple {24643#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {24643#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:54,860 INFO L272 TraceCheckUtils]: 153: Hoare triple {24643#(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)); {24165#true} is VALID [2022-04-08 07:49:54,860 INFO L290 TraceCheckUtils]: 154: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,860 INFO L290 TraceCheckUtils]: 155: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,860 INFO L290 TraceCheckUtils]: 156: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,861 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {24165#true} {24643#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #54#return; {24643#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:54,861 INFO L290 TraceCheckUtils]: 158: Hoare triple {24643#(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; {24665#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:49:54,862 INFO L290 TraceCheckUtils]: 159: Hoare triple {24665#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !false; {24665#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:49:54,862 INFO L272 TraceCheckUtils]: 160: Hoare triple {24665#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24165#true} is VALID [2022-04-08 07:49:54,862 INFO L290 TraceCheckUtils]: 161: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,862 INFO L290 TraceCheckUtils]: 162: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,862 INFO L290 TraceCheckUtils]: 163: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,862 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {24165#true} {24665#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} #54#return; {24665#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:49:54,863 INFO L290 TraceCheckUtils]: 165: Hoare triple {24665#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24687#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-08 07:49:54,863 INFO L290 TraceCheckUtils]: 166: Hoare triple {24687#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} assume !false; {24687#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-08 07:49:54,863 INFO L272 TraceCheckUtils]: 167: Hoare triple {24687#(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)); {24165#true} is VALID [2022-04-08 07:49:54,863 INFO L290 TraceCheckUtils]: 168: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,863 INFO L290 TraceCheckUtils]: 169: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,863 INFO L290 TraceCheckUtils]: 170: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,864 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {24165#true} {24687#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} #54#return; {24687#(and (= 19 (+ main_~y~0 (- 3))) (= main_~c~0 22))} is VALID [2022-04-08 07:49:54,864 INFO L290 TraceCheckUtils]: 172: Hoare triple {24687#(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; {24709#(and (= 19 (+ main_~y~0 (- 4))) (= 23 main_~c~0))} is VALID [2022-04-08 07:49:54,864 INFO L290 TraceCheckUtils]: 173: Hoare triple {24709#(and (= 19 (+ main_~y~0 (- 4))) (= 23 main_~c~0))} assume !false; {24709#(and (= 19 (+ main_~y~0 (- 4))) (= 23 main_~c~0))} is VALID [2022-04-08 07:49:54,865 INFO L272 TraceCheckUtils]: 174: Hoare triple {24709#(and (= 19 (+ main_~y~0 (- 4))) (= 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)); {24165#true} is VALID [2022-04-08 07:49:54,865 INFO L290 TraceCheckUtils]: 175: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,865 INFO L290 TraceCheckUtils]: 176: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,865 INFO L290 TraceCheckUtils]: 177: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,865 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {24165#true} {24709#(and (= 19 (+ main_~y~0 (- 4))) (= 23 main_~c~0))} #54#return; {24709#(and (= 19 (+ main_~y~0 (- 4))) (= 23 main_~c~0))} is VALID [2022-04-08 07:49:54,865 INFO L290 TraceCheckUtils]: 179: Hoare triple {24709#(and (= 19 (+ main_~y~0 (- 4))) (= 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; {24731#(and (= 19 (+ main_~y~0 (- 5))) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:54,866 INFO L290 TraceCheckUtils]: 180: Hoare triple {24731#(and (= 19 (+ main_~y~0 (- 5))) (= 23 (+ (- 1) main_~c~0)))} assume !false; {24731#(and (= 19 (+ main_~y~0 (- 5))) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:54,866 INFO L272 TraceCheckUtils]: 181: Hoare triple {24731#(and (= 19 (+ main_~y~0 (- 5))) (= 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)); {24165#true} is VALID [2022-04-08 07:49:54,866 INFO L290 TraceCheckUtils]: 182: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,866 INFO L290 TraceCheckUtils]: 183: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,866 INFO L290 TraceCheckUtils]: 184: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,866 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {24165#true} {24731#(and (= 19 (+ main_~y~0 (- 5))) (= 23 (+ (- 1) main_~c~0)))} #54#return; {24731#(and (= 19 (+ main_~y~0 (- 5))) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:49:54,867 INFO L290 TraceCheckUtils]: 186: Hoare triple {24731#(and (= 19 (+ main_~y~0 (- 5))) (= 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; {24753#(and (= main_~c~0 25) (= (+ main_~y~0 (- 6)) 19))} is VALID [2022-04-08 07:49:54,867 INFO L290 TraceCheckUtils]: 187: Hoare triple {24753#(and (= main_~c~0 25) (= (+ main_~y~0 (- 6)) 19))} assume !false; {24753#(and (= main_~c~0 25) (= (+ main_~y~0 (- 6)) 19))} is VALID [2022-04-08 07:49:54,867 INFO L272 TraceCheckUtils]: 188: Hoare triple {24753#(and (= main_~c~0 25) (= (+ main_~y~0 (- 6)) 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)); {24165#true} is VALID [2022-04-08 07:49:54,867 INFO L290 TraceCheckUtils]: 189: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,867 INFO L290 TraceCheckUtils]: 190: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,867 INFO L290 TraceCheckUtils]: 191: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,868 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {24165#true} {24753#(and (= main_~c~0 25) (= (+ main_~y~0 (- 6)) 19))} #54#return; {24753#(and (= main_~c~0 25) (= (+ main_~y~0 (- 6)) 19))} is VALID [2022-04-08 07:49:54,868 INFO L290 TraceCheckUtils]: 193: Hoare triple {24753#(and (= main_~c~0 25) (= (+ main_~y~0 (- 6)) 19))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {24775#(and (= 19 (+ main_~y~0 (- 7))) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-08 07:49:54,868 INFO L290 TraceCheckUtils]: 194: Hoare triple {24775#(and (= 19 (+ main_~y~0 (- 7))) (= (+ (- 1) main_~c~0) 25))} assume !false; {24775#(and (= 19 (+ main_~y~0 (- 7))) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-08 07:49:54,869 INFO L272 TraceCheckUtils]: 195: Hoare triple {24775#(and (= 19 (+ main_~y~0 (- 7))) (= (+ (- 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)); {24165#true} is VALID [2022-04-08 07:49:54,869 INFO L290 TraceCheckUtils]: 196: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,869 INFO L290 TraceCheckUtils]: 197: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,869 INFO L290 TraceCheckUtils]: 198: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,869 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {24165#true} {24775#(and (= 19 (+ main_~y~0 (- 7))) (= (+ (- 1) main_~c~0) 25))} #54#return; {24775#(and (= 19 (+ main_~y~0 (- 7))) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-08 07:49:54,869 INFO L290 TraceCheckUtils]: 200: Hoare triple {24775#(and (= 19 (+ main_~y~0 (- 7))) (= (+ (- 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; {24797#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} is VALID [2022-04-08 07:49:54,870 INFO L290 TraceCheckUtils]: 201: Hoare triple {24797#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} assume !false; {24797#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} is VALID [2022-04-08 07:49:54,870 INFO L272 TraceCheckUtils]: 202: Hoare triple {24797#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24165#true} is VALID [2022-04-08 07:49:54,870 INFO L290 TraceCheckUtils]: 203: Hoare triple {24165#true} ~cond := #in~cond; {24165#true} is VALID [2022-04-08 07:49:54,870 INFO L290 TraceCheckUtils]: 204: Hoare triple {24165#true} assume !(0 == ~cond); {24165#true} is VALID [2022-04-08 07:49:54,870 INFO L290 TraceCheckUtils]: 205: Hoare triple {24165#true} assume true; {24165#true} is VALID [2022-04-08 07:49:54,870 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {24165#true} {24797#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} #54#return; {24797#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} is VALID [2022-04-08 07:49:54,871 INFO L290 TraceCheckUtils]: 207: Hoare triple {24797#(and (= main_~y~0 27) (<= main_~c~0 27) (< 26 main_~k~0))} assume !(~c~0 < ~k~0); {24819#(and (= main_~y~0 27) (< 26 main_~k~0) (<= main_~k~0 27))} is VALID [2022-04-08 07:49:54,871 INFO L272 TraceCheckUtils]: 208: Hoare triple {24819#(and (= main_~y~0 27) (< 26 main_~k~0) (<= main_~k~0 27))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {24823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:49:54,872 INFO L290 TraceCheckUtils]: 209: Hoare triple {24823#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:49:54,872 INFO L290 TraceCheckUtils]: 210: Hoare triple {24827#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24166#false} is VALID [2022-04-08 07:49:54,872 INFO L290 TraceCheckUtils]: 211: Hoare triple {24166#false} assume !false; {24166#false} is VALID [2022-04-08 07:49:54,873 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 07:49:54,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:49:55,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:49:55,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132263342] [2022-04-08 07:49:55,234 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:49:55,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621163924] [2022-04-08 07:49:55,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621163924] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:49:55,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:49:55,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2022-04-08 07:49:55,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:49:55,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1855839461] [2022-04-08 07:49:55,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1855839461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:55,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:55,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-08 07:49:55,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146413995] [2022-04-08 07:49:55,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:49:55,236 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) Word has length 212 [2022-04-08 07:49:55,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:49:55,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-08 07:49:55,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:55,464 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-08 07:49:55,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:55,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-08 07:49:55,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 07:49:55,465 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-08 07:50:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:50:05,787 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2022-04-08 07:50:05,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 07:50:05,787 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) Word has length 212 [2022-04-08 07:50:05,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:50:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-08 07:50:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 140 transitions. [2022-04-08 07:50:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-08 07:50:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 140 transitions. [2022-04-08 07:50:05,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 140 transitions. [2022-04-08 07:50:06,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:50:06,101 INFO L225 Difference]: With dead ends: 117 [2022-04-08 07:50:06,102 INFO L226 Difference]: Without dead ends: 112 [2022-04-08 07:50:06,102 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=1294, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 07:50:06,103 INFO L913 BasicCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 2677 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-08 07:50:06,103 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1493 Invalid, 2677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2677 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-08 07:50:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-08 07:50:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-04-08 07:50:06,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:50:06,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 07:50:06,236 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 07:50:06,236 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 07:50:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:50:06,238 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2022-04-08 07:50:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-04-08 07:50:06,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:50:06,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:50:06,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 112 states. [2022-04-08 07:50:06,238 INFO L87 Difference]: Start difference. First operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 112 states. [2022-04-08 07:50:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:50:06,240 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2022-04-08 07:50:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-04-08 07:50:06,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:50:06,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:50:06,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:50:06,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:50:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 33 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 07:50:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2022-04-08 07:50:06,243 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 212 [2022-04-08 07:50:06,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:50:06,243 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2022-04-08 07:50:06,243 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 30 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-04-08 07:50:06,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 139 transitions. [2022-04-08 07:50:07,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:50:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-04-08 07:50:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-04-08 07:50:07,051 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:50:07,052 INFO L499 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:50:07,061 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 07:50:07,252 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 07:50:07,252 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:50:07,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:50:07,253 INFO L85 PathProgramCache]: Analyzing trace with hash -255861015, now seen corresponding path program 55 times [2022-04-08 07:50:07,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:50:07,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1797860414] [2022-04-08 07:50:07,338 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:50:07,338 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:50:07,338 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:50:07,338 INFO L85 PathProgramCache]: Analyzing trace with hash -255861015, now seen corresponding path program 56 times [2022-04-08 07:50:07,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:50:07,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5418880] [2022-04-08 07:50:07,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:50:07,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:50:07,353 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:50:07,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171228096] [2022-04-08 07:50:07,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:50:07,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:50:07,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:50:07,360 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 07:50:07,367 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 07:50:08,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:50:08,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:50:08,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 139 conjunts are in the unsatisfiable core [2022-04-08 07:50:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:50:08,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:50:09,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {25561#true} call ULTIMATE.init(); {25561#true} is VALID [2022-04-08 07:50:09,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {25561#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); {25561#true} is VALID [2022-04-08 07:50:09,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25561#true} {25561#true} #60#return; {25561#true} is VALID [2022-04-08 07:50:09,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {25561#true} call #t~ret5 := main(); {25561#true} is VALID [2022-04-08 07:50:09,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {25561#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; {25561#true} is VALID [2022-04-08 07:50:09,972 INFO L272 TraceCheckUtils]: 6: Hoare triple {25561#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {25561#true} is VALID [2022-04-08 07:50:09,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,972 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25561#true} {25561#true} #52#return; {25561#true} is VALID [2022-04-08 07:50:09,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {25561#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {25599#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:50:09,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {25599#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {25599#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:50:09,973 INFO L272 TraceCheckUtils]: 13: Hoare triple {25599#(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)); {25561#true} is VALID [2022-04-08 07:50:09,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,973 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25561#true} {25599#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {25599#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:50:09,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {25599#(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; {25621#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:50:09,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {25621#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {25621#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:50:09,974 INFO L272 TraceCheckUtils]: 20: Hoare triple {25621#(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)); {25561#true} is VALID [2022-04-08 07:50:09,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,975 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {25561#true} {25621#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {25621#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:50:09,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {25621#(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; {25643#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:50:09,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {25643#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {25643#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:50:09,976 INFO L272 TraceCheckUtils]: 27: Hoare triple {25643#(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)); {25561#true} is VALID [2022-04-08 07:50:09,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,976 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {25561#true} {25643#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {25643#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:50:09,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {25643#(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; {25665#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:50:09,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {25665#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {25665#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:50:09,977 INFO L272 TraceCheckUtils]: 34: Hoare triple {25665#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25561#true} is VALID [2022-04-08 07:50:09,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,978 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {25561#true} {25665#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {25665#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:50:09,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {25665#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25687#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-08 07:50:09,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {25687#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !false; {25687#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-08 07:50:09,978 INFO L272 TraceCheckUtils]: 41: Hoare triple {25687#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25561#true} is VALID [2022-04-08 07:50:09,978 INFO L290 TraceCheckUtils]: 42: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,979 INFO L290 TraceCheckUtils]: 43: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,979 INFO L290 TraceCheckUtils]: 44: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,979 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25561#true} {25687#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #54#return; {25687#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-08 07:50:09,980 INFO L290 TraceCheckUtils]: 46: Hoare triple {25687#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25709#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:50:09,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {25709#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} assume !false; {25709#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:50:09,980 INFO L272 TraceCheckUtils]: 48: Hoare triple {25709#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25561#true} is VALID [2022-04-08 07:50:09,980 INFO L290 TraceCheckUtils]: 49: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,980 INFO L290 TraceCheckUtils]: 51: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,981 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {25561#true} {25709#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} #54#return; {25709#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:50:09,981 INFO L290 TraceCheckUtils]: 53: Hoare triple {25709#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {25731#(and (= 2 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:50:09,981 INFO L290 TraceCheckUtils]: 54: Hoare triple {25731#(and (= 2 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 4))} assume !false; {25731#(and (= 2 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:50:09,982 INFO L272 TraceCheckUtils]: 55: Hoare triple {25731#(and (= 2 (+ main_~c~0 (- 4))) (= (+ (- 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)); {25561#true} is VALID [2022-04-08 07:50:09,982 INFO L290 TraceCheckUtils]: 56: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,982 INFO L290 TraceCheckUtils]: 57: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,982 INFO L290 TraceCheckUtils]: 58: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,982 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25561#true} {25731#(and (= 2 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 4))} #54#return; {25731#(and (= 2 (+ main_~c~0 (- 4))) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:50:09,983 INFO L290 TraceCheckUtils]: 60: Hoare triple {25731#(and (= 2 (+ main_~c~0 (- 4))) (= (+ (- 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; {25753#(and (= 7 main_~y~0) (= 2 (+ main_~c~0 (- 5))))} is VALID [2022-04-08 07:50:09,983 INFO L290 TraceCheckUtils]: 61: Hoare triple {25753#(and (= 7 main_~y~0) (= 2 (+ main_~c~0 (- 5))))} assume !false; {25753#(and (= 7 main_~y~0) (= 2 (+ main_~c~0 (- 5))))} is VALID [2022-04-08 07:50:09,983 INFO L272 TraceCheckUtils]: 62: Hoare triple {25753#(and (= 7 main_~y~0) (= 2 (+ 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)); {25561#true} is VALID [2022-04-08 07:50:09,983 INFO L290 TraceCheckUtils]: 63: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,983 INFO L290 TraceCheckUtils]: 64: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,983 INFO L290 TraceCheckUtils]: 65: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,984 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {25561#true} {25753#(and (= 7 main_~y~0) (= 2 (+ main_~c~0 (- 5))))} #54#return; {25753#(and (= 7 main_~y~0) (= 2 (+ main_~c~0 (- 5))))} is VALID [2022-04-08 07:50:09,984 INFO L290 TraceCheckUtils]: 67: Hoare triple {25753#(and (= 7 main_~y~0) (= 2 (+ 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; {25775#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))))} is VALID [2022-04-08 07:50:09,984 INFO L290 TraceCheckUtils]: 68: Hoare triple {25775#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))))} assume !false; {25775#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))))} is VALID [2022-04-08 07:50:09,984 INFO L272 TraceCheckUtils]: 69: Hoare triple {25775#(and (= main_~y~0 8) (= 2 (+ 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)); {25561#true} is VALID [2022-04-08 07:50:09,985 INFO L290 TraceCheckUtils]: 70: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,985 INFO L290 TraceCheckUtils]: 71: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,985 INFO L290 TraceCheckUtils]: 72: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,985 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {25561#true} {25775#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))))} #54#return; {25775#(and (= main_~y~0 8) (= 2 (+ main_~c~0 (- 6))))} is VALID [2022-04-08 07:50:09,985 INFO L290 TraceCheckUtils]: 74: Hoare triple {25775#(and (= main_~y~0 8) (= 2 (+ 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; {25797#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 07:50:09,986 INFO L290 TraceCheckUtils]: 75: Hoare triple {25797#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {25797#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 07:50:09,986 INFO L272 TraceCheckUtils]: 76: Hoare triple {25797#(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)); {25561#true} is VALID [2022-04-08 07:50:09,986 INFO L290 TraceCheckUtils]: 77: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,986 INFO L290 TraceCheckUtils]: 78: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,986 INFO L290 TraceCheckUtils]: 79: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,986 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {25561#true} {25797#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #54#return; {25797#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 07:50:09,987 INFO L290 TraceCheckUtils]: 81: Hoare triple {25797#(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; {25819#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:50:09,987 INFO L290 TraceCheckUtils]: 82: Hoare triple {25819#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {25819#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:50:09,987 INFO L272 TraceCheckUtils]: 83: Hoare triple {25819#(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)); {25561#true} is VALID [2022-04-08 07:50:09,987 INFO L290 TraceCheckUtils]: 84: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,987 INFO L290 TraceCheckUtils]: 85: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,988 INFO L290 TraceCheckUtils]: 86: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,988 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {25561#true} {25819#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {25819#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:50:09,988 INFO L290 TraceCheckUtils]: 88: Hoare triple {25819#(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; {25841#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:50:09,989 INFO L290 TraceCheckUtils]: 89: Hoare triple {25841#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !false; {25841#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:50:09,989 INFO L272 TraceCheckUtils]: 90: Hoare triple {25841#(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)); {25561#true} is VALID [2022-04-08 07:50:09,989 INFO L290 TraceCheckUtils]: 91: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,989 INFO L290 TraceCheckUtils]: 92: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,989 INFO L290 TraceCheckUtils]: 93: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,989 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25561#true} {25841#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #54#return; {25841#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:50:09,990 INFO L290 TraceCheckUtils]: 95: Hoare triple {25841#(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; {25863#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:50:09,990 INFO L290 TraceCheckUtils]: 96: Hoare triple {25863#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {25863#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:50:09,990 INFO L272 TraceCheckUtils]: 97: Hoare triple {25863#(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)); {25561#true} is VALID [2022-04-08 07:50:09,990 INFO L290 TraceCheckUtils]: 98: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,990 INFO L290 TraceCheckUtils]: 99: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,990 INFO L290 TraceCheckUtils]: 100: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,991 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {25561#true} {25863#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {25863#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:50:09,991 INFO L290 TraceCheckUtils]: 102: Hoare triple {25863#(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; {25885#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:50:09,992 INFO L290 TraceCheckUtils]: 103: Hoare triple {25885#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !false; {25885#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:50:09,992 INFO L272 TraceCheckUtils]: 104: Hoare triple {25885#(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)); {25561#true} is VALID [2022-04-08 07:50:09,992 INFO L290 TraceCheckUtils]: 105: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,992 INFO L290 TraceCheckUtils]: 106: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,992 INFO L290 TraceCheckUtils]: 107: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,992 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25561#true} {25885#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} #54#return; {25885#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:50:09,993 INFO L290 TraceCheckUtils]: 109: Hoare triple {25885#(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; {25907#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:50:09,993 INFO L290 TraceCheckUtils]: 110: Hoare triple {25907#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} assume !false; {25907#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:50:09,993 INFO L272 TraceCheckUtils]: 111: Hoare triple {25907#(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)); {25561#true} is VALID [2022-04-08 07:50:09,993 INFO L290 TraceCheckUtils]: 112: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,993 INFO L290 TraceCheckUtils]: 113: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,993 INFO L290 TraceCheckUtils]: 114: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,994 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {25561#true} {25907#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} #54#return; {25907#(and (= (+ (- 2) main_~y~0) 12) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:50:09,994 INFO L290 TraceCheckUtils]: 116: Hoare triple {25907#(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; {25929#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 07:50:09,994 INFO L290 TraceCheckUtils]: 117: Hoare triple {25929#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} assume !false; {25929#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 07:50:09,995 INFO L272 TraceCheckUtils]: 118: Hoare triple {25929#(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)); {25561#true} is VALID [2022-04-08 07:50:09,995 INFO L290 TraceCheckUtils]: 119: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,995 INFO L290 TraceCheckUtils]: 120: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,995 INFO L290 TraceCheckUtils]: 121: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,995 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {25561#true} {25929#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} #54#return; {25929#(and (= (+ main_~c~0 (- 3)) 12) (= (+ main_~y~0 (- 3)) 12))} is VALID [2022-04-08 07:50:09,996 INFO L290 TraceCheckUtils]: 123: Hoare triple {25929#(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; {25951#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:50:09,996 INFO L290 TraceCheckUtils]: 124: Hoare triple {25951#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {25951#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:50:09,996 INFO L272 TraceCheckUtils]: 125: Hoare triple {25951#(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)); {25561#true} is VALID [2022-04-08 07:50:09,996 INFO L290 TraceCheckUtils]: 126: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,996 INFO L290 TraceCheckUtils]: 127: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,996 INFO L290 TraceCheckUtils]: 128: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,997 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {25561#true} {25951#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {25951#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:50:09,997 INFO L290 TraceCheckUtils]: 130: Hoare triple {25951#(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; {25973#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:50:09,997 INFO L290 TraceCheckUtils]: 131: Hoare triple {25973#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {25973#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:50:09,997 INFO L272 TraceCheckUtils]: 132: Hoare triple {25973#(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)); {25561#true} is VALID [2022-04-08 07:50:09,997 INFO L290 TraceCheckUtils]: 133: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,998 INFO L290 TraceCheckUtils]: 134: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,998 INFO L290 TraceCheckUtils]: 135: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,998 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {25561#true} {25973#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {25973#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:50:09,998 INFO L290 TraceCheckUtils]: 137: Hoare triple {25973#(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; {25995#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:50:09,999 INFO L290 TraceCheckUtils]: 138: Hoare triple {25995#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} assume !false; {25995#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:50:09,999 INFO L272 TraceCheckUtils]: 139: Hoare triple {25995#(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)); {25561#true} is VALID [2022-04-08 07:50:09,999 INFO L290 TraceCheckUtils]: 140: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:09,999 INFO L290 TraceCheckUtils]: 141: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:09,999 INFO L290 TraceCheckUtils]: 142: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:09,999 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {25561#true} {25995#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} #54#return; {25995#(and (= main_~c~0 18) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:50:10,000 INFO L290 TraceCheckUtils]: 144: Hoare triple {25995#(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; {26017#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 07:50:10,000 INFO L290 TraceCheckUtils]: 145: Hoare triple {26017#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {26017#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 07:50:10,000 INFO L272 TraceCheckUtils]: 146: Hoare triple {26017#(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)); {25561#true} is VALID [2022-04-08 07:50:10,000 INFO L290 TraceCheckUtils]: 147: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:10,000 INFO L290 TraceCheckUtils]: 148: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:10,001 INFO L290 TraceCheckUtils]: 149: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:10,001 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {25561#true} {26017#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #54#return; {26017#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 07:50:10,001 INFO L290 TraceCheckUtils]: 151: Hoare triple {26017#(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; {26039#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:50:10,002 INFO L290 TraceCheckUtils]: 152: Hoare triple {26039#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} assume !false; {26039#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:50:10,002 INFO L272 TraceCheckUtils]: 153: Hoare triple {26039#(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)); {25561#true} is VALID [2022-04-08 07:50:10,002 INFO L290 TraceCheckUtils]: 154: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:10,002 INFO L290 TraceCheckUtils]: 155: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:10,002 INFO L290 TraceCheckUtils]: 156: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:10,002 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25561#true} {26039#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} #54#return; {26039#(and (= 19 (+ (- 1) main_~y~0)) (= 18 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:50:10,003 INFO L290 TraceCheckUtils]: 158: Hoare triple {26039#(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; {26061#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-08 07:50:10,003 INFO L290 TraceCheckUtils]: 159: Hoare triple {26061#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} assume !false; {26061#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-08 07:50:10,003 INFO L272 TraceCheckUtils]: 160: Hoare triple {26061#(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)); {25561#true} is VALID [2022-04-08 07:50:10,004 INFO L290 TraceCheckUtils]: 161: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:10,004 INFO L290 TraceCheckUtils]: 162: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:10,004 INFO L290 TraceCheckUtils]: 163: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:10,004 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {25561#true} {26061#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} #54#return; {26061#(and (= 19 (+ (- 2) main_~y~0)) (= (+ main_~c~0 (- 3)) 18))} is VALID [2022-04-08 07:50:10,005 INFO L290 TraceCheckUtils]: 165: Hoare triple {26061#(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; {26083#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 07:50:10,005 INFO L290 TraceCheckUtils]: 166: Hoare triple {26083#(and (= main_~y~0 22) (= main_~c~0 22))} assume !false; {26083#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 07:50:10,005 INFO L272 TraceCheckUtils]: 167: Hoare triple {26083#(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)); {25561#true} is VALID [2022-04-08 07:50:10,005 INFO L290 TraceCheckUtils]: 168: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:10,005 INFO L290 TraceCheckUtils]: 169: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:10,005 INFO L290 TraceCheckUtils]: 170: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:10,006 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {25561#true} {26083#(and (= main_~y~0 22) (= main_~c~0 22))} #54#return; {26083#(and (= main_~y~0 22) (= main_~c~0 22))} is VALID [2022-04-08 07:50:10,006 INFO L290 TraceCheckUtils]: 172: Hoare triple {26083#(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; {26105#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:50:10,006 INFO L290 TraceCheckUtils]: 173: Hoare triple {26105#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {26105#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:50:10,006 INFO L272 TraceCheckUtils]: 174: Hoare triple {26105#(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)); {25561#true} is VALID [2022-04-08 07:50:10,007 INFO L290 TraceCheckUtils]: 175: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:10,007 INFO L290 TraceCheckUtils]: 176: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:10,007 INFO L290 TraceCheckUtils]: 177: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:10,007 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {25561#true} {26105#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {26105#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:50:10,008 INFO L290 TraceCheckUtils]: 179: Hoare triple {26105#(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; {26127#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:50:10,008 INFO L290 TraceCheckUtils]: 180: Hoare triple {26127#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !false; {26127#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:50:10,008 INFO L272 TraceCheckUtils]: 181: Hoare triple {26127#(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)); {25561#true} is VALID [2022-04-08 07:50:10,009 INFO L290 TraceCheckUtils]: 182: Hoare triple {25561#true} ~cond := #in~cond; {26137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:50:10,009 INFO L290 TraceCheckUtils]: 183: Hoare triple {26137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:50:10,009 INFO L290 TraceCheckUtils]: 184: Hoare triple {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:50:10,010 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} {26127#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} #54#return; {26148#(and (= main_~y~0 24) (= (+ (* 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)) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:50:10,012 INFO L290 TraceCheckUtils]: 186: Hoare triple {26148#(and (= main_~y~0 24) (= (+ (* 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)) (= 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; {26152#(and (= main_~y~0 25) (= main_~c~0 25) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0))} is VALID [2022-04-08 07:50:10,012 INFO L290 TraceCheckUtils]: 187: Hoare triple {26152#(and (= main_~y~0 25) (= main_~c~0 25) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0))} assume !false; {26152#(and (= main_~y~0 25) (= main_~c~0 25) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0))} is VALID [2022-04-08 07:50:10,012 INFO L272 TraceCheckUtils]: 188: Hoare triple {26152#(and (= main_~y~0 25) (= main_~c~0 25) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25561#true} is VALID [2022-04-08 07:50:10,012 INFO L290 TraceCheckUtils]: 189: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:10,012 INFO L290 TraceCheckUtils]: 190: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:10,012 INFO L290 TraceCheckUtils]: 191: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:10,013 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {25561#true} {26152#(and (= main_~y~0 25) (= main_~c~0 25) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0))} #54#return; {26152#(and (= main_~y~0 25) (= main_~c~0 25) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0))} is VALID [2022-04-08 07:50:10,014 INFO L290 TraceCheckUtils]: 193: Hoare triple {26152#(and (= main_~y~0 25) (= main_~c~0 25) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4))) main_~x~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {26174#(and (= main_~c~0 26) (<= (+ 105625 (* main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 26))} is VALID [2022-04-08 07:50:10,015 INFO L290 TraceCheckUtils]: 194: Hoare triple {26174#(and (= main_~c~0 26) (<= (+ 105625 (* main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 26))} assume !false; {26174#(and (= main_~c~0 26) (<= (+ 105625 (* main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 26))} is VALID [2022-04-08 07:50:10,015 INFO L272 TraceCheckUtils]: 195: Hoare triple {26174#(and (= main_~c~0 26) (<= (+ 105625 (* main_~y~0 main_~y~0 main_~y~0)) main_~x~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)); {25561#true} is VALID [2022-04-08 07:50:10,015 INFO L290 TraceCheckUtils]: 196: Hoare triple {25561#true} ~cond := #in~cond; {26137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:50:10,015 INFO L290 TraceCheckUtils]: 197: Hoare triple {26137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:50:10,016 INFO L290 TraceCheckUtils]: 198: Hoare triple {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:50:10,017 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} {26174#(and (= main_~c~0 26) (<= (+ 105625 (* main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 26))} #54#return; {26193#(and (= main_~c~0 26) (= (+ (* 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)) (= main_~y~0 26))} is VALID [2022-04-08 07:50:10,018 INFO L290 TraceCheckUtils]: 200: Hoare triple {26193#(and (= main_~c~0 26) (= (+ (* 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)) (= 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; {26197#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4))) (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 07:50:10,018 INFO L290 TraceCheckUtils]: 201: Hoare triple {26197#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4))) (= main_~y~0 27) (= main_~c~0 27))} assume !false; {26197#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4))) (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 07:50:10,018 INFO L272 TraceCheckUtils]: 202: Hoare triple {26197#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4))) (= main_~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)); {25561#true} is VALID [2022-04-08 07:50:10,019 INFO L290 TraceCheckUtils]: 203: Hoare triple {25561#true} ~cond := #in~cond; {25561#true} is VALID [2022-04-08 07:50:10,019 INFO L290 TraceCheckUtils]: 204: Hoare triple {25561#true} assume !(0 == ~cond); {25561#true} is VALID [2022-04-08 07:50:10,019 INFO L290 TraceCheckUtils]: 205: Hoare triple {25561#true} assume true; {25561#true} is VALID [2022-04-08 07:50:10,019 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {25561#true} {26197#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4))) (= main_~y~0 27) (= main_~c~0 27))} #54#return; {26197#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4))) (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 07:50:10,020 INFO L290 TraceCheckUtils]: 207: Hoare triple {26197#(and (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 2) main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) 4))) (= main_~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; {26219#(and (<= (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1) (+ (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2) (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 (- 12)) (* main_~y~0 main_~y~0 13) 4 (* main_~y~0 main_~y~0 main_~y~0 (- 6))) 4))) (<= main_~c~0 28) (< 27 main_~k~0) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 07:50:10,021 INFO L290 TraceCheckUtils]: 208: Hoare triple {26219#(and (<= (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1) (+ (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2) (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 (- 12)) (* main_~y~0 main_~y~0 13) 4 (* main_~y~0 main_~y~0 main_~y~0 (- 6))) 4))) (<= main_~c~0 28) (< 27 main_~k~0) (= (+ (- 1) main_~y~0) 27))} assume !false; {26219#(and (<= (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1) (+ (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2) (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 (- 12)) (* main_~y~0 main_~y~0 13) 4 (* main_~y~0 main_~y~0 main_~y~0 (- 6))) 4))) (<= main_~c~0 28) (< 27 main_~k~0) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 07:50:10,021 INFO L272 TraceCheckUtils]: 209: Hoare triple {26219#(and (<= (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1) (+ (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2) (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 (- 12)) (* main_~y~0 main_~y~0 13) 4 (* main_~y~0 main_~y~0 main_~y~0 (- 6))) 4))) (<= main_~c~0 28) (< 27 main_~k~0) (= (+ (- 1) main_~y~0) 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {25561#true} is VALID [2022-04-08 07:50:10,022 INFO L290 TraceCheckUtils]: 210: Hoare triple {25561#true} ~cond := #in~cond; {26137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:50:10,022 INFO L290 TraceCheckUtils]: 211: Hoare triple {26137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:50:10,022 INFO L290 TraceCheckUtils]: 212: Hoare triple {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:50:10,023 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {26141#(not (= |__VERIFIER_assert_#in~cond| 0))} {26219#(and (<= (+ (* 3 (* main_~y~0 main_~y~0)) main_~x~0 1) (+ (* main_~y~0 3) (* (* main_~y~0 main_~y~0 main_~y~0) 2) (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 (- 12)) (* main_~y~0 main_~y~0 13) 4 (* main_~y~0 main_~y~0 main_~y~0 (- 6))) 4))) (<= main_~c~0 28) (< 27 main_~k~0) (= (+ (- 1) main_~y~0) 27))} #54#return; {26238#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-08 07:50:10,024 INFO L290 TraceCheckUtils]: 214: Hoare triple {26238#(and (<= main_~c~0 28) (< 27 main_~k~0) (= main_~y~0 28))} assume !(~c~0 < ~k~0); {26242#(and (<= main_~k~0 28) (< 27 main_~k~0) (= main_~y~0 28))} is VALID [2022-04-08 07:50:10,024 INFO L272 TraceCheckUtils]: 215: Hoare triple {26242#(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)); {26246#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:50:10,025 INFO L290 TraceCheckUtils]: 216: Hoare triple {26246#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26250#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:50:10,025 INFO L290 TraceCheckUtils]: 217: Hoare triple {26250#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25562#false} is VALID [2022-04-08 07:50:10,025 INFO L290 TraceCheckUtils]: 218: Hoare triple {25562#false} assume !false; {25562#false} is VALID [2022-04-08 07:50:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2900 backedges. 280 proven. 1230 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2022-04-08 07:50:10,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:50:58,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:50:58,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5418880] [2022-04-08 07:50:58,224 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:50:58,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171228096] [2022-04-08 07:50:58,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171228096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:50:58,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:50:58,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2022-04-08 07:50:58,224 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:50:58,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1797860414] [2022-04-08 07:50:58,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1797860414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:50:58,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:50:58,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-08 07:50:58,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896560697] [2022-04-08 07:50:58,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:50:58,225 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 35 states have internal predecessors, (74), 31 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) Word has length 219 [2022-04-08 07:50:58,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:50:58,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 35 states have internal predecessors, (74), 31 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-08 07:50:58,485 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 07:50:58,485 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-08 07:50:58,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:50:58,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-08 07:50:58,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1745, Unknown=12, NotChecked=0, Total=1892 [2022-04-08 07:50:58,487 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 35 states have internal predecessors, (74), 31 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-08 07:51:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:51:11,871 INFO L93 Difference]: Finished difference Result 120 states and 148 transitions. [2022-04-08 07:51:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 07:51:11,871 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 35 states have internal predecessors, (74), 31 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) Word has length 219 [2022-04-08 07:51:11,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:51:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 35 states have internal predecessors, (74), 31 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-08 07:51:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 144 transitions. [2022-04-08 07:51:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 35 states have internal predecessors, (74), 31 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-08 07:51:11,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 144 transitions. [2022-04-08 07:51:11,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 144 transitions. [2022-04-08 07:51:12,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:51:12,195 INFO L225 Difference]: With dead ends: 120 [2022-04-08 07:51:12,195 INFO L226 Difference]: Without dead ends: 115 [2022-04-08 07:51:12,196 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=156, Invalid=1994, Unknown=12, NotChecked=0, Total=2162 [2022-04-08 07:51:12,196 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 9 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 3321 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:51:12,197 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1514 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3321 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-04-08 07:51:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-08 07:51:12,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-08 07:51:12,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:51:12,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 07:51:12,344 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 07:51:12,349 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 07:51:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:51:12,352 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-04-08 07:51:12,352 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2022-04-08 07:51:12,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:51:12,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:51:12,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 115 states. [2022-04-08 07:51:12,353 INFO L87 Difference]: Start difference. First operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 115 states. [2022-04-08 07:51:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:51:12,355 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-04-08 07:51:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2022-04-08 07:51:12,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:51:12,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:51:12,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:51:12,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:51:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 34 states have call successors, (34), 6 states have call predecessors, (34), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 07:51:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 143 transitions. [2022-04-08 07:51:12,357 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 143 transitions. Word has length 219 [2022-04-08 07:51:12,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:51:12,357 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 143 transitions. [2022-04-08 07:51:12,358 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 35 states have internal predecessors, (74), 31 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-04-08 07:51:12,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 143 transitions. [2022-04-08 07:51:13,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:51:13,207 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2022-04-08 07:51:13,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-04-08 07:51:13,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:51:13,208 INFO L499 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:51:13,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-08 07:51:13,408 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 07:51:13,409 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:51:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:51:13,409 INFO L85 PathProgramCache]: Analyzing trace with hash 963111432, now seen corresponding path program 57 times [2022-04-08 07:51:13,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:51:13,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2027462275] [2022-04-08 07:51:13,480 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:51:13,480 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:51:13,480 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:51:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash 963111432, now seen corresponding path program 58 times [2022-04-08 07:51:13,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:51:13,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631216813] [2022-04-08 07:51:13,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:51:13,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:51:13,495 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:51:13,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [953926938] [2022-04-08 07:51:13,495 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:51:13,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:51:13,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:51:13,497 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 07:51:13,498 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 07:51:14,311 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:51:14,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:51:14,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 124 conjunts are in the unsatisfiable core [2022-04-08 07:51:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:51:14,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:51:15,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {27006#true} call ULTIMATE.init(); {27006#true} is VALID [2022-04-08 07:51:15,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {27006#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); {27006#true} is VALID [2022-04-08 07:51:15,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27006#true} {27006#true} #60#return; {27006#true} is VALID [2022-04-08 07:51:15,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {27006#true} call #t~ret5 := main(); {27006#true} is VALID [2022-04-08 07:51:15,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {27006#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; {27006#true} is VALID [2022-04-08 07:51:15,455 INFO L272 TraceCheckUtils]: 6: Hoare triple {27006#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {27006#true} is VALID [2022-04-08 07:51:15,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,455 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27006#true} {27006#true} #52#return; {27006#true} is VALID [2022-04-08 07:51:15,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {27006#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {27044#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:51:15,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {27044#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {27044#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:51:15,456 INFO L272 TraceCheckUtils]: 13: Hoare triple {27044#(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)); {27006#true} is VALID [2022-04-08 07:51:15,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,457 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27006#true} {27044#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {27044#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:51:15,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {27044#(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; {27066#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:51:15,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {27066#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {27066#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:51:15,457 INFO L272 TraceCheckUtils]: 20: Hoare triple {27066#(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)); {27006#true} is VALID [2022-04-08 07:51:15,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,458 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {27006#true} {27066#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {27066#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:51:15,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {27066#(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; {27088#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:51:15,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {27088#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {27088#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:51:15,459 INFO L272 TraceCheckUtils]: 27: Hoare triple {27088#(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)); {27006#true} is VALID [2022-04-08 07:51:15,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,459 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {27006#true} {27088#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {27088#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:51:15,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {27088#(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; {27110#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:51:15,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {27110#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {27110#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:51:15,460 INFO L272 TraceCheckUtils]: 34: Hoare triple {27110#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27006#true} is VALID [2022-04-08 07:51:15,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,461 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {27006#true} {27110#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {27110#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:51:15,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {27110#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27132#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:15,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {27132#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {27132#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:15,461 INFO L272 TraceCheckUtils]: 41: Hoare triple {27132#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27006#true} is VALID [2022-04-08 07:51:15,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,462 INFO L290 TraceCheckUtils]: 43: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,462 INFO L290 TraceCheckUtils]: 44: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,462 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {27006#true} {27132#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #54#return; {27132#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:15,462 INFO L290 TraceCheckUtils]: 46: Hoare triple {27132#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27154#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 07:51:15,463 INFO L290 TraceCheckUtils]: 47: Hoare triple {27154#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {27154#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 07:51:15,463 INFO L272 TraceCheckUtils]: 48: Hoare triple {27154#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27006#true} is VALID [2022-04-08 07:51:15,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,463 INFO L290 TraceCheckUtils]: 50: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,463 INFO L290 TraceCheckUtils]: 51: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,463 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {27006#true} {27154#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #54#return; {27154#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 07:51:15,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {27154#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27176#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:51:15,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {27176#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {27176#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:51:15,464 INFO L272 TraceCheckUtils]: 55: Hoare triple {27176#(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)); {27006#true} is VALID [2022-04-08 07:51:15,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,464 INFO L290 TraceCheckUtils]: 58: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,465 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {27006#true} {27176#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {27176#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:51:15,465 INFO L290 TraceCheckUtils]: 60: Hoare triple {27176#(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; {27198#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:15,465 INFO L290 TraceCheckUtils]: 61: Hoare triple {27198#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {27198#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:15,465 INFO L272 TraceCheckUtils]: 62: Hoare triple {27198#(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)); {27006#true} is VALID [2022-04-08 07:51:15,466 INFO L290 TraceCheckUtils]: 63: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,466 INFO L290 TraceCheckUtils]: 64: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,466 INFO L290 TraceCheckUtils]: 65: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,466 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27006#true} {27198#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #54#return; {27198#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:15,466 INFO L290 TraceCheckUtils]: 67: Hoare triple {27198#(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; {27220#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:51:15,467 INFO L290 TraceCheckUtils]: 68: Hoare triple {27220#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {27220#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:51:15,467 INFO L272 TraceCheckUtils]: 69: Hoare triple {27220#(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)); {27006#true} is VALID [2022-04-08 07:51:15,467 INFO L290 TraceCheckUtils]: 70: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,467 INFO L290 TraceCheckUtils]: 71: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,467 INFO L290 TraceCheckUtils]: 72: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,467 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {27006#true} {27220#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {27220#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:51:15,468 INFO L290 TraceCheckUtils]: 74: Hoare triple {27220#(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; {27242#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 07:51:15,468 INFO L290 TraceCheckUtils]: 75: Hoare triple {27242#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} assume !false; {27242#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 07:51:15,468 INFO L272 TraceCheckUtils]: 76: Hoare triple {27242#(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)); {27006#true} is VALID [2022-04-08 07:51:15,468 INFO L290 TraceCheckUtils]: 77: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,468 INFO L290 TraceCheckUtils]: 78: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,468 INFO L290 TraceCheckUtils]: 79: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,469 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27006#true} {27242#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} #54#return; {27242#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 07:51:15,471 INFO L290 TraceCheckUtils]: 81: Hoare triple {27242#(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; {27264#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:51:15,472 INFO L290 TraceCheckUtils]: 82: Hoare triple {27264#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !false; {27264#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:51:15,472 INFO L272 TraceCheckUtils]: 83: Hoare triple {27264#(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)); {27006#true} is VALID [2022-04-08 07:51:15,472 INFO L290 TraceCheckUtils]: 84: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,472 INFO L290 TraceCheckUtils]: 85: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,472 INFO L290 TraceCheckUtils]: 86: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,472 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {27006#true} {27264#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #54#return; {27264#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:51:15,473 INFO L290 TraceCheckUtils]: 88: Hoare triple {27264#(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; {27286#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:51:15,473 INFO L290 TraceCheckUtils]: 89: Hoare triple {27286#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {27286#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:51:15,473 INFO L272 TraceCheckUtils]: 90: Hoare triple {27286#(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)); {27006#true} is VALID [2022-04-08 07:51:15,473 INFO L290 TraceCheckUtils]: 91: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,473 INFO L290 TraceCheckUtils]: 92: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,473 INFO L290 TraceCheckUtils]: 93: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,474 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27006#true} {27286#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {27286#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:51:15,474 INFO L290 TraceCheckUtils]: 95: Hoare triple {27286#(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; {27308#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:51:15,474 INFO L290 TraceCheckUtils]: 96: Hoare triple {27308#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !false; {27308#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:51:15,474 INFO L272 TraceCheckUtils]: 97: Hoare triple {27308#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27006#true} is VALID [2022-04-08 07:51:15,475 INFO L290 TraceCheckUtils]: 98: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,475 INFO L290 TraceCheckUtils]: 99: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,475 INFO L290 TraceCheckUtils]: 100: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,475 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {27006#true} {27308#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #54#return; {27308#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 07:51:15,475 INFO L290 TraceCheckUtils]: 102: Hoare triple {27308#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27330#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 07:51:15,476 INFO L290 TraceCheckUtils]: 103: Hoare triple {27330#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} assume !false; {27330#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 07:51:15,476 INFO L272 TraceCheckUtils]: 104: Hoare triple {27330#(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)); {27006#true} is VALID [2022-04-08 07:51:15,476 INFO L290 TraceCheckUtils]: 105: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,476 INFO L290 TraceCheckUtils]: 106: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,476 INFO L290 TraceCheckUtils]: 107: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,476 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {27006#true} {27330#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} #54#return; {27330#(and (= 11 (+ (- 2) main_~c~0)) (= main_~y~0 13))} is VALID [2022-04-08 07:51:15,477 INFO L290 TraceCheckUtils]: 109: Hoare triple {27330#(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; {27352#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 07:51:15,477 INFO L290 TraceCheckUtils]: 110: Hoare triple {27352#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} assume !false; {27352#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 07:51:15,477 INFO L272 TraceCheckUtils]: 111: Hoare triple {27352#(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)); {27006#true} is VALID [2022-04-08 07:51:15,477 INFO L290 TraceCheckUtils]: 112: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,477 INFO L290 TraceCheckUtils]: 113: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,477 INFO L290 TraceCheckUtils]: 114: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,478 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {27006#true} {27352#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} #54#return; {27352#(and (= main_~y~0 14) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 07:51:15,478 INFO L290 TraceCheckUtils]: 116: Hoare triple {27352#(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; {27374#(and (= 11 (+ main_~c~0 (- 4))) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:15,478 INFO L290 TraceCheckUtils]: 117: Hoare triple {27374#(and (= 11 (+ main_~c~0 (- 4))) (= 14 (+ (- 1) main_~y~0)))} assume !false; {27374#(and (= 11 (+ main_~c~0 (- 4))) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:15,479 INFO L272 TraceCheckUtils]: 118: Hoare triple {27374#(and (= 11 (+ main_~c~0 (- 4))) (= 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)); {27006#true} is VALID [2022-04-08 07:51:15,479 INFO L290 TraceCheckUtils]: 119: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,479 INFO L290 TraceCheckUtils]: 120: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,479 INFO L290 TraceCheckUtils]: 121: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,479 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {27006#true} {27374#(and (= 11 (+ main_~c~0 (- 4))) (= 14 (+ (- 1) main_~y~0)))} #54#return; {27374#(and (= 11 (+ main_~c~0 (- 4))) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:15,479 INFO L290 TraceCheckUtils]: 123: Hoare triple {27374#(and (= 11 (+ main_~c~0 (- 4))) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27396#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:51:15,481 INFO L290 TraceCheckUtils]: 124: Hoare triple {27396#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {27396#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:51:15,481 INFO L272 TraceCheckUtils]: 125: Hoare triple {27396#(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)); {27006#true} is VALID [2022-04-08 07:51:15,481 INFO L290 TraceCheckUtils]: 126: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,481 INFO L290 TraceCheckUtils]: 127: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,481 INFO L290 TraceCheckUtils]: 128: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,482 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {27006#true} {27396#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {27396#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:51:15,482 INFO L290 TraceCheckUtils]: 130: Hoare triple {27396#(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; {27418#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:51:15,482 INFO L290 TraceCheckUtils]: 131: Hoare triple {27418#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {27418#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:51:15,482 INFO L272 TraceCheckUtils]: 132: Hoare triple {27418#(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)); {27006#true} is VALID [2022-04-08 07:51:15,482 INFO L290 TraceCheckUtils]: 133: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,482 INFO L290 TraceCheckUtils]: 134: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,482 INFO L290 TraceCheckUtils]: 135: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,483 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {27006#true} {27418#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {27418#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:51:15,483 INFO L290 TraceCheckUtils]: 137: Hoare triple {27418#(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; {27440#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:51:15,483 INFO L290 TraceCheckUtils]: 138: Hoare triple {27440#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {27440#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:51:15,484 INFO L272 TraceCheckUtils]: 139: Hoare triple {27440#(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)); {27006#true} is VALID [2022-04-08 07:51:15,484 INFO L290 TraceCheckUtils]: 140: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,484 INFO L290 TraceCheckUtils]: 141: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,484 INFO L290 TraceCheckUtils]: 142: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,484 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {27006#true} {27440#(and (= main_~c~0 18) (= main_~y~0 18))} #54#return; {27440#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:51:15,485 INFO L290 TraceCheckUtils]: 144: Hoare triple {27440#(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; {27462#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 07:51:15,485 INFO L290 TraceCheckUtils]: 145: Hoare triple {27462#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {27462#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 07:51:15,485 INFO L272 TraceCheckUtils]: 146: Hoare triple {27462#(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)); {27006#true} is VALID [2022-04-08 07:51:15,485 INFO L290 TraceCheckUtils]: 147: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,485 INFO L290 TraceCheckUtils]: 148: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,485 INFO L290 TraceCheckUtils]: 149: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,485 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {27006#true} {27462#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #54#return; {27462#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 07:51:15,486 INFO L290 TraceCheckUtils]: 151: Hoare triple {27462#(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; {27484#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 07:51:15,486 INFO L290 TraceCheckUtils]: 152: Hoare triple {27484#(and (= main_~c~0 20) (= main_~y~0 20))} assume !false; {27484#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 07:51:15,486 INFO L272 TraceCheckUtils]: 153: Hoare triple {27484#(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)); {27006#true} is VALID [2022-04-08 07:51:15,486 INFO L290 TraceCheckUtils]: 154: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,486 INFO L290 TraceCheckUtils]: 155: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,486 INFO L290 TraceCheckUtils]: 156: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,487 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {27006#true} {27484#(and (= main_~c~0 20) (= main_~y~0 20))} #54#return; {27484#(and (= main_~c~0 20) (= main_~y~0 20))} is VALID [2022-04-08 07:51:15,487 INFO L290 TraceCheckUtils]: 158: Hoare triple {27484#(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; {27506#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:15,487 INFO L290 TraceCheckUtils]: 159: Hoare triple {27506#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)))} assume !false; {27506#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:15,488 INFO L272 TraceCheckUtils]: 160: Hoare triple {27506#(and (= (+ (- 1) main_~c~0) 20) (= 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)); {27006#true} is VALID [2022-04-08 07:51:15,488 INFO L290 TraceCheckUtils]: 161: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,488 INFO L290 TraceCheckUtils]: 162: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,488 INFO L290 TraceCheckUtils]: 163: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,488 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {27006#true} {27506#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)))} #54#return; {27506#(and (= (+ (- 1) main_~c~0) 20) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:15,489 INFO L290 TraceCheckUtils]: 165: Hoare triple {27506#(and (= (+ (- 1) main_~c~0) 20) (= 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; {27528#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 07:51:15,489 INFO L290 TraceCheckUtils]: 166: Hoare triple {27528#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} assume !false; {27528#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 07:51:15,489 INFO L272 TraceCheckUtils]: 167: Hoare triple {27528#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27006#true} is VALID [2022-04-08 07:51:15,489 INFO L290 TraceCheckUtils]: 168: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,489 INFO L290 TraceCheckUtils]: 169: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,489 INFO L290 TraceCheckUtils]: 170: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,489 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {27006#true} {27528#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} #54#return; {27528#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} is VALID [2022-04-08 07:51:15,490 INFO L290 TraceCheckUtils]: 172: Hoare triple {27528#(and (= main_~c~0 22) (= (+ (- 2) main_~y~0) 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {27550#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} is VALID [2022-04-08 07:51:15,490 INFO L290 TraceCheckUtils]: 173: Hoare triple {27550#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} assume !false; {27550#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} is VALID [2022-04-08 07:51:15,490 INFO L272 TraceCheckUtils]: 174: Hoare triple {27550#(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)); {27006#true} is VALID [2022-04-08 07:51:15,490 INFO L290 TraceCheckUtils]: 175: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,490 INFO L290 TraceCheckUtils]: 176: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,490 INFO L290 TraceCheckUtils]: 177: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,491 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {27006#true} {27550#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} #54#return; {27550#(and (= (+ main_~y~0 (- 3)) 20) (= 23 main_~c~0))} is VALID [2022-04-08 07:51:15,491 INFO L290 TraceCheckUtils]: 179: Hoare triple {27550#(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; {27572#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} is VALID [2022-04-08 07:51:15,492 INFO L290 TraceCheckUtils]: 180: Hoare triple {27572#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} assume !false; {27572#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} is VALID [2022-04-08 07:51:15,492 INFO L272 TraceCheckUtils]: 181: Hoare triple {27572#(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)); {27006#true} is VALID [2022-04-08 07:51:15,492 INFO L290 TraceCheckUtils]: 182: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,492 INFO L290 TraceCheckUtils]: 183: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,492 INFO L290 TraceCheckUtils]: 184: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,492 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {27006#true} {27572#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} #54#return; {27572#(and (= main_~c~0 24) (= (+ main_~y~0 (- 4)) 20))} is VALID [2022-04-08 07:51:15,493 INFO L290 TraceCheckUtils]: 186: Hoare triple {27572#(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; {27594#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 07:51:15,493 INFO L290 TraceCheckUtils]: 187: Hoare triple {27594#(and (= main_~y~0 25) (= main_~c~0 25))} assume !false; {27594#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 07:51:15,493 INFO L272 TraceCheckUtils]: 188: Hoare triple {27594#(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)); {27006#true} is VALID [2022-04-08 07:51:15,493 INFO L290 TraceCheckUtils]: 189: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,493 INFO L290 TraceCheckUtils]: 190: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,493 INFO L290 TraceCheckUtils]: 191: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,493 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {27006#true} {27594#(and (= main_~y~0 25) (= main_~c~0 25))} #54#return; {27594#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 07:51:15,494 INFO L290 TraceCheckUtils]: 193: Hoare triple {27594#(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; {27616#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 07:51:15,494 INFO L290 TraceCheckUtils]: 194: Hoare triple {27616#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} assume !false; {27616#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 07:51:15,494 INFO L272 TraceCheckUtils]: 195: Hoare triple {27616#(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)); {27006#true} is VALID [2022-04-08 07:51:15,494 INFO L290 TraceCheckUtils]: 196: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,494 INFO L290 TraceCheckUtils]: 197: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,494 INFO L290 TraceCheckUtils]: 198: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,495 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {27006#true} {27616#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} #54#return; {27616#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 07:51:15,495 INFO L290 TraceCheckUtils]: 200: Hoare triple {27616#(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; {27638#(and (= 25 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-08 07:51:15,496 INFO L290 TraceCheckUtils]: 201: Hoare triple {27638#(and (= 25 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 25))} assume !false; {27638#(and (= 25 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-08 07:51:15,497 INFO L272 TraceCheckUtils]: 202: Hoare triple {27638#(and (= 25 (+ (- 2) main_~c~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)); {27006#true} is VALID [2022-04-08 07:51:15,497 INFO L290 TraceCheckUtils]: 203: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,497 INFO L290 TraceCheckUtils]: 204: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,497 INFO L290 TraceCheckUtils]: 205: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,497 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {27006#true} {27638#(and (= 25 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 25))} #54#return; {27638#(and (= 25 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-08 07:51:15,497 INFO L290 TraceCheckUtils]: 207: Hoare triple {27638#(and (= 25 (+ (- 2) main_~c~0)) (= (+ (- 2) 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; {27660#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-08 07:51:15,498 INFO L290 TraceCheckUtils]: 208: Hoare triple {27660#(and (= main_~c~0 28) (= main_~y~0 28))} assume !false; {27660#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-08 07:51:15,498 INFO L272 TraceCheckUtils]: 209: Hoare triple {27660#(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)); {27006#true} is VALID [2022-04-08 07:51:15,498 INFO L290 TraceCheckUtils]: 210: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,498 INFO L290 TraceCheckUtils]: 211: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,498 INFO L290 TraceCheckUtils]: 212: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,498 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {27006#true} {27660#(and (= main_~c~0 28) (= main_~y~0 28))} #54#return; {27660#(and (= main_~c~0 28) (= main_~y~0 28))} is VALID [2022-04-08 07:51:15,499 INFO L290 TraceCheckUtils]: 214: Hoare triple {27660#(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; {27682#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:15,499 INFO L290 TraceCheckUtils]: 215: Hoare triple {27682#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} assume !false; {27682#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:15,499 INFO L272 TraceCheckUtils]: 216: Hoare triple {27682#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27006#true} is VALID [2022-04-08 07:51:15,499 INFO L290 TraceCheckUtils]: 217: Hoare triple {27006#true} ~cond := #in~cond; {27006#true} is VALID [2022-04-08 07:51:15,499 INFO L290 TraceCheckUtils]: 218: Hoare triple {27006#true} assume !(0 == ~cond); {27006#true} is VALID [2022-04-08 07:51:15,499 INFO L290 TraceCheckUtils]: 219: Hoare triple {27006#true} assume true; {27006#true} is VALID [2022-04-08 07:51:15,500 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {27006#true} {27682#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} #54#return; {27682#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:15,500 INFO L290 TraceCheckUtils]: 221: Hoare triple {27682#(and (< 28 main_~k~0) (<= main_~c~0 29) (= 28 (+ (- 1) main_~y~0)))} assume !(~c~0 < ~k~0); {27704#(and (< 28 main_~k~0) (= 28 (+ (- 1) main_~y~0)) (<= main_~k~0 29))} is VALID [2022-04-08 07:51:15,501 INFO L272 TraceCheckUtils]: 222: Hoare triple {27704#(and (< 28 main_~k~0) (= 28 (+ (- 1) main_~y~0)) (<= main_~k~0 29))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27708#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:51:15,501 INFO L290 TraceCheckUtils]: 223: Hoare triple {27708#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27712#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:51:15,501 INFO L290 TraceCheckUtils]: 224: Hoare triple {27712#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27007#false} is VALID [2022-04-08 07:51:15,501 INFO L290 TraceCheckUtils]: 225: Hoare triple {27007#false} assume !false; {27007#false} is VALID [2022-04-08 07:51:15,503 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 07:51:15,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:51:15,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:51:15,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631216813] [2022-04-08 07:51:15,878 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:51:15,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953926938] [2022-04-08 07:51:15,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953926938] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:51:15,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:51:15,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2022-04-08 07:51:15,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:51:15,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2027462275] [2022-04-08 07:51:15,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2027462275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:51:15,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:51:15,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-08 07:51:15,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663097136] [2022-04-08 07:51:15,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:51:15,886 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) Word has length 226 [2022-04-08 07:51:15,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:51:15,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-04-08 07:51:16,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:51:16,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-08 07:51:16,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:51:16,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-08 07:51:16,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 07:51:16,183 INFO L87 Difference]: Start difference. First operand 115 states and 143 transitions. Second operand has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-04-08 07:51:30,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:51:30,504 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2022-04-08 07:51:30,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 07:51:30,504 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) Word has length 226 [2022-04-08 07:51:30,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:51:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-04-08 07:51:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 148 transitions. [2022-04-08 07:51:30,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-04-08 07:51:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 148 transitions. [2022-04-08 07:51:30,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 148 transitions. [2022-04-08 07:51:30,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:51:30,916 INFO L225 Difference]: With dead ends: 123 [2022-04-08 07:51:30,916 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 07:51:30,917 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 07:51:30,917 INFO L913 BasicCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 3047 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 3047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-08 07:51:30,917 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1655 Invalid, 3047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3047 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-04-08 07:51:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 07:51:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-08 07:51:31,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:51:31,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 07:51:31,060 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 07:51:31,060 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 07:51:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:51:31,062 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-08 07:51:31,062 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2022-04-08 07:51:31,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:51:31,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:51:31,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 118 states. [2022-04-08 07:51:31,063 INFO L87 Difference]: Start difference. First operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 118 states. [2022-04-08 07:51:31,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:51:31,065 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-08 07:51:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2022-04-08 07:51:31,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:51:31,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:51:31,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:51:31,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:51:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 35 states have call successors, (35), 6 states have call predecessors, (35), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 07:51:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2022-04-08 07:51:31,067 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 226 [2022-04-08 07:51:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:51:31,067 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2022-04-08 07:51:31,068 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 32 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-04-08 07:51:31,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 147 transitions. [2022-04-08 07:51:31,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:51:31,951 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2022-04-08 07:51:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-04-08 07:51:31,952 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:51:31,952 INFO L499 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:51:31,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-08 07:51:32,152 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 07:51:32,152 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:51:32,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:51:32,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1527648759, now seen corresponding path program 59 times [2022-04-08 07:51:32,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:51:32,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2083730952] [2022-04-08 07:51:32,216 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:51:32,216 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:51:32,216 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:51:32,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1527648759, now seen corresponding path program 60 times [2022-04-08 07:51:32,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:51:32,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326835935] [2022-04-08 07:51:32,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:51:32,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:51:32,230 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:51:32,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1618398373] [2022-04-08 07:51:32,231 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:51:32,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:51:32,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:51:32,231 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 07:51:32,232 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 07:51:46,555 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-08 07:51:46,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:51:46,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 128 conjunts are in the unsatisfiable core [2022-04-08 07:51:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:51:46,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:51:47,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {28482#true} call ULTIMATE.init(); {28482#true} is VALID [2022-04-08 07:51:47,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {28482#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); {28482#true} is VALID [2022-04-08 07:51:47,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28482#true} {28482#true} #60#return; {28482#true} is VALID [2022-04-08 07:51:47,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {28482#true} call #t~ret5 := main(); {28482#true} is VALID [2022-04-08 07:51:47,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {28482#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; {28482#true} is VALID [2022-04-08 07:51:47,767 INFO L272 TraceCheckUtils]: 6: Hoare triple {28482#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {28482#true} is VALID [2022-04-08 07:51:47,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,768 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28482#true} {28482#true} #52#return; {28482#true} is VALID [2022-04-08 07:51:47,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {28482#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {28520#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:51:47,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {28520#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {28520#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:51:47,768 INFO L272 TraceCheckUtils]: 13: Hoare triple {28520#(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)); {28482#true} is VALID [2022-04-08 07:51:47,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,769 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {28482#true} {28520#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {28520#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:51:47,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {28520#(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; {28542#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:51:47,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {28542#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {28542#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:51:47,770 INFO L272 TraceCheckUtils]: 20: Hoare triple {28542#(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)); {28482#true} is VALID [2022-04-08 07:51:47,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,770 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {28482#true} {28542#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {28542#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:51:47,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {28542#(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; {28564#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:51:47,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {28564#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {28564#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:51:47,771 INFO L272 TraceCheckUtils]: 27: Hoare triple {28564#(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)); {28482#true} is VALID [2022-04-08 07:51:47,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,772 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28482#true} {28564#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {28564#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:51:47,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {28564#(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; {28586#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 07:51:47,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {28586#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {28586#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 07:51:47,772 INFO L272 TraceCheckUtils]: 34: Hoare triple {28586#(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)); {28482#true} is VALID [2022-04-08 07:51:47,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,773 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {28482#true} {28586#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #54#return; {28586#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 07:51:47,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {28586#(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; {28608#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:51:47,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {28608#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {28608#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:51:47,774 INFO L272 TraceCheckUtils]: 41: Hoare triple {28608#(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)); {28482#true} is VALID [2022-04-08 07:51:47,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,774 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {28482#true} {28608#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {28608#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:51:47,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {28608#(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; {28630#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:51:47,775 INFO L290 TraceCheckUtils]: 47: Hoare triple {28630#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {28630#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:51:47,775 INFO L272 TraceCheckUtils]: 48: Hoare triple {28630#(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)); {28482#true} is VALID [2022-04-08 07:51:47,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,775 INFO L290 TraceCheckUtils]: 50: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,775 INFO L290 TraceCheckUtils]: 51: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,776 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {28482#true} {28630#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #54#return; {28630#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:51:47,776 INFO L290 TraceCheckUtils]: 53: Hoare triple {28630#(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; {28652#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:51:47,776 INFO L290 TraceCheckUtils]: 54: Hoare triple {28652#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {28652#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:51:47,776 INFO L272 TraceCheckUtils]: 55: Hoare triple {28652#(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)); {28482#true} is VALID [2022-04-08 07:51:47,776 INFO L290 TraceCheckUtils]: 56: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,776 INFO L290 TraceCheckUtils]: 57: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,777 INFO L290 TraceCheckUtils]: 58: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,777 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {28482#true} {28652#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {28652#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:51:47,777 INFO L290 TraceCheckUtils]: 60: Hoare triple {28652#(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; {28674#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:47,778 INFO L290 TraceCheckUtils]: 61: Hoare triple {28674#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {28674#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:47,778 INFO L272 TraceCheckUtils]: 62: Hoare triple {28674#(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)); {28482#true} is VALID [2022-04-08 07:51:47,778 INFO L290 TraceCheckUtils]: 63: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,778 INFO L290 TraceCheckUtils]: 64: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,778 INFO L290 TraceCheckUtils]: 65: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,778 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {28482#true} {28674#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {28674#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:47,779 INFO L290 TraceCheckUtils]: 67: Hoare triple {28674#(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; {28696#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 07:51:47,779 INFO L290 TraceCheckUtils]: 68: Hoare triple {28696#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {28696#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 07:51:47,779 INFO L272 TraceCheckUtils]: 69: Hoare triple {28696#(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)); {28482#true} is VALID [2022-04-08 07:51:47,779 INFO L290 TraceCheckUtils]: 70: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,779 INFO L290 TraceCheckUtils]: 71: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,779 INFO L290 TraceCheckUtils]: 72: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,780 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {28482#true} {28696#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {28696#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 07:51:47,780 INFO L290 TraceCheckUtils]: 74: Hoare triple {28696#(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; {28718#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:51:47,780 INFO L290 TraceCheckUtils]: 75: Hoare triple {28718#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {28718#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:51:47,780 INFO L272 TraceCheckUtils]: 76: Hoare triple {28718#(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)); {28482#true} is VALID [2022-04-08 07:51:47,780 INFO L290 TraceCheckUtils]: 77: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,780 INFO L290 TraceCheckUtils]: 78: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,780 INFO L290 TraceCheckUtils]: 79: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,781 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {28482#true} {28718#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {28718#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:51:47,781 INFO L290 TraceCheckUtils]: 81: Hoare triple {28718#(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; {28740#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:51:47,782 INFO L290 TraceCheckUtils]: 82: Hoare triple {28740#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {28740#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:51:47,782 INFO L272 TraceCheckUtils]: 83: Hoare triple {28740#(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)); {28482#true} is VALID [2022-04-08 07:51:47,782 INFO L290 TraceCheckUtils]: 84: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,782 INFO L290 TraceCheckUtils]: 85: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,782 INFO L290 TraceCheckUtils]: 86: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,782 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {28482#true} {28740#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {28740#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:51:47,783 INFO L290 TraceCheckUtils]: 88: Hoare triple {28740#(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; {28762#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 07:51:47,783 INFO L290 TraceCheckUtils]: 89: Hoare triple {28762#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {28762#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 07:51:47,783 INFO L272 TraceCheckUtils]: 90: Hoare triple {28762#(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)); {28482#true} is VALID [2022-04-08 07:51:47,783 INFO L290 TraceCheckUtils]: 91: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,783 INFO L290 TraceCheckUtils]: 92: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,783 INFO L290 TraceCheckUtils]: 93: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,783 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {28482#true} {28762#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {28762#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 07:51:47,784 INFO L290 TraceCheckUtils]: 95: Hoare triple {28762#(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; {28784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:51:47,784 INFO L290 TraceCheckUtils]: 96: Hoare triple {28784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} assume !false; {28784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:51:47,784 INFO L272 TraceCheckUtils]: 97: Hoare triple {28784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28482#true} is VALID [2022-04-08 07:51:47,784 INFO L290 TraceCheckUtils]: 98: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,784 INFO L290 TraceCheckUtils]: 99: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,784 INFO L290 TraceCheckUtils]: 100: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,785 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {28482#true} {28784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} #54#return; {28784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:51:47,785 INFO L290 TraceCheckUtils]: 102: Hoare triple {28784#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28806#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:51:47,786 INFO L290 TraceCheckUtils]: 103: Hoare triple {28806#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {28806#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:51:47,786 INFO L272 TraceCheckUtils]: 104: Hoare triple {28806#(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)); {28482#true} is VALID [2022-04-08 07:51:47,786 INFO L290 TraceCheckUtils]: 105: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,786 INFO L290 TraceCheckUtils]: 106: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,786 INFO L290 TraceCheckUtils]: 107: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,786 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {28482#true} {28806#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {28806#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:51:47,787 INFO L290 TraceCheckUtils]: 109: Hoare triple {28806#(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; {28828#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:51:47,787 INFO L290 TraceCheckUtils]: 110: Hoare triple {28828#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {28828#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:51:47,787 INFO L272 TraceCheckUtils]: 111: Hoare triple {28828#(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)); {28482#true} is VALID [2022-04-08 07:51:47,787 INFO L290 TraceCheckUtils]: 112: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,787 INFO L290 TraceCheckUtils]: 113: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,787 INFO L290 TraceCheckUtils]: 114: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,787 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {28482#true} {28828#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #54#return; {28828#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:51:47,789 INFO L290 TraceCheckUtils]: 116: Hoare triple {28828#(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; {28850#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 07:51:47,790 INFO L290 TraceCheckUtils]: 117: Hoare triple {28850#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} assume !false; {28850#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 07:51:47,790 INFO L272 TraceCheckUtils]: 118: Hoare triple {28850#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28482#true} is VALID [2022-04-08 07:51:47,790 INFO L290 TraceCheckUtils]: 119: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,790 INFO L290 TraceCheckUtils]: 120: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,790 INFO L290 TraceCheckUtils]: 121: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,790 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {28482#true} {28850#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} #54#return; {28850#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 07:51:47,791 INFO L290 TraceCheckUtils]: 123: Hoare triple {28850#(and (= (+ (- 2) main_~y~0) 13) (= (+ (- 1) main_~c~0) 14))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {28872#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 07:51:47,791 INFO L290 TraceCheckUtils]: 124: Hoare triple {28872#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} assume !false; {28872#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 07:51:47,791 INFO L272 TraceCheckUtils]: 125: Hoare triple {28872#(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)); {28482#true} is VALID [2022-04-08 07:51:47,791 INFO L290 TraceCheckUtils]: 126: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,791 INFO L290 TraceCheckUtils]: 127: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,791 INFO L290 TraceCheckUtils]: 128: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,792 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {28482#true} {28872#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} #54#return; {28872#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 07:51:47,792 INFO L290 TraceCheckUtils]: 130: Hoare triple {28872#(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; {28894#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:47,792 INFO L290 TraceCheckUtils]: 131: Hoare triple {28894#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} assume !false; {28894#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:47,792 INFO L272 TraceCheckUtils]: 132: Hoare triple {28894#(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)); {28482#true} is VALID [2022-04-08 07:51:47,792 INFO L290 TraceCheckUtils]: 133: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,792 INFO L290 TraceCheckUtils]: 134: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,792 INFO L290 TraceCheckUtils]: 135: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,793 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {28482#true} {28894#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} #54#return; {28894#(and (= main_~c~0 17) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:47,793 INFO L290 TraceCheckUtils]: 137: Hoare triple {28894#(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; {28916#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-08 07:51:47,794 INFO L290 TraceCheckUtils]: 138: Hoare triple {28916#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} assume !false; {28916#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-08 07:51:47,794 INFO L272 TraceCheckUtils]: 139: Hoare triple {28916#(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)); {28482#true} is VALID [2022-04-08 07:51:47,794 INFO L290 TraceCheckUtils]: 140: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,794 INFO L290 TraceCheckUtils]: 141: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,794 INFO L290 TraceCheckUtils]: 142: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,794 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {28482#true} {28916#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} #54#return; {28916#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-08 07:51:47,795 INFO L290 TraceCheckUtils]: 144: Hoare triple {28916#(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; {28938#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:51:47,795 INFO L290 TraceCheckUtils]: 145: Hoare triple {28938#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {28938#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:51:47,795 INFO L272 TraceCheckUtils]: 146: Hoare triple {28938#(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)); {28482#true} is VALID [2022-04-08 07:51:47,795 INFO L290 TraceCheckUtils]: 147: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,795 INFO L290 TraceCheckUtils]: 148: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,795 INFO L290 TraceCheckUtils]: 149: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,795 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {28482#true} {28938#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {28938#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:51:47,796 INFO L290 TraceCheckUtils]: 151: Hoare triple {28938#(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; {28960#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:51:47,796 INFO L290 TraceCheckUtils]: 152: Hoare triple {28960#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {28960#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:51:47,796 INFO L272 TraceCheckUtils]: 153: Hoare triple {28960#(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)); {28482#true} is VALID [2022-04-08 07:51:47,796 INFO L290 TraceCheckUtils]: 154: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,796 INFO L290 TraceCheckUtils]: 155: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,796 INFO L290 TraceCheckUtils]: 156: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,797 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {28482#true} {28960#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #54#return; {28960#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:51:47,797 INFO L290 TraceCheckUtils]: 158: Hoare triple {28960#(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; {28982#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:51:47,798 INFO L290 TraceCheckUtils]: 159: Hoare triple {28982#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !false; {28982#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:51:47,798 INFO L272 TraceCheckUtils]: 160: Hoare triple {28982#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {28482#true} is VALID [2022-04-08 07:51:47,798 INFO L290 TraceCheckUtils]: 161: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,798 INFO L290 TraceCheckUtils]: 162: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,798 INFO L290 TraceCheckUtils]: 163: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,798 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {28482#true} {28982#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} #54#return; {28982#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:51:47,799 INFO L290 TraceCheckUtils]: 165: Hoare triple {28982#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {29004#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:51:47,799 INFO L290 TraceCheckUtils]: 166: Hoare triple {29004#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {29004#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:51:47,799 INFO L272 TraceCheckUtils]: 167: Hoare triple {29004#(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)); {28482#true} is VALID [2022-04-08 07:51:47,799 INFO L290 TraceCheckUtils]: 168: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,799 INFO L290 TraceCheckUtils]: 169: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,799 INFO L290 TraceCheckUtils]: 170: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,799 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {28482#true} {29004#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #54#return; {29004#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:51:47,800 INFO L290 TraceCheckUtils]: 172: Hoare triple {29004#(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; {29026#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:47,800 INFO L290 TraceCheckUtils]: 173: Hoare triple {29026#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} assume !false; {29026#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:47,800 INFO L272 TraceCheckUtils]: 174: Hoare triple {29026#(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)); {28482#true} is VALID [2022-04-08 07:51:47,800 INFO L290 TraceCheckUtils]: 175: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,800 INFO L290 TraceCheckUtils]: 176: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,800 INFO L290 TraceCheckUtils]: 177: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,801 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {28482#true} {29026#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} #54#return; {29026#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:51:47,801 INFO L290 TraceCheckUtils]: 179: Hoare triple {29026#(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; {29048#(and (= 21 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-08 07:51:47,802 INFO L290 TraceCheckUtils]: 180: Hoare triple {29048#(and (= 21 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 22))} assume !false; {29048#(and (= 21 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-08 07:51:47,802 INFO L272 TraceCheckUtils]: 181: Hoare triple {29048#(and (= 21 (+ main_~c~0 (- 3))) (= (+ (- 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)); {28482#true} is VALID [2022-04-08 07:51:47,802 INFO L290 TraceCheckUtils]: 182: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,802 INFO L290 TraceCheckUtils]: 183: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,802 INFO L290 TraceCheckUtils]: 184: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,802 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {28482#true} {29048#(and (= 21 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 22))} #54#return; {29048#(and (= 21 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-08 07:51:47,803 INFO L290 TraceCheckUtils]: 186: Hoare triple {29048#(and (= 21 (+ main_~c~0 (- 3))) (= (+ (- 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; {29070#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 07:51:47,803 INFO L290 TraceCheckUtils]: 187: Hoare triple {29070#(and (= main_~y~0 25) (= main_~c~0 25))} assume !false; {29070#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 07:51:47,803 INFO L272 TraceCheckUtils]: 188: Hoare triple {29070#(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)); {28482#true} is VALID [2022-04-08 07:51:47,803 INFO L290 TraceCheckUtils]: 189: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,803 INFO L290 TraceCheckUtils]: 190: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,803 INFO L290 TraceCheckUtils]: 191: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,803 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {28482#true} {29070#(and (= main_~y~0 25) (= main_~c~0 25))} #54#return; {29070#(and (= main_~y~0 25) (= main_~c~0 25))} is VALID [2022-04-08 07:51:47,804 INFO L290 TraceCheckUtils]: 193: Hoare triple {29070#(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; {29092#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 07:51:47,804 INFO L290 TraceCheckUtils]: 194: Hoare triple {29092#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} assume !false; {29092#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 07:51:47,804 INFO L272 TraceCheckUtils]: 195: Hoare triple {29092#(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)); {28482#true} is VALID [2022-04-08 07:51:47,804 INFO L290 TraceCheckUtils]: 196: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,804 INFO L290 TraceCheckUtils]: 197: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,804 INFO L290 TraceCheckUtils]: 198: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,805 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {28482#true} {29092#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} #54#return; {29092#(and (= (+ (- 1) main_~c~0) 25) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 07:51:47,805 INFO L290 TraceCheckUtils]: 200: Hoare triple {29092#(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; {29114#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-08 07:51:47,805 INFO L290 TraceCheckUtils]: 201: Hoare triple {29114#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} assume !false; {29114#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-08 07:51:47,806 INFO L272 TraceCheckUtils]: 202: Hoare triple {29114#(and (= main_~c~0 27) (= (+ (- 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)); {28482#true} is VALID [2022-04-08 07:51:47,806 INFO L290 TraceCheckUtils]: 203: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,806 INFO L290 TraceCheckUtils]: 204: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,806 INFO L290 TraceCheckUtils]: 205: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,806 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {28482#true} {29114#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} #54#return; {29114#(and (= main_~c~0 27) (= (+ (- 2) main_~y~0) 25))} is VALID [2022-04-08 07:51:47,807 INFO L290 TraceCheckUtils]: 207: Hoare triple {29114#(and (= main_~c~0 27) (= (+ (- 2) 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; {29136#(and (= (+ main_~y~0 (- 3)) 25) (= main_~c~0 28))} is VALID [2022-04-08 07:51:47,807 INFO L290 TraceCheckUtils]: 208: Hoare triple {29136#(and (= (+ main_~y~0 (- 3)) 25) (= main_~c~0 28))} assume !false; {29136#(and (= (+ main_~y~0 (- 3)) 25) (= main_~c~0 28))} is VALID [2022-04-08 07:51:47,807 INFO L272 TraceCheckUtils]: 209: Hoare triple {29136#(and (= (+ main_~y~0 (- 3)) 25) (= 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)); {28482#true} is VALID [2022-04-08 07:51:47,807 INFO L290 TraceCheckUtils]: 210: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,807 INFO L290 TraceCheckUtils]: 211: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,807 INFO L290 TraceCheckUtils]: 212: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,807 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {28482#true} {29136#(and (= (+ main_~y~0 (- 3)) 25) (= main_~c~0 28))} #54#return; {29136#(and (= (+ main_~y~0 (- 3)) 25) (= main_~c~0 28))} is VALID [2022-04-08 07:51:47,808 INFO L290 TraceCheckUtils]: 214: Hoare triple {29136#(and (= (+ main_~y~0 (- 3)) 25) (= 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; {29158#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 07:51:47,808 INFO L290 TraceCheckUtils]: 215: Hoare triple {29158#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !false; {29158#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 07:51:47,808 INFO L272 TraceCheckUtils]: 216: Hoare triple {29158#(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)); {28482#true} is VALID [2022-04-08 07:51:47,808 INFO L290 TraceCheckUtils]: 217: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,808 INFO L290 TraceCheckUtils]: 218: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,808 INFO L290 TraceCheckUtils]: 219: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,809 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {28482#true} {29158#(and (= 29 main_~y~0) (= 29 main_~c~0))} #54#return; {29158#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 07:51:47,809 INFO L290 TraceCheckUtils]: 221: Hoare triple {29158#(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; {29180#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-08 07:51:47,809 INFO L290 TraceCheckUtils]: 222: Hoare triple {29180#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} assume !false; {29180#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-08 07:51:47,810 INFO L272 TraceCheckUtils]: 223: Hoare triple {29180#(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)); {28482#true} is VALID [2022-04-08 07:51:47,810 INFO L290 TraceCheckUtils]: 224: Hoare triple {28482#true} ~cond := #in~cond; {28482#true} is VALID [2022-04-08 07:51:47,810 INFO L290 TraceCheckUtils]: 225: Hoare triple {28482#true} assume !(0 == ~cond); {28482#true} is VALID [2022-04-08 07:51:47,810 INFO L290 TraceCheckUtils]: 226: Hoare triple {28482#true} assume true; {28482#true} is VALID [2022-04-08 07:51:47,810 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {28482#true} {29180#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} #54#return; {29180#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} is VALID [2022-04-08 07:51:47,811 INFO L290 TraceCheckUtils]: 228: Hoare triple {29180#(and (= 30 main_~y~0) (<= main_~c~0 30) (< 29 main_~k~0))} assume !(~c~0 < ~k~0); {29202#(and (<= main_~k~0 30) (= 30 main_~y~0) (< 29 main_~k~0))} is VALID [2022-04-08 07:51:47,811 INFO L272 TraceCheckUtils]: 229: Hoare triple {29202#(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)); {29206#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:51:47,811 INFO L290 TraceCheckUtils]: 230: Hoare triple {29206#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29210#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:51:47,812 INFO L290 TraceCheckUtils]: 231: Hoare triple {29210#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28483#false} is VALID [2022-04-08 07:51:47,812 INFO L290 TraceCheckUtils]: 232: Hoare triple {28483#false} assume !false; {28483#false} is VALID [2022-04-08 07:51:47,813 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 07:51:47,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:51:48,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:51:48,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326835935] [2022-04-08 07:51:48,157 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:51:48,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618398373] [2022-04-08 07:51:48,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618398373] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:51:48,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:51:48,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2022-04-08 07:51:48,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:51:48,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2083730952] [2022-04-08 07:51:48,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2083730952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:51:48,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:51:48,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-08 07:51:48,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993823967] [2022-04-08 07:51:48,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:51:48,159 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) Word has length 233 [2022-04-08 07:51:48,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:51:48,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-04-08 07:51:48,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:51:48,504 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-08 07:51:48,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:51:48,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-08 07:51:48,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 07:51:48,505 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-04-08 07:52:04,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:52:04,873 INFO L93 Difference]: Finished difference Result 126 states and 156 transitions. [2022-04-08 07:52:04,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 07:52:04,873 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) Word has length 233 [2022-04-08 07:52:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:52:04,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-04-08 07:52:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 152 transitions. [2022-04-08 07:52:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-04-08 07:52:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 152 transitions. [2022-04-08 07:52:04,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 152 transitions. [2022-04-08 07:52:05,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:52:05,314 INFO L225 Difference]: With dead ends: 126 [2022-04-08 07:52:05,314 INFO L226 Difference]: Without dead ends: 121 [2022-04-08 07:52:05,314 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=1519, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 07:52:05,315 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 3241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 3241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-04-08 07:52:05,315 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1739 Invalid, 3241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3241 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2022-04-08 07:52:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-08 07:52:05,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-04-08 07:52:05,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:52:05,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 07:52:05,457 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 07:52:05,457 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 07:52:05,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:52:05,459 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-08 07:52:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-08 07:52:05,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:52:05,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:52:05,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 121 states. [2022-04-08 07:52:05,460 INFO L87 Difference]: Start difference. First operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 121 states. [2022-04-08 07:52:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:52:05,462 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-08 07:52:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-08 07:52:05,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:52:05,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:52:05,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:52:05,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:52:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 36 states have call successors, (36), 6 states have call predecessors, (36), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 07:52:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 151 transitions. [2022-04-08 07:52:05,465 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 151 transitions. Word has length 233 [2022-04-08 07:52:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:52:05,465 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 151 transitions. [2022-04-08 07:52:05,465 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 33 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-04-08 07:52:05,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 151 transitions. [2022-04-08 07:52:06,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:52:06,494 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-08 07:52:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-04-08 07:52:06,495 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:52:06,495 INFO L499 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:52:06,508 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 07:52:06,697 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 07:52:06,697 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:52:06,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:52:06,697 INFO L85 PathProgramCache]: Analyzing trace with hash -155412760, now seen corresponding path program 61 times [2022-04-08 07:52:06,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:52:06,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1156965918] [2022-04-08 07:52:06,759 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:52:06,759 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:52:06,759 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:52:06,759 INFO L85 PathProgramCache]: Analyzing trace with hash -155412760, now seen corresponding path program 62 times [2022-04-08 07:52:06,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:52:06,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130467037] [2022-04-08 07:52:06,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:52:06,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:52:06,774 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:52:06,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1501222736] [2022-04-08 07:52:06,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:52:06,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:52:06,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:52:06,775 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 07:52:06,776 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 07:52:07,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:52:07,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:52:07,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 149 conjunts are in the unsatisfiable core [2022-04-08 07:52:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:52:07,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:52:09,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {29998#true} call ULTIMATE.init(); {29998#true} is VALID [2022-04-08 07:52:09,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {29998#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); {29998#true} is VALID [2022-04-08 07:52:09,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29998#true} {29998#true} #60#return; {29998#true} is VALID [2022-04-08 07:52:09,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {29998#true} call #t~ret5 := main(); {29998#true} is VALID [2022-04-08 07:52:09,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {29998#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; {29998#true} is VALID [2022-04-08 07:52:09,181 INFO L272 TraceCheckUtils]: 6: Hoare triple {29998#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {29998#true} is VALID [2022-04-08 07:52:09,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,181 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29998#true} {29998#true} #52#return; {29998#true} is VALID [2022-04-08 07:52:09,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {29998#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {30036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:52:09,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {30036#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {30036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:52:09,182 INFO L272 TraceCheckUtils]: 13: Hoare triple {30036#(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)); {29998#true} is VALID [2022-04-08 07:52:09,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,183 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29998#true} {30036#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {30036#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:52:09,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {30036#(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; {30058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:52:09,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {30058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {30058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:52:09,183 INFO L272 TraceCheckUtils]: 20: Hoare triple {30058#(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)); {29998#true} is VALID [2022-04-08 07:52:09,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,184 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {29998#true} {30058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {30058#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:52:09,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {30058#(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; {30080#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:52:09,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {30080#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {30080#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:52:09,185 INFO L272 TraceCheckUtils]: 27: Hoare triple {30080#(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)); {29998#true} is VALID [2022-04-08 07:52:09,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,185 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {29998#true} {30080#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {30080#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:52:09,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {30080#(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; {30102#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:52:09,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {30102#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {30102#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:52:09,186 INFO L272 TraceCheckUtils]: 34: Hoare triple {30102#(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)); {29998#true} is VALID [2022-04-08 07:52:09,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,187 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {29998#true} {30102#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {30102#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:52:09,187 INFO L290 TraceCheckUtils]: 39: Hoare triple {30102#(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; {30124#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:52:09,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {30124#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {30124#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:52:09,188 INFO L272 TraceCheckUtils]: 41: Hoare triple {30124#(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)); {29998#true} is VALID [2022-04-08 07:52:09,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,188 INFO L290 TraceCheckUtils]: 43: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,188 INFO L290 TraceCheckUtils]: 44: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,188 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {29998#true} {30124#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {30124#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:52:09,188 INFO L290 TraceCheckUtils]: 46: Hoare triple {30124#(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; {30146#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:52:09,189 INFO L290 TraceCheckUtils]: 47: Hoare triple {30146#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} assume !false; {30146#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:52:09,189 INFO L272 TraceCheckUtils]: 48: Hoare triple {30146#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29998#true} is VALID [2022-04-08 07:52:09,189 INFO L290 TraceCheckUtils]: 49: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,189 INFO L290 TraceCheckUtils]: 50: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,189 INFO L290 TraceCheckUtils]: 51: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,189 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {29998#true} {30146#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} #54#return; {30146#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:52:09,190 INFO L290 TraceCheckUtils]: 53: Hoare triple {30146#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:52:09,190 INFO L290 TraceCheckUtils]: 54: Hoare triple {30168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {30168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:52:09,190 INFO L272 TraceCheckUtils]: 55: Hoare triple {30168#(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)); {29998#true} is VALID [2022-04-08 07:52:09,190 INFO L290 TraceCheckUtils]: 56: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,190 INFO L290 TraceCheckUtils]: 57: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,190 INFO L290 TraceCheckUtils]: 58: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,191 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29998#true} {30168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {30168#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:52:09,191 INFO L290 TraceCheckUtils]: 60: Hoare triple {30168#(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; {30190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 07:52:09,191 INFO L290 TraceCheckUtils]: 61: Hoare triple {30190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !false; {30190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 07:52:09,192 INFO L272 TraceCheckUtils]: 62: Hoare triple {30190#(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)); {29998#true} is VALID [2022-04-08 07:52:09,192 INFO L290 TraceCheckUtils]: 63: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,192 INFO L290 TraceCheckUtils]: 64: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,192 INFO L290 TraceCheckUtils]: 65: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,192 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29998#true} {30190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #54#return; {30190#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 07:52:09,193 INFO L290 TraceCheckUtils]: 67: Hoare triple {30190#(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; {30212#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 07:52:09,193 INFO L290 TraceCheckUtils]: 68: Hoare triple {30212#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} assume !false; {30212#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 07:52:09,193 INFO L272 TraceCheckUtils]: 69: Hoare triple {30212#(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)); {29998#true} is VALID [2022-04-08 07:52:09,193 INFO L290 TraceCheckUtils]: 70: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,193 INFO L290 TraceCheckUtils]: 71: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,193 INFO L290 TraceCheckUtils]: 72: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,194 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {29998#true} {30212#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} #54#return; {30212#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 07:52:09,194 INFO L290 TraceCheckUtils]: 74: Hoare triple {30212#(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; {30234#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:52:09,194 INFO L290 TraceCheckUtils]: 75: Hoare triple {30234#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {30234#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:52:09,194 INFO L272 TraceCheckUtils]: 76: Hoare triple {30234#(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)); {29998#true} is VALID [2022-04-08 07:52:09,194 INFO L290 TraceCheckUtils]: 77: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,195 INFO L290 TraceCheckUtils]: 78: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,195 INFO L290 TraceCheckUtils]: 79: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,195 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {29998#true} {30234#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {30234#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:52:09,195 INFO L290 TraceCheckUtils]: 81: Hoare triple {30234#(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; {30256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:52:09,196 INFO L290 TraceCheckUtils]: 82: Hoare triple {30256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} assume !false; {30256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:52:09,196 INFO L272 TraceCheckUtils]: 83: Hoare triple {30256#(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)); {29998#true} is VALID [2022-04-08 07:52:09,196 INFO L290 TraceCheckUtils]: 84: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,196 INFO L290 TraceCheckUtils]: 85: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,196 INFO L290 TraceCheckUtils]: 86: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,196 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {29998#true} {30256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} #54#return; {30256#(and (= 9 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 07:52:09,197 INFO L290 TraceCheckUtils]: 88: Hoare triple {30256#(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; {30278#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 07:52:09,197 INFO L290 TraceCheckUtils]: 89: Hoare triple {30278#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} assume !false; {30278#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 07:52:09,197 INFO L272 TraceCheckUtils]: 90: Hoare triple {30278#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29998#true} is VALID [2022-04-08 07:52:09,197 INFO L290 TraceCheckUtils]: 91: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,197 INFO L290 TraceCheckUtils]: 92: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,197 INFO L290 TraceCheckUtils]: 93: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,198 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {29998#true} {30278#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} #54#return; {30278#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 07:52:09,198 INFO L290 TraceCheckUtils]: 95: Hoare triple {30278#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30300#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 07:52:09,198 INFO L290 TraceCheckUtils]: 96: Hoare triple {30300#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} assume !false; {30300#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 07:52:09,199 INFO L272 TraceCheckUtils]: 97: Hoare triple {30300#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29998#true} is VALID [2022-04-08 07:52:09,199 INFO L290 TraceCheckUtils]: 98: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,199 INFO L290 TraceCheckUtils]: 99: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,199 INFO L290 TraceCheckUtils]: 100: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,199 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {29998#true} {30300#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} #54#return; {30300#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} is VALID [2022-04-08 07:52:09,199 INFO L290 TraceCheckUtils]: 102: Hoare triple {30300#(and (= main_~c~0 12) (= (+ main_~y~0 (- 3)) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30322#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:52:09,200 INFO L290 TraceCheckUtils]: 103: Hoare triple {30322#(and (= main_~c~0 13) (= main_~y~0 13))} assume !false; {30322#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:52:09,200 INFO L272 TraceCheckUtils]: 104: Hoare triple {30322#(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)); {29998#true} is VALID [2022-04-08 07:52:09,200 INFO L290 TraceCheckUtils]: 105: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,200 INFO L290 TraceCheckUtils]: 106: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,200 INFO L290 TraceCheckUtils]: 107: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,200 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {29998#true} {30322#(and (= main_~c~0 13) (= main_~y~0 13))} #54#return; {30322#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 07:52:09,201 INFO L290 TraceCheckUtils]: 109: Hoare triple {30322#(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; {30344#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:52:09,201 INFO L290 TraceCheckUtils]: 110: Hoare triple {30344#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {30344#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:52:09,201 INFO L272 TraceCheckUtils]: 111: Hoare triple {30344#(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)); {29998#true} is VALID [2022-04-08 07:52:09,201 INFO L290 TraceCheckUtils]: 112: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,201 INFO L290 TraceCheckUtils]: 113: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,201 INFO L290 TraceCheckUtils]: 114: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,202 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {29998#true} {30344#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #54#return; {30344#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:52:09,202 INFO L290 TraceCheckUtils]: 116: Hoare triple {30344#(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; {30366#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-08 07:52:09,203 INFO L290 TraceCheckUtils]: 117: Hoare triple {30366#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} assume !false; {30366#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-08 07:52:09,203 INFO L272 TraceCheckUtils]: 118: Hoare triple {30366#(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)); {29998#true} is VALID [2022-04-08 07:52:09,203 INFO L290 TraceCheckUtils]: 119: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,203 INFO L290 TraceCheckUtils]: 120: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,203 INFO L290 TraceCheckUtils]: 121: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,203 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29998#true} {30366#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} #54#return; {30366#(and (= main_~c~0 15) (= (+ (- 2) main_~y~0) 13))} is VALID [2022-04-08 07:52:09,204 INFO L290 TraceCheckUtils]: 123: Hoare triple {30366#(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; {30388#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-08 07:52:09,204 INFO L290 TraceCheckUtils]: 124: Hoare triple {30388#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} assume !false; {30388#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-08 07:52:09,204 INFO L272 TraceCheckUtils]: 125: Hoare triple {30388#(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)); {29998#true} is VALID [2022-04-08 07:52:09,204 INFO L290 TraceCheckUtils]: 126: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,204 INFO L290 TraceCheckUtils]: 127: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,204 INFO L290 TraceCheckUtils]: 128: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,205 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {29998#true} {30388#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} #54#return; {30388#(and (= main_~c~0 16) (= (+ main_~y~0 (- 3)) 13))} is VALID [2022-04-08 07:52:09,205 INFO L290 TraceCheckUtils]: 130: Hoare triple {30388#(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; {30410#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:52:09,205 INFO L290 TraceCheckUtils]: 131: Hoare triple {30410#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {30410#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:52:09,205 INFO L272 TraceCheckUtils]: 132: Hoare triple {30410#(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)); {29998#true} is VALID [2022-04-08 07:52:09,205 INFO L290 TraceCheckUtils]: 133: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,205 INFO L290 TraceCheckUtils]: 134: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,205 INFO L290 TraceCheckUtils]: 135: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,206 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {29998#true} {30410#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {30410#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:52:09,206 INFO L290 TraceCheckUtils]: 137: Hoare triple {30410#(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; {30432#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:52:09,207 INFO L290 TraceCheckUtils]: 138: Hoare triple {30432#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} assume !false; {30432#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:52:09,207 INFO L272 TraceCheckUtils]: 139: Hoare triple {30432#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29998#true} is VALID [2022-04-08 07:52:09,207 INFO L290 TraceCheckUtils]: 140: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,207 INFO L290 TraceCheckUtils]: 141: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,207 INFO L290 TraceCheckUtils]: 142: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,207 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {29998#true} {30432#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} #54#return; {30432#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} is VALID [2022-04-08 07:52:09,208 INFO L290 TraceCheckUtils]: 144: Hoare triple {30432#(and (= (+ (- 1) main_~c~0) 17) (= (+ (- 1) main_~y~0) 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30454#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 07:52:09,208 INFO L290 TraceCheckUtils]: 145: Hoare triple {30454#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} assume !false; {30454#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 07:52:09,208 INFO L272 TraceCheckUtils]: 146: Hoare triple {30454#(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)); {29998#true} is VALID [2022-04-08 07:52:09,208 INFO L290 TraceCheckUtils]: 147: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,208 INFO L290 TraceCheckUtils]: 148: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,208 INFO L290 TraceCheckUtils]: 149: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,209 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {29998#true} {30454#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} #54#return; {30454#(and (= (+ (- 2) main_~y~0) 17) (= 19 main_~c~0))} is VALID [2022-04-08 07:52:09,209 INFO L290 TraceCheckUtils]: 151: Hoare triple {30454#(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; {30476#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17))} is VALID [2022-04-08 07:52:09,209 INFO L290 TraceCheckUtils]: 152: Hoare triple {30476#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17))} assume !false; {30476#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17))} is VALID [2022-04-08 07:52:09,209 INFO L272 TraceCheckUtils]: 153: Hoare triple {30476#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~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)); {29998#true} is VALID [2022-04-08 07:52:09,209 INFO L290 TraceCheckUtils]: 154: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,210 INFO L290 TraceCheckUtils]: 155: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,210 INFO L290 TraceCheckUtils]: 156: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,210 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {29998#true} {30476#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17))} #54#return; {30476#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 3)) 17))} is VALID [2022-04-08 07:52:09,210 INFO L290 TraceCheckUtils]: 158: Hoare triple {30476#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~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; {30498#(and (= (+ main_~y~0 (- 4)) 17) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:52:09,211 INFO L290 TraceCheckUtils]: 159: Hoare triple {30498#(and (= (+ main_~y~0 (- 4)) 17) (= 19 (+ (- 2) main_~c~0)))} assume !false; {30498#(and (= (+ main_~y~0 (- 4)) 17) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:52:09,211 INFO L272 TraceCheckUtils]: 160: Hoare triple {30498#(and (= (+ main_~y~0 (- 4)) 17) (= 19 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {29998#true} is VALID [2022-04-08 07:52:09,211 INFO L290 TraceCheckUtils]: 161: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,211 INFO L290 TraceCheckUtils]: 162: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,211 INFO L290 TraceCheckUtils]: 163: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,211 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {29998#true} {30498#(and (= (+ main_~y~0 (- 4)) 17) (= 19 (+ (- 2) main_~c~0)))} #54#return; {30498#(and (= (+ main_~y~0 (- 4)) 17) (= 19 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:52:09,212 INFO L290 TraceCheckUtils]: 165: Hoare triple {30498#(and (= (+ main_~y~0 (- 4)) 17) (= 19 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {30520#(and (= (+ main_~y~0 (- 5)) 17) (= main_~c~0 22))} is VALID [2022-04-08 07:52:09,212 INFO L290 TraceCheckUtils]: 166: Hoare triple {30520#(and (= (+ main_~y~0 (- 5)) 17) (= main_~c~0 22))} assume !false; {30520#(and (= (+ main_~y~0 (- 5)) 17) (= main_~c~0 22))} is VALID [2022-04-08 07:52:09,212 INFO L272 TraceCheckUtils]: 167: Hoare triple {30520#(and (= (+ main_~y~0 (- 5)) 17) (= 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)); {29998#true} is VALID [2022-04-08 07:52:09,212 INFO L290 TraceCheckUtils]: 168: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,212 INFO L290 TraceCheckUtils]: 169: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,212 INFO L290 TraceCheckUtils]: 170: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,213 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {29998#true} {30520#(and (= (+ main_~y~0 (- 5)) 17) (= main_~c~0 22))} #54#return; {30520#(and (= (+ main_~y~0 (- 5)) 17) (= main_~c~0 22))} is VALID [2022-04-08 07:52:09,213 INFO L290 TraceCheckUtils]: 172: Hoare triple {30520#(and (= (+ main_~y~0 (- 5)) 17) (= 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; {30542#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:52:09,213 INFO L290 TraceCheckUtils]: 173: Hoare triple {30542#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {30542#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:52:09,213 INFO L272 TraceCheckUtils]: 174: Hoare triple {30542#(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)); {29998#true} is VALID [2022-04-08 07:52:09,214 INFO L290 TraceCheckUtils]: 175: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,214 INFO L290 TraceCheckUtils]: 176: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,214 INFO L290 TraceCheckUtils]: 177: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,214 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {29998#true} {30542#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {30542#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:52:09,214 INFO L290 TraceCheckUtils]: 179: Hoare triple {30542#(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; {30564#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 07:52:09,215 INFO L290 TraceCheckUtils]: 180: Hoare triple {30564#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {30564#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 07:52:09,215 INFO L272 TraceCheckUtils]: 181: Hoare triple {30564#(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)); {29998#true} is VALID [2022-04-08 07:52:09,215 INFO L290 TraceCheckUtils]: 182: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,215 INFO L290 TraceCheckUtils]: 183: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,215 INFO L290 TraceCheckUtils]: 184: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,215 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {29998#true} {30564#(and (= main_~c~0 24) (= main_~y~0 24))} #54#return; {30564#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 07:52:09,216 INFO L290 TraceCheckUtils]: 186: Hoare triple {30564#(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; {30586#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 07:52:09,216 INFO L290 TraceCheckUtils]: 187: Hoare triple {30586#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} assume !false; {30586#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 07:52:09,216 INFO L272 TraceCheckUtils]: 188: Hoare triple {30586#(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)); {29998#true} is VALID [2022-04-08 07:52:09,216 INFO L290 TraceCheckUtils]: 189: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,216 INFO L290 TraceCheckUtils]: 190: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,216 INFO L290 TraceCheckUtils]: 191: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,217 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {29998#true} {30586#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} #54#return; {30586#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 07:52:09,217 INFO L290 TraceCheckUtils]: 193: Hoare triple {30586#(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; {30608#(and (= (+ (- 2) main_~c~0) 24) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 07:52:09,217 INFO L290 TraceCheckUtils]: 194: Hoare triple {30608#(and (= (+ (- 2) main_~c~0) 24) (= (+ (- 1) main_~y~0) 25))} assume !false; {30608#(and (= (+ (- 2) main_~c~0) 24) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 07:52:09,218 INFO L272 TraceCheckUtils]: 195: Hoare triple {30608#(and (= (+ (- 2) main_~c~0) 24) (= (+ (- 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)); {29998#true} is VALID [2022-04-08 07:52:09,218 INFO L290 TraceCheckUtils]: 196: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,218 INFO L290 TraceCheckUtils]: 197: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,218 INFO L290 TraceCheckUtils]: 198: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,218 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {29998#true} {30608#(and (= (+ (- 2) main_~c~0) 24) (= (+ (- 1) main_~y~0) 25))} #54#return; {30608#(and (= (+ (- 2) main_~c~0) 24) (= (+ (- 1) main_~y~0) 25))} is VALID [2022-04-08 07:52:09,219 INFO L290 TraceCheckUtils]: 200: Hoare triple {30608#(and (= (+ (- 2) main_~c~0) 24) (= (+ (- 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; {30630#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27))} is VALID [2022-04-08 07:52:09,219 INFO L290 TraceCheckUtils]: 201: Hoare triple {30630#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27))} assume !false; {30630#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27))} is VALID [2022-04-08 07:52:09,219 INFO L272 TraceCheckUtils]: 202: Hoare triple {30630#(and (= (+ main_~c~0 (- 3)) 24) (= 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)); {29998#true} is VALID [2022-04-08 07:52:09,219 INFO L290 TraceCheckUtils]: 203: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,219 INFO L290 TraceCheckUtils]: 204: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,219 INFO L290 TraceCheckUtils]: 205: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,220 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {29998#true} {30630#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27))} #54#return; {30630#(and (= (+ main_~c~0 (- 3)) 24) (= main_~y~0 27))} is VALID [2022-04-08 07:52:09,220 INFO L290 TraceCheckUtils]: 207: Hoare triple {30630#(and (= (+ main_~c~0 (- 3)) 24) (= 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; {30652#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 24))} is VALID [2022-04-08 07:52:09,228 INFO L290 TraceCheckUtils]: 208: Hoare triple {30652#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 24))} assume !false; {30652#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 24))} is VALID [2022-04-08 07:52:09,228 INFO L272 TraceCheckUtils]: 209: Hoare triple {30652#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 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)); {29998#true} is VALID [2022-04-08 07:52:09,228 INFO L290 TraceCheckUtils]: 210: Hoare triple {29998#true} ~cond := #in~cond; {29998#true} is VALID [2022-04-08 07:52:09,228 INFO L290 TraceCheckUtils]: 211: Hoare triple {29998#true} assume !(0 == ~cond); {29998#true} is VALID [2022-04-08 07:52:09,228 INFO L290 TraceCheckUtils]: 212: Hoare triple {29998#true} assume true; {29998#true} is VALID [2022-04-08 07:52:09,229 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {29998#true} {30652#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 24))} #54#return; {30652#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 24))} is VALID [2022-04-08 07:52:09,229 INFO L290 TraceCheckUtils]: 214: Hoare triple {30652#(and (= (+ (- 1) main_~y~0) 27) (= (+ main_~c~0 (- 4)) 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; {30674#(and (= (+ (- 2) main_~y~0) 27) (= (+ main_~c~0 (- 5)) 24))} is VALID [2022-04-08 07:52:09,229 INFO L290 TraceCheckUtils]: 215: Hoare triple {30674#(and (= (+ (- 2) main_~y~0) 27) (= (+ main_~c~0 (- 5)) 24))} assume !false; {30674#(and (= (+ (- 2) main_~y~0) 27) (= (+ main_~c~0 (- 5)) 24))} is VALID [2022-04-08 07:52:09,229 INFO L272 TraceCheckUtils]: 216: Hoare triple {30674#(and (= (+ (- 2) main_~y~0) 27) (= (+ main_~c~0 (- 5)) 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)); {29998#true} is VALID [2022-04-08 07:52:09,230 INFO L290 TraceCheckUtils]: 217: Hoare triple {29998#true} ~cond := #in~cond; {30684#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:52:09,230 INFO L290 TraceCheckUtils]: 218: Hoare triple {30684#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:52:09,230 INFO L290 TraceCheckUtils]: 219: Hoare triple {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:52:09,231 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} {30674#(and (= (+ (- 2) main_~y~0) 27) (= (+ main_~c~0 (- 5)) 24))} #54#return; {30695#(and (= (+ (- 2) main_~y~0) 27) (= (+ main_~c~0 (- 5)) 24) (= (+ (* 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 07:52:09,231 INFO L290 TraceCheckUtils]: 221: Hoare triple {30695#(and (= (+ (- 2) main_~y~0) 27) (= (+ main_~c~0 (- 5)) 24) (= (+ (* 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; {30699#(and (= 30 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 189225) main_~x~0) (= (+ main_~c~0 (- 6)) 24))} is VALID [2022-04-08 07:52:09,232 INFO L290 TraceCheckUtils]: 222: Hoare triple {30699#(and (= 30 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 189225) main_~x~0) (= (+ main_~c~0 (- 6)) 24))} assume !false; {30699#(and (= 30 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 189225) main_~x~0) (= (+ main_~c~0 (- 6)) 24))} is VALID [2022-04-08 07:52:09,232 INFO L272 TraceCheckUtils]: 223: Hoare triple {30699#(and (= 30 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 189225) main_~x~0) (= (+ main_~c~0 (- 6)) 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)); {29998#true} is VALID [2022-04-08 07:52:09,232 INFO L290 TraceCheckUtils]: 224: Hoare triple {29998#true} ~cond := #in~cond; {30684#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:52:09,232 INFO L290 TraceCheckUtils]: 225: Hoare triple {30684#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:52:09,233 INFO L290 TraceCheckUtils]: 226: Hoare triple {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:52:09,233 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} {30699#(and (= 30 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 189225) main_~x~0) (= (+ main_~c~0 (- 6)) 24))} #54#return; {30718#(and (= 30 main_~y~0) (= 30 main_~c~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 main_~y~0) 2)) (* main_~x~0 4)))} is VALID [2022-04-08 07:52:09,234 INFO L290 TraceCheckUtils]: 228: Hoare triple {30718#(and (= 30 main_~y~0) (= 30 main_~c~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 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; {30722#(and (<= main_~c~0 31) (= main_~y~0 31) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 216225)) (< 30 main_~k~0))} is VALID [2022-04-08 07:52:09,234 INFO L290 TraceCheckUtils]: 229: Hoare triple {30722#(and (<= main_~c~0 31) (= main_~y~0 31) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 216225)) (< 30 main_~k~0))} assume !false; {30722#(and (<= main_~c~0 31) (= main_~y~0 31) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 216225)) (< 30 main_~k~0))} is VALID [2022-04-08 07:52:09,234 INFO L272 TraceCheckUtils]: 230: Hoare triple {30722#(and (<= main_~c~0 31) (= main_~y~0 31) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 216225)) (< 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)); {29998#true} is VALID [2022-04-08 07:52:09,234 INFO L290 TraceCheckUtils]: 231: Hoare triple {29998#true} ~cond := #in~cond; {30684#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:52:09,235 INFO L290 TraceCheckUtils]: 232: Hoare triple {30684#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:52:09,235 INFO L290 TraceCheckUtils]: 233: Hoare triple {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:52:09,236 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {30688#(not (= |__VERIFIER_assert_#in~cond| 0))} {30722#(and (<= main_~c~0 31) (= main_~y~0 31) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) 216225)) (< 30 main_~k~0))} #54#return; {30741#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} is VALID [2022-04-08 07:52:09,236 INFO L290 TraceCheckUtils]: 235: Hoare triple {30741#(and (<= main_~c~0 31) (= main_~y~0 31) (< 30 main_~k~0))} assume !(~c~0 < ~k~0); {30745#(and (= main_~y~0 31) (< 30 main_~k~0) (<= main_~k~0 31))} is VALID [2022-04-08 07:52:09,237 INFO L272 TraceCheckUtils]: 236: Hoare triple {30745#(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)); {30749#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:52:09,237 INFO L290 TraceCheckUtils]: 237: Hoare triple {30749#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30753#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:52:09,237 INFO L290 TraceCheckUtils]: 238: Hoare triple {30753#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29999#false} is VALID [2022-04-08 07:52:09,237 INFO L290 TraceCheckUtils]: 239: Hoare triple {29999#false} assume !false; {29999#false} is VALID [2022-04-08 07:52:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3536 backedges. 322 proven. 1491 refuted. 0 times theorem prover too weak. 1723 trivial. 0 not checked. [2022-04-08 07:52:09,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:53:07,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:53:07,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130467037] [2022-04-08 07:53:07,921 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:53:07,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501222736] [2022-04-08 07:53:07,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501222736] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:53:07,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:53:07,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2022-04-08 07:53:07,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:53:07,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1156965918] [2022-04-08 07:53:07,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1156965918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:53:07,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:53:07,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-08 07:53:07,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056338443] [2022-04-08 07:53:07,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:53:07,922 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 38 states have internal predecessors, (80), 34 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) Word has length 240 [2022-04-08 07:53:07,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:53:07,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 38 states have internal predecessors, (80), 34 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2022-04-08 07:53:08,413 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 07:53:08,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-08 07:53:08,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:53:08,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-08 07:53:08,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2065, Unknown=11, NotChecked=0, Total=2256 [2022-04-08 07:53:08,415 INFO L87 Difference]: Start difference. First operand 121 states and 151 transitions. Second operand has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 38 states have internal predecessors, (80), 34 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2022-04-08 07:53:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:53:33,752 INFO L93 Difference]: Finished difference Result 133 states and 163 transitions. [2022-04-08 07:53:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-08 07:53:33,753 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 38 states have internal predecessors, (80), 34 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) Word has length 240 [2022-04-08 07:53:33,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:53:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 38 states have internal predecessors, (80), 34 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2022-04-08 07:53:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 158 transitions. [2022-04-08 07:53:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 38 states have internal predecessors, (80), 34 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2022-04-08 07:53:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 158 transitions. [2022-04-08 07:53:33,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 158 transitions. [2022-04-08 07:53:34,420 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 07:53:34,422 INFO L225 Difference]: With dead ends: 133 [2022-04-08 07:53:34,422 INFO L226 Difference]: Without dead ends: 128 [2022-04-08 07:53:34,423 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=201, Invalid=2338, Unknown=11, NotChecked=0, Total=2550 [2022-04-08 07:53:34,423 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 12 mSDsluCounter, 1755 mSDsCounter, 0 mSdLazyCounter, 4083 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 4088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-04-08 07:53:34,423 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 1836 Invalid, 4088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4083 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2022-04-08 07:53:34,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-08 07:53:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-04-08 07:53:34,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:53:34,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 128 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 37 states have call successors, (37), 7 states have call predecessors, (37), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 07:53:34,593 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 128 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 37 states have call successors, (37), 7 states have call predecessors, (37), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 07:53:34,593 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 128 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 37 states have call successors, (37), 7 states have call predecessors, (37), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 07:53:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:53:34,595 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2022-04-08 07:53:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2022-04-08 07:53:34,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:53:34,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:53:34,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 37 states have call successors, (37), 7 states have call predecessors, (37), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 128 states. [2022-04-08 07:53:34,596 INFO L87 Difference]: Start difference. First operand has 128 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 37 states have call successors, (37), 7 states have call predecessors, (37), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 128 states. [2022-04-08 07:53:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:53:34,598 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2022-04-08 07:53:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2022-04-08 07:53:34,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:53:34,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:53:34,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:53:34,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:53:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 37 states have call successors, (37), 7 states have call predecessors, (37), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 07:53:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2022-04-08 07:53:34,600 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 240 [2022-04-08 07:53:34,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:53:34,601 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2022-04-08 07:53:34,601 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 38 states have internal predecessors, (80), 34 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2022-04-08 07:53:34,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 158 transitions. [2022-04-08 07:53:35,735 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 07:53:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2022-04-08 07:53:35,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-04-08 07:53:35,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:53:35,736 INFO L499 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:53:35,742 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 07:53:35,936 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 07:53:35,936 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:53:35,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:53:35,937 INFO L85 PathProgramCache]: Analyzing trace with hash 810222889, now seen corresponding path program 63 times [2022-04-08 07:53:35,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:53:35,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1113383357] [2022-04-08 07:53:36,001 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:53:36,001 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:53:36,001 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:53:36,001 INFO L85 PathProgramCache]: Analyzing trace with hash 810222889, now seen corresponding path program 64 times [2022-04-08 07:53:36,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:53:36,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725486655] [2022-04-08 07:53:36,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:53:36,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:53:36,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:53:36,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1373497396] [2022-04-08 07:53:36,025 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:53:36,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:53:36,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:53:36,026 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 07:53:36,026 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 07:53:37,485 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:53:37,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:53:37,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 136 conjunts are in the unsatisfiable core [2022-04-08 07:53:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:53:37,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:53:38,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {31588#true} call ULTIMATE.init(); {31588#true} is VALID [2022-04-08 07:53:38,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {31588#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); {31588#true} is VALID [2022-04-08 07:53:38,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31588#true} {31588#true} #60#return; {31588#true} is VALID [2022-04-08 07:53:38,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {31588#true} call #t~ret5 := main(); {31588#true} is VALID [2022-04-08 07:53:38,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {31588#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; {31588#true} is VALID [2022-04-08 07:53:38,814 INFO L272 TraceCheckUtils]: 6: Hoare triple {31588#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {31588#true} is VALID [2022-04-08 07:53:38,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,814 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31588#true} {31588#true} #52#return; {31588#true} is VALID [2022-04-08 07:53:38,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {31588#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {31626#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:53:38,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {31626#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {31626#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:53:38,815 INFO L272 TraceCheckUtils]: 13: Hoare triple {31626#(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)); {31588#true} is VALID [2022-04-08 07:53:38,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,815 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {31588#true} {31626#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {31626#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:53:38,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {31626#(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; {31648#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:53:38,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {31648#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {31648#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:53:38,816 INFO L272 TraceCheckUtils]: 20: Hoare triple {31648#(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)); {31588#true} is VALID [2022-04-08 07:53:38,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,817 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {31588#true} {31648#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {31648#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:53:38,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {31648#(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; {31670#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:53:38,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {31670#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {31670#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:53:38,817 INFO L272 TraceCheckUtils]: 27: Hoare triple {31670#(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)); {31588#true} is VALID [2022-04-08 07:53:38,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,818 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31588#true} {31670#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {31670#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:53:38,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {31670#(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; {31692#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:53:38,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {31692#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {31692#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:53:38,819 INFO L272 TraceCheckUtils]: 34: Hoare triple {31692#(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)); {31588#true} is VALID [2022-04-08 07:53:38,819 INFO L290 TraceCheckUtils]: 35: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,819 INFO L290 TraceCheckUtils]: 36: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,819 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {31588#true} {31692#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {31692#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:53:38,820 INFO L290 TraceCheckUtils]: 39: Hoare triple {31692#(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; {31714#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:53:38,820 INFO L290 TraceCheckUtils]: 40: Hoare triple {31714#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {31714#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:53:38,820 INFO L272 TraceCheckUtils]: 41: Hoare triple {31714#(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)); {31588#true} is VALID [2022-04-08 07:53:38,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,820 INFO L290 TraceCheckUtils]: 44: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,821 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {31588#true} {31714#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #54#return; {31714#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:53:38,821 INFO L290 TraceCheckUtils]: 46: Hoare triple {31714#(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; {31736#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:53:38,821 INFO L290 TraceCheckUtils]: 47: Hoare triple {31736#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} assume !false; {31736#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:53:38,822 INFO L272 TraceCheckUtils]: 48: Hoare triple {31736#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {31588#true} is VALID [2022-04-08 07:53:38,822 INFO L290 TraceCheckUtils]: 49: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,822 INFO L290 TraceCheckUtils]: 50: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,822 INFO L290 TraceCheckUtils]: 51: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,822 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {31588#true} {31736#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} #54#return; {31736#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:53:38,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {31736#(and (= (+ (- 2) main_~y~0) 3) (= 3 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {31758#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:53:38,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {31758#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {31758#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:53:38,823 INFO L272 TraceCheckUtils]: 55: Hoare triple {31758#(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)); {31588#true} is VALID [2022-04-08 07:53:38,823 INFO L290 TraceCheckUtils]: 56: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,823 INFO L290 TraceCheckUtils]: 57: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,823 INFO L290 TraceCheckUtils]: 58: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,823 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {31588#true} {31758#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {31758#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:53:38,824 INFO L290 TraceCheckUtils]: 60: Hoare triple {31758#(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; {31780#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:53:38,824 INFO L290 TraceCheckUtils]: 61: Hoare triple {31780#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {31780#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:53:38,824 INFO L272 TraceCheckUtils]: 62: Hoare triple {31780#(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)); {31588#true} is VALID [2022-04-08 07:53:38,824 INFO L290 TraceCheckUtils]: 63: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,824 INFO L290 TraceCheckUtils]: 64: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,824 INFO L290 TraceCheckUtils]: 65: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,825 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {31588#true} {31780#(and (= 7 main_~y~0) (= 7 main_~c~0))} #54#return; {31780#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:53:38,825 INFO L290 TraceCheckUtils]: 67: Hoare triple {31780#(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; {31802#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:53:38,825 INFO L290 TraceCheckUtils]: 68: Hoare triple {31802#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} assume !false; {31802#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:53:38,826 INFO L272 TraceCheckUtils]: 69: Hoare triple {31802#(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)); {31588#true} is VALID [2022-04-08 07:53:38,826 INFO L290 TraceCheckUtils]: 70: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,826 INFO L290 TraceCheckUtils]: 71: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,826 INFO L290 TraceCheckUtils]: 72: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,826 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {31588#true} {31802#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} #54#return; {31802#(and (= 7 (+ (- 1) main_~y~0)) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:53:38,827 INFO L290 TraceCheckUtils]: 74: Hoare triple {31802#(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; {31824#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:53:38,827 INFO L290 TraceCheckUtils]: 75: Hoare triple {31824#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {31824#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:53:38,827 INFO L272 TraceCheckUtils]: 76: Hoare triple {31824#(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)); {31588#true} is VALID [2022-04-08 07:53:38,827 INFO L290 TraceCheckUtils]: 77: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,827 INFO L290 TraceCheckUtils]: 78: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,827 INFO L290 TraceCheckUtils]: 79: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,828 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {31588#true} {31824#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {31824#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:53:38,828 INFO L290 TraceCheckUtils]: 81: Hoare triple {31824#(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; {31846#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:53:38,828 INFO L290 TraceCheckUtils]: 82: Hoare triple {31846#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {31846#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:53:38,828 INFO L272 TraceCheckUtils]: 83: Hoare triple {31846#(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)); {31588#true} is VALID [2022-04-08 07:53:38,828 INFO L290 TraceCheckUtils]: 84: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,829 INFO L290 TraceCheckUtils]: 85: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,829 INFO L290 TraceCheckUtils]: 86: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,829 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31588#true} {31846#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {31846#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:53:38,829 INFO L290 TraceCheckUtils]: 88: Hoare triple {31846#(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; {31868#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 07:53:38,830 INFO L290 TraceCheckUtils]: 89: Hoare triple {31868#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {31868#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 07:53:38,830 INFO L272 TraceCheckUtils]: 90: Hoare triple {31868#(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)); {31588#true} is VALID [2022-04-08 07:53:38,830 INFO L290 TraceCheckUtils]: 91: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,830 INFO L290 TraceCheckUtils]: 92: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,830 INFO L290 TraceCheckUtils]: 93: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,830 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {31588#true} {31868#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {31868#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 07:53:38,831 INFO L290 TraceCheckUtils]: 95: Hoare triple {31868#(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; {31890#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:53:38,831 INFO L290 TraceCheckUtils]: 96: Hoare triple {31890#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} assume !false; {31890#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:53:38,831 INFO L272 TraceCheckUtils]: 97: Hoare triple {31890#(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)); {31588#true} is VALID [2022-04-08 07:53:38,831 INFO L290 TraceCheckUtils]: 98: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,831 INFO L290 TraceCheckUtils]: 99: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,831 INFO L290 TraceCheckUtils]: 100: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,832 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {31588#true} {31890#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} #54#return; {31890#(and (= main_~y~0 12) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:53:38,832 INFO L290 TraceCheckUtils]: 102: Hoare triple {31890#(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; {31912#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:53:38,832 INFO L290 TraceCheckUtils]: 103: Hoare triple {31912#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} assume !false; {31912#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:53:38,833 INFO L272 TraceCheckUtils]: 104: Hoare triple {31912#(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)); {31588#true} is VALID [2022-04-08 07:53:38,833 INFO L290 TraceCheckUtils]: 105: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,833 INFO L290 TraceCheckUtils]: 106: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,833 INFO L290 TraceCheckUtils]: 107: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,833 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {31588#true} {31912#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} #54#return; {31912#(and (= (+ main_~c~0 (- 3)) 10) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:53:38,834 INFO L290 TraceCheckUtils]: 109: Hoare triple {31912#(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; {31934#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-08 07:53:38,834 INFO L290 TraceCheckUtils]: 110: Hoare triple {31934#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} assume !false; {31934#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-08 07:53:38,834 INFO L272 TraceCheckUtils]: 111: Hoare triple {31934#(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)); {31588#true} is VALID [2022-04-08 07:53:38,834 INFO L290 TraceCheckUtils]: 112: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,834 INFO L290 TraceCheckUtils]: 113: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,834 INFO L290 TraceCheckUtils]: 114: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,835 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {31588#true} {31934#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} #54#return; {31934#(and (= (+ (- 2) main_~y~0) 12) (= main_~c~0 14))} is VALID [2022-04-08 07:53:38,835 INFO L290 TraceCheckUtils]: 116: Hoare triple {31934#(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; {31956#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 07:53:38,835 INFO L290 TraceCheckUtils]: 117: Hoare triple {31956#(and (= main_~c~0 15) (= main_~y~0 15))} assume !false; {31956#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 07:53:38,835 INFO L272 TraceCheckUtils]: 118: Hoare triple {31956#(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)); {31588#true} is VALID [2022-04-08 07:53:38,835 INFO L290 TraceCheckUtils]: 119: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,835 INFO L290 TraceCheckUtils]: 120: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,836 INFO L290 TraceCheckUtils]: 121: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,836 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {31588#true} {31956#(and (= main_~c~0 15) (= main_~y~0 15))} #54#return; {31956#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-08 07:53:38,836 INFO L290 TraceCheckUtils]: 123: Hoare triple {31956#(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; {31978#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:53:38,837 INFO L290 TraceCheckUtils]: 124: Hoare triple {31978#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {31978#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:53:38,837 INFO L272 TraceCheckUtils]: 125: Hoare triple {31978#(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)); {31588#true} is VALID [2022-04-08 07:53:38,837 INFO L290 TraceCheckUtils]: 126: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,837 INFO L290 TraceCheckUtils]: 127: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,837 INFO L290 TraceCheckUtils]: 128: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,837 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {31588#true} {31978#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {31978#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:53:38,838 INFO L290 TraceCheckUtils]: 130: Hoare triple {31978#(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; {32000#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-08 07:53:38,838 INFO L290 TraceCheckUtils]: 131: Hoare triple {32000#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !false; {32000#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-08 07:53:38,838 INFO L272 TraceCheckUtils]: 132: Hoare triple {32000#(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)); {31588#true} is VALID [2022-04-08 07:53:38,838 INFO L290 TraceCheckUtils]: 133: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,838 INFO L290 TraceCheckUtils]: 134: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,838 INFO L290 TraceCheckUtils]: 135: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,839 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {31588#true} {32000#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} #54#return; {32000#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-08 07:53:38,839 INFO L290 TraceCheckUtils]: 137: Hoare triple {32000#(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; {32022#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-08 07:53:38,839 INFO L290 TraceCheckUtils]: 138: Hoare triple {32022#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} assume !false; {32022#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-08 07:53:38,839 INFO L272 TraceCheckUtils]: 139: Hoare triple {32022#(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)); {31588#true} is VALID [2022-04-08 07:53:38,840 INFO L290 TraceCheckUtils]: 140: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,840 INFO L290 TraceCheckUtils]: 141: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,840 INFO L290 TraceCheckUtils]: 142: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,840 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {31588#true} {32022#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} #54#return; {32022#(and (= (+ (- 2) main_~y~0) 16) (= main_~c~0 18))} is VALID [2022-04-08 07:53:38,840 INFO L290 TraceCheckUtils]: 144: Hoare triple {32022#(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; {32044#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:53:38,841 INFO L290 TraceCheckUtils]: 145: Hoare triple {32044#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {32044#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:53:38,841 INFO L272 TraceCheckUtils]: 146: Hoare triple {32044#(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)); {31588#true} is VALID [2022-04-08 07:53:38,841 INFO L290 TraceCheckUtils]: 147: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,841 INFO L290 TraceCheckUtils]: 148: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,841 INFO L290 TraceCheckUtils]: 149: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,841 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {31588#true} {32044#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {32044#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:53:38,842 INFO L290 TraceCheckUtils]: 151: Hoare triple {32044#(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; {32066#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:53:38,842 INFO L290 TraceCheckUtils]: 152: Hoare triple {32066#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {32066#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:53:38,842 INFO L272 TraceCheckUtils]: 153: Hoare triple {32066#(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)); {31588#true} is VALID [2022-04-08 07:53:38,842 INFO L290 TraceCheckUtils]: 154: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,842 INFO L290 TraceCheckUtils]: 155: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,842 INFO L290 TraceCheckUtils]: 156: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,843 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {31588#true} {32066#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #54#return; {32066#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:53:38,843 INFO L290 TraceCheckUtils]: 158: Hoare triple {32066#(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; {32088#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 07:53:38,843 INFO L290 TraceCheckUtils]: 159: Hoare triple {32088#(and (= main_~c~0 21) (= main_~y~0 21))} assume !false; {32088#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 07:53:38,843 INFO L272 TraceCheckUtils]: 160: Hoare triple {32088#(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)); {31588#true} is VALID [2022-04-08 07:53:38,844 INFO L290 TraceCheckUtils]: 161: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,844 INFO L290 TraceCheckUtils]: 162: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,844 INFO L290 TraceCheckUtils]: 163: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,844 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {31588#true} {32088#(and (= main_~c~0 21) (= main_~y~0 21))} #54#return; {32088#(and (= main_~c~0 21) (= main_~y~0 21))} is VALID [2022-04-08 07:53:38,844 INFO L290 TraceCheckUtils]: 165: Hoare triple {32088#(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; {32110#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:53:38,845 INFO L290 TraceCheckUtils]: 166: Hoare triple {32110#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {32110#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:53:38,845 INFO L272 TraceCheckUtils]: 167: Hoare triple {32110#(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)); {31588#true} is VALID [2022-04-08 07:53:38,845 INFO L290 TraceCheckUtils]: 168: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,845 INFO L290 TraceCheckUtils]: 169: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,845 INFO L290 TraceCheckUtils]: 170: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,845 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {31588#true} {32110#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #54#return; {32110#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:53:38,846 INFO L290 TraceCheckUtils]: 172: Hoare triple {32110#(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; {32132#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:53:38,846 INFO L290 TraceCheckUtils]: 173: Hoare triple {32132#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} assume !false; {32132#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:53:38,846 INFO L272 TraceCheckUtils]: 174: Hoare triple {32132#(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)); {31588#true} is VALID [2022-04-08 07:53:38,846 INFO L290 TraceCheckUtils]: 175: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,846 INFO L290 TraceCheckUtils]: 176: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,846 INFO L290 TraceCheckUtils]: 177: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,847 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {31588#true} {32132#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} #54#return; {32132#(and (= 21 (+ (- 2) main_~c~0)) (= 22 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:53:38,847 INFO L290 TraceCheckUtils]: 179: Hoare triple {32132#(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; {32154#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 07:53:38,848 INFO L290 TraceCheckUtils]: 180: Hoare triple {32154#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {32154#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 07:53:38,848 INFO L272 TraceCheckUtils]: 181: Hoare triple {32154#(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)); {31588#true} is VALID [2022-04-08 07:53:38,848 INFO L290 TraceCheckUtils]: 182: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,848 INFO L290 TraceCheckUtils]: 183: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,848 INFO L290 TraceCheckUtils]: 184: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,848 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {31588#true} {32154#(and (= main_~c~0 24) (= main_~y~0 24))} #54#return; {32154#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 07:53:38,849 INFO L290 TraceCheckUtils]: 186: Hoare triple {32154#(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; {32176#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 07:53:38,849 INFO L290 TraceCheckUtils]: 187: Hoare triple {32176#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !false; {32176#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 07:53:38,849 INFO L272 TraceCheckUtils]: 188: Hoare triple {32176#(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)); {31588#true} is VALID [2022-04-08 07:53:38,849 INFO L290 TraceCheckUtils]: 189: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,849 INFO L290 TraceCheckUtils]: 190: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,849 INFO L290 TraceCheckUtils]: 191: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,850 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {31588#true} {32176#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} #54#return; {32176#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 07:53:38,850 INFO L290 TraceCheckUtils]: 193: Hoare triple {32176#(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; {32198#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 07:53:38,851 INFO L290 TraceCheckUtils]: 194: Hoare triple {32198#(and (= main_~c~0 26) (= main_~y~0 26))} assume !false; {32198#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 07:53:38,851 INFO L272 TraceCheckUtils]: 195: Hoare triple {32198#(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)); {31588#true} is VALID [2022-04-08 07:53:38,851 INFO L290 TraceCheckUtils]: 196: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,851 INFO L290 TraceCheckUtils]: 197: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,851 INFO L290 TraceCheckUtils]: 198: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,851 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {31588#true} {32198#(and (= main_~c~0 26) (= main_~y~0 26))} #54#return; {32198#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 07:53:38,852 INFO L290 TraceCheckUtils]: 200: Hoare triple {32198#(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; {32220#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 07:53:38,852 INFO L290 TraceCheckUtils]: 201: Hoare triple {32220#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {32220#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 07:53:38,852 INFO L272 TraceCheckUtils]: 202: Hoare triple {32220#(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)); {31588#true} is VALID [2022-04-08 07:53:38,852 INFO L290 TraceCheckUtils]: 203: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,852 INFO L290 TraceCheckUtils]: 204: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,852 INFO L290 TraceCheckUtils]: 205: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,853 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {31588#true} {32220#(and (= main_~y~0 27) (= main_~c~0 27))} #54#return; {32220#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 07:53:38,853 INFO L290 TraceCheckUtils]: 207: Hoare triple {32220#(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; {32242#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-08 07:53:38,853 INFO L290 TraceCheckUtils]: 208: Hoare triple {32242#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} assume !false; {32242#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-08 07:53:38,853 INFO L272 TraceCheckUtils]: 209: Hoare triple {32242#(and (= (+ (- 1) main_~c~0) 27) (= 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)); {31588#true} is VALID [2022-04-08 07:53:38,853 INFO L290 TraceCheckUtils]: 210: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,854 INFO L290 TraceCheckUtils]: 211: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,854 INFO L290 TraceCheckUtils]: 212: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,854 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {31588#true} {32242#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} #54#return; {32242#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-08 07:53:38,854 INFO L290 TraceCheckUtils]: 214: Hoare triple {32242#(and (= (+ (- 1) main_~c~0) 27) (= 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; {32264#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 07:53:38,855 INFO L290 TraceCheckUtils]: 215: Hoare triple {32264#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !false; {32264#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 07:53:38,855 INFO L272 TraceCheckUtils]: 216: Hoare triple {32264#(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)); {31588#true} is VALID [2022-04-08 07:53:38,855 INFO L290 TraceCheckUtils]: 217: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,855 INFO L290 TraceCheckUtils]: 218: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,855 INFO L290 TraceCheckUtils]: 219: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,855 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {31588#true} {32264#(and (= 29 main_~y~0) (= 29 main_~c~0))} #54#return; {32264#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 07:53:38,856 INFO L290 TraceCheckUtils]: 221: Hoare triple {32264#(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; {32286#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 07:53:38,856 INFO L290 TraceCheckUtils]: 222: Hoare triple {32286#(and (= 30 main_~y~0) (= 30 main_~c~0))} assume !false; {32286#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 07:53:38,856 INFO L272 TraceCheckUtils]: 223: Hoare triple {32286#(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)); {31588#true} is VALID [2022-04-08 07:53:38,856 INFO L290 TraceCheckUtils]: 224: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,856 INFO L290 TraceCheckUtils]: 225: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,856 INFO L290 TraceCheckUtils]: 226: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,857 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {31588#true} {32286#(and (= 30 main_~y~0) (= 30 main_~c~0))} #54#return; {32286#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 07:53:38,857 INFO L290 TraceCheckUtils]: 228: Hoare triple {32286#(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; {32308#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-08 07:53:38,857 INFO L290 TraceCheckUtils]: 229: Hoare triple {32308#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !false; {32308#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-08 07:53:38,857 INFO L272 TraceCheckUtils]: 230: Hoare triple {32308#(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)); {31588#true} is VALID [2022-04-08 07:53:38,858 INFO L290 TraceCheckUtils]: 231: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,858 INFO L290 TraceCheckUtils]: 232: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,858 INFO L290 TraceCheckUtils]: 233: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,858 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {31588#true} {32308#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} #54#return; {32308#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-08 07:53:38,858 INFO L290 TraceCheckUtils]: 235: Hoare triple {32308#(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; {32330#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-08 07:53:38,859 INFO L290 TraceCheckUtils]: 236: Hoare triple {32330#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} assume !false; {32330#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-08 07:53:38,859 INFO L272 TraceCheckUtils]: 237: Hoare triple {32330#(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)); {31588#true} is VALID [2022-04-08 07:53:38,859 INFO L290 TraceCheckUtils]: 238: Hoare triple {31588#true} ~cond := #in~cond; {31588#true} is VALID [2022-04-08 07:53:38,859 INFO L290 TraceCheckUtils]: 239: Hoare triple {31588#true} assume !(0 == ~cond); {31588#true} is VALID [2022-04-08 07:53:38,859 INFO L290 TraceCheckUtils]: 240: Hoare triple {31588#true} assume true; {31588#true} is VALID [2022-04-08 07:53:38,860 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {31588#true} {32330#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} #54#return; {32330#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} is VALID [2022-04-08 07:53:38,863 INFO L290 TraceCheckUtils]: 242: Hoare triple {32330#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~c~0 32))} assume !(~c~0 < ~k~0); {32352#(and (= 32 main_~y~0) (< 31 main_~k~0) (<= main_~k~0 32))} is VALID [2022-04-08 07:53:38,864 INFO L272 TraceCheckUtils]: 243: Hoare triple {32352#(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)); {32356#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:53:38,864 INFO L290 TraceCheckUtils]: 244: Hoare triple {32356#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32360#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:53:38,865 INFO L290 TraceCheckUtils]: 245: Hoare triple {32360#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31589#false} is VALID [2022-04-08 07:53:38,865 INFO L290 TraceCheckUtils]: 246: Hoare triple {31589#false} assume !false; {31589#false} is VALID [2022-04-08 07:53:38,868 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 07:53:38,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:53:39,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:53:39,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725486655] [2022-04-08 07:53:39,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:53:39,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373497396] [2022-04-08 07:53:39,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373497396] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:53:39,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:53:39,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2022-04-08 07:53:39,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:53:39,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1113383357] [2022-04-08 07:53:39,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1113383357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:53:39,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:53:39,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-08 07:53:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226299440] [2022-04-08 07:53:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:53:39,271 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) Word has length 247 [2022-04-08 07:53:39,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:53:39,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-08 07:53:39,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:53:39,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-08 07:53:39,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:53:39,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-08 07:53:39,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 07:53:39,861 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-08 07:54:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:54:04,479 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2022-04-08 07:54:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 07:54:04,480 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) Word has length 247 [2022-04-08 07:54:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:54:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-08 07:54:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 160 transitions. [2022-04-08 07:54:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-08 07:54:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 160 transitions. [2022-04-08 07:54:04,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 160 transitions. [2022-04-08 07:54:05,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:54:05,113 INFO L225 Difference]: With dead ends: 136 [2022-04-08 07:54:05,113 INFO L226 Difference]: Without dead ends: 131 [2022-04-08 07:54:05,113 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=1679, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 07:54:05,114 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 3647 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 3647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:54:05,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1913 Invalid, 3647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3647 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2022-04-08 07:54:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-08 07:54:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-08 07:54:05,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:54:05,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 38 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 07:54:05,250 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 38 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 07:54:05,250 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 38 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 07:54:05,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:54:05,252 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-08 07:54:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-08 07:54:05,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:54:05,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:54:05,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 38 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 131 states. [2022-04-08 07:54:05,253 INFO L87 Difference]: Start difference. First operand has 131 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 38 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 131 states. [2022-04-08 07:54:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:54:05,255 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-08 07:54:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-08 07:54:05,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:54:05,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:54:05,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:54:05,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:54:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 38 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-08 07:54:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2022-04-08 07:54:05,258 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 247 [2022-04-08 07:54:05,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:54:05,258 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2022-04-08 07:54:05,258 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 35 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 34 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-08 07:54:05,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 162 transitions. [2022-04-08 07:54:06,425 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 07:54:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-08 07:54:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-04-08 07:54:06,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:54:06,426 INFO L499 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:54:06,432 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 07:54:06,627 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 07:54:06,627 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:54:06,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:54:06,627 INFO L85 PathProgramCache]: Analyzing trace with hash -596558904, now seen corresponding path program 65 times [2022-04-08 07:54:06,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:54:06,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [725325244] [2022-04-08 07:54:06,691 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:54:06,691 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:54:06,691 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:54:06,691 INFO L85 PathProgramCache]: Analyzing trace with hash -596558904, now seen corresponding path program 66 times [2022-04-08 07:54:06,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:54:06,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574578750] [2022-04-08 07:54:06,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:54:06,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:54:06,706 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:54:06,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136479321] [2022-04-08 07:54:06,707 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:54:06,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:54:06,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:54:06,708 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 07:54:06,746 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 07:54:14,137 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2022-04-08 07:54:14,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:54:14,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 140 conjunts are in the unsatisfiable core [2022-04-08 07:54:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:54:14,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:54:15,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {33208#true} call ULTIMATE.init(); {33208#true} is VALID [2022-04-08 07:54:15,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {33208#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); {33208#true} is VALID [2022-04-08 07:54:15,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33208#true} {33208#true} #60#return; {33208#true} is VALID [2022-04-08 07:54:15,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {33208#true} call #t~ret5 := main(); {33208#true} is VALID [2022-04-08 07:54:15,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {33208#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; {33208#true} is VALID [2022-04-08 07:54:15,531 INFO L272 TraceCheckUtils]: 6: Hoare triple {33208#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {33208#true} is VALID [2022-04-08 07:54:15,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,532 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33208#true} {33208#true} #52#return; {33208#true} is VALID [2022-04-08 07:54:15,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {33208#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33246#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:54:15,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {33246#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {33246#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:54:15,532 INFO L272 TraceCheckUtils]: 13: Hoare triple {33246#(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)); {33208#true} is VALID [2022-04-08 07:54:15,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,533 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {33208#true} {33246#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {33246#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:54:15,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {33246#(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; {33268#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:54:15,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {33268#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {33268#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:54:15,534 INFO L272 TraceCheckUtils]: 20: Hoare triple {33268#(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)); {33208#true} is VALID [2022-04-08 07:54:15,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,534 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {33208#true} {33268#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {33268#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:54:15,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {33268#(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; {33290#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:54:15,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {33290#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {33290#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:54:15,535 INFO L272 TraceCheckUtils]: 27: Hoare triple {33290#(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)); {33208#true} is VALID [2022-04-08 07:54:15,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,536 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {33208#true} {33290#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {33290#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:54:15,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {33290#(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; {33312#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:54:15,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {33312#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {33312#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:54:15,536 INFO L272 TraceCheckUtils]: 34: Hoare triple {33312#(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)); {33208#true} is VALID [2022-04-08 07:54:15,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,537 INFO L290 TraceCheckUtils]: 37: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,537 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {33208#true} {33312#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {33312#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:54:15,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {33312#(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; {33334#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:54:15,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {33334#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {33334#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:54:15,538 INFO L272 TraceCheckUtils]: 41: Hoare triple {33334#(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)); {33208#true} is VALID [2022-04-08 07:54:15,538 INFO L290 TraceCheckUtils]: 42: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,538 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {33208#true} {33334#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {33334#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:54:15,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {33334#(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; {33356#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:54:15,539 INFO L290 TraceCheckUtils]: 47: Hoare triple {33356#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {33356#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:54:15,539 INFO L272 TraceCheckUtils]: 48: Hoare triple {33356#(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)); {33208#true} is VALID [2022-04-08 07:54:15,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,540 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {33208#true} {33356#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #54#return; {33356#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:54:15,540 INFO L290 TraceCheckUtils]: 53: Hoare triple {33356#(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; {33378#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:54:15,540 INFO L290 TraceCheckUtils]: 54: Hoare triple {33378#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {33378#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:54:15,540 INFO L272 TraceCheckUtils]: 55: Hoare triple {33378#(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)); {33208#true} is VALID [2022-04-08 07:54:15,540 INFO L290 TraceCheckUtils]: 56: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,541 INFO L290 TraceCheckUtils]: 57: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,541 INFO L290 TraceCheckUtils]: 58: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,541 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {33208#true} {33378#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {33378#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:54:15,541 INFO L290 TraceCheckUtils]: 60: Hoare triple {33378#(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; {33400#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:54:15,542 INFO L290 TraceCheckUtils]: 61: Hoare triple {33400#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {33400#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:54:15,542 INFO L272 TraceCheckUtils]: 62: Hoare triple {33400#(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)); {33208#true} is VALID [2022-04-08 07:54:15,542 INFO L290 TraceCheckUtils]: 63: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,542 INFO L290 TraceCheckUtils]: 64: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,542 INFO L290 TraceCheckUtils]: 65: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,542 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {33208#true} {33400#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #54#return; {33400#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:54:15,543 INFO L290 TraceCheckUtils]: 67: Hoare triple {33400#(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; {33422#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:54:15,543 INFO L290 TraceCheckUtils]: 68: Hoare triple {33422#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} assume !false; {33422#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:54:15,543 INFO L272 TraceCheckUtils]: 69: Hoare triple {33422#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33208#true} is VALID [2022-04-08 07:54:15,543 INFO L290 TraceCheckUtils]: 70: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,543 INFO L290 TraceCheckUtils]: 71: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,543 INFO L290 TraceCheckUtils]: 72: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,544 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {33208#true} {33422#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} #54#return; {33422#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:54:15,544 INFO L290 TraceCheckUtils]: 74: Hoare triple {33422#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 07:54:15,544 INFO L290 TraceCheckUtils]: 75: Hoare triple {33444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !false; {33444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 07:54:15,544 INFO L272 TraceCheckUtils]: 76: Hoare triple {33444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33208#true} is VALID [2022-04-08 07:54:15,545 INFO L290 TraceCheckUtils]: 77: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,545 INFO L290 TraceCheckUtils]: 78: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,545 INFO L290 TraceCheckUtils]: 79: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,545 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {33208#true} {33444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} #54#return; {33444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 07:54:15,545 INFO L290 TraceCheckUtils]: 81: Hoare triple {33444#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33466#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:54:15,546 INFO L290 TraceCheckUtils]: 82: Hoare triple {33466#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {33466#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:54:15,546 INFO L272 TraceCheckUtils]: 83: Hoare triple {33466#(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)); {33208#true} is VALID [2022-04-08 07:54:15,546 INFO L290 TraceCheckUtils]: 84: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,546 INFO L290 TraceCheckUtils]: 85: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,546 INFO L290 TraceCheckUtils]: 86: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,546 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {33208#true} {33466#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {33466#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:54:15,547 INFO L290 TraceCheckUtils]: 88: Hoare triple {33466#(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; {33488#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:54:15,547 INFO L290 TraceCheckUtils]: 89: Hoare triple {33488#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {33488#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:54:15,547 INFO L272 TraceCheckUtils]: 90: Hoare triple {33488#(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)); {33208#true} is VALID [2022-04-08 07:54:15,547 INFO L290 TraceCheckUtils]: 91: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,547 INFO L290 TraceCheckUtils]: 92: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,547 INFO L290 TraceCheckUtils]: 93: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,548 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {33208#true} {33488#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {33488#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:54:15,548 INFO L290 TraceCheckUtils]: 95: Hoare triple {33488#(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; {33510#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:54:15,548 INFO L290 TraceCheckUtils]: 96: Hoare triple {33510#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !false; {33510#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:54:15,549 INFO L272 TraceCheckUtils]: 97: Hoare triple {33510#(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)); {33208#true} is VALID [2022-04-08 07:54:15,549 INFO L290 TraceCheckUtils]: 98: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,549 INFO L290 TraceCheckUtils]: 99: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,549 INFO L290 TraceCheckUtils]: 100: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,549 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {33208#true} {33510#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #54#return; {33510#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:54:15,549 INFO L290 TraceCheckUtils]: 102: Hoare triple {33510#(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; {33532#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-08 07:54:15,550 INFO L290 TraceCheckUtils]: 103: Hoare triple {33532#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} assume !false; {33532#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-08 07:54:15,550 INFO L272 TraceCheckUtils]: 104: Hoare triple {33532#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33208#true} is VALID [2022-04-08 07:54:15,550 INFO L290 TraceCheckUtils]: 105: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,550 INFO L290 TraceCheckUtils]: 106: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,550 INFO L290 TraceCheckUtils]: 107: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,550 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {33208#true} {33532#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} #54#return; {33532#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-08 07:54:15,551 INFO L290 TraceCheckUtils]: 109: Hoare triple {33532#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33554#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} is VALID [2022-04-08 07:54:15,551 INFO L290 TraceCheckUtils]: 110: Hoare triple {33554#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} assume !false; {33554#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} is VALID [2022-04-08 07:54:15,551 INFO L272 TraceCheckUtils]: 111: Hoare triple {33554#(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)); {33208#true} is VALID [2022-04-08 07:54:15,551 INFO L290 TraceCheckUtils]: 112: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,551 INFO L290 TraceCheckUtils]: 113: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,551 INFO L290 TraceCheckUtils]: 114: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,552 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {33208#true} {33554#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} #54#return; {33554#(and (= (+ main_~y~0 (- 3)) 11) (= main_~c~0 14))} is VALID [2022-04-08 07:54:15,552 INFO L290 TraceCheckUtils]: 116: Hoare triple {33554#(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; {33576#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 07:54:15,552 INFO L290 TraceCheckUtils]: 117: Hoare triple {33576#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 1) main_~c~0) 14))} assume !false; {33576#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 07:54:15,553 INFO L272 TraceCheckUtils]: 118: Hoare triple {33576#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 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)); {33208#true} is VALID [2022-04-08 07:54:15,553 INFO L290 TraceCheckUtils]: 119: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,553 INFO L290 TraceCheckUtils]: 120: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,553 INFO L290 TraceCheckUtils]: 121: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,553 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {33208#true} {33576#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 1) main_~c~0) 14))} #54#return; {33576#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 07:54:15,553 INFO L290 TraceCheckUtils]: 123: Hoare triple {33576#(and (= (+ main_~y~0 (- 4)) 11) (= (+ (- 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; {33598#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:54:15,554 INFO L290 TraceCheckUtils]: 124: Hoare triple {33598#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {33598#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:54:15,554 INFO L272 TraceCheckUtils]: 125: Hoare triple {33598#(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)); {33208#true} is VALID [2022-04-08 07:54:15,554 INFO L290 TraceCheckUtils]: 126: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,554 INFO L290 TraceCheckUtils]: 127: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,554 INFO L290 TraceCheckUtils]: 128: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,554 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {33208#true} {33598#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {33598#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:54:15,555 INFO L290 TraceCheckUtils]: 130: Hoare triple {33598#(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; {33620#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-08 07:54:15,555 INFO L290 TraceCheckUtils]: 131: Hoare triple {33620#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} assume !false; {33620#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-08 07:54:15,555 INFO L272 TraceCheckUtils]: 132: Hoare triple {33620#(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)); {33208#true} is VALID [2022-04-08 07:54:15,555 INFO L290 TraceCheckUtils]: 133: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,555 INFO L290 TraceCheckUtils]: 134: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,555 INFO L290 TraceCheckUtils]: 135: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,556 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {33208#true} {33620#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} #54#return; {33620#(and (= (+ (- 1) main_~c~0) 16) (= main_~y~0 17))} is VALID [2022-04-08 07:54:15,556 INFO L290 TraceCheckUtils]: 137: Hoare triple {33620#(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; {33642#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:54:15,556 INFO L290 TraceCheckUtils]: 138: Hoare triple {33642#(and (= main_~c~0 18) (= main_~y~0 18))} assume !false; {33642#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:54:15,557 INFO L272 TraceCheckUtils]: 139: Hoare triple {33642#(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)); {33208#true} is VALID [2022-04-08 07:54:15,557 INFO L290 TraceCheckUtils]: 140: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,557 INFO L290 TraceCheckUtils]: 141: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,557 INFO L290 TraceCheckUtils]: 142: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,557 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {33208#true} {33642#(and (= main_~c~0 18) (= main_~y~0 18))} #54#return; {33642#(and (= main_~c~0 18) (= main_~y~0 18))} is VALID [2022-04-08 07:54:15,558 INFO L290 TraceCheckUtils]: 144: Hoare triple {33642#(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; {33664#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 07:54:15,558 INFO L290 TraceCheckUtils]: 145: Hoare triple {33664#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} assume !false; {33664#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 07:54:15,558 INFO L272 TraceCheckUtils]: 146: Hoare triple {33664#(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)); {33208#true} is VALID [2022-04-08 07:54:15,558 INFO L290 TraceCheckUtils]: 147: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,558 INFO L290 TraceCheckUtils]: 148: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,558 INFO L290 TraceCheckUtils]: 149: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,559 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {33208#true} {33664#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} #54#return; {33664#(and (= 19 main_~y~0) (= (+ (- 1) main_~c~0) 18))} is VALID [2022-04-08 07:54:15,559 INFO L290 TraceCheckUtils]: 151: Hoare triple {33664#(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; {33686#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-08 07:54:15,559 INFO L290 TraceCheckUtils]: 152: Hoare triple {33686#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} assume !false; {33686#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-08 07:54:15,559 INFO L272 TraceCheckUtils]: 153: Hoare triple {33686#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33208#true} is VALID [2022-04-08 07:54:15,559 INFO L290 TraceCheckUtils]: 154: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,559 INFO L290 TraceCheckUtils]: 155: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,560 INFO L290 TraceCheckUtils]: 156: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,560 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {33208#true} {33686#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} #54#return; {33686#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} is VALID [2022-04-08 07:54:15,560 INFO L290 TraceCheckUtils]: 158: Hoare triple {33686#(and (= 19 (+ (- 1) main_~y~0)) (= main_~c~0 20))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33708#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:54:15,561 INFO L290 TraceCheckUtils]: 159: Hoare triple {33708#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !false; {33708#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:54:15,561 INFO L272 TraceCheckUtils]: 160: Hoare triple {33708#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33208#true} is VALID [2022-04-08 07:54:15,561 INFO L290 TraceCheckUtils]: 161: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,561 INFO L290 TraceCheckUtils]: 162: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,561 INFO L290 TraceCheckUtils]: 163: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,561 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {33208#true} {33708#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} #54#return; {33708#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:54:15,562 INFO L290 TraceCheckUtils]: 165: Hoare triple {33708#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33730#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:54:15,562 INFO L290 TraceCheckUtils]: 166: Hoare triple {33730#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {33730#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:54:15,562 INFO L272 TraceCheckUtils]: 167: Hoare triple {33730#(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)); {33208#true} is VALID [2022-04-08 07:54:15,562 INFO L290 TraceCheckUtils]: 168: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,562 INFO L290 TraceCheckUtils]: 169: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,562 INFO L290 TraceCheckUtils]: 170: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,563 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {33208#true} {33730#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #54#return; {33730#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:54:15,563 INFO L290 TraceCheckUtils]: 172: Hoare triple {33730#(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; {33752#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} is VALID [2022-04-08 07:54:15,563 INFO L290 TraceCheckUtils]: 173: Hoare triple {33752#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} assume !false; {33752#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} is VALID [2022-04-08 07:54:15,563 INFO L272 TraceCheckUtils]: 174: Hoare triple {33752#(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)); {33208#true} is VALID [2022-04-08 07:54:15,563 INFO L290 TraceCheckUtils]: 175: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,563 INFO L290 TraceCheckUtils]: 176: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,564 INFO L290 TraceCheckUtils]: 177: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,564 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {33208#true} {33752#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} #54#return; {33752#(and (= 21 (+ (- 2) main_~c~0)) (= 23 main_~y~0))} is VALID [2022-04-08 07:54:15,564 INFO L290 TraceCheckUtils]: 179: Hoare triple {33752#(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; {33774#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-08 07:54:15,565 INFO L290 TraceCheckUtils]: 180: Hoare triple {33774#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} assume !false; {33774#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-08 07:54:15,565 INFO L272 TraceCheckUtils]: 181: Hoare triple {33774#(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)); {33208#true} is VALID [2022-04-08 07:54:15,565 INFO L290 TraceCheckUtils]: 182: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,565 INFO L290 TraceCheckUtils]: 183: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,565 INFO L290 TraceCheckUtils]: 184: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,565 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {33208#true} {33774#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} #54#return; {33774#(and (= 23 (+ (- 1) main_~y~0)) (= main_~c~0 24))} is VALID [2022-04-08 07:54:15,566 INFO L290 TraceCheckUtils]: 186: Hoare triple {33774#(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; {33796#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} is VALID [2022-04-08 07:54:15,566 INFO L290 TraceCheckUtils]: 187: Hoare triple {33796#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} assume !false; {33796#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} is VALID [2022-04-08 07:54:15,566 INFO L272 TraceCheckUtils]: 188: Hoare triple {33796#(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)); {33208#true} is VALID [2022-04-08 07:54:15,566 INFO L290 TraceCheckUtils]: 189: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,566 INFO L290 TraceCheckUtils]: 190: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,566 INFO L290 TraceCheckUtils]: 191: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,567 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {33208#true} {33796#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} #54#return; {33796#(and (= 23 (+ (- 2) main_~y~0)) (= main_~c~0 25))} is VALID [2022-04-08 07:54:15,567 INFO L290 TraceCheckUtils]: 193: Hoare triple {33796#(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; {33818#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} is VALID [2022-04-08 07:54:15,567 INFO L290 TraceCheckUtils]: 194: Hoare triple {33818#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} assume !false; {33818#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} is VALID [2022-04-08 07:54:15,567 INFO L272 TraceCheckUtils]: 195: Hoare triple {33818#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33208#true} is VALID [2022-04-08 07:54:15,567 INFO L290 TraceCheckUtils]: 196: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,567 INFO L290 TraceCheckUtils]: 197: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,568 INFO L290 TraceCheckUtils]: 198: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,568 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {33208#true} {33818#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} #54#return; {33818#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} is VALID [2022-04-08 07:54:15,568 INFO L290 TraceCheckUtils]: 200: Hoare triple {33818#(and (= 23 (+ main_~y~0 (- 3))) (= main_~c~0 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33840#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} is VALID [2022-04-08 07:54:15,569 INFO L290 TraceCheckUtils]: 201: Hoare triple {33840#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} assume !false; {33840#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} is VALID [2022-04-08 07:54:15,569 INFO L272 TraceCheckUtils]: 202: Hoare triple {33840#(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)); {33208#true} is VALID [2022-04-08 07:54:15,569 INFO L290 TraceCheckUtils]: 203: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,569 INFO L290 TraceCheckUtils]: 204: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,569 INFO L290 TraceCheckUtils]: 205: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,569 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {33208#true} {33840#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} #54#return; {33840#(and (= (+ (- 1) main_~c~0) 26) (= main_~y~0 27))} is VALID [2022-04-08 07:54:15,570 INFO L290 TraceCheckUtils]: 207: Hoare triple {33840#(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; {33862#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 07:54:15,570 INFO L290 TraceCheckUtils]: 208: Hoare triple {33862#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} assume !false; {33862#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 07:54:15,570 INFO L272 TraceCheckUtils]: 209: Hoare triple {33862#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33208#true} is VALID [2022-04-08 07:54:15,570 INFO L290 TraceCheckUtils]: 210: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,570 INFO L290 TraceCheckUtils]: 211: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,570 INFO L290 TraceCheckUtils]: 212: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,571 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {33208#true} {33862#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} #54#return; {33862#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 07:54:15,571 INFO L290 TraceCheckUtils]: 214: Hoare triple {33862#(and (= main_~c~0 28) (= (+ (- 1) main_~y~0) 27))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33884#(and (= (+ (- 2) main_~y~0) 27) (= 29 main_~c~0))} is VALID [2022-04-08 07:54:15,571 INFO L290 TraceCheckUtils]: 215: Hoare triple {33884#(and (= (+ (- 2) main_~y~0) 27) (= 29 main_~c~0))} assume !false; {33884#(and (= (+ (- 2) main_~y~0) 27) (= 29 main_~c~0))} is VALID [2022-04-08 07:54:15,571 INFO L272 TraceCheckUtils]: 216: Hoare triple {33884#(and (= (+ (- 2) main_~y~0) 27) (= 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)); {33208#true} is VALID [2022-04-08 07:54:15,571 INFO L290 TraceCheckUtils]: 217: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,572 INFO L290 TraceCheckUtils]: 218: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,572 INFO L290 TraceCheckUtils]: 219: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,572 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {33208#true} {33884#(and (= (+ (- 2) main_~y~0) 27) (= 29 main_~c~0))} #54#return; {33884#(and (= (+ (- 2) main_~y~0) 27) (= 29 main_~c~0))} is VALID [2022-04-08 07:54:15,572 INFO L290 TraceCheckUtils]: 221: Hoare triple {33884#(and (= (+ (- 2) main_~y~0) 27) (= 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; {33906#(and (= (+ main_~y~0 (- 3)) 27) (= 30 main_~c~0))} is VALID [2022-04-08 07:54:15,573 INFO L290 TraceCheckUtils]: 222: Hoare triple {33906#(and (= (+ main_~y~0 (- 3)) 27) (= 30 main_~c~0))} assume !false; {33906#(and (= (+ main_~y~0 (- 3)) 27) (= 30 main_~c~0))} is VALID [2022-04-08 07:54:15,573 INFO L272 TraceCheckUtils]: 223: Hoare triple {33906#(and (= (+ main_~y~0 (- 3)) 27) (= 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)); {33208#true} is VALID [2022-04-08 07:54:15,573 INFO L290 TraceCheckUtils]: 224: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,573 INFO L290 TraceCheckUtils]: 225: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,573 INFO L290 TraceCheckUtils]: 226: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,573 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {33208#true} {33906#(and (= (+ main_~y~0 (- 3)) 27) (= 30 main_~c~0))} #54#return; {33906#(and (= (+ main_~y~0 (- 3)) 27) (= 30 main_~c~0))} is VALID [2022-04-08 07:54:15,574 INFO L290 TraceCheckUtils]: 228: Hoare triple {33906#(and (= (+ main_~y~0 (- 3)) 27) (= 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; {33928#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-08 07:54:15,574 INFO L290 TraceCheckUtils]: 229: Hoare triple {33928#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !false; {33928#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-08 07:54:15,574 INFO L272 TraceCheckUtils]: 230: Hoare triple {33928#(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)); {33208#true} is VALID [2022-04-08 07:54:15,574 INFO L290 TraceCheckUtils]: 231: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,574 INFO L290 TraceCheckUtils]: 232: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,574 INFO L290 TraceCheckUtils]: 233: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,575 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {33208#true} {33928#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} #54#return; {33928#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-08 07:54:15,575 INFO L290 TraceCheckUtils]: 235: Hoare triple {33928#(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; {33950#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:54:15,575 INFO L290 TraceCheckUtils]: 236: Hoare triple {33950#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} assume !false; {33950#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:54:15,575 INFO L272 TraceCheckUtils]: 237: Hoare triple {33950#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33208#true} is VALID [2022-04-08 07:54:15,576 INFO L290 TraceCheckUtils]: 238: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,576 INFO L290 TraceCheckUtils]: 239: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,576 INFO L290 TraceCheckUtils]: 240: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,576 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {33208#true} {33950#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} #54#return; {33950#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:54:15,576 INFO L290 TraceCheckUtils]: 242: Hoare triple {33950#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {33972#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-08 07:54:15,577 INFO L290 TraceCheckUtils]: 243: Hoare triple {33972#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} assume !false; {33972#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-08 07:54:15,577 INFO L272 TraceCheckUtils]: 244: Hoare triple {33972#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33208#true} is VALID [2022-04-08 07:54:15,577 INFO L290 TraceCheckUtils]: 245: Hoare triple {33208#true} ~cond := #in~cond; {33208#true} is VALID [2022-04-08 07:54:15,577 INFO L290 TraceCheckUtils]: 246: Hoare triple {33208#true} assume !(0 == ~cond); {33208#true} is VALID [2022-04-08 07:54:15,577 INFO L290 TraceCheckUtils]: 247: Hoare triple {33208#true} assume true; {33208#true} is VALID [2022-04-08 07:54:15,577 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {33208#true} {33972#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} #54#return; {33972#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} is VALID [2022-04-08 07:54:15,579 INFO L290 TraceCheckUtils]: 249: Hoare triple {33972#(and (= (+ (- 2) main_~y~0) 31) (<= main_~c~0 33) (< 32 main_~k~0))} assume !(~c~0 < ~k~0); {33994#(and (= (+ (- 2) main_~y~0) 31) (<= main_~k~0 33) (< 32 main_~k~0))} is VALID [2022-04-08 07:54:15,580 INFO L272 TraceCheckUtils]: 250: Hoare triple {33994#(and (= (+ (- 2) main_~y~0) 31) (<= main_~k~0 33) (< 32 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {33998#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:54:15,580 INFO L290 TraceCheckUtils]: 251: Hoare triple {33998#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34002#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:54:15,581 INFO L290 TraceCheckUtils]: 252: Hoare triple {34002#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33209#false} is VALID [2022-04-08 07:54:15,581 INFO L290 TraceCheckUtils]: 253: Hoare triple {33209#false} assume !false; {33209#false} is VALID [2022-04-08 07:54:15,582 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 07:54:15,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:54:15,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:54:15,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574578750] [2022-04-08 07:54:15,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:54:15,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136479321] [2022-04-08 07:54:15,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136479321] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:54:15,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:54:15,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2022-04-08 07:54:15,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:54:15,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [725325244] [2022-04-08 07:54:15,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [725325244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:54:15,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:54:15,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-08 07:54:15,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141154511] [2022-04-08 07:54:15,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:54:15,966 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) Word has length 254 [2022-04-08 07:54:15,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:54:15,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2022-04-08 07:54:16,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:54:16,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-08 07:54:16,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:54:16,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-08 07:54:16,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 07:54:16,604 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2022-04-08 07:54:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:54:47,383 INFO L93 Difference]: Finished difference Result 139 states and 171 transitions. [2022-04-08 07:54:47,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-08 07:54:47,383 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) Word has length 254 [2022-04-08 07:54:47,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:54:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2022-04-08 07:54:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 164 transitions. [2022-04-08 07:54:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2022-04-08 07:54:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 164 transitions. [2022-04-08 07:54:47,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 164 transitions. [2022-04-08 07:54:48,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:54:48,132 INFO L225 Difference]: With dead ends: 139 [2022-04-08 07:54:48,132 INFO L226 Difference]: Without dead ends: 134 [2022-04-08 07:54:48,133 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=1762, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 07:54:48,133 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 2 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 3859 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 3859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-04-08 07:54:48,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2003 Invalid, 3859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3859 Invalid, 0 Unknown, 0 Unchecked, 16.5s Time] [2022-04-08 07:54:48,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-08 07:54:48,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-04-08 07:54:48,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:54:48,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 134 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 39 states have call successors, (39), 7 states have call predecessors, (39), 5 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 07:54:48,278 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 134 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 39 states have call successors, (39), 7 states have call predecessors, (39), 5 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 07:54:48,278 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 134 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 39 states have call successors, (39), 7 states have call predecessors, (39), 5 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 07:54:48,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:54:48,280 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2022-04-08 07:54:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2022-04-08 07:54:48,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:54:48,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:54:48,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 39 states have call successors, (39), 7 states have call predecessors, (39), 5 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 134 states. [2022-04-08 07:54:48,281 INFO L87 Difference]: Start difference. First operand has 134 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 39 states have call successors, (39), 7 states have call predecessors, (39), 5 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 134 states. [2022-04-08 07:54:48,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:54:48,283 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2022-04-08 07:54:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2022-04-08 07:54:48,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:54:48,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:54:48,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:54:48,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:54:48,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 39 states have call successors, (39), 7 states have call predecessors, (39), 5 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 07:54:48,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2022-04-08 07:54:48,286 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 254 [2022-04-08 07:54:48,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:54:48,286 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2022-04-08 07:54:48,286 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 states have internal predecessors, (81), 36 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2022-04-08 07:54:48,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 166 transitions. [2022-04-08 07:54:49,388 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 07:54:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2022-04-08 07:54:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-04-08 07:54:49,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:54:49,389 INFO L499 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:54:49,397 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 07:54:49,589 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 07:54:49,589 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:54:49,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:54:49,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1574773833, now seen corresponding path program 67 times [2022-04-08 07:54:49,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:54:49,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [567762738] [2022-04-08 07:54:49,653 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:54:49,653 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:54:49,653 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:54:49,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1574773833, now seen corresponding path program 68 times [2022-04-08 07:54:49,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:54:49,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262307873] [2022-04-08 07:54:49,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:54:49,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:54:49,672 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:54:49,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1595208257] [2022-04-08 07:54:49,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:54:49,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:54:49,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:54:49,673 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 07:54:49,674 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 07:54:50,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:54:50,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:54:50,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 144 conjunts are in the unsatisfiable core [2022-04-08 07:54:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:54:51,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:54:52,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {34868#true} call ULTIMATE.init(); {34868#true} is VALID [2022-04-08 07:54:52,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {34868#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); {34868#true} is VALID [2022-04-08 07:54:52,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34868#true} {34868#true} #60#return; {34868#true} is VALID [2022-04-08 07:54:52,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {34868#true} call #t~ret5 := main(); {34868#true} is VALID [2022-04-08 07:54:52,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {34868#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; {34868#true} is VALID [2022-04-08 07:54:52,380 INFO L272 TraceCheckUtils]: 6: Hoare triple {34868#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {34868#true} is VALID [2022-04-08 07:54:52,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,380 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34868#true} {34868#true} #52#return; {34868#true} is VALID [2022-04-08 07:54:52,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {34868#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {34906#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:54:52,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {34906#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {34906#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:54:52,381 INFO L272 TraceCheckUtils]: 13: Hoare triple {34906#(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)); {34868#true} is VALID [2022-04-08 07:54:52,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,381 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {34868#true} {34906#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {34906#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:54:52,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {34906#(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; {34928#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:54:52,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {34928#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {34928#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:54:52,382 INFO L272 TraceCheckUtils]: 20: Hoare triple {34928#(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)); {34868#true} is VALID [2022-04-08 07:54:52,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,383 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {34868#true} {34928#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {34928#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:54:52,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {34928#(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; {34950#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 07:54:52,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {34950#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !false; {34950#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 07:54:52,383 INFO L272 TraceCheckUtils]: 27: Hoare triple {34950#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34868#true} is VALID [2022-04-08 07:54:52,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,384 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34868#true} {34950#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #54#return; {34950#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 07:54:52,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {34950#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34972#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 07:54:52,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {34972#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !false; {34972#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 07:54:52,385 INFO L272 TraceCheckUtils]: 34: Hoare triple {34972#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34868#true} is VALID [2022-04-08 07:54:52,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,385 INFO L290 TraceCheckUtils]: 37: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,386 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {34868#true} {34972#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #54#return; {34972#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 07:54:52,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {34972#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {34994#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 07:54:52,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {34994#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !false; {34994#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 07:54:52,386 INFO L272 TraceCheckUtils]: 41: Hoare triple {34994#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34868#true} is VALID [2022-04-08 07:54:52,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,387 INFO L290 TraceCheckUtils]: 43: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,387 INFO L290 TraceCheckUtils]: 44: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,387 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {34868#true} {34994#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #54#return; {34994#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 07:54:52,388 INFO L290 TraceCheckUtils]: 46: Hoare triple {34994#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35016#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:54:52,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {35016#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {35016#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:54:52,388 INFO L272 TraceCheckUtils]: 48: Hoare triple {35016#(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)); {34868#true} is VALID [2022-04-08 07:54:52,388 INFO L290 TraceCheckUtils]: 49: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,388 INFO L290 TraceCheckUtils]: 50: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,388 INFO L290 TraceCheckUtils]: 51: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,389 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {34868#true} {35016#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {35016#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:54:52,389 INFO L290 TraceCheckUtils]: 53: Hoare triple {35016#(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; {35038#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:54:52,389 INFO L290 TraceCheckUtils]: 54: Hoare triple {35038#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {35038#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:54:52,390 INFO L272 TraceCheckUtils]: 55: Hoare triple {35038#(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)); {34868#true} is VALID [2022-04-08 07:54:52,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,390 INFO L290 TraceCheckUtils]: 57: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,390 INFO L290 TraceCheckUtils]: 58: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,390 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {34868#true} {35038#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {35038#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:54:52,391 INFO L290 TraceCheckUtils]: 60: Hoare triple {35038#(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; {35060#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:54:52,391 INFO L290 TraceCheckUtils]: 61: Hoare triple {35060#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !false; {35060#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:54:52,391 INFO L272 TraceCheckUtils]: 62: Hoare triple {35060#(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)); {34868#true} is VALID [2022-04-08 07:54:52,391 INFO L290 TraceCheckUtils]: 63: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,391 INFO L290 TraceCheckUtils]: 64: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,391 INFO L290 TraceCheckUtils]: 65: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,392 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {34868#true} {35060#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #54#return; {35060#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:54:52,392 INFO L290 TraceCheckUtils]: 67: Hoare triple {35060#(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; {35082#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:54:52,392 INFO L290 TraceCheckUtils]: 68: Hoare triple {35082#(and (= main_~y~0 8) (= main_~c~0 8))} assume !false; {35082#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:54:52,392 INFO L272 TraceCheckUtils]: 69: Hoare triple {35082#(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)); {34868#true} is VALID [2022-04-08 07:54:52,392 INFO L290 TraceCheckUtils]: 70: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,392 INFO L290 TraceCheckUtils]: 71: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,393 INFO L290 TraceCheckUtils]: 72: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,393 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {34868#true} {35082#(and (= main_~y~0 8) (= main_~c~0 8))} #54#return; {35082#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 07:54:52,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {35082#(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; {35104#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:54:52,394 INFO L290 TraceCheckUtils]: 75: Hoare triple {35104#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {35104#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:54:52,394 INFO L272 TraceCheckUtils]: 76: Hoare triple {35104#(and (= 8 (+ (- 1) 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)); {34868#true} is VALID [2022-04-08 07:54:52,394 INFO L290 TraceCheckUtils]: 77: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,394 INFO L290 TraceCheckUtils]: 78: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,394 INFO L290 TraceCheckUtils]: 79: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,394 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {34868#true} {35104#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #54#return; {35104#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 07:54:52,395 INFO L290 TraceCheckUtils]: 81: Hoare triple {35104#(and (= 8 (+ (- 1) 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; {35126#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:54:52,395 INFO L290 TraceCheckUtils]: 82: Hoare triple {35126#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {35126#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:54:52,395 INFO L272 TraceCheckUtils]: 83: Hoare triple {35126#(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)); {34868#true} is VALID [2022-04-08 07:54:52,395 INFO L290 TraceCheckUtils]: 84: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,395 INFO L290 TraceCheckUtils]: 85: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,395 INFO L290 TraceCheckUtils]: 86: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,396 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {34868#true} {35126#(and (= main_~y~0 10) (= main_~c~0 10))} #54#return; {35126#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 07:54:52,396 INFO L290 TraceCheckUtils]: 88: Hoare triple {35126#(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; {35148#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 07:54:52,396 INFO L290 TraceCheckUtils]: 89: Hoare triple {35148#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} assume !false; {35148#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 07:54:52,396 INFO L272 TraceCheckUtils]: 90: Hoare triple {35148#(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)); {34868#true} is VALID [2022-04-08 07:54:52,396 INFO L290 TraceCheckUtils]: 91: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,396 INFO L290 TraceCheckUtils]: 92: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,397 INFO L290 TraceCheckUtils]: 93: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,397 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {34868#true} {35148#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} #54#return; {35148#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 07:54:52,397 INFO L290 TraceCheckUtils]: 95: Hoare triple {35148#(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; {35170#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:54:52,398 INFO L290 TraceCheckUtils]: 96: Hoare triple {35170#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} assume !false; {35170#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:54:52,398 INFO L272 TraceCheckUtils]: 97: Hoare triple {35170#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34868#true} is VALID [2022-04-08 07:54:52,398 INFO L290 TraceCheckUtils]: 98: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,398 INFO L290 TraceCheckUtils]: 99: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,398 INFO L290 TraceCheckUtils]: 100: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,398 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {34868#true} {35170#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} #54#return; {35170#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 07:54:52,399 INFO L290 TraceCheckUtils]: 102: Hoare triple {35170#(and (= 10 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35192#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 07:54:52,399 INFO L290 TraceCheckUtils]: 103: Hoare triple {35192#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !false; {35192#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 07:54:52,399 INFO L272 TraceCheckUtils]: 104: Hoare triple {35192#(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)); {34868#true} is VALID [2022-04-08 07:54:52,399 INFO L290 TraceCheckUtils]: 105: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,399 INFO L290 TraceCheckUtils]: 106: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,399 INFO L290 TraceCheckUtils]: 107: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,400 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {34868#true} {35192#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #54#return; {35192#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 07:54:52,400 INFO L290 TraceCheckUtils]: 109: Hoare triple {35192#(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; {35214#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 07:54:52,400 INFO L290 TraceCheckUtils]: 110: Hoare triple {35214#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} assume !false; {35214#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 07:54:52,400 INFO L272 TraceCheckUtils]: 111: Hoare triple {35214#(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)); {34868#true} is VALID [2022-04-08 07:54:52,400 INFO L290 TraceCheckUtils]: 112: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,401 INFO L290 TraceCheckUtils]: 113: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,401 INFO L290 TraceCheckUtils]: 114: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,401 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {34868#true} {35214#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} #54#return; {35214#(and (= main_~y~0 14) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-08 07:54:52,401 INFO L290 TraceCheckUtils]: 116: Hoare triple {35214#(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; {35236#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:54:52,402 INFO L290 TraceCheckUtils]: 117: Hoare triple {35236#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} assume !false; {35236#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:54:52,402 INFO L272 TraceCheckUtils]: 118: Hoare triple {35236#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34868#true} is VALID [2022-04-08 07:54:52,402 INFO L290 TraceCheckUtils]: 119: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,402 INFO L290 TraceCheckUtils]: 120: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,402 INFO L290 TraceCheckUtils]: 121: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,402 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {34868#true} {35236#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} #54#return; {35236#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:54:52,403 INFO L290 TraceCheckUtils]: 123: Hoare triple {35236#(and (= 14 (+ (- 1) main_~y~0)) (= 13 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35258#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 07:54:52,403 INFO L290 TraceCheckUtils]: 124: Hoare triple {35258#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} assume !false; {35258#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 07:54:52,403 INFO L272 TraceCheckUtils]: 125: Hoare triple {35258#(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)); {34868#true} is VALID [2022-04-08 07:54:52,403 INFO L290 TraceCheckUtils]: 126: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,403 INFO L290 TraceCheckUtils]: 127: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,403 INFO L290 TraceCheckUtils]: 128: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,404 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {34868#true} {35258#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} #54#return; {35258#(and (= main_~c~0 16) (= (+ (- 2) main_~y~0) 14))} is VALID [2022-04-08 07:54:52,404 INFO L290 TraceCheckUtils]: 130: Hoare triple {35258#(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; {35280#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:54:52,404 INFO L290 TraceCheckUtils]: 131: Hoare triple {35280#(and (= main_~c~0 17) (= main_~y~0 17))} assume !false; {35280#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:54:52,405 INFO L272 TraceCheckUtils]: 132: Hoare triple {35280#(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)); {34868#true} is VALID [2022-04-08 07:54:52,405 INFO L290 TraceCheckUtils]: 133: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,405 INFO L290 TraceCheckUtils]: 134: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,405 INFO L290 TraceCheckUtils]: 135: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,405 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {34868#true} {35280#(and (= main_~c~0 17) (= main_~y~0 17))} #54#return; {35280#(and (= main_~c~0 17) (= main_~y~0 17))} is VALID [2022-04-08 07:54:52,405 INFO L290 TraceCheckUtils]: 137: Hoare triple {35280#(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; {35302#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 07:54:52,406 INFO L290 TraceCheckUtils]: 138: Hoare triple {35302#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} assume !false; {35302#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 07:54:52,406 INFO L272 TraceCheckUtils]: 139: Hoare triple {35302#(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)); {34868#true} is VALID [2022-04-08 07:54:52,406 INFO L290 TraceCheckUtils]: 140: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,406 INFO L290 TraceCheckUtils]: 141: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,406 INFO L290 TraceCheckUtils]: 142: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,406 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {34868#true} {35302#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} #54#return; {35302#(and (= (+ (- 1) main_~c~0) 17) (= main_~y~0 18))} is VALID [2022-04-08 07:54:52,407 INFO L290 TraceCheckUtils]: 144: Hoare triple {35302#(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; {35324#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:54:52,407 INFO L290 TraceCheckUtils]: 145: Hoare triple {35324#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} assume !false; {35324#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:54:52,407 INFO L272 TraceCheckUtils]: 146: Hoare triple {35324#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34868#true} is VALID [2022-04-08 07:54:52,407 INFO L290 TraceCheckUtils]: 147: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,407 INFO L290 TraceCheckUtils]: 148: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,407 INFO L290 TraceCheckUtils]: 149: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,408 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {34868#true} {35324#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} #54#return; {35324#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:54:52,408 INFO L290 TraceCheckUtils]: 151: Hoare triple {35324#(and (= 17 (+ (- 2) main_~c~0)) (= 18 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35346#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-08 07:54:52,409 INFO L290 TraceCheckUtils]: 152: Hoare triple {35346#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} assume !false; {35346#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-08 07:54:52,409 INFO L272 TraceCheckUtils]: 153: Hoare triple {35346#(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)); {34868#true} is VALID [2022-04-08 07:54:52,409 INFO L290 TraceCheckUtils]: 154: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,409 INFO L290 TraceCheckUtils]: 155: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,409 INFO L290 TraceCheckUtils]: 156: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,409 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {34868#true} {35346#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} #54#return; {35346#(and (= (+ (- 2) main_~y~0) 18) (= main_~c~0 20))} is VALID [2022-04-08 07:54:52,410 INFO L290 TraceCheckUtils]: 158: Hoare triple {35346#(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; {35368#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-08 07:54:52,410 INFO L290 TraceCheckUtils]: 159: Hoare triple {35368#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} assume !false; {35368#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-08 07:54:52,410 INFO L272 TraceCheckUtils]: 160: Hoare triple {35368#(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)); {34868#true} is VALID [2022-04-08 07:54:52,410 INFO L290 TraceCheckUtils]: 161: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,410 INFO L290 TraceCheckUtils]: 162: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,410 INFO L290 TraceCheckUtils]: 163: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,411 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {34868#true} {35368#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} #54#return; {35368#(and (= (+ (- 1) main_~c~0) 20) (= (+ main_~y~0 (- 3)) 18))} is VALID [2022-04-08 07:54:52,411 INFO L290 TraceCheckUtils]: 165: Hoare triple {35368#(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; {35390#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:54:52,411 INFO L290 TraceCheckUtils]: 166: Hoare triple {35390#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} assume !false; {35390#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:54:52,412 INFO L272 TraceCheckUtils]: 167: Hoare triple {35390#(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)); {34868#true} is VALID [2022-04-08 07:54:52,412 INFO L290 TraceCheckUtils]: 168: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,412 INFO L290 TraceCheckUtils]: 169: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,412 INFO L290 TraceCheckUtils]: 170: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,412 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {34868#true} {35390#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} #54#return; {35390#(and (= main_~y~0 22) (= 20 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:54:52,413 INFO L290 TraceCheckUtils]: 172: Hoare triple {35390#(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; {35412#(and (= 22 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 20))} is VALID [2022-04-08 07:54:52,413 INFO L290 TraceCheckUtils]: 173: Hoare triple {35412#(and (= 22 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 20))} assume !false; {35412#(and (= 22 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 20))} is VALID [2022-04-08 07:54:52,413 INFO L272 TraceCheckUtils]: 174: Hoare triple {35412#(and (= 22 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 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)); {34868#true} is VALID [2022-04-08 07:54:52,413 INFO L290 TraceCheckUtils]: 175: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,413 INFO L290 TraceCheckUtils]: 176: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,413 INFO L290 TraceCheckUtils]: 177: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,414 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {34868#true} {35412#(and (= 22 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 20))} #54#return; {35412#(and (= 22 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 20))} is VALID [2022-04-08 07:54:52,414 INFO L290 TraceCheckUtils]: 179: Hoare triple {35412#(and (= 22 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 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; {35434#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-08 07:54:52,414 INFO L290 TraceCheckUtils]: 180: Hoare triple {35434#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} assume !false; {35434#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-08 07:54:52,414 INFO L272 TraceCheckUtils]: 181: Hoare triple {35434#(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)); {34868#true} is VALID [2022-04-08 07:54:52,415 INFO L290 TraceCheckUtils]: 182: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,415 INFO L290 TraceCheckUtils]: 183: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,415 INFO L290 TraceCheckUtils]: 184: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,415 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {34868#true} {35434#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} #54#return; {35434#(and (= main_~c~0 24) (= (+ (- 2) main_~y~0) 22))} is VALID [2022-04-08 07:54:52,415 INFO L290 TraceCheckUtils]: 186: Hoare triple {35434#(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; {35456#(and (= (+ main_~y~0 (- 3)) 22) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 07:54:52,416 INFO L290 TraceCheckUtils]: 187: Hoare triple {35456#(and (= (+ main_~y~0 (- 3)) 22) (= (+ (- 1) main_~c~0) 24))} assume !false; {35456#(and (= (+ main_~y~0 (- 3)) 22) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 07:54:52,416 INFO L272 TraceCheckUtils]: 188: Hoare triple {35456#(and (= (+ main_~y~0 (- 3)) 22) (= (+ (- 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)); {34868#true} is VALID [2022-04-08 07:54:52,416 INFO L290 TraceCheckUtils]: 189: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,416 INFO L290 TraceCheckUtils]: 190: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,416 INFO L290 TraceCheckUtils]: 191: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,416 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {34868#true} {35456#(and (= (+ main_~y~0 (- 3)) 22) (= (+ (- 1) main_~c~0) 24))} #54#return; {35456#(and (= (+ main_~y~0 (- 3)) 22) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 07:54:52,417 INFO L290 TraceCheckUtils]: 193: Hoare triple {35456#(and (= (+ main_~y~0 (- 3)) 22) (= (+ (- 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; {35478#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} is VALID [2022-04-08 07:54:52,417 INFO L290 TraceCheckUtils]: 194: Hoare triple {35478#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} assume !false; {35478#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} is VALID [2022-04-08 07:54:52,417 INFO L272 TraceCheckUtils]: 195: Hoare triple {35478#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34868#true} is VALID [2022-04-08 07:54:52,417 INFO L290 TraceCheckUtils]: 196: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,417 INFO L290 TraceCheckUtils]: 197: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,418 INFO L290 TraceCheckUtils]: 198: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,418 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {34868#true} {35478#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} #54#return; {35478#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} is VALID [2022-04-08 07:54:52,418 INFO L290 TraceCheckUtils]: 200: Hoare triple {35478#(and (= main_~c~0 26) (= (+ main_~y~0 (- 4)) 22))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35500#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 07:54:52,419 INFO L290 TraceCheckUtils]: 201: Hoare triple {35500#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {35500#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 07:54:52,419 INFO L272 TraceCheckUtils]: 202: Hoare triple {35500#(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)); {34868#true} is VALID [2022-04-08 07:54:52,419 INFO L290 TraceCheckUtils]: 203: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,419 INFO L290 TraceCheckUtils]: 204: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,419 INFO L290 TraceCheckUtils]: 205: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,419 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {34868#true} {35500#(and (= main_~y~0 27) (= main_~c~0 27))} #54#return; {35500#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 07:54:52,420 INFO L290 TraceCheckUtils]: 207: Hoare triple {35500#(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; {35522#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-08 07:54:52,420 INFO L290 TraceCheckUtils]: 208: Hoare triple {35522#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} assume !false; {35522#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-08 07:54:52,420 INFO L272 TraceCheckUtils]: 209: Hoare triple {35522#(and (= (+ (- 1) main_~c~0) 27) (= 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)); {34868#true} is VALID [2022-04-08 07:54:52,420 INFO L290 TraceCheckUtils]: 210: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,420 INFO L290 TraceCheckUtils]: 211: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,420 INFO L290 TraceCheckUtils]: 212: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,421 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {34868#true} {35522#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} #54#return; {35522#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-08 07:54:52,421 INFO L290 TraceCheckUtils]: 214: Hoare triple {35522#(and (= (+ (- 1) main_~c~0) 27) (= 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; {35544#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 07:54:52,421 INFO L290 TraceCheckUtils]: 215: Hoare triple {35544#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !false; {35544#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 07:54:52,421 INFO L272 TraceCheckUtils]: 216: Hoare triple {35544#(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)); {34868#true} is VALID [2022-04-08 07:54:52,422 INFO L290 TraceCheckUtils]: 217: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,422 INFO L290 TraceCheckUtils]: 218: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,422 INFO L290 TraceCheckUtils]: 219: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,422 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {34868#true} {35544#(and (= 29 main_~y~0) (= 29 main_~c~0))} #54#return; {35544#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 07:54:52,422 INFO L290 TraceCheckUtils]: 221: Hoare triple {35544#(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; {35566#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:54:52,423 INFO L290 TraceCheckUtils]: 222: Hoare triple {35566#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)))} assume !false; {35566#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:54:52,423 INFO L272 TraceCheckUtils]: 223: Hoare triple {35566#(and (= (+ (- 1) main_~c~0) 29) (= 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)); {34868#true} is VALID [2022-04-08 07:54:52,423 INFO L290 TraceCheckUtils]: 224: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,423 INFO L290 TraceCheckUtils]: 225: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,423 INFO L290 TraceCheckUtils]: 226: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,423 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {34868#true} {35566#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)))} #54#return; {35566#(and (= (+ (- 1) main_~c~0) 29) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:54:52,424 INFO L290 TraceCheckUtils]: 228: Hoare triple {35566#(and (= (+ (- 1) main_~c~0) 29) (= 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; {35588#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-08 07:54:52,424 INFO L290 TraceCheckUtils]: 229: Hoare triple {35588#(and (= main_~y~0 31) (= main_~c~0 31))} assume !false; {35588#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-08 07:54:52,424 INFO L272 TraceCheckUtils]: 230: Hoare triple {35588#(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)); {34868#true} is VALID [2022-04-08 07:54:52,424 INFO L290 TraceCheckUtils]: 231: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,424 INFO L290 TraceCheckUtils]: 232: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,424 INFO L290 TraceCheckUtils]: 233: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,425 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {34868#true} {35588#(and (= main_~y~0 31) (= main_~c~0 31))} #54#return; {35588#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-08 07:54:52,425 INFO L290 TraceCheckUtils]: 235: Hoare triple {35588#(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; {35610#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 07:54:52,425 INFO L290 TraceCheckUtils]: 236: Hoare triple {35610#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !false; {35610#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 07:54:52,426 INFO L272 TraceCheckUtils]: 237: Hoare triple {35610#(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)); {34868#true} is VALID [2022-04-08 07:54:52,426 INFO L290 TraceCheckUtils]: 238: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,426 INFO L290 TraceCheckUtils]: 239: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,426 INFO L290 TraceCheckUtils]: 240: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,426 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {34868#true} {35610#(and (= 32 main_~y~0) (= 32 main_~c~0))} #54#return; {35610#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 07:54:52,427 INFO L290 TraceCheckUtils]: 242: Hoare triple {35610#(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; {35632#(and (= main_~y~0 33) (= main_~c~0 33))} is VALID [2022-04-08 07:54:52,427 INFO L290 TraceCheckUtils]: 243: Hoare triple {35632#(and (= main_~y~0 33) (= main_~c~0 33))} assume !false; {35632#(and (= main_~y~0 33) (= main_~c~0 33))} is VALID [2022-04-08 07:54:52,427 INFO L272 TraceCheckUtils]: 244: Hoare triple {35632#(and (= main_~y~0 33) (= main_~c~0 33))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {34868#true} is VALID [2022-04-08 07:54:52,427 INFO L290 TraceCheckUtils]: 245: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,427 INFO L290 TraceCheckUtils]: 246: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,427 INFO L290 TraceCheckUtils]: 247: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,428 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {34868#true} {35632#(and (= main_~y~0 33) (= main_~c~0 33))} #54#return; {35632#(and (= main_~y~0 33) (= main_~c~0 33))} is VALID [2022-04-08 07:54:52,428 INFO L290 TraceCheckUtils]: 249: Hoare triple {35632#(and (= main_~y~0 33) (= main_~c~0 33))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {35654#(and (<= main_~c~0 34) (= main_~y~0 34) (< 33 main_~k~0))} is VALID [2022-04-08 07:54:52,428 INFO L290 TraceCheckUtils]: 250: Hoare triple {35654#(and (<= main_~c~0 34) (= main_~y~0 34) (< 33 main_~k~0))} assume !false; {35654#(and (<= main_~c~0 34) (= main_~y~0 34) (< 33 main_~k~0))} is VALID [2022-04-08 07:54:52,428 INFO L272 TraceCheckUtils]: 251: Hoare triple {35654#(and (<= main_~c~0 34) (= main_~y~0 34) (< 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)); {34868#true} is VALID [2022-04-08 07:54:52,428 INFO L290 TraceCheckUtils]: 252: Hoare triple {34868#true} ~cond := #in~cond; {34868#true} is VALID [2022-04-08 07:54:52,428 INFO L290 TraceCheckUtils]: 253: Hoare triple {34868#true} assume !(0 == ~cond); {34868#true} is VALID [2022-04-08 07:54:52,429 INFO L290 TraceCheckUtils]: 254: Hoare triple {34868#true} assume true; {34868#true} is VALID [2022-04-08 07:54:52,429 INFO L284 TraceCheckUtils]: 255: Hoare quadruple {34868#true} {35654#(and (<= main_~c~0 34) (= main_~y~0 34) (< 33 main_~k~0))} #54#return; {35654#(and (<= main_~c~0 34) (= main_~y~0 34) (< 33 main_~k~0))} is VALID [2022-04-08 07:54:52,429 INFO L290 TraceCheckUtils]: 256: Hoare triple {35654#(and (<= main_~c~0 34) (= main_~y~0 34) (< 33 main_~k~0))} assume !(~c~0 < ~k~0); {35676#(and (<= main_~k~0 34) (= main_~y~0 34) (< 33 main_~k~0))} is VALID [2022-04-08 07:54:52,430 INFO L272 TraceCheckUtils]: 257: Hoare triple {35676#(and (<= main_~k~0 34) (= main_~y~0 34) (< 33 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {35680#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:54:52,430 INFO L290 TraceCheckUtils]: 258: Hoare triple {35680#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35684#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:54:52,431 INFO L290 TraceCheckUtils]: 259: Hoare triple {35684#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {34869#false} is VALID [2022-04-08 07:54:52,431 INFO L290 TraceCheckUtils]: 260: Hoare triple {34869#false} assume !false; {34869#false} is VALID [2022-04-08 07:54:52,432 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 07:54:52,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:54:52,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:54:52,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262307873] [2022-04-08 07:54:52,846 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:54:52,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595208257] [2022-04-08 07:54:52,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595208257] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:54:52,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:54:52,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2022-04-08 07:54:52,847 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:54:52,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [567762738] [2022-04-08 07:54:52,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [567762738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:54:52,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:54:52,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-08 07:54:52,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168609367] [2022-04-08 07:54:52,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:54:52,848 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) Word has length 261 [2022-04-08 07:54:52,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:54:52,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) [2022-04-08 07:54:53,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:54:53,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-08 07:54:53,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:54:53,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-08 07:54:53,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 07:54:53,608 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) [2022-04-08 07:55:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:55:29,747 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2022-04-08 07:55:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-08 07:55:29,748 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) Word has length 261 [2022-04-08 07:55:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:55:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) [2022-04-08 07:55:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 168 transitions. [2022-04-08 07:55:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) [2022-04-08 07:55:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 168 transitions. [2022-04-08 07:55:29,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 168 transitions. [2022-04-08 07:55:30,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:55:30,723 INFO L225 Difference]: With dead ends: 142 [2022-04-08 07:55:30,723 INFO L226 Difference]: Without dead ends: 137 [2022-04-08 07:55:30,723 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=1847, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 07:55:30,724 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 2 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 4077 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 4077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:55:30,724 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2095 Invalid, 4077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4077 Invalid, 0 Unknown, 0 Unchecked, 19.4s Time] [2022-04-08 07:55:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-08 07:55:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-04-08 07:55:30,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:55:30,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 137 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 40 states have call successors, (40), 7 states have call predecessors, (40), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 07:55:30,864 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 137 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 40 states have call successors, (40), 7 states have call predecessors, (40), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 07:55:30,865 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 137 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 40 states have call successors, (40), 7 states have call predecessors, (40), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 07:55:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:55:30,867 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2022-04-08 07:55:30,867 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2022-04-08 07:55:30,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:55:30,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:55:30,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 40 states have call successors, (40), 7 states have call predecessors, (40), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand 137 states. [2022-04-08 07:55:30,867 INFO L87 Difference]: Start difference. First operand has 137 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 40 states have call successors, (40), 7 states have call predecessors, (40), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand 137 states. [2022-04-08 07:55:30,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:55:30,870 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2022-04-08 07:55:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2022-04-08 07:55:30,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:55:30,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:55:30,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:55:30,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:55:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 40 states have call successors, (40), 7 states have call predecessors, (40), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 07:55:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2022-04-08 07:55:30,872 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 261 [2022-04-08 07:55:30,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:55:30,873 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2022-04-08 07:55:30,873 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 37 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (37), 36 states have call predecessors, (37), 36 states have call successors, (37) [2022-04-08 07:55:30,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 170 transitions. [2022-04-08 07:55:32,201 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 07:55:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2022-04-08 07:55:32,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-04-08 07:55:32,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:55:32,203 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:55:32,209 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 07:55:32,403 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 07:55:32,403 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:55:32,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:55:32,403 INFO L85 PathProgramCache]: Analyzing trace with hash -416032600, now seen corresponding path program 69 times [2022-04-08 07:55:32,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:55:32,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [829539972] [2022-04-08 07:55:32,471 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:55:32,471 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:55:32,472 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:55:32,472 INFO L85 PathProgramCache]: Analyzing trace with hash -416032600, now seen corresponding path program 70 times [2022-04-08 07:55:32,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:55:32,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891075061] [2022-04-08 07:55:32,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:55:32,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:55:32,488 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:55:32,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1033118103] [2022-04-08 07:55:32,488 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:55:32,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:55:32,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:55:32,489 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 07:55:32,490 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 07:55:33,634 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:55:33,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:55:33,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 148 conjunts are in the unsatisfiable core [2022-04-08 07:55:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:55:33,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:55:35,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {36568#true} call ULTIMATE.init(); {36568#true} is VALID [2022-04-08 07:55:35,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {36568#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); {36568#true} is VALID [2022-04-08 07:55:35,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36568#true} {36568#true} #60#return; {36568#true} is VALID [2022-04-08 07:55:35,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {36568#true} call #t~ret5 := main(); {36568#true} is VALID [2022-04-08 07:55:35,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {36568#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; {36568#true} is VALID [2022-04-08 07:55:35,146 INFO L272 TraceCheckUtils]: 6: Hoare triple {36568#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {36568#true} is VALID [2022-04-08 07:55:35,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,146 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36568#true} {36568#true} #52#return; {36568#true} is VALID [2022-04-08 07:55:35,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {36568#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {36606#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:55:35,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {36606#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {36606#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:55:35,150 INFO L272 TraceCheckUtils]: 13: Hoare triple {36606#(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)); {36568#true} is VALID [2022-04-08 07:55:35,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,150 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {36568#true} {36606#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {36606#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:55:35,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {36606#(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; {36628#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:55:35,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {36628#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {36628#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:55:35,151 INFO L272 TraceCheckUtils]: 20: Hoare triple {36628#(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)); {36568#true} is VALID [2022-04-08 07:55:35,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,152 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {36568#true} {36628#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {36628#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:55:35,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {36628#(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; {36650#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 07:55:35,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {36650#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {36650#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 07:55:35,152 INFO L272 TraceCheckUtils]: 27: Hoare triple {36650#(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)); {36568#true} is VALID [2022-04-08 07:55:35,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,153 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {36568#true} {36650#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #54#return; {36650#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 07:55:35,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {36650#(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; {36672#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:55:35,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {36672#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {36672#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:55:35,154 INFO L272 TraceCheckUtils]: 34: Hoare triple {36672#(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)); {36568#true} is VALID [2022-04-08 07:55:35,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,154 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {36568#true} {36672#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #54#return; {36672#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:55:35,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {36672#(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; {36694#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:55:35,155 INFO L290 TraceCheckUtils]: 40: Hoare triple {36694#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {36694#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:55:35,155 INFO L272 TraceCheckUtils]: 41: Hoare triple {36694#(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)); {36568#true} is VALID [2022-04-08 07:55:35,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,155 INFO L290 TraceCheckUtils]: 43: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,156 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {36568#true} {36694#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {36694#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:55:35,156 INFO L290 TraceCheckUtils]: 46: Hoare triple {36694#(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; {36716#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:55:35,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {36716#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {36716#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:55:35,157 INFO L272 TraceCheckUtils]: 48: Hoare triple {36716#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36568#true} is VALID [2022-04-08 07:55:35,157 INFO L290 TraceCheckUtils]: 49: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,157 INFO L290 TraceCheckUtils]: 50: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,157 INFO L290 TraceCheckUtils]: 51: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,157 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {36568#true} {36716#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #54#return; {36716#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:55:35,157 INFO L290 TraceCheckUtils]: 53: Hoare triple {36716#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36738#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:55:35,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {36738#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {36738#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:55:35,158 INFO L272 TraceCheckUtils]: 55: Hoare triple {36738#(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)); {36568#true} is VALID [2022-04-08 07:55:35,158 INFO L290 TraceCheckUtils]: 56: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,158 INFO L290 TraceCheckUtils]: 57: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,158 INFO L290 TraceCheckUtils]: 58: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,158 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {36568#true} {36738#(and (= main_~y~0 6) (= main_~c~0 6))} #54#return; {36738#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:55:35,159 INFO L290 TraceCheckUtils]: 60: Hoare triple {36738#(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; {36760#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:55:35,159 INFO L290 TraceCheckUtils]: 61: Hoare triple {36760#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !false; {36760#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:55:35,159 INFO L272 TraceCheckUtils]: 62: Hoare triple {36760#(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)); {36568#true} is VALID [2022-04-08 07:55:35,159 INFO L290 TraceCheckUtils]: 63: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,159 INFO L290 TraceCheckUtils]: 64: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,160 INFO L290 TraceCheckUtils]: 65: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,160 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {36568#true} {36760#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #54#return; {36760#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:55:35,160 INFO L290 TraceCheckUtils]: 67: Hoare triple {36760#(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; {36782#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 07:55:35,161 INFO L290 TraceCheckUtils]: 68: Hoare triple {36782#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {36782#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 07:55:35,161 INFO L272 TraceCheckUtils]: 69: Hoare triple {36782#(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)); {36568#true} is VALID [2022-04-08 07:55:35,161 INFO L290 TraceCheckUtils]: 70: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,161 INFO L290 TraceCheckUtils]: 71: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,161 INFO L290 TraceCheckUtils]: 72: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,161 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {36568#true} {36782#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {36782#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 07:55:35,162 INFO L290 TraceCheckUtils]: 74: Hoare triple {36782#(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; {36804#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:55:35,162 INFO L290 TraceCheckUtils]: 75: Hoare triple {36804#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {36804#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:55:35,162 INFO L272 TraceCheckUtils]: 76: Hoare triple {36804#(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)); {36568#true} is VALID [2022-04-08 07:55:35,162 INFO L290 TraceCheckUtils]: 77: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,162 INFO L290 TraceCheckUtils]: 78: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,162 INFO L290 TraceCheckUtils]: 79: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,163 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {36568#true} {36804#(and (= main_~y~0 9) (= main_~c~0 9))} #54#return; {36804#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 07:55:35,163 INFO L290 TraceCheckUtils]: 81: Hoare triple {36804#(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; {36826#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:55:35,163 INFO L290 TraceCheckUtils]: 82: Hoare triple {36826#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !false; {36826#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:55:35,163 INFO L272 TraceCheckUtils]: 83: Hoare triple {36826#(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)); {36568#true} is VALID [2022-04-08 07:55:35,163 INFO L290 TraceCheckUtils]: 84: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,164 INFO L290 TraceCheckUtils]: 85: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,164 INFO L290 TraceCheckUtils]: 86: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,164 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {36568#true} {36826#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #54#return; {36826#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 07:55:35,164 INFO L290 TraceCheckUtils]: 88: Hoare triple {36826#(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; {36848#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 07:55:35,165 INFO L290 TraceCheckUtils]: 89: Hoare triple {36848#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} assume !false; {36848#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 07:55:35,165 INFO L272 TraceCheckUtils]: 90: Hoare triple {36848#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36568#true} is VALID [2022-04-08 07:55:35,165 INFO L290 TraceCheckUtils]: 91: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,165 INFO L290 TraceCheckUtils]: 92: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,165 INFO L290 TraceCheckUtils]: 93: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,165 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {36568#true} {36848#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} #54#return; {36848#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 07:55:35,166 INFO L290 TraceCheckUtils]: 95: Hoare triple {36848#(and (= main_~c~0 11) (= (+ (- 2) main_~y~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {36870#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:55:35,166 INFO L290 TraceCheckUtils]: 96: Hoare triple {36870#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {36870#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:55:35,166 INFO L272 TraceCheckUtils]: 97: Hoare triple {36870#(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)); {36568#true} is VALID [2022-04-08 07:55:35,166 INFO L290 TraceCheckUtils]: 98: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,166 INFO L290 TraceCheckUtils]: 99: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,166 INFO L290 TraceCheckUtils]: 100: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,167 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {36568#true} {36870#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {36870#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:55:35,167 INFO L290 TraceCheckUtils]: 102: Hoare triple {36870#(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; {36892#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 07:55:35,168 INFO L290 TraceCheckUtils]: 103: Hoare triple {36892#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {36892#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 07:55:35,168 INFO L272 TraceCheckUtils]: 104: Hoare triple {36892#(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)); {36568#true} is VALID [2022-04-08 07:55:35,168 INFO L290 TraceCheckUtils]: 105: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,168 INFO L290 TraceCheckUtils]: 106: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,168 INFO L290 TraceCheckUtils]: 107: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,168 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {36568#true} {36892#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #54#return; {36892#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 07:55:35,169 INFO L290 TraceCheckUtils]: 109: Hoare triple {36892#(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; {36914#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:55:35,169 INFO L290 TraceCheckUtils]: 110: Hoare triple {36914#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} assume !false; {36914#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:55:35,169 INFO L272 TraceCheckUtils]: 111: Hoare triple {36914#(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)); {36568#true} is VALID [2022-04-08 07:55:35,169 INFO L290 TraceCheckUtils]: 112: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,169 INFO L290 TraceCheckUtils]: 113: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,169 INFO L290 TraceCheckUtils]: 114: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,170 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {36568#true} {36914#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} #54#return; {36914#(and (= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 07:55:35,170 INFO L290 TraceCheckUtils]: 116: Hoare triple {36914#(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; {36936#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 07:55:35,170 INFO L290 TraceCheckUtils]: 117: Hoare triple {36936#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} assume !false; {36936#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 07:55:35,171 INFO L272 TraceCheckUtils]: 118: Hoare triple {36936#(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)); {36568#true} is VALID [2022-04-08 07:55:35,171 INFO L290 TraceCheckUtils]: 119: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,171 INFO L290 TraceCheckUtils]: 120: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,171 INFO L290 TraceCheckUtils]: 121: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,175 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {36568#true} {36936#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} #54#return; {36936#(and (= main_~y~0 15) (= (+ (- 1) main_~c~0) 14))} is VALID [2022-04-08 07:55:35,176 INFO L290 TraceCheckUtils]: 123: Hoare triple {36936#(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; {36958#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:55:35,176 INFO L290 TraceCheckUtils]: 124: Hoare triple {36958#(and (= main_~c~0 16) (= main_~y~0 16))} assume !false; {36958#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:55:35,176 INFO L272 TraceCheckUtils]: 125: Hoare triple {36958#(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)); {36568#true} is VALID [2022-04-08 07:55:35,176 INFO L290 TraceCheckUtils]: 126: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,177 INFO L290 TraceCheckUtils]: 127: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,177 INFO L290 TraceCheckUtils]: 128: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,177 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {36568#true} {36958#(and (= main_~c~0 16) (= main_~y~0 16))} #54#return; {36958#(and (= main_~c~0 16) (= main_~y~0 16))} is VALID [2022-04-08 07:55:35,177 INFO L290 TraceCheckUtils]: 130: Hoare triple {36958#(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; {36980#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-08 07:55:35,178 INFO L290 TraceCheckUtils]: 131: Hoare triple {36980#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} assume !false; {36980#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-08 07:55:35,178 INFO L272 TraceCheckUtils]: 132: Hoare triple {36980#(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)); {36568#true} is VALID [2022-04-08 07:55:35,178 INFO L290 TraceCheckUtils]: 133: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,178 INFO L290 TraceCheckUtils]: 134: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,178 INFO L290 TraceCheckUtils]: 135: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,179 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {36568#true} {36980#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} #54#return; {36980#(and (= 16 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 16))} is VALID [2022-04-08 07:55:35,179 INFO L290 TraceCheckUtils]: 137: Hoare triple {36980#(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; {37002#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:55:35,180 INFO L290 TraceCheckUtils]: 138: Hoare triple {37002#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} assume !false; {37002#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:55:35,180 INFO L272 TraceCheckUtils]: 139: Hoare triple {37002#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36568#true} is VALID [2022-04-08 07:55:35,180 INFO L290 TraceCheckUtils]: 140: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,180 INFO L290 TraceCheckUtils]: 141: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,180 INFO L290 TraceCheckUtils]: 142: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,180 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {36568#true} {37002#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} #54#return; {37002#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:55:35,181 INFO L290 TraceCheckUtils]: 144: Hoare triple {37002#(and (= (+ (- 2) main_~y~0) 16) (= 16 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37024#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-08 07:55:35,181 INFO L290 TraceCheckUtils]: 145: Hoare triple {37024#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} assume !false; {37024#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-08 07:55:35,181 INFO L272 TraceCheckUtils]: 146: Hoare triple {37024#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36568#true} is VALID [2022-04-08 07:55:35,181 INFO L290 TraceCheckUtils]: 147: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,181 INFO L290 TraceCheckUtils]: 148: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,181 INFO L290 TraceCheckUtils]: 149: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,182 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {36568#true} {37024#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} #54#return; {37024#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} is VALID [2022-04-08 07:55:35,182 INFO L290 TraceCheckUtils]: 151: Hoare triple {37024#(and (= (+ main_~y~0 (- 3)) 16) (= 19 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37046#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-08 07:55:35,183 INFO L290 TraceCheckUtils]: 152: Hoare triple {37046#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} assume !false; {37046#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-08 07:55:35,183 INFO L272 TraceCheckUtils]: 153: Hoare triple {37046#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36568#true} is VALID [2022-04-08 07:55:35,183 INFO L290 TraceCheckUtils]: 154: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,183 INFO L290 TraceCheckUtils]: 155: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,183 INFO L290 TraceCheckUtils]: 156: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,184 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {36568#true} {37046#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} #54#return; {37046#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} is VALID [2022-04-08 07:55:35,184 INFO L290 TraceCheckUtils]: 158: Hoare triple {37046#(and (= 19 (+ (- 1) main_~c~0)) (= (+ main_~y~0 (- 4)) 16))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37068#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 07:55:35,184 INFO L290 TraceCheckUtils]: 159: Hoare triple {37068#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} assume !false; {37068#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 07:55:35,184 INFO L272 TraceCheckUtils]: 160: Hoare triple {37068#(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)); {36568#true} is VALID [2022-04-08 07:55:35,184 INFO L290 TraceCheckUtils]: 161: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,185 INFO L290 TraceCheckUtils]: 162: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,185 INFO L290 TraceCheckUtils]: 163: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,185 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {36568#true} {37068#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} #54#return; {37068#(and (= main_~c~0 21) (= 16 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 07:55:35,186 INFO L290 TraceCheckUtils]: 165: Hoare triple {37068#(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; {37090#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:55:35,186 INFO L290 TraceCheckUtils]: 166: Hoare triple {37090#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} assume !false; {37090#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:55:35,186 INFO L272 TraceCheckUtils]: 167: Hoare triple {37090#(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)); {36568#true} is VALID [2022-04-08 07:55:35,186 INFO L290 TraceCheckUtils]: 168: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,186 INFO L290 TraceCheckUtils]: 169: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,186 INFO L290 TraceCheckUtils]: 170: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,187 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {36568#true} {37090#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} #54#return; {37090#(and (= (+ main_~y~0 (- 6)) 16) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:55:35,187 INFO L290 TraceCheckUtils]: 172: Hoare triple {37090#(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; {37112#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:55:35,187 INFO L290 TraceCheckUtils]: 173: Hoare triple {37112#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {37112#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:55:35,187 INFO L272 TraceCheckUtils]: 174: Hoare triple {37112#(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)); {36568#true} is VALID [2022-04-08 07:55:35,187 INFO L290 TraceCheckUtils]: 175: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,188 INFO L290 TraceCheckUtils]: 176: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,188 INFO L290 TraceCheckUtils]: 177: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,188 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {36568#true} {37112#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {37112#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:55:35,188 INFO L290 TraceCheckUtils]: 179: Hoare triple {37112#(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; {37134#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 07:55:35,189 INFO L290 TraceCheckUtils]: 180: Hoare triple {37134#(and (= main_~c~0 24) (= main_~y~0 24))} assume !false; {37134#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 07:55:35,189 INFO L272 TraceCheckUtils]: 181: Hoare triple {37134#(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)); {36568#true} is VALID [2022-04-08 07:55:35,189 INFO L290 TraceCheckUtils]: 182: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,189 INFO L290 TraceCheckUtils]: 183: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,189 INFO L290 TraceCheckUtils]: 184: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,189 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {36568#true} {37134#(and (= main_~c~0 24) (= main_~y~0 24))} #54#return; {37134#(and (= main_~c~0 24) (= main_~y~0 24))} is VALID [2022-04-08 07:55:35,190 INFO L290 TraceCheckUtils]: 186: Hoare triple {37134#(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; {37156#(and (= (+ (- 1) main_~c~0) 24) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 07:55:35,190 INFO L290 TraceCheckUtils]: 187: Hoare triple {37156#(and (= (+ (- 1) main_~c~0) 24) (= (+ (- 1) main_~y~0) 24))} assume !false; {37156#(and (= (+ (- 1) main_~c~0) 24) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 07:55:35,190 INFO L272 TraceCheckUtils]: 188: Hoare triple {37156#(and (= (+ (- 1) main_~c~0) 24) (= (+ (- 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)); {36568#true} is VALID [2022-04-08 07:55:35,190 INFO L290 TraceCheckUtils]: 189: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,190 INFO L290 TraceCheckUtils]: 190: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,190 INFO L290 TraceCheckUtils]: 191: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,191 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {36568#true} {37156#(and (= (+ (- 1) main_~c~0) 24) (= (+ (- 1) main_~y~0) 24))} #54#return; {37156#(and (= (+ (- 1) main_~c~0) 24) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 07:55:35,191 INFO L290 TraceCheckUtils]: 193: Hoare triple {37156#(and (= (+ (- 1) main_~c~0) 24) (= (+ (- 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; {37178#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} is VALID [2022-04-08 07:55:35,192 INFO L290 TraceCheckUtils]: 194: Hoare triple {37178#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} assume !false; {37178#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} is VALID [2022-04-08 07:55:35,192 INFO L272 TraceCheckUtils]: 195: Hoare triple {37178#(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)); {36568#true} is VALID [2022-04-08 07:55:35,192 INFO L290 TraceCheckUtils]: 196: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,192 INFO L290 TraceCheckUtils]: 197: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,192 INFO L290 TraceCheckUtils]: 198: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,192 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {36568#true} {37178#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} #54#return; {37178#(and (= main_~c~0 26) (= (+ (- 2) main_~y~0) 24))} is VALID [2022-04-08 07:55:35,193 INFO L290 TraceCheckUtils]: 200: Hoare triple {37178#(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; {37200#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 07:55:35,198 INFO L290 TraceCheckUtils]: 201: Hoare triple {37200#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {37200#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 07:55:35,199 INFO L272 TraceCheckUtils]: 202: Hoare triple {37200#(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)); {36568#true} is VALID [2022-04-08 07:55:35,199 INFO L290 TraceCheckUtils]: 203: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,199 INFO L290 TraceCheckUtils]: 204: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,199 INFO L290 TraceCheckUtils]: 205: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,199 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {36568#true} {37200#(and (= main_~y~0 27) (= main_~c~0 27))} #54#return; {37200#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 07:55:35,200 INFO L290 TraceCheckUtils]: 207: Hoare triple {37200#(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; {37222#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-08 07:55:35,200 INFO L290 TraceCheckUtils]: 208: Hoare triple {37222#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} assume !false; {37222#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-08 07:55:35,200 INFO L272 TraceCheckUtils]: 209: Hoare triple {37222#(and (= (+ (- 1) main_~c~0) 27) (= 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)); {36568#true} is VALID [2022-04-08 07:55:35,200 INFO L290 TraceCheckUtils]: 210: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,200 INFO L290 TraceCheckUtils]: 211: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,200 INFO L290 TraceCheckUtils]: 212: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,201 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {36568#true} {37222#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} #54#return; {37222#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-08 07:55:35,201 INFO L290 TraceCheckUtils]: 214: Hoare triple {37222#(and (= (+ (- 1) main_~c~0) 27) (= 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; {37244#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 07:55:35,201 INFO L290 TraceCheckUtils]: 215: Hoare triple {37244#(and (= 29 main_~y~0) (= 29 main_~c~0))} assume !false; {37244#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 07:55:35,201 INFO L272 TraceCheckUtils]: 216: Hoare triple {37244#(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)); {36568#true} is VALID [2022-04-08 07:55:35,201 INFO L290 TraceCheckUtils]: 217: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,201 INFO L290 TraceCheckUtils]: 218: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,202 INFO L290 TraceCheckUtils]: 219: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,202 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {36568#true} {37244#(and (= 29 main_~y~0) (= 29 main_~c~0))} #54#return; {37244#(and (= 29 main_~y~0) (= 29 main_~c~0))} is VALID [2022-04-08 07:55:35,202 INFO L290 TraceCheckUtils]: 221: Hoare triple {37244#(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; {37266#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:55:35,203 INFO L290 TraceCheckUtils]: 222: Hoare triple {37266#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} assume !false; {37266#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:55:35,203 INFO L272 TraceCheckUtils]: 223: Hoare triple {37266#(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)); {36568#true} is VALID [2022-04-08 07:55:35,203 INFO L290 TraceCheckUtils]: 224: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,203 INFO L290 TraceCheckUtils]: 225: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,203 INFO L290 TraceCheckUtils]: 226: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,203 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {36568#true} {37266#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} #54#return; {37266#(and (= 30 main_~c~0) (= 29 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:55:35,204 INFO L290 TraceCheckUtils]: 228: Hoare triple {37266#(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; {37288#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-08 07:55:35,204 INFO L290 TraceCheckUtils]: 229: Hoare triple {37288#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} assume !false; {37288#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-08 07:55:35,204 INFO L272 TraceCheckUtils]: 230: Hoare triple {37288#(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)); {36568#true} is VALID [2022-04-08 07:55:35,204 INFO L290 TraceCheckUtils]: 231: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,204 INFO L290 TraceCheckUtils]: 232: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,204 INFO L290 TraceCheckUtils]: 233: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,205 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {36568#true} {37288#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} #54#return; {37288#(and (= main_~y~0 31) (= (+ (- 1) main_~c~0) 30))} is VALID [2022-04-08 07:55:35,205 INFO L290 TraceCheckUtils]: 235: Hoare triple {37288#(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; {37310#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:55:35,205 INFO L290 TraceCheckUtils]: 236: Hoare triple {37310#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} assume !false; {37310#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:55:35,205 INFO L272 TraceCheckUtils]: 237: Hoare triple {37310#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {36568#true} is VALID [2022-04-08 07:55:35,205 INFO L290 TraceCheckUtils]: 238: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,206 INFO L290 TraceCheckUtils]: 239: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,206 INFO L290 TraceCheckUtils]: 240: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,206 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {36568#true} {37310#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} #54#return; {37310#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:55:35,206 INFO L290 TraceCheckUtils]: 242: Hoare triple {37310#(and (= 32 main_~c~0) (= 31 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {37332#(and (= (+ (- 2) main_~y~0) 31) (= main_~c~0 33))} is VALID [2022-04-08 07:55:35,207 INFO L290 TraceCheckUtils]: 243: Hoare triple {37332#(and (= (+ (- 2) main_~y~0) 31) (= main_~c~0 33))} assume !false; {37332#(and (= (+ (- 2) main_~y~0) 31) (= main_~c~0 33))} is VALID [2022-04-08 07:55:35,207 INFO L272 TraceCheckUtils]: 244: Hoare triple {37332#(and (= (+ (- 2) main_~y~0) 31) (= 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)); {36568#true} is VALID [2022-04-08 07:55:35,207 INFO L290 TraceCheckUtils]: 245: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,207 INFO L290 TraceCheckUtils]: 246: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,207 INFO L290 TraceCheckUtils]: 247: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,207 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {36568#true} {37332#(and (= (+ (- 2) main_~y~0) 31) (= main_~c~0 33))} #54#return; {37332#(and (= (+ (- 2) main_~y~0) 31) (= main_~c~0 33))} is VALID [2022-04-08 07:55:35,208 INFO L290 TraceCheckUtils]: 249: Hoare triple {37332#(and (= (+ (- 2) main_~y~0) 31) (= 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; {37354#(and (= main_~c~0 34) (= main_~y~0 34))} is VALID [2022-04-08 07:55:35,208 INFO L290 TraceCheckUtils]: 250: Hoare triple {37354#(and (= main_~c~0 34) (= main_~y~0 34))} assume !false; {37354#(and (= main_~c~0 34) (= main_~y~0 34))} is VALID [2022-04-08 07:55:35,208 INFO L272 TraceCheckUtils]: 251: Hoare triple {37354#(and (= main_~c~0 34) (= main_~y~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)); {36568#true} is VALID [2022-04-08 07:55:35,208 INFO L290 TraceCheckUtils]: 252: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,208 INFO L290 TraceCheckUtils]: 253: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,208 INFO L290 TraceCheckUtils]: 254: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,209 INFO L284 TraceCheckUtils]: 255: Hoare quadruple {36568#true} {37354#(and (= main_~c~0 34) (= main_~y~0 34))} #54#return; {37354#(and (= main_~c~0 34) (= main_~y~0 34))} is VALID [2022-04-08 07:55:35,209 INFO L290 TraceCheckUtils]: 256: Hoare triple {37354#(and (= main_~c~0 34) (= main_~y~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; {37376#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} is VALID [2022-04-08 07:55:35,209 INFO L290 TraceCheckUtils]: 257: Hoare triple {37376#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} assume !false; {37376#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} is VALID [2022-04-08 07:55:35,210 INFO L272 TraceCheckUtils]: 258: Hoare triple {37376#(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)); {36568#true} is VALID [2022-04-08 07:55:35,210 INFO L290 TraceCheckUtils]: 259: Hoare triple {36568#true} ~cond := #in~cond; {36568#true} is VALID [2022-04-08 07:55:35,210 INFO L290 TraceCheckUtils]: 260: Hoare triple {36568#true} assume !(0 == ~cond); {36568#true} is VALID [2022-04-08 07:55:35,210 INFO L290 TraceCheckUtils]: 261: Hoare triple {36568#true} assume true; {36568#true} is VALID [2022-04-08 07:55:35,210 INFO L284 TraceCheckUtils]: 262: Hoare quadruple {36568#true} {37376#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} #54#return; {37376#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} is VALID [2022-04-08 07:55:35,211 INFO L290 TraceCheckUtils]: 263: Hoare triple {37376#(and (<= main_~c~0 35) (= 35 main_~y~0) (< 34 main_~k~0))} assume !(~c~0 < ~k~0); {37398#(and (= 35 main_~y~0) (<= main_~k~0 35) (< 34 main_~k~0))} is VALID [2022-04-08 07:55:35,211 INFO L272 TraceCheckUtils]: 264: Hoare triple {37398#(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)); {37402#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:55:35,212 INFO L290 TraceCheckUtils]: 265: Hoare triple {37402#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37406#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:55:35,212 INFO L290 TraceCheckUtils]: 266: Hoare triple {37406#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36569#false} is VALID [2022-04-08 07:55:35,212 INFO L290 TraceCheckUtils]: 267: Hoare triple {36569#false} assume !false; {36569#false} is VALID [2022-04-08 07:55:35,214 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 07:55:35,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:55:35,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:55:35,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891075061] [2022-04-08 07:55:35,696 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:55:35,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033118103] [2022-04-08 07:55:35,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033118103] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:55:35,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:55:35,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2022-04-08 07:55:35,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:55:35,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [829539972] [2022-04-08 07:55:35,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [829539972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:55:35,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:55:35,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-08 07:55:35,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196957694] [2022-04-08 07:55:35,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:55:35,698 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) Word has length 268 [2022-04-08 07:55:35,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:55:35,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-04-08 07:55:36,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:55:36,638 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-08 07:55:36,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:55:36,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-08 07:55:36,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 07:55:36,639 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-04-08 07:56:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:56:16,739 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2022-04-08 07:56:16,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-08 07:56:16,740 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) Word has length 268 [2022-04-08 07:56:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:56:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-04-08 07:56:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 172 transitions. [2022-04-08 07:56:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-04-08 07:56:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 172 transitions. [2022-04-08 07:56:16,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 172 transitions. [2022-04-08 07:56:17,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:56:17,706 INFO L225 Difference]: With dead ends: 145 [2022-04-08 07:56:17,707 INFO L226 Difference]: Without dead ends: 140 [2022-04-08 07:56:17,707 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 237 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 07:56:17,707 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 2 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 4301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 4301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:56:17,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2189 Invalid, 4301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4301 Invalid, 0 Unknown, 0 Unchecked, 21.4s Time] [2022-04-08 07:56:17,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-08 07:56:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-04-08 07:56:17,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:56:17,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 140 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 41 states have call successors, (41), 7 states have call predecessors, (41), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 07:56:17,853 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 140 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 41 states have call successors, (41), 7 states have call predecessors, (41), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 07:56:17,853 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 140 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 41 states have call successors, (41), 7 states have call predecessors, (41), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 07:56:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:56:17,855 INFO L93 Difference]: Finished difference Result 140 states and 174 transitions. [2022-04-08 07:56:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2022-04-08 07:56:17,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:56:17,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:56:17,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 41 states have call successors, (41), 7 states have call predecessors, (41), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 140 states. [2022-04-08 07:56:17,856 INFO L87 Difference]: Start difference. First operand has 140 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 41 states have call successors, (41), 7 states have call predecessors, (41), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 140 states. [2022-04-08 07:56:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:56:17,858 INFO L93 Difference]: Finished difference Result 140 states and 174 transitions. [2022-04-08 07:56:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2022-04-08 07:56:17,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:56:17,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:56:17,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:56:17,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:56:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 41 states have call successors, (41), 7 states have call predecessors, (41), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 07:56:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2022-04-08 07:56:17,861 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 268 [2022-04-08 07:56:17,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:56:17,861 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2022-04-08 07:56:17,861 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.125) internal successors, (85), 40 states have internal predecessors, (85), 38 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-04-08 07:56:17,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 174 transitions. [2022-04-08 07:56:19,227 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 07:56:19,228 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2022-04-08 07:56:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-04-08 07:56:19,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:56:19,229 INFO L499 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:56:19,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-08 07:56:19,435 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 07:56:19,435 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:56:19,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:56:19,436 INFO L85 PathProgramCache]: Analyzing trace with hash 825903977, now seen corresponding path program 71 times [2022-04-08 07:56:19,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:56:19,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1261980801] [2022-04-08 07:56:19,500 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:56:19,500 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:56:19,500 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:56:19,500 INFO L85 PathProgramCache]: Analyzing trace with hash 825903977, now seen corresponding path program 72 times [2022-04-08 07:56:19,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:56:19,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196413787] [2022-04-08 07:56:19,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:56:19,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:56:19,516 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:56:19,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [550712312] [2022-04-08 07:56:19,516 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:56:19,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:56:19,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:56:19,517 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 07:56:19,519 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 07:57:02,968 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2022-04-08 07:57:02,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:57:02,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 152 conjunts are in the unsatisfiable core [2022-04-08 07:57:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:57:03,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:57:04,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {38308#true} call ULTIMATE.init(); {38308#true} is VALID [2022-04-08 07:57:04,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {38308#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); {38308#true} is VALID [2022-04-08 07:57:04,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38308#true} {38308#true} #60#return; {38308#true} is VALID [2022-04-08 07:57:04,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {38308#true} call #t~ret5 := main(); {38308#true} is VALID [2022-04-08 07:57:04,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {38308#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; {38308#true} is VALID [2022-04-08 07:57:04,675 INFO L272 TraceCheckUtils]: 6: Hoare triple {38308#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {38308#true} is VALID [2022-04-08 07:57:04,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,675 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38308#true} {38308#true} #52#return; {38308#true} is VALID [2022-04-08 07:57:04,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {38308#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {38346#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:57:04,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {38346#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {38346#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:57:04,675 INFO L272 TraceCheckUtils]: 13: Hoare triple {38346#(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)); {38308#true} is VALID [2022-04-08 07:57:04,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,679 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38308#true} {38346#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {38346#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:57:04,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {38346#(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; {38368#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:57:04,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {38368#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {38368#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:57:04,680 INFO L272 TraceCheckUtils]: 20: Hoare triple {38368#(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)); {38308#true} is VALID [2022-04-08 07:57:04,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,681 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {38308#true} {38368#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {38368#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:57:04,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {38368#(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; {38390#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:57:04,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {38390#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {38390#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:57:04,682 INFO L272 TraceCheckUtils]: 27: Hoare triple {38390#(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)); {38308#true} is VALID [2022-04-08 07:57:04,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,682 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {38308#true} {38390#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {38390#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:57:04,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {38390#(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; {38412#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:57:04,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {38412#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {38412#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:57:04,683 INFO L272 TraceCheckUtils]: 34: Hoare triple {38412#(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)); {38308#true} is VALID [2022-04-08 07:57:04,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,683 INFO L290 TraceCheckUtils]: 36: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,684 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {38308#true} {38412#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {38412#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:57:04,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {38412#(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; {38434#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:57:04,685 INFO L290 TraceCheckUtils]: 40: Hoare triple {38434#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {38434#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:57:04,685 INFO L272 TraceCheckUtils]: 41: Hoare triple {38434#(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)); {38308#true} is VALID [2022-04-08 07:57:04,685 INFO L290 TraceCheckUtils]: 42: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,686 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {38308#true} {38434#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {38434#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:57:04,686 INFO L290 TraceCheckUtils]: 46: Hoare triple {38434#(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; {38456#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 07:57:04,686 INFO L290 TraceCheckUtils]: 47: Hoare triple {38456#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {38456#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 07:57:04,686 INFO L272 TraceCheckUtils]: 48: Hoare triple {38456#(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)); {38308#true} is VALID [2022-04-08 07:57:04,687 INFO L290 TraceCheckUtils]: 49: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,687 INFO L290 TraceCheckUtils]: 50: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,687 INFO L290 TraceCheckUtils]: 51: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,687 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {38308#true} {38456#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #54#return; {38456#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 07:57:04,688 INFO L290 TraceCheckUtils]: 53: Hoare triple {38456#(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; {38478#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:57:04,688 INFO L290 TraceCheckUtils]: 54: Hoare triple {38478#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {38478#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:57:04,688 INFO L272 TraceCheckUtils]: 55: Hoare triple {38478#(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)); {38308#true} is VALID [2022-04-08 07:57:04,688 INFO L290 TraceCheckUtils]: 56: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,688 INFO L290 TraceCheckUtils]: 57: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,689 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {38308#true} {38478#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #54#return; {38478#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:57:04,689 INFO L290 TraceCheckUtils]: 60: Hoare triple {38478#(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; {38500#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:57:04,689 INFO L290 TraceCheckUtils]: 61: Hoare triple {38500#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {38500#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:57:04,690 INFO L272 TraceCheckUtils]: 62: Hoare triple {38500#(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)); {38308#true} is VALID [2022-04-08 07:57:04,690 INFO L290 TraceCheckUtils]: 63: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,690 INFO L290 TraceCheckUtils]: 64: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,690 INFO L290 TraceCheckUtils]: 65: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,690 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {38308#true} {38500#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #54#return; {38500#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:57:04,691 INFO L290 TraceCheckUtils]: 67: Hoare triple {38500#(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; {38522#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:57:04,691 INFO L290 TraceCheckUtils]: 68: Hoare triple {38522#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} assume !false; {38522#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:57:04,691 INFO L272 TraceCheckUtils]: 69: Hoare triple {38522#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38308#true} is VALID [2022-04-08 07:57:04,691 INFO L290 TraceCheckUtils]: 70: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,691 INFO L290 TraceCheckUtils]: 71: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,691 INFO L290 TraceCheckUtils]: 72: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,692 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {38308#true} {38522#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} #54#return; {38522#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:57:04,692 INFO L290 TraceCheckUtils]: 74: Hoare triple {38522#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {38544#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 07:57:04,692 INFO L290 TraceCheckUtils]: 75: Hoare triple {38544#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} assume !false; {38544#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 07:57:04,693 INFO L272 TraceCheckUtils]: 76: Hoare triple {38544#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38308#true} is VALID [2022-04-08 07:57:04,693 INFO L290 TraceCheckUtils]: 77: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,693 INFO L290 TraceCheckUtils]: 78: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,693 INFO L290 TraceCheckUtils]: 79: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,693 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {38308#true} {38544#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} #54#return; {38544#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 07:57:04,694 INFO L290 TraceCheckUtils]: 81: Hoare triple {38544#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {38566#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 07:57:04,694 INFO L290 TraceCheckUtils]: 82: Hoare triple {38566#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} assume !false; {38566#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 07:57:04,694 INFO L272 TraceCheckUtils]: 83: Hoare triple {38566#(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)); {38308#true} is VALID [2022-04-08 07:57:04,694 INFO L290 TraceCheckUtils]: 84: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,694 INFO L290 TraceCheckUtils]: 85: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,694 INFO L290 TraceCheckUtils]: 86: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,695 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {38308#true} {38566#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} #54#return; {38566#(and (= 7 (+ main_~y~0 (- 3))) (= main_~c~0 10))} is VALID [2022-04-08 07:57:04,695 INFO L290 TraceCheckUtils]: 88: Hoare triple {38566#(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; {38588#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:57:04,695 INFO L290 TraceCheckUtils]: 89: Hoare triple {38588#(and (= main_~c~0 11) (= main_~y~0 11))} assume !false; {38588#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:57:04,695 INFO L272 TraceCheckUtils]: 90: Hoare triple {38588#(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)); {38308#true} is VALID [2022-04-08 07:57:04,695 INFO L290 TraceCheckUtils]: 91: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,696 INFO L290 TraceCheckUtils]: 92: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,696 INFO L290 TraceCheckUtils]: 93: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,696 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {38308#true} {38588#(and (= main_~c~0 11) (= main_~y~0 11))} #54#return; {38588#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 07:57:04,696 INFO L290 TraceCheckUtils]: 95: Hoare triple {38588#(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; {38610#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:57:04,697 INFO L290 TraceCheckUtils]: 96: Hoare triple {38610#(and (= main_~y~0 12) (= main_~c~0 12))} assume !false; {38610#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:57:04,697 INFO L272 TraceCheckUtils]: 97: Hoare triple {38610#(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)); {38308#true} is VALID [2022-04-08 07:57:04,697 INFO L290 TraceCheckUtils]: 98: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,697 INFO L290 TraceCheckUtils]: 99: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,697 INFO L290 TraceCheckUtils]: 100: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,697 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {38308#true} {38610#(and (= main_~y~0 12) (= main_~c~0 12))} #54#return; {38610#(and (= main_~y~0 12) (= main_~c~0 12))} is VALID [2022-04-08 07:57:04,698 INFO L290 TraceCheckUtils]: 102: Hoare triple {38610#(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; {38632#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:57:04,698 INFO L290 TraceCheckUtils]: 103: Hoare triple {38632#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} assume !false; {38632#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:57:04,698 INFO L272 TraceCheckUtils]: 104: Hoare triple {38632#(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)); {38308#true} is VALID [2022-04-08 07:57:04,698 INFO L290 TraceCheckUtils]: 105: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,698 INFO L290 TraceCheckUtils]: 106: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,698 INFO L290 TraceCheckUtils]: 107: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,699 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {38308#true} {38632#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} #54#return; {38632#(and (= (+ (- 1) main_~c~0) 12) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:57:04,699 INFO L290 TraceCheckUtils]: 109: Hoare triple {38632#(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; {38654#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 07:57:04,700 INFO L290 TraceCheckUtils]: 110: Hoare triple {38654#(and (= main_~y~0 14) (= main_~c~0 14))} assume !false; {38654#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 07:57:04,700 INFO L272 TraceCheckUtils]: 111: Hoare triple {38654#(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)); {38308#true} is VALID [2022-04-08 07:57:04,700 INFO L290 TraceCheckUtils]: 112: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,700 INFO L290 TraceCheckUtils]: 113: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,700 INFO L290 TraceCheckUtils]: 114: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,700 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {38308#true} {38654#(and (= main_~y~0 14) (= main_~c~0 14))} #54#return; {38654#(and (= main_~y~0 14) (= main_~c~0 14))} is VALID [2022-04-08 07:57:04,701 INFO L290 TraceCheckUtils]: 116: Hoare triple {38654#(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; {38676#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:57:04,701 INFO L290 TraceCheckUtils]: 117: Hoare triple {38676#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !false; {38676#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:57:04,701 INFO L272 TraceCheckUtils]: 118: Hoare triple {38676#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38308#true} is VALID [2022-04-08 07:57:04,701 INFO L290 TraceCheckUtils]: 119: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,701 INFO L290 TraceCheckUtils]: 120: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,701 INFO L290 TraceCheckUtils]: 121: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,702 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {38308#true} {38676#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} #54#return; {38676#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:57:04,702 INFO L290 TraceCheckUtils]: 123: Hoare triple {38676#(and (= (+ (- 1) main_~c~0) 14) (= 14 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {38698#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 07:57:04,703 INFO L290 TraceCheckUtils]: 124: Hoare triple {38698#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} assume !false; {38698#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 07:57:04,703 INFO L272 TraceCheckUtils]: 125: Hoare triple {38698#(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)); {38308#true} is VALID [2022-04-08 07:57:04,703 INFO L290 TraceCheckUtils]: 126: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,703 INFO L290 TraceCheckUtils]: 127: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,703 INFO L290 TraceCheckUtils]: 128: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,703 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {38308#true} {38698#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} #54#return; {38698#(and (= 14 (+ (- 2) main_~c~0)) (= main_~y~0 16))} is VALID [2022-04-08 07:57:04,704 INFO L290 TraceCheckUtils]: 130: Hoare triple {38698#(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; {38720#(and (= (+ main_~c~0 (- 3)) 14) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:57:04,704 INFO L290 TraceCheckUtils]: 131: Hoare triple {38720#(and (= (+ main_~c~0 (- 3)) 14) (= 16 (+ (- 1) main_~y~0)))} assume !false; {38720#(and (= (+ main_~c~0 (- 3)) 14) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:57:04,704 INFO L272 TraceCheckUtils]: 132: Hoare triple {38720#(and (= (+ main_~c~0 (- 3)) 14) (= 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)); {38308#true} is VALID [2022-04-08 07:57:04,704 INFO L290 TraceCheckUtils]: 133: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,704 INFO L290 TraceCheckUtils]: 134: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,704 INFO L290 TraceCheckUtils]: 135: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,705 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {38308#true} {38720#(and (= (+ main_~c~0 (- 3)) 14) (= 16 (+ (- 1) main_~y~0)))} #54#return; {38720#(and (= (+ main_~c~0 (- 3)) 14) (= 16 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:57:04,705 INFO L290 TraceCheckUtils]: 137: Hoare triple {38720#(and (= (+ main_~c~0 (- 3)) 14) (= 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; {38742#(and (= (+ (- 2) main_~y~0) 16) (= 14 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 07:57:04,705 INFO L290 TraceCheckUtils]: 138: Hoare triple {38742#(and (= (+ (- 2) main_~y~0) 16) (= 14 (+ main_~c~0 (- 4))))} assume !false; {38742#(and (= (+ (- 2) main_~y~0) 16) (= 14 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 07:57:04,706 INFO L272 TraceCheckUtils]: 139: Hoare triple {38742#(and (= (+ (- 2) main_~y~0) 16) (= 14 (+ 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)); {38308#true} is VALID [2022-04-08 07:57:04,706 INFO L290 TraceCheckUtils]: 140: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,706 INFO L290 TraceCheckUtils]: 141: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,706 INFO L290 TraceCheckUtils]: 142: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,706 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {38308#true} {38742#(and (= (+ (- 2) main_~y~0) 16) (= 14 (+ main_~c~0 (- 4))))} #54#return; {38742#(and (= (+ (- 2) main_~y~0) 16) (= 14 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 07:57:04,707 INFO L290 TraceCheckUtils]: 144: Hoare triple {38742#(and (= (+ (- 2) main_~y~0) 16) (= 14 (+ 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; {38764#(and (= 14 (+ main_~c~0 (- 5))) (= 19 main_~y~0))} is VALID [2022-04-08 07:57:04,707 INFO L290 TraceCheckUtils]: 145: Hoare triple {38764#(and (= 14 (+ main_~c~0 (- 5))) (= 19 main_~y~0))} assume !false; {38764#(and (= 14 (+ main_~c~0 (- 5))) (= 19 main_~y~0))} is VALID [2022-04-08 07:57:04,707 INFO L272 TraceCheckUtils]: 146: Hoare triple {38764#(and (= 14 (+ main_~c~0 (- 5))) (= 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)); {38308#true} is VALID [2022-04-08 07:57:04,707 INFO L290 TraceCheckUtils]: 147: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,707 INFO L290 TraceCheckUtils]: 148: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,707 INFO L290 TraceCheckUtils]: 149: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,708 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {38308#true} {38764#(and (= 14 (+ main_~c~0 (- 5))) (= 19 main_~y~0))} #54#return; {38764#(and (= 14 (+ main_~c~0 (- 5))) (= 19 main_~y~0))} is VALID [2022-04-08 07:57:04,708 INFO L290 TraceCheckUtils]: 151: Hoare triple {38764#(and (= 14 (+ main_~c~0 (- 5))) (= 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; {38786#(and (= 14 (+ main_~c~0 (- 6))) (= main_~y~0 20))} is VALID [2022-04-08 07:57:04,708 INFO L290 TraceCheckUtils]: 152: Hoare triple {38786#(and (= 14 (+ main_~c~0 (- 6))) (= main_~y~0 20))} assume !false; {38786#(and (= 14 (+ main_~c~0 (- 6))) (= main_~y~0 20))} is VALID [2022-04-08 07:57:04,708 INFO L272 TraceCheckUtils]: 153: Hoare triple {38786#(and (= 14 (+ main_~c~0 (- 6))) (= 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)); {38308#true} is VALID [2022-04-08 07:57:04,709 INFO L290 TraceCheckUtils]: 154: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,709 INFO L290 TraceCheckUtils]: 155: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,709 INFO L290 TraceCheckUtils]: 156: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,709 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {38308#true} {38786#(and (= 14 (+ main_~c~0 (- 6))) (= main_~y~0 20))} #54#return; {38786#(and (= 14 (+ main_~c~0 (- 6))) (= main_~y~0 20))} is VALID [2022-04-08 07:57:04,709 INFO L290 TraceCheckUtils]: 158: Hoare triple {38786#(and (= 14 (+ main_~c~0 (- 6))) (= 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; {38808#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:57:04,710 INFO L290 TraceCheckUtils]: 159: Hoare triple {38808#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} assume !false; {38808#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:57:04,710 INFO L272 TraceCheckUtils]: 160: Hoare triple {38808#(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)); {38308#true} is VALID [2022-04-08 07:57:04,710 INFO L290 TraceCheckUtils]: 161: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,710 INFO L290 TraceCheckUtils]: 162: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,710 INFO L290 TraceCheckUtils]: 163: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,711 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {38308#true} {38808#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} #54#return; {38808#(and (= main_~c~0 21) (= 20 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:57:04,711 INFO L290 TraceCheckUtils]: 165: Hoare triple {38808#(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; {38830#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:57:04,711 INFO L290 TraceCheckUtils]: 166: Hoare triple {38830#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} assume !false; {38830#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:57:04,711 INFO L272 TraceCheckUtils]: 167: Hoare triple {38830#(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)); {38308#true} is VALID [2022-04-08 07:57:04,711 INFO L290 TraceCheckUtils]: 168: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,712 INFO L290 TraceCheckUtils]: 169: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,712 INFO L290 TraceCheckUtils]: 170: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,712 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {38308#true} {38830#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} #54#return; {38830#(and (= main_~y~0 22) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:57:04,712 INFO L290 TraceCheckUtils]: 172: Hoare triple {38830#(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; {38852#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:57:04,713 INFO L290 TraceCheckUtils]: 173: Hoare triple {38852#(and (= 23 main_~y~0) (= 23 main_~c~0))} assume !false; {38852#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:57:04,713 INFO L272 TraceCheckUtils]: 174: Hoare triple {38852#(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)); {38308#true} is VALID [2022-04-08 07:57:04,713 INFO L290 TraceCheckUtils]: 175: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,713 INFO L290 TraceCheckUtils]: 176: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,713 INFO L290 TraceCheckUtils]: 177: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,713 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {38308#true} {38852#(and (= 23 main_~y~0) (= 23 main_~c~0))} #54#return; {38852#(and (= 23 main_~y~0) (= 23 main_~c~0))} is VALID [2022-04-08 07:57:04,714 INFO L290 TraceCheckUtils]: 179: Hoare triple {38852#(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; {38874#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:57:04,714 INFO L290 TraceCheckUtils]: 180: Hoare triple {38874#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} assume !false; {38874#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:57:04,714 INFO L272 TraceCheckUtils]: 181: Hoare triple {38874#(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)); {38308#true} is VALID [2022-04-08 07:57:04,714 INFO L290 TraceCheckUtils]: 182: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,714 INFO L290 TraceCheckUtils]: 183: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,714 INFO L290 TraceCheckUtils]: 184: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,715 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {38308#true} {38874#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} #54#return; {38874#(and (= main_~y~0 24) (= 23 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:57:04,715 INFO L290 TraceCheckUtils]: 186: Hoare triple {38874#(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; {38896#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 07:57:04,716 INFO L290 TraceCheckUtils]: 187: Hoare triple {38896#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} assume !false; {38896#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 07:57:04,716 INFO L272 TraceCheckUtils]: 188: Hoare triple {38896#(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)); {38308#true} is VALID [2022-04-08 07:57:04,716 INFO L290 TraceCheckUtils]: 189: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,716 INFO L290 TraceCheckUtils]: 190: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,716 INFO L290 TraceCheckUtils]: 191: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,716 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {38308#true} {38896#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} #54#return; {38896#(and (= main_~c~0 25) (= (+ (- 1) main_~y~0) 24))} is VALID [2022-04-08 07:57:04,717 INFO L290 TraceCheckUtils]: 193: Hoare triple {38896#(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; {38918#(and (= (+ (- 2) main_~y~0) 24) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-08 07:57:04,717 INFO L290 TraceCheckUtils]: 194: Hoare triple {38918#(and (= (+ (- 2) main_~y~0) 24) (= (+ (- 1) main_~c~0) 25))} assume !false; {38918#(and (= (+ (- 2) main_~y~0) 24) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-08 07:57:04,717 INFO L272 TraceCheckUtils]: 195: Hoare triple {38918#(and (= (+ (- 2) main_~y~0) 24) (= (+ (- 1) main_~c~0) 25))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {38308#true} is VALID [2022-04-08 07:57:04,717 INFO L290 TraceCheckUtils]: 196: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,717 INFO L290 TraceCheckUtils]: 197: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,717 INFO L290 TraceCheckUtils]: 198: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,718 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {38308#true} {38918#(and (= (+ (- 2) main_~y~0) 24) (= (+ (- 1) main_~c~0) 25))} #54#return; {38918#(and (= (+ (- 2) main_~y~0) 24) (= (+ (- 1) main_~c~0) 25))} is VALID [2022-04-08 07:57:04,718 INFO L290 TraceCheckUtils]: 200: Hoare triple {38918#(and (= (+ (- 2) main_~y~0) 24) (= (+ (- 1) main_~c~0) 25))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {38940#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 07:57:04,719 INFO L290 TraceCheckUtils]: 201: Hoare triple {38940#(and (= main_~y~0 27) (= main_~c~0 27))} assume !false; {38940#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 07:57:04,719 INFO L272 TraceCheckUtils]: 202: Hoare triple {38940#(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)); {38308#true} is VALID [2022-04-08 07:57:04,719 INFO L290 TraceCheckUtils]: 203: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,719 INFO L290 TraceCheckUtils]: 204: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,719 INFO L290 TraceCheckUtils]: 205: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,719 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {38308#true} {38940#(and (= main_~y~0 27) (= main_~c~0 27))} #54#return; {38940#(and (= main_~y~0 27) (= main_~c~0 27))} is VALID [2022-04-08 07:57:04,720 INFO L290 TraceCheckUtils]: 207: Hoare triple {38940#(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; {38962#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 07:57:04,720 INFO L290 TraceCheckUtils]: 208: Hoare triple {38962#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} assume !false; {38962#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 07:57:04,720 INFO L272 TraceCheckUtils]: 209: Hoare triple {38962#(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)); {38308#true} is VALID [2022-04-08 07:57:04,720 INFO L290 TraceCheckUtils]: 210: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,720 INFO L290 TraceCheckUtils]: 211: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,720 INFO L290 TraceCheckUtils]: 212: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,721 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {38308#true} {38962#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} #54#return; {38962#(and (= (+ (- 1) main_~c~0) 27) (= (+ (- 1) main_~y~0) 27))} is VALID [2022-04-08 07:57:04,721 INFO L290 TraceCheckUtils]: 214: Hoare triple {38962#(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; {38984#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:57:04,722 INFO L290 TraceCheckUtils]: 215: Hoare triple {38984#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} assume !false; {38984#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:57:04,722 INFO L272 TraceCheckUtils]: 216: Hoare triple {38984#(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)); {38308#true} is VALID [2022-04-08 07:57:04,722 INFO L290 TraceCheckUtils]: 217: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,722 INFO L290 TraceCheckUtils]: 218: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,722 INFO L290 TraceCheckUtils]: 219: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,722 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {38308#true} {38984#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} #54#return; {38984#(and (= 29 main_~y~0) (= 27 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:57:04,723 INFO L290 TraceCheckUtils]: 221: Hoare triple {38984#(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; {39006#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 07:57:04,723 INFO L290 TraceCheckUtils]: 222: Hoare triple {39006#(and (= 30 main_~y~0) (= 30 main_~c~0))} assume !false; {39006#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 07:57:04,723 INFO L272 TraceCheckUtils]: 223: Hoare triple {39006#(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)); {38308#true} is VALID [2022-04-08 07:57:04,723 INFO L290 TraceCheckUtils]: 224: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,723 INFO L290 TraceCheckUtils]: 225: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,723 INFO L290 TraceCheckUtils]: 226: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,724 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {38308#true} {39006#(and (= 30 main_~y~0) (= 30 main_~c~0))} #54#return; {39006#(and (= 30 main_~y~0) (= 30 main_~c~0))} is VALID [2022-04-08 07:57:04,724 INFO L290 TraceCheckUtils]: 228: Hoare triple {39006#(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; {39028#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-08 07:57:04,724 INFO L290 TraceCheckUtils]: 229: Hoare triple {39028#(and (= main_~y~0 31) (= main_~c~0 31))} assume !false; {39028#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-08 07:57:04,725 INFO L272 TraceCheckUtils]: 230: Hoare triple {39028#(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)); {38308#true} is VALID [2022-04-08 07:57:04,725 INFO L290 TraceCheckUtils]: 231: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,725 INFO L290 TraceCheckUtils]: 232: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,725 INFO L290 TraceCheckUtils]: 233: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,725 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {38308#true} {39028#(and (= main_~y~0 31) (= main_~c~0 31))} #54#return; {39028#(and (= main_~y~0 31) (= main_~c~0 31))} is VALID [2022-04-08 07:57:04,726 INFO L290 TraceCheckUtils]: 235: Hoare triple {39028#(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; {39050#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 07:57:04,726 INFO L290 TraceCheckUtils]: 236: Hoare triple {39050#(and (= 32 main_~y~0) (= 32 main_~c~0))} assume !false; {39050#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 07:57:04,726 INFO L272 TraceCheckUtils]: 237: Hoare triple {39050#(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)); {38308#true} is VALID [2022-04-08 07:57:04,726 INFO L290 TraceCheckUtils]: 238: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,726 INFO L290 TraceCheckUtils]: 239: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,726 INFO L290 TraceCheckUtils]: 240: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,727 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {38308#true} {39050#(and (= 32 main_~y~0) (= 32 main_~c~0))} #54#return; {39050#(and (= 32 main_~y~0) (= 32 main_~c~0))} is VALID [2022-04-08 07:57:04,727 INFO L290 TraceCheckUtils]: 242: Hoare triple {39050#(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; {39072#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} is VALID [2022-04-08 07:57:04,727 INFO L290 TraceCheckUtils]: 243: Hoare triple {39072#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} assume !false; {39072#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} is VALID [2022-04-08 07:57:04,727 INFO L272 TraceCheckUtils]: 244: Hoare triple {39072#(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)); {38308#true} is VALID [2022-04-08 07:57:04,728 INFO L290 TraceCheckUtils]: 245: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,728 INFO L290 TraceCheckUtils]: 246: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,728 INFO L290 TraceCheckUtils]: 247: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,728 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {38308#true} {39072#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} #54#return; {39072#(and (= main_~y~0 33) (= (+ (- 1) main_~c~0) 32))} is VALID [2022-04-08 07:57:04,728 INFO L290 TraceCheckUtils]: 249: Hoare triple {39072#(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; {39094#(and (= 32 (+ (- 2) main_~c~0)) (= main_~y~0 34))} is VALID [2022-04-08 07:57:04,729 INFO L290 TraceCheckUtils]: 250: Hoare triple {39094#(and (= 32 (+ (- 2) main_~c~0)) (= main_~y~0 34))} assume !false; {39094#(and (= 32 (+ (- 2) main_~c~0)) (= main_~y~0 34))} is VALID [2022-04-08 07:57:04,729 INFO L272 TraceCheckUtils]: 251: Hoare triple {39094#(and (= 32 (+ (- 2) main_~c~0)) (= main_~y~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)); {38308#true} is VALID [2022-04-08 07:57:04,729 INFO L290 TraceCheckUtils]: 252: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,729 INFO L290 TraceCheckUtils]: 253: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,729 INFO L290 TraceCheckUtils]: 254: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,730 INFO L284 TraceCheckUtils]: 255: Hoare quadruple {38308#true} {39094#(and (= 32 (+ (- 2) main_~c~0)) (= main_~y~0 34))} #54#return; {39094#(and (= 32 (+ (- 2) main_~c~0)) (= main_~y~0 34))} is VALID [2022-04-08 07:57:04,730 INFO L290 TraceCheckUtils]: 256: Hoare triple {39094#(and (= 32 (+ (- 2) main_~c~0)) (= main_~y~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; {39116#(and (= 35 main_~c~0) (= 34 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:57:04,730 INFO L290 TraceCheckUtils]: 257: Hoare triple {39116#(and (= 35 main_~c~0) (= 34 (+ (- 1) main_~y~0)))} assume !false; {39116#(and (= 35 main_~c~0) (= 34 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:57:04,730 INFO L272 TraceCheckUtils]: 258: Hoare triple {39116#(and (= 35 main_~c~0) (= 34 (+ (- 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)); {38308#true} is VALID [2022-04-08 07:57:04,730 INFO L290 TraceCheckUtils]: 259: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,730 INFO L290 TraceCheckUtils]: 260: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,731 INFO L290 TraceCheckUtils]: 261: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,731 INFO L284 TraceCheckUtils]: 262: Hoare quadruple {38308#true} {39116#(and (= 35 main_~c~0) (= 34 (+ (- 1) main_~y~0)))} #54#return; {39116#(and (= 35 main_~c~0) (= 34 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:57:04,731 INFO L290 TraceCheckUtils]: 263: Hoare triple {39116#(and (= 35 main_~c~0) (= 34 (+ (- 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; {39138#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-08 07:57:04,732 INFO L290 TraceCheckUtils]: 264: Hoare triple {39138#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} assume !false; {39138#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-08 07:57:04,732 INFO L272 TraceCheckUtils]: 265: Hoare triple {39138#(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)); {38308#true} is VALID [2022-04-08 07:57:04,732 INFO L290 TraceCheckUtils]: 266: Hoare triple {38308#true} ~cond := #in~cond; {38308#true} is VALID [2022-04-08 07:57:04,732 INFO L290 TraceCheckUtils]: 267: Hoare triple {38308#true} assume !(0 == ~cond); {38308#true} is VALID [2022-04-08 07:57:04,732 INFO L290 TraceCheckUtils]: 268: Hoare triple {38308#true} assume true; {38308#true} is VALID [2022-04-08 07:57:04,732 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {38308#true} {39138#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} #54#return; {39138#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-08 07:57:04,733 INFO L290 TraceCheckUtils]: 270: Hoare triple {39138#(and (<= main_~c~0 36) (= main_~y~0 36) (< 35 main_~k~0))} assume !(~c~0 < ~k~0); {39160#(and (<= main_~k~0 36) (= main_~y~0 36) (< 35 main_~k~0))} is VALID [2022-04-08 07:57:04,734 INFO L272 TraceCheckUtils]: 271: Hoare triple {39160#(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)); {39164#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:57:04,734 INFO L290 TraceCheckUtils]: 272: Hoare triple {39164#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {39168#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:57:04,734 INFO L290 TraceCheckUtils]: 273: Hoare triple {39168#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {38309#false} is VALID [2022-04-08 07:57:04,734 INFO L290 TraceCheckUtils]: 274: Hoare triple {38309#false} assume !false; {38309#false} is VALID [2022-04-08 07:57:04,736 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 07:57:04,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:57:05,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:57:05,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196413787] [2022-04-08 07:57:05,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:57:05,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550712312] [2022-04-08 07:57:05,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550712312] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:57:05,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:57:05,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2022-04-08 07:57:05,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:57:05,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1261980801] [2022-04-08 07:57:05,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1261980801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:57:05,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:57:05,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-08 07:57:05,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852433528] [2022-04-08 07:57:05,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:57:05,215 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 39 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) Word has length 275 [2022-04-08 07:57:05,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:57:05,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 39 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2022-04-08 07:57:06,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:57:06,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-08 07:57:06,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:57:06,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-08 07:57:06,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 07:57:06,291 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 39 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2022-04-08 07:57:56,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:57:56,316 INFO L93 Difference]: Finished difference Result 148 states and 183 transitions. [2022-04-08 07:57:56,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-08 07:57:56,316 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 39 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) Word has length 275 [2022-04-08 07:57:56,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:57:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 39 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2022-04-08 07:57:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 176 transitions. [2022-04-08 07:57:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 39 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2022-04-08 07:57:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 176 transitions. [2022-04-08 07:57:56,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 176 transitions. [2022-04-08 07:57:57,483 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 07:57:57,485 INFO L225 Difference]: With dead ends: 148 [2022-04-08 07:57:57,485 INFO L226 Difference]: Without dead ends: 143 [2022-04-08 07:57:57,486 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=2023, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 07:57:57,486 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 2 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 4531 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 4531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.7s IncrementalHoareTripleChecker+Time [2022-04-08 07:57:57,486 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2285 Invalid, 4531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4531 Invalid, 0 Unknown, 0 Unchecked, 26.7s Time] [2022-04-08 07:57:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-08 07:57:57,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-04-08 07:57:57,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:57:57,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 143 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 42 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 07:57:57,653 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 143 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 42 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 07:57:57,653 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 143 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 42 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 07:57:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:57:57,656 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2022-04-08 07:57:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 178 transitions. [2022-04-08 07:57:57,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:57:57,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:57:57,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 42 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 143 states. [2022-04-08 07:57:57,656 INFO L87 Difference]: Start difference. First operand has 143 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 42 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 143 states. [2022-04-08 07:57:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:57:57,659 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2022-04-08 07:57:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 178 transitions. [2022-04-08 07:57:57,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:57:57,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:57:57,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:57:57,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:57:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 42 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 07:57:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 178 transitions. [2022-04-08 07:57:57,662 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 178 transitions. Word has length 275 [2022-04-08 07:57:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:57:57,662 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 178 transitions. [2022-04-08 07:57:57,662 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 39 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2022-04-08 07:57:57,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 178 transitions. [2022-04-08 07:57:59,140 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 07:57:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 178 transitions. [2022-04-08 07:57:59,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-04-08 07:57:59,142 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:57:59,142 INFO L499 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:57:59,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-08 07:57:59,342 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 07:57:59,342 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:57:59,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:57:59,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1261596040, now seen corresponding path program 73 times [2022-04-08 07:57:59,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:57:59,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1085500040] [2022-04-08 07:57:59,412 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:57:59,412 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:57:59,412 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:57:59,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1261596040, now seen corresponding path program 74 times [2022-04-08 07:57:59,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:57:59,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086271650] [2022-04-08 07:57:59,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:57:59,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:57:59,429 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:57:59,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666329831] [2022-04-08 07:57:59,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:57:59,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:57:59,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:57:59,431 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 07:57:59,432 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 07:58:00,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:58:00,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:58:00,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 156 conjunts are in the unsatisfiable core [2022-04-08 07:58:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:58:00,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:58:02,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {40088#true} call ULTIMATE.init(); {40088#true} is VALID [2022-04-08 07:58:02,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {40088#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); {40088#true} is VALID [2022-04-08 07:58:02,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40088#true} {40088#true} #60#return; {40088#true} is VALID [2022-04-08 07:58:02,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {40088#true} call #t~ret5 := main(); {40088#true} is VALID [2022-04-08 07:58:02,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {40088#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; {40088#true} is VALID [2022-04-08 07:58:02,551 INFO L272 TraceCheckUtils]: 6: Hoare triple {40088#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {40088#true} is VALID [2022-04-08 07:58:02,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,551 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40088#true} {40088#true} #52#return; {40088#true} is VALID [2022-04-08 07:58:02,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {40088#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {40126#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:58:02,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {40126#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {40126#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:58:02,552 INFO L272 TraceCheckUtils]: 13: Hoare triple {40126#(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)); {40088#true} is VALID [2022-04-08 07:58:02,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,553 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {40088#true} {40126#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {40126#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:58:02,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {40126#(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; {40148#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:58:02,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {40148#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {40148#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:58:02,554 INFO L272 TraceCheckUtils]: 20: Hoare triple {40148#(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)); {40088#true} is VALID [2022-04-08 07:58:02,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,554 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {40088#true} {40148#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {40148#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:58:02,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {40148#(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; {40170#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:58:02,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {40170#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {40170#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:58:02,555 INFO L272 TraceCheckUtils]: 27: Hoare triple {40170#(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)); {40088#true} is VALID [2022-04-08 07:58:02,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,555 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {40088#true} {40170#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {40170#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:58:02,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {40170#(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; {40192#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:58:02,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {40192#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {40192#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:58:02,556 INFO L272 TraceCheckUtils]: 34: Hoare triple {40192#(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)); {40088#true} is VALID [2022-04-08 07:58:02,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,556 INFO L290 TraceCheckUtils]: 36: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,557 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {40088#true} {40192#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #54#return; {40192#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:58:02,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {40192#(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; {40214#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-08 07:58:02,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {40214#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !false; {40214#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-08 07:58:02,558 INFO L272 TraceCheckUtils]: 41: Hoare triple {40214#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40088#true} is VALID [2022-04-08 07:58:02,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,558 INFO L290 TraceCheckUtils]: 43: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,558 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {40088#true} {40214#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} #54#return; {40214#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-08 07:58:02,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {40214#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40236#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 07:58:02,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {40236#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {40236#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 07:58:02,559 INFO L272 TraceCheckUtils]: 48: Hoare triple {40236#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40088#true} is VALID [2022-04-08 07:58:02,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,559 INFO L290 TraceCheckUtils]: 51: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,563 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {40088#true} {40236#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #54#return; {40236#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 07:58:02,564 INFO L290 TraceCheckUtils]: 53: Hoare triple {40236#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40258#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:58:02,564 INFO L290 TraceCheckUtils]: 54: Hoare triple {40258#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} assume !false; {40258#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:58:02,564 INFO L272 TraceCheckUtils]: 55: Hoare triple {40258#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40088#true} is VALID [2022-04-08 07:58:02,564 INFO L290 TraceCheckUtils]: 56: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,564 INFO L290 TraceCheckUtils]: 57: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,564 INFO L290 TraceCheckUtils]: 58: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,565 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {40088#true} {40258#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} #54#return; {40258#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:58:02,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {40258#(and (= 2 (+ main_~c~0 (- 4))) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40280#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 07:58:02,566 INFO L290 TraceCheckUtils]: 61: Hoare triple {40280#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !false; {40280#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 07:58:02,566 INFO L272 TraceCheckUtils]: 62: Hoare triple {40280#(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)); {40088#true} is VALID [2022-04-08 07:58:02,566 INFO L290 TraceCheckUtils]: 63: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,566 INFO L290 TraceCheckUtils]: 64: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,566 INFO L290 TraceCheckUtils]: 65: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,566 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {40088#true} {40280#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #54#return; {40280#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-08 07:58:02,567 INFO L290 TraceCheckUtils]: 67: Hoare triple {40280#(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; {40302#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:58:02,567 INFO L290 TraceCheckUtils]: 68: Hoare triple {40302#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} assume !false; {40302#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:58:02,567 INFO L272 TraceCheckUtils]: 69: Hoare triple {40302#(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)); {40088#true} is VALID [2022-04-08 07:58:02,567 INFO L290 TraceCheckUtils]: 70: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,568 INFO L290 TraceCheckUtils]: 71: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,568 INFO L290 TraceCheckUtils]: 72: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,568 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {40088#true} {40302#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} #54#return; {40302#(and (= (+ main_~y~0 (- 3)) 5) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:58:02,569 INFO L290 TraceCheckUtils]: 74: Hoare triple {40302#(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; {40324#(and (= 5 (+ main_~y~0 (- 4))) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:58:02,569 INFO L290 TraceCheckUtils]: 75: Hoare triple {40324#(and (= 5 (+ main_~y~0 (- 4))) (= 7 (+ (- 2) main_~c~0)))} assume !false; {40324#(and (= 5 (+ main_~y~0 (- 4))) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:58:02,569 INFO L272 TraceCheckUtils]: 76: Hoare triple {40324#(and (= 5 (+ main_~y~0 (- 4))) (= 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)); {40088#true} is VALID [2022-04-08 07:58:02,569 INFO L290 TraceCheckUtils]: 77: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,569 INFO L290 TraceCheckUtils]: 78: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,569 INFO L290 TraceCheckUtils]: 79: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,570 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {40088#true} {40324#(and (= 5 (+ main_~y~0 (- 4))) (= 7 (+ (- 2) main_~c~0)))} #54#return; {40324#(and (= 5 (+ main_~y~0 (- 4))) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:58:02,570 INFO L290 TraceCheckUtils]: 81: Hoare triple {40324#(and (= 5 (+ main_~y~0 (- 4))) (= 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; {40346#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:58:02,570 INFO L290 TraceCheckUtils]: 82: Hoare triple {40346#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} assume !false; {40346#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:58:02,571 INFO L272 TraceCheckUtils]: 83: Hoare triple {40346#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40088#true} is VALID [2022-04-08 07:58:02,571 INFO L290 TraceCheckUtils]: 84: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,571 INFO L290 TraceCheckUtils]: 85: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,571 INFO L290 TraceCheckUtils]: 86: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,571 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {40088#true} {40346#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} #54#return; {40346#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:58:02,572 INFO L290 TraceCheckUtils]: 88: Hoare triple {40346#(and (= main_~y~0 10) (= 7 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40368#(and (= (+ (- 1) main_~y~0) 10) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 07:58:02,572 INFO L290 TraceCheckUtils]: 89: Hoare triple {40368#(and (= (+ (- 1) main_~y~0) 10) (= 7 (+ main_~c~0 (- 4))))} assume !false; {40368#(and (= (+ (- 1) main_~y~0) 10) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 07:58:02,572 INFO L272 TraceCheckUtils]: 90: Hoare triple {40368#(and (= (+ (- 1) main_~y~0) 10) (= 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)); {40088#true} is VALID [2022-04-08 07:58:02,572 INFO L290 TraceCheckUtils]: 91: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,572 INFO L290 TraceCheckUtils]: 92: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,572 INFO L290 TraceCheckUtils]: 93: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,573 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {40088#true} {40368#(and (= (+ (- 1) main_~y~0) 10) (= 7 (+ main_~c~0 (- 4))))} #54#return; {40368#(and (= (+ (- 1) main_~y~0) 10) (= 7 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 07:58:02,573 INFO L290 TraceCheckUtils]: 95: Hoare triple {40368#(and (= (+ (- 1) main_~y~0) 10) (= 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; {40390#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-08 07:58:02,574 INFO L290 TraceCheckUtils]: 96: Hoare triple {40390#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} assume !false; {40390#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-08 07:58:02,574 INFO L272 TraceCheckUtils]: 97: Hoare triple {40390#(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)); {40088#true} is VALID [2022-04-08 07:58:02,580 INFO L290 TraceCheckUtils]: 98: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,580 INFO L290 TraceCheckUtils]: 99: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,580 INFO L290 TraceCheckUtils]: 100: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,581 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {40088#true} {40390#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} #54#return; {40390#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-08 07:58:02,581 INFO L290 TraceCheckUtils]: 102: Hoare triple {40390#(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; {40412#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 07:58:02,582 INFO L290 TraceCheckUtils]: 103: Hoare triple {40412#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} assume !false; {40412#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 07:58:02,582 INFO L272 TraceCheckUtils]: 104: Hoare triple {40412#(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)); {40088#true} is VALID [2022-04-08 07:58:02,582 INFO L290 TraceCheckUtils]: 105: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,582 INFO L290 TraceCheckUtils]: 106: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,582 INFO L290 TraceCheckUtils]: 107: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,582 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {40088#true} {40412#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} #54#return; {40412#(and (= (+ (- 1) main_~c~0) 12) (= main_~y~0 13))} is VALID [2022-04-08 07:58:02,583 INFO L290 TraceCheckUtils]: 109: Hoare triple {40412#(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; {40434#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:58:02,583 INFO L290 TraceCheckUtils]: 110: Hoare triple {40434#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} assume !false; {40434#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:58:02,583 INFO L272 TraceCheckUtils]: 111: Hoare triple {40434#(and (= main_~y~0 14) (= 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)); {40088#true} is VALID [2022-04-08 07:58:02,583 INFO L290 TraceCheckUtils]: 112: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,583 INFO L290 TraceCheckUtils]: 113: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,583 INFO L290 TraceCheckUtils]: 114: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,584 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {40088#true} {40434#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} #54#return; {40434#(and (= main_~y~0 14) (= 12 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:58:02,584 INFO L290 TraceCheckUtils]: 116: Hoare triple {40434#(and (= main_~y~0 14) (= 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; {40456#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:58:02,584 INFO L290 TraceCheckUtils]: 117: Hoare triple {40456#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} assume !false; {40456#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:58:02,585 INFO L272 TraceCheckUtils]: 118: Hoare triple {40456#(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)); {40088#true} is VALID [2022-04-08 07:58:02,585 INFO L290 TraceCheckUtils]: 119: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,585 INFO L290 TraceCheckUtils]: 120: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,585 INFO L290 TraceCheckUtils]: 121: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,585 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {40088#true} {40456#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} #54#return; {40456#(and (= main_~c~0 15) (= 14 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:58:02,586 INFO L290 TraceCheckUtils]: 123: Hoare triple {40456#(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; {40478#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 07:58:02,586 INFO L290 TraceCheckUtils]: 124: Hoare triple {40478#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} assume !false; {40478#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 07:58:02,586 INFO L272 TraceCheckUtils]: 125: Hoare triple {40478#(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)); {40088#true} is VALID [2022-04-08 07:58:02,586 INFO L290 TraceCheckUtils]: 126: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,586 INFO L290 TraceCheckUtils]: 127: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,586 INFO L290 TraceCheckUtils]: 128: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,587 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {40088#true} {40478#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} #54#return; {40478#(and (= main_~y~0 16) (= (+ (- 1) main_~c~0) 15))} is VALID [2022-04-08 07:58:02,587 INFO L290 TraceCheckUtils]: 130: Hoare triple {40478#(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; {40500#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-08 07:58:02,587 INFO L290 TraceCheckUtils]: 131: Hoare triple {40500#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} assume !false; {40500#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-08 07:58:02,587 INFO L272 TraceCheckUtils]: 132: Hoare triple {40500#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40088#true} is VALID [2022-04-08 07:58:02,588 INFO L290 TraceCheckUtils]: 133: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,588 INFO L290 TraceCheckUtils]: 134: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,588 INFO L290 TraceCheckUtils]: 135: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,588 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {40088#true} {40500#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} #54#return; {40500#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} is VALID [2022-04-08 07:58:02,588 INFO L290 TraceCheckUtils]: 137: Hoare triple {40500#(and (= 15 (+ (- 2) main_~c~0)) (= main_~y~0 17))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40522#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} is VALID [2022-04-08 07:58:02,589 INFO L290 TraceCheckUtils]: 138: Hoare triple {40522#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} assume !false; {40522#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} is VALID [2022-04-08 07:58:02,589 INFO L272 TraceCheckUtils]: 139: Hoare triple {40522#(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)); {40088#true} is VALID [2022-04-08 07:58:02,589 INFO L290 TraceCheckUtils]: 140: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,589 INFO L290 TraceCheckUtils]: 141: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,589 INFO L290 TraceCheckUtils]: 142: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,589 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {40088#true} {40522#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} #54#return; {40522#(and (= (+ main_~c~0 (- 3)) 15) (= main_~y~0 18))} is VALID [2022-04-08 07:58:02,590 INFO L290 TraceCheckUtils]: 144: Hoare triple {40522#(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; {40544#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:58:02,590 INFO L290 TraceCheckUtils]: 145: Hoare triple {40544#(and (= 19 main_~y~0) (= 19 main_~c~0))} assume !false; {40544#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:58:02,590 INFO L272 TraceCheckUtils]: 146: Hoare triple {40544#(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)); {40088#true} is VALID [2022-04-08 07:58:02,590 INFO L290 TraceCheckUtils]: 147: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,590 INFO L290 TraceCheckUtils]: 148: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,591 INFO L290 TraceCheckUtils]: 149: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,591 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {40088#true} {40544#(and (= 19 main_~y~0) (= 19 main_~c~0))} #54#return; {40544#(and (= 19 main_~y~0) (= 19 main_~c~0))} is VALID [2022-04-08 07:58:02,591 INFO L290 TraceCheckUtils]: 151: Hoare triple {40544#(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; {40566#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:58:02,592 INFO L290 TraceCheckUtils]: 152: Hoare triple {40566#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} assume !false; {40566#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:58:02,592 INFO L272 TraceCheckUtils]: 153: Hoare triple {40566#(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)); {40088#true} is VALID [2022-04-08 07:58:02,592 INFO L290 TraceCheckUtils]: 154: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,592 INFO L290 TraceCheckUtils]: 155: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,592 INFO L290 TraceCheckUtils]: 156: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,592 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {40088#true} {40566#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} #54#return; {40566#(and (= 19 (+ (- 1) main_~y~0)) (= 19 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 07:58:02,593 INFO L290 TraceCheckUtils]: 158: Hoare triple {40566#(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; {40588#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:58:02,593 INFO L290 TraceCheckUtils]: 159: Hoare triple {40588#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !false; {40588#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:58:02,593 INFO L272 TraceCheckUtils]: 160: Hoare triple {40588#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40088#true} is VALID [2022-04-08 07:58:02,593 INFO L290 TraceCheckUtils]: 161: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,593 INFO L290 TraceCheckUtils]: 162: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,593 INFO L290 TraceCheckUtils]: 163: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,594 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {40088#true} {40588#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} #54#return; {40588#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} is VALID [2022-04-08 07:58:02,594 INFO L290 TraceCheckUtils]: 165: Hoare triple {40588#(and (= main_~c~0 21) (= 19 (+ (- 2) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40610#(and (= 19 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:58:02,595 INFO L290 TraceCheckUtils]: 166: Hoare triple {40610#(and (= 19 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 21))} assume !false; {40610#(and (= 19 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:58:02,595 INFO L272 TraceCheckUtils]: 167: Hoare triple {40610#(and (= 19 (+ main_~y~0 (- 3))) (= (+ (- 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)); {40088#true} is VALID [2022-04-08 07:58:02,595 INFO L290 TraceCheckUtils]: 168: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,595 INFO L290 TraceCheckUtils]: 169: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,595 INFO L290 TraceCheckUtils]: 170: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,595 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {40088#true} {40610#(and (= 19 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 21))} #54#return; {40610#(and (= 19 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 21))} is VALID [2022-04-08 07:58:02,596 INFO L290 TraceCheckUtils]: 172: Hoare triple {40610#(and (= 19 (+ main_~y~0 (- 3))) (= (+ (- 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; {40632#(and (= 19 (+ main_~y~0 (- 4))) (= 23 main_~c~0))} is VALID [2022-04-08 07:58:02,596 INFO L290 TraceCheckUtils]: 173: Hoare triple {40632#(and (= 19 (+ main_~y~0 (- 4))) (= 23 main_~c~0))} assume !false; {40632#(and (= 19 (+ main_~y~0 (- 4))) (= 23 main_~c~0))} is VALID [2022-04-08 07:58:02,596 INFO L272 TraceCheckUtils]: 174: Hoare triple {40632#(and (= 19 (+ main_~y~0 (- 4))) (= 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)); {40088#true} is VALID [2022-04-08 07:58:02,596 INFO L290 TraceCheckUtils]: 175: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,596 INFO L290 TraceCheckUtils]: 176: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,596 INFO L290 TraceCheckUtils]: 177: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,597 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {40088#true} {40632#(and (= 19 (+ main_~y~0 (- 4))) (= 23 main_~c~0))} #54#return; {40632#(and (= 19 (+ main_~y~0 (- 4))) (= 23 main_~c~0))} is VALID [2022-04-08 07:58:02,597 INFO L290 TraceCheckUtils]: 179: Hoare triple {40632#(and (= 19 (+ main_~y~0 (- 4))) (= 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; {40654#(and (= main_~c~0 24) (= 19 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 07:58:02,597 INFO L290 TraceCheckUtils]: 180: Hoare triple {40654#(and (= main_~c~0 24) (= 19 (+ main_~y~0 (- 5))))} assume !false; {40654#(and (= main_~c~0 24) (= 19 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 07:58:02,597 INFO L272 TraceCheckUtils]: 181: Hoare triple {40654#(and (= main_~c~0 24) (= 19 (+ 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)); {40088#true} is VALID [2022-04-08 07:58:02,597 INFO L290 TraceCheckUtils]: 182: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,598 INFO L290 TraceCheckUtils]: 183: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,598 INFO L290 TraceCheckUtils]: 184: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,598 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {40088#true} {40654#(and (= main_~c~0 24) (= 19 (+ main_~y~0 (- 5))))} #54#return; {40654#(and (= main_~c~0 24) (= 19 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 07:58:02,598 INFO L290 TraceCheckUtils]: 186: Hoare triple {40654#(and (= main_~c~0 24) (= 19 (+ 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; {40676#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 07:58:02,599 INFO L290 TraceCheckUtils]: 187: Hoare triple {40676#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} assume !false; {40676#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 07:58:02,599 INFO L272 TraceCheckUtils]: 188: Hoare triple {40676#(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)); {40088#true} is VALID [2022-04-08 07:58:02,599 INFO L290 TraceCheckUtils]: 189: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,599 INFO L290 TraceCheckUtils]: 190: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,599 INFO L290 TraceCheckUtils]: 191: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,599 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {40088#true} {40676#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} #54#return; {40676#(and (= main_~y~0 25) (= (+ (- 1) main_~c~0) 24))} is VALID [2022-04-08 07:58:02,600 INFO L290 TraceCheckUtils]: 193: Hoare triple {40676#(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; {40698#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 07:58:02,600 INFO L290 TraceCheckUtils]: 194: Hoare triple {40698#(and (= main_~c~0 26) (= main_~y~0 26))} assume !false; {40698#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 07:58:02,600 INFO L272 TraceCheckUtils]: 195: Hoare triple {40698#(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)); {40088#true} is VALID [2022-04-08 07:58:02,600 INFO L290 TraceCheckUtils]: 196: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,600 INFO L290 TraceCheckUtils]: 197: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,600 INFO L290 TraceCheckUtils]: 198: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,601 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {40088#true} {40698#(and (= main_~c~0 26) (= main_~y~0 26))} #54#return; {40698#(and (= main_~c~0 26) (= main_~y~0 26))} is VALID [2022-04-08 07:58:02,601 INFO L290 TraceCheckUtils]: 200: Hoare triple {40698#(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; {40720#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-08 07:58:02,601 INFO L290 TraceCheckUtils]: 201: Hoare triple {40720#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} assume !false; {40720#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-08 07:58:02,601 INFO L272 TraceCheckUtils]: 202: Hoare triple {40720#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40088#true} is VALID [2022-04-08 07:58:02,601 INFO L290 TraceCheckUtils]: 203: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,601 INFO L290 TraceCheckUtils]: 204: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,602 INFO L290 TraceCheckUtils]: 205: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,602 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {40088#true} {40720#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} #54#return; {40720#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} is VALID [2022-04-08 07:58:02,602 INFO L290 TraceCheckUtils]: 207: Hoare triple {40720#(and (= main_~c~0 27) (= (+ (- 1) main_~y~0) 26))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40742#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-08 07:58:02,603 INFO L290 TraceCheckUtils]: 208: Hoare triple {40742#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} assume !false; {40742#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-08 07:58:02,603 INFO L272 TraceCheckUtils]: 209: Hoare triple {40742#(and (= (+ (- 1) main_~c~0) 27) (= 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)); {40088#true} is VALID [2022-04-08 07:58:02,603 INFO L290 TraceCheckUtils]: 210: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,603 INFO L290 TraceCheckUtils]: 211: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,603 INFO L290 TraceCheckUtils]: 212: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,603 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {40088#true} {40742#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} #54#return; {40742#(and (= (+ (- 1) main_~c~0) 27) (= main_~y~0 28))} is VALID [2022-04-08 07:58:02,604 INFO L290 TraceCheckUtils]: 214: Hoare triple {40742#(and (= (+ (- 1) main_~c~0) 27) (= 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; {40764#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} is VALID [2022-04-08 07:58:02,604 INFO L290 TraceCheckUtils]: 215: Hoare triple {40764#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} assume !false; {40764#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} is VALID [2022-04-08 07:58:02,604 INFO L272 TraceCheckUtils]: 216: Hoare triple {40764#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40088#true} is VALID [2022-04-08 07:58:02,604 INFO L290 TraceCheckUtils]: 217: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,604 INFO L290 TraceCheckUtils]: 218: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,604 INFO L290 TraceCheckUtils]: 219: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,605 INFO L284 TraceCheckUtils]: 220: Hoare quadruple {40088#true} {40764#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} #54#return; {40764#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} is VALID [2022-04-08 07:58:02,605 INFO L290 TraceCheckUtils]: 221: Hoare triple {40764#(and (= 28 (+ (- 1) main_~y~0)) (= 29 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40786#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} is VALID [2022-04-08 07:58:02,605 INFO L290 TraceCheckUtils]: 222: Hoare triple {40786#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} assume !false; {40786#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} is VALID [2022-04-08 07:58:02,605 INFO L272 TraceCheckUtils]: 223: Hoare triple {40786#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40088#true} is VALID [2022-04-08 07:58:02,605 INFO L290 TraceCheckUtils]: 224: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,605 INFO L290 TraceCheckUtils]: 225: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,606 INFO L290 TraceCheckUtils]: 226: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,606 INFO L284 TraceCheckUtils]: 227: Hoare quadruple {40088#true} {40786#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} #54#return; {40786#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} is VALID [2022-04-08 07:58:02,606 INFO L290 TraceCheckUtils]: 228: Hoare triple {40786#(and (= 30 main_~y~0) (= (+ (- 1) main_~c~0) 29))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40808#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:58:02,607 INFO L290 TraceCheckUtils]: 229: Hoare triple {40808#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)))} assume !false; {40808#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:58:02,607 INFO L272 TraceCheckUtils]: 230: Hoare triple {40808#(and (= main_~y~0 31) (= 29 (+ (- 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)); {40088#true} is VALID [2022-04-08 07:58:02,607 INFO L290 TraceCheckUtils]: 231: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,607 INFO L290 TraceCheckUtils]: 232: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,607 INFO L290 TraceCheckUtils]: 233: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,607 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {40088#true} {40808#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)))} #54#return; {40808#(and (= main_~y~0 31) (= 29 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:58:02,608 INFO L290 TraceCheckUtils]: 235: Hoare triple {40808#(and (= main_~y~0 31) (= 29 (+ (- 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; {40830#(and (= 32 main_~y~0) (= 29 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:58:02,608 INFO L290 TraceCheckUtils]: 236: Hoare triple {40830#(and (= 32 main_~y~0) (= 29 (+ main_~c~0 (- 3))))} assume !false; {40830#(and (= 32 main_~y~0) (= 29 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:58:02,608 INFO L272 TraceCheckUtils]: 237: Hoare triple {40830#(and (= 32 main_~y~0) (= 29 (+ 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)); {40088#true} is VALID [2022-04-08 07:58:02,608 INFO L290 TraceCheckUtils]: 238: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,608 INFO L290 TraceCheckUtils]: 239: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,608 INFO L290 TraceCheckUtils]: 240: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,609 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {40088#true} {40830#(and (= 32 main_~y~0) (= 29 (+ main_~c~0 (- 3))))} #54#return; {40830#(and (= 32 main_~y~0) (= 29 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:58:02,609 INFO L290 TraceCheckUtils]: 242: Hoare triple {40830#(and (= 32 main_~y~0) (= 29 (+ 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; {40852#(and (= main_~y~0 33) (= 29 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 07:58:02,609 INFO L290 TraceCheckUtils]: 243: Hoare triple {40852#(and (= main_~y~0 33) (= 29 (+ main_~c~0 (- 4))))} assume !false; {40852#(and (= main_~y~0 33) (= 29 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 07:58:02,609 INFO L272 TraceCheckUtils]: 244: Hoare triple {40852#(and (= main_~y~0 33) (= 29 (+ 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)); {40088#true} is VALID [2022-04-08 07:58:02,609 INFO L290 TraceCheckUtils]: 245: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,609 INFO L290 TraceCheckUtils]: 246: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,610 INFO L290 TraceCheckUtils]: 247: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,610 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {40088#true} {40852#(and (= main_~y~0 33) (= 29 (+ main_~c~0 (- 4))))} #54#return; {40852#(and (= main_~y~0 33) (= 29 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 07:58:02,610 INFO L290 TraceCheckUtils]: 249: Hoare triple {40852#(and (= main_~y~0 33) (= 29 (+ 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; {40874#(and (= main_~c~0 34) (= main_~y~0 34))} is VALID [2022-04-08 07:58:02,611 INFO L290 TraceCheckUtils]: 250: Hoare triple {40874#(and (= main_~c~0 34) (= main_~y~0 34))} assume !false; {40874#(and (= main_~c~0 34) (= main_~y~0 34))} is VALID [2022-04-08 07:58:02,611 INFO L272 TraceCheckUtils]: 251: Hoare triple {40874#(and (= main_~c~0 34) (= main_~y~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)); {40088#true} is VALID [2022-04-08 07:58:02,611 INFO L290 TraceCheckUtils]: 252: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,611 INFO L290 TraceCheckUtils]: 253: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,611 INFO L290 TraceCheckUtils]: 254: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,611 INFO L284 TraceCheckUtils]: 255: Hoare quadruple {40088#true} {40874#(and (= main_~c~0 34) (= main_~y~0 34))} #54#return; {40874#(and (= main_~c~0 34) (= main_~y~0 34))} is VALID [2022-04-08 07:58:02,612 INFO L290 TraceCheckUtils]: 256: Hoare triple {40874#(and (= main_~c~0 34) (= main_~y~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; {40896#(and (= 35 main_~c~0) (= 35 main_~y~0))} is VALID [2022-04-08 07:58:02,612 INFO L290 TraceCheckUtils]: 257: Hoare triple {40896#(and (= 35 main_~c~0) (= 35 main_~y~0))} assume !false; {40896#(and (= 35 main_~c~0) (= 35 main_~y~0))} is VALID [2022-04-08 07:58:02,612 INFO L272 TraceCheckUtils]: 258: Hoare triple {40896#(and (= 35 main_~c~0) (= 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)); {40088#true} is VALID [2022-04-08 07:58:02,612 INFO L290 TraceCheckUtils]: 259: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,612 INFO L290 TraceCheckUtils]: 260: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,612 INFO L290 TraceCheckUtils]: 261: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,613 INFO L284 TraceCheckUtils]: 262: Hoare quadruple {40088#true} {40896#(and (= 35 main_~c~0) (= 35 main_~y~0))} #54#return; {40896#(and (= 35 main_~c~0) (= 35 main_~y~0))} is VALID [2022-04-08 07:58:02,613 INFO L290 TraceCheckUtils]: 263: Hoare triple {40896#(and (= 35 main_~c~0) (= 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; {40918#(and (= 35 (+ (- 1) main_~y~0)) (= main_~c~0 36))} is VALID [2022-04-08 07:58:02,613 INFO L290 TraceCheckUtils]: 264: Hoare triple {40918#(and (= 35 (+ (- 1) main_~y~0)) (= main_~c~0 36))} assume !false; {40918#(and (= 35 (+ (- 1) main_~y~0)) (= main_~c~0 36))} is VALID [2022-04-08 07:58:02,613 INFO L272 TraceCheckUtils]: 265: Hoare triple {40918#(and (= 35 (+ (- 1) main_~y~0)) (= main_~c~0 36))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40088#true} is VALID [2022-04-08 07:58:02,613 INFO L290 TraceCheckUtils]: 266: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,613 INFO L290 TraceCheckUtils]: 267: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,614 INFO L290 TraceCheckUtils]: 268: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,614 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {40088#true} {40918#(and (= 35 (+ (- 1) main_~y~0)) (= main_~c~0 36))} #54#return; {40918#(and (= 35 (+ (- 1) main_~y~0)) (= main_~c~0 36))} is VALID [2022-04-08 07:58:02,614 INFO L290 TraceCheckUtils]: 270: Hoare triple {40918#(and (= 35 (+ (- 1) main_~y~0)) (= main_~c~0 36))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {40940#(and (< 36 main_~k~0) (= main_~y~0 37) (<= main_~c~0 37))} is VALID [2022-04-08 07:58:02,615 INFO L290 TraceCheckUtils]: 271: Hoare triple {40940#(and (< 36 main_~k~0) (= main_~y~0 37) (<= main_~c~0 37))} assume !false; {40940#(and (< 36 main_~k~0) (= main_~y~0 37) (<= main_~c~0 37))} is VALID [2022-04-08 07:58:02,615 INFO L272 TraceCheckUtils]: 272: Hoare triple {40940#(and (< 36 main_~k~0) (= main_~y~0 37) (<= 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)); {40088#true} is VALID [2022-04-08 07:58:02,615 INFO L290 TraceCheckUtils]: 273: Hoare triple {40088#true} ~cond := #in~cond; {40088#true} is VALID [2022-04-08 07:58:02,615 INFO L290 TraceCheckUtils]: 274: Hoare triple {40088#true} assume !(0 == ~cond); {40088#true} is VALID [2022-04-08 07:58:02,615 INFO L290 TraceCheckUtils]: 275: Hoare triple {40088#true} assume true; {40088#true} is VALID [2022-04-08 07:58:02,615 INFO L284 TraceCheckUtils]: 276: Hoare quadruple {40088#true} {40940#(and (< 36 main_~k~0) (= main_~y~0 37) (<= main_~c~0 37))} #54#return; {40940#(and (< 36 main_~k~0) (= main_~y~0 37) (<= main_~c~0 37))} is VALID [2022-04-08 07:58:02,616 INFO L290 TraceCheckUtils]: 277: Hoare triple {40940#(and (< 36 main_~k~0) (= main_~y~0 37) (<= main_~c~0 37))} assume !(~c~0 < ~k~0); {40962#(and (<= main_~k~0 37) (< 36 main_~k~0) (= main_~y~0 37))} is VALID [2022-04-08 07:58:02,616 INFO L272 TraceCheckUtils]: 278: Hoare triple {40962#(and (<= main_~k~0 37) (< 36 main_~k~0) (= main_~y~0 37))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {40966#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:58:02,617 INFO L290 TraceCheckUtils]: 279: Hoare triple {40966#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40970#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:58:02,617 INFO L290 TraceCheckUtils]: 280: Hoare triple {40970#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40089#false} is VALID [2022-04-08 07:58:02,617 INFO L290 TraceCheckUtils]: 281: Hoare triple {40089#false} assume !false; {40089#false} is VALID [2022-04-08 07:58:02,618 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 07:58:02,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:58:03,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:58:03,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086271650] [2022-04-08 07:58:03,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:58:03,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666329831] [2022-04-08 07:58:03,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666329831] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:58:03,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:58:03,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2022-04-08 07:58:03,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:58:03,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1085500040] [2022-04-08 07:58:03,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1085500040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:58:03,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:58:03,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-08 07:58:03,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838329416] [2022-04-08 07:58:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:58:03,100 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.119047619047619) internal successors, (89), 42 states have internal predecessors, (89), 40 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) Word has length 282 [2022-04-08 07:58:03,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:58:03,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 42 states have (on average 2.119047619047619) internal successors, (89), 42 states have internal predecessors, (89), 40 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2022-04-08 07:58:04,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:58:04,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-08 07:58:04,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:58:04,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-08 07:58:04,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 07:58:04,224 INFO L87 Difference]: Start difference. First operand 143 states and 178 transitions. Second operand has 43 states, 42 states have (on average 2.119047619047619) internal successors, (89), 42 states have internal predecessors, (89), 40 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40)