/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:32:36,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:32:36,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:32:36,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:32:36,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:32:36,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:32:36,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:32:36,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:32:36,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:32:36,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:32:36,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:32:36,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:32:36,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:32:36,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:32:36,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:32:36,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:32:36,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:32:36,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:32:36,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:32:36,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:32:36,254 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:32:36,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:32:36,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:32:36,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:32:36,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:32:36,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:32:36,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:32:36,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:32:36,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:32:36,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:32:36,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:32:36,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:32:36,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:32:36,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:32:36,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:32:36,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:32:36,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:32:36,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:32:36,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:32:36,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:32:36,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:32:36,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:32:36,271 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:32:36,279 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:32:36,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:32:36,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:32:36,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:32:36,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:32:36,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:32:36,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:32:36,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:32:36,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:32:36,282 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:32:36,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:32:36,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:32:36,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:32:36,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:32:36,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:32:36,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:32:36,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:32:36,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:32:36,283 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:32:36,283 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:32:36,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:32:36,283 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:32:36,283 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 14:32:36,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:32:36,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:32:36,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:32:36,515 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:32:36,515 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:32:36,516 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c [2022-04-08 14:32:36,559 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf52acac/9ce4271fe6d1470d830a0e10f841b527/FLAG2c99aca8e [2022-04-08 14:32:36,921 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:32:36,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c [2022-04-08 14:32:36,925 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf52acac/9ce4271fe6d1470d830a0e10f841b527/FLAG2c99aca8e [2022-04-08 14:32:36,934 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf52acac/9ce4271fe6d1470d830a0e10f841b527 [2022-04-08 14:32:36,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:32:36,937 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:32:36,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:32:36,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:32:36,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:32:36,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:32:36" (1/1) ... [2022-04-08 14:32:36,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77398499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:32:36, skipping insertion in model container [2022-04-08 14:32:36,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:32:36" (1/1) ... [2022-04-08 14:32:36,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:32:36,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:32:37,090 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/ps6-ll_unwindbound20.c[458,471] [2022-04-08 14:32:37,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:32:37,127 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:32:37,141 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/ps6-ll_unwindbound20.c[458,471] [2022-04-08 14:32:37,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:32:37,172 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:32:37,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:32:37 WrapperNode [2022-04-08 14:32:37,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:32:37,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:32:37,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:32:37,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:32:37,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:32:37" (1/1) ... [2022-04-08 14:32:37,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:32:37" (1/1) ... [2022-04-08 14:32:37,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:32:37" (1/1) ... [2022-04-08 14:32:37,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:32:37" (1/1) ... [2022-04-08 14:32:37,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:32:37" (1/1) ... [2022-04-08 14:32:37,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:32:37" (1/1) ... [2022-04-08 14:32:37,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:32:37" (1/1) ... [2022-04-08 14:32:37,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:32:37,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:32:37,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:32:37,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:32:37,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:32:37" (1/1) ... [2022-04-08 14:32:37,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:32:37,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:37,273 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 14:32:37,292 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 14:32:37,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:32:37,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:32:37,311 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:32:37,311 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:32:37,311 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:32:37,311 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:32:37,311 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:32:37,311 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:32:37,311 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:32:37,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:32:37,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 14:32:37,312 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:32:37,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:32:37,312 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:32:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:32:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:32:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:32:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:32:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:32:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:32:37,363 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:32:37,365 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:32:37,462 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:32:37,473 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:32:37,473 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:32:37,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:32:37 BoogieIcfgContainer [2022-04-08 14:32:37,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:32:37,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:32:37,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:32:37,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:32:37,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:32:36" (1/3) ... [2022-04-08 14:32:37,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4360c337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:32:37, skipping insertion in model container [2022-04-08 14:32:37,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:32:37" (2/3) ... [2022-04-08 14:32:37,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4360c337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:32:37, skipping insertion in model container [2022-04-08 14:32:37,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:32:37" (3/3) ... [2022-04-08 14:32:37,493 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound20.c [2022-04-08 14:32:37,496 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:32:37,497 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:32:37,547 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:32:37,557 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 14:32:37,557 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:32:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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 14:32:37,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:32:37,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:37,579 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 14:32:37,579 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:37,586 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-08 14:32:37,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:37,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [281567711] [2022-04-08 14:32:37,603 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:32:37,604 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-08 14:32:37,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:37,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397655612] [2022-04-08 14:32:37,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:37,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:37,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:32:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:37,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {32#true} is VALID [2022-04-08 14:32:37,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:32:37,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-08 14:32:37,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 14:32:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:37,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:32:37,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:32:37,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:32:37,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:32:37,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:32:37,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {32#true} is VALID [2022-04-08 14:32:37,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:32:37,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-08 14:32:37,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-08 14:32:37,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#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; {32#true} is VALID [2022-04-08 14:32:37,808 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-08 14:32:37,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:32:37,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:32:37,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:32:37,809 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:32:37,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-08 14:32:37,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-08 14:32:37,811 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-08 14:32:37,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 14:32:37,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 14:32:37,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 14:32:37,812 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 14:32:37,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:37,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397655612] [2022-04-08 14:32:37,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397655612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:37,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:37,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:32:37,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:37,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [281567711] [2022-04-08 14:32:37,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [281567711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:37,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:37,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:32:37,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735541061] [2022-04-08 14:32:37,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:37,822 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 14:32:37,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:37,826 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 14:32:37,855 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 14:32:37,856 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:32:37,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:37,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:32:37,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:32:37,879 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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 14:32:38,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:38,229 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-08 14:32:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:32:38,230 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 14:32:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:38,231 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 14:32:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-08 14:32:38,237 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 14:32:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-08 14:32:38,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-08 14:32:38,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:38,300 INFO L225 Difference]: With dead ends: 50 [2022-04-08 14:32:38,301 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 14:32:38,303 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 14:32:38,305 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:38,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:32:38,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 14:32:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-08 14:32:38,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:38,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 14:32:38,343 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 14:32:38,344 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 14:32:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:38,346 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 14:32:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 14:32:38,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:38,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:38,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 25 states. [2022-04-08 14:32:38,348 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 25 states. [2022-04-08 14:32:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:38,350 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 14:32:38,350 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 14:32:38,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:38,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:38,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:38,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 14:32:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 14:32:38,368 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-08 14:32:38,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:38,368 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 14:32:38,369 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 14:32:38,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 14:32:38,394 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 14:32:38,394 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:32:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 14:32:38,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:38,395 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:32:38,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:32:38,395 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:38,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:38,396 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-08 14:32:38,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:38,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [353017329] [2022-04-08 14:32:38,397 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:32:38,397 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-08 14:32:38,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:38,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062323683] [2022-04-08 14:32:38,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:38,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:38,412 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:38,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [446203958] [2022-04-08 14:32:38,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:32:38,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:38,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:38,414 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 14:32:38,415 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 14:32:38,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:32:38,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:38,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 14:32:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:38,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:38,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-08 14:32:38,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#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);~counter~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:38,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:38,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:38,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:38,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(<= ~counter~0 0)} 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; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:38,584 INFO L272 TraceCheckUtils]: 6: Hoare triple {250#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:38,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:38,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:38,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:38,586 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#(<= ~counter~0 0)} {250#(<= ~counter~0 0)} #53#return; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:38,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:38,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {250#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {284#(<= |main_#t~post5| 0)} is VALID [2022-04-08 14:32:38,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {243#false} is VALID [2022-04-08 14:32:38,588 INFO L272 TraceCheckUtils]: 14: Hoare triple {243#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {243#false} is VALID [2022-04-08 14:32:38,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-08 14:32:38,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-08 14:32:38,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-08 14:32:38,588 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 14:32:38,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:32:38,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:38,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062323683] [2022-04-08 14:32:38,589 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:38,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446203958] [2022-04-08 14:32:38,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446203958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:38,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:38,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:32:38,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:38,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [353017329] [2022-04-08 14:32:38,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [353017329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:38,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:38,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:32:38,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291401673] [2022-04-08 14:32:38,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:38,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 14:32:38,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:38,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:32:38,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:38,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:32:38,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:38,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:32:38,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:32:38,606 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:32:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:38,688 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 14:32:38,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:32:38,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 14:32:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:32:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 14:32:38,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:32:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 14:32:38,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-08 14:32:38,721 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 14:32:38,722 INFO L225 Difference]: With dead ends: 34 [2022-04-08 14:32:38,722 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 14:32:38,723 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:32:38,724 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:38,724 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:32:38,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 14:32:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 14:32:38,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:38,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 14:32:38,736 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 14:32:38,736 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 14:32:38,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:38,738 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 14:32:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:32:38,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:38,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:38,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 26 states. [2022-04-08 14:32:38,739 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 26 states. [2022-04-08 14:32:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:38,740 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 14:32:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:32:38,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:38,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:38,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:38,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 14:32:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-08 14:32:38,742 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-08 14:32:38,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:38,742 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-08 14:32:38,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:32:38,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-08 14:32:38,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:32:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 14:32:38,766 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:38,767 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:32:38,787 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 14:32:38,984 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 14:32:38,984 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:38,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:38,985 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-08 14:32:38,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:38,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1558914253] [2022-04-08 14:32:38,986 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:32:38,986 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-08 14:32:38,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:38,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846453218] [2022-04-08 14:32:38,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:38,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:39,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:39,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [178724494] [2022-04-08 14:32:39,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:32:39,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:39,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:39,012 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 14:32:39,036 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 14:32:39,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:32:39,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:39,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:32:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:39,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:39,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-08 14:32:39,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#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);~counter~0 := 0; {471#true} is VALID [2022-04-08 14:32:39,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-08 14:32:39,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-08 14:32:39,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-08 14:32:39,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#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; {471#true} is VALID [2022-04-08 14:32:39,162 INFO L272 TraceCheckUtils]: 6: Hoare triple {471#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {471#true} is VALID [2022-04-08 14:32:39,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-08 14:32:39,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-08 14:32:39,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-08 14:32:39,163 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-08 14:32:39,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:39,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:39,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:39,169 INFO L272 TraceCheckUtils]: 14: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:32:39,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:32:39,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-08 14:32:39,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-08 14:32:39,170 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 14:32:39,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:32:39,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:39,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846453218] [2022-04-08 14:32:39,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:39,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178724494] [2022-04-08 14:32:39,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178724494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:39,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:39,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:32:39,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:39,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1558914253] [2022-04-08 14:32:39,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1558914253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:39,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:39,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:32:39,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693240857] [2022-04-08 14:32:39,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:39,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-04-08 14:32:39,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:39,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 14:32:39,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:39,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:32:39,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:39,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:32:39,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:32:39,187 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 14:32:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:39,342 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 14:32:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:32:39,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-04-08 14:32:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 14:32:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 14:32:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 14:32:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 14:32:39,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-08 14:32:39,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:39,380 INFO L225 Difference]: With dead ends: 36 [2022-04-08 14:32:39,381 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 14:32:39,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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 14:32:39,382 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:39,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:32:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 14:32:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 14:32:39,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:39,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 14:32:39,397 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 14:32:39,397 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 14:32:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:39,399 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 14:32:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 14:32:39,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:39,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:39,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 32 states. [2022-04-08 14:32:39,400 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 32 states. [2022-04-08 14:32:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:39,401 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 14:32:39,401 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 14:32:39,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:39,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:39,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:39,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 14:32:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-08 14:32:39,403 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-08 14:32:39,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:39,403 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-08 14:32:39,403 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 14:32:39,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-08 14:32:39,436 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 14:32:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 14:32:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:32:39,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:39,437 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:32:39,468 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 14:32:39,655 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 14:32:39,656 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:39,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:39,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-08 14:32:39,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:39,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [237161239] [2022-04-08 14:32:39,878 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:39,878 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:39,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-08 14:32:39,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:39,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265462195] [2022-04-08 14:32:39,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:39,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:39,933 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:39,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [144349520] [2022-04-08 14:32:39,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:32:39,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:39,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:39,940 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 14:32:39,982 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 14:32:40,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:32:40,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:40,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:32:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:40,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:40,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-08 14:32:40,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#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);~counter~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:40,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:40,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:40,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:40,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {739#(<= ~counter~0 0)} 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; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:40,394 INFO L272 TraceCheckUtils]: 6: Hoare triple {739#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:40,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:40,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:40,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:40,395 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {739#(<= ~counter~0 0)} {739#(<= ~counter~0 0)} #53#return; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:40,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {739#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:40,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {739#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:40,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:40,397 INFO L272 TraceCheckUtils]: 14: Hoare triple {773#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:40,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:40,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:40,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:40,398 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {773#(<= ~counter~0 1)} {773#(<= ~counter~0 1)} #55#return; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:40,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {773#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:40,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {773#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {798#(<= |main_#t~post5| 1)} is VALID [2022-04-08 14:32:40,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-08 14:32:40,399 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {732#false} is VALID [2022-04-08 14:32:40,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-08 14:32:40,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-08 14:32:40,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-08 14:32:40,400 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 14:32:40,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:40,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-08 14:32:40,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-08 14:32:40,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-08 14:32:40,550 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {732#false} is VALID [2022-04-08 14:32:40,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-08 14:32:40,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:32:40,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {830#(< ~counter~0 20)} is VALID [2022-04-08 14:32:40,551 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 20)} #55#return; {830#(< ~counter~0 20)} is VALID [2022-04-08 14:32:40,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-08 14:32:40,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-08 14:32:40,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-08 14:32:40,552 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {731#true} is VALID [2022-04-08 14:32:40,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {830#(< ~counter~0 20)} is VALID [2022-04-08 14:32:40,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 20)} is VALID [2022-04-08 14:32:40,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 19)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 19)} is VALID [2022-04-08 14:32:40,553 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 19)} #53#return; {855#(< ~counter~0 19)} is VALID [2022-04-08 14:32:40,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-08 14:32:40,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-08 14:32:40,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-08 14:32:40,555 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 19)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-08 14:32:40,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~counter~0 19)} 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; {855#(< ~counter~0 19)} is VALID [2022-04-08 14:32:40,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 19)} call #t~ret6 := main(); {855#(< ~counter~0 19)} is VALID [2022-04-08 14:32:40,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 19)} {731#true} #61#return; {855#(< ~counter~0 19)} is VALID [2022-04-08 14:32:40,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 19)} assume true; {855#(< ~counter~0 19)} is VALID [2022-04-08 14:32:40,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#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);~counter~0 := 0; {855#(< ~counter~0 19)} is VALID [2022-04-08 14:32:40,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-08 14:32:40,558 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 14:32:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:40,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265462195] [2022-04-08 14:32:40,558 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:40,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144349520] [2022-04-08 14:32:40,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144349520] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:32:40,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:32:40,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 14:32:40,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:40,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [237161239] [2022-04-08 14:32:40,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [237161239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:40,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:40,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:32:40,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734660807] [2022-04-08 14:32:40,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:40,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-08 14:32:40,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:40,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:32:40,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:40,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:32:40,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:40,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:32:40,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:32:40,580 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:32:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:40,684 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 14:32:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:32:40,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-08 14:32:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:32:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 14:32:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:32:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 14:32:40,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-08 14:32:40,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:40,724 INFO L225 Difference]: With dead ends: 42 [2022-04-08 14:32:40,724 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 14:32:40,725 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 14:32:40,727 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:40,728 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:32:40,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 14:32:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 14:32:40,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:40,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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 14:32:40,754 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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 14:32:40,755 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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 14:32:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:40,758 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 14:32:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 14:32:40,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:40,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:40,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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 34 states. [2022-04-08 14:32:40,763 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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 34 states. [2022-04-08 14:32:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:40,765 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 14:32:40,765 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 14:32:40,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:40,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:40,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:40,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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 14:32:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-08 14:32:40,769 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-08 14:32:40,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:40,769 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-08 14:32:40,769 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:32:40,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-08 14:32:40,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:40,798 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 14:32:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:32:40,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:40,799 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:32:40,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 14:32:41,004 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 14:32:41,005 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:41,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-08 14:32:41,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:41,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [229232850] [2022-04-08 14:32:41,129 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:41,129 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:41,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-08 14:32:41,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:41,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556933463] [2022-04-08 14:32:41,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:41,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:41,158 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:41,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1393478290] [2022-04-08 14:32:41,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:32:41,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:41,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:41,160 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 14:32:41,161 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 14:32:41,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:32:41,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:41,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:32:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:41,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:41,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 14:32:41,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#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);~counter~0 := 0; {1116#true} is VALID [2022-04-08 14:32:41,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:32:41,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-08 14:32:41,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 14:32:41,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#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; {1116#true} is VALID [2022-04-08 14:32:41,316 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-08 14:32:41,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:32:41,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:32:41,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:32:41,327 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-08 14:32:41,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:41,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:41,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:41,331 INFO L272 TraceCheckUtils]: 14: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1116#true} is VALID [2022-04-08 14:32:41,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:32:41,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:32:41,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:32:41,332 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:41,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {1154#(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 * ~y~0 * ~y~0 + ~x~0; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-08 14:32:41,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-08 14:32:41,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-08 14:32:41,334 INFO L272 TraceCheckUtils]: 22: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:32:41,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:32:41,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 14:32:41,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 14:32:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:32:41,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:41,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 14:32:41,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 14:32:41,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:32:41,474 INFO L272 TraceCheckUtils]: 22: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:32:41,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 14:32:41,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 14:32:41,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 14:32:41,568 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #55#return; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 14:32:41,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:32:41,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:32:41,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:32:41,568 INFO L272 TraceCheckUtils]: 14: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1116#true} is VALID [2022-04-08 14:32:41,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 14:32:41,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 14:32:41,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 14:32:41,571 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-08 14:32:41,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:32:41,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:32:41,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:32:41,571 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-08 14:32:41,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#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; {1116#true} is VALID [2022-04-08 14:32:41,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 14:32:41,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-08 14:32:41,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:32:41,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#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);~counter~0 := 0; {1116#true} is VALID [2022-04-08 14:32:41,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 14:32:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 14:32:41,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:41,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556933463] [2022-04-08 14:32:41,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:41,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393478290] [2022-04-08 14:32:41,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393478290] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:32:41,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:32:41,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:32:41,573 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:41,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [229232850] [2022-04-08 14:32:41,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [229232850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:41,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:41,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:32:41,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724378805] [2022-04-08 14:32:41,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:41,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 26 [2022-04-08 14:32:41,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:41,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 14:32:41,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:41,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:32:41,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:41,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:32:41,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:32:41,709 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 14:32:41,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:41,852 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-08 14:32:41,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:32:41,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 26 [2022-04-08 14:32:41,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 14:32:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:32:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 14:32:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:32:41,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 14:32:42,051 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 14:32:42,052 INFO L225 Difference]: With dead ends: 40 [2022-04-08 14:32:42,052 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 14:32:42,052 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:32:42,053 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:42,053 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:32:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 14:32:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 14:32:42,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:42,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 14:32:42,076 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 14:32:42,076 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 14:32:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:42,077 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 14:32:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 14:32:42,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:42,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:42,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 36 states. [2022-04-08 14:32:42,078 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 36 states. [2022-04-08 14:32:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:42,079 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 14:32:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 14:32:42,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:42,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:42,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:42,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 14:32:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-08 14:32:42,080 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-08 14:32:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:42,080 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-08 14:32:42,080 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 14:32:42,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-08 14:32:42,231 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 14:32:42,231 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 14:32:42,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 14:32:42,232 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:42,232 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:32:42,250 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 14:32:42,432 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 14:32:42,432 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:42,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:42,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-08 14:32:42,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:42,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1973018821] [2022-04-08 14:32:42,567 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:42,567 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:42,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-08 14:32:42,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:42,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210504619] [2022-04-08 14:32:42,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:42,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:42,577 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:42,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [212495214] [2022-04-08 14:32:42,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:32:42,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:42,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:42,579 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 14:32:42,580 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 14:32:42,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:32:42,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:42,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 14:32:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:42,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:42,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-08 14:32:42,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#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);~counter~0 := 0; {1504#true} is VALID [2022-04-08 14:32:42,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:32:42,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-08 14:32:42,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-08 14:32:42,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#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; {1504#true} is VALID [2022-04-08 14:32:42,928 INFO L272 TraceCheckUtils]: 6: Hoare triple {1504#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1504#true} is VALID [2022-04-08 14:32:42,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:32:42,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:32:42,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:32:42,928 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-08 14:32:42,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {1504#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:42,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:42,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:42,930 INFO L272 TraceCheckUtils]: 14: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1504#true} is VALID [2022-04-08 14:32:42,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:32:42,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:32:42,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:32:42,930 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1504#true} {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:42,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {1542#(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 * ~y~0 * ~y~0 + ~x~0; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:32:42,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:32:42,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:32:42,932 INFO L272 TraceCheckUtils]: 22: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1504#true} is VALID [2022-04-08 14:32:42,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:32:42,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:32:42,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:32:42,933 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1504#true} {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:32:42,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:42,933 INFO L272 TraceCheckUtils]: 28: Hoare triple {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1504#true} is VALID [2022-04-08 14:32:42,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:32:42,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:32:42,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:32:42,934 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1504#true} {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:42,935 INFO L272 TraceCheckUtils]: 33: Hoare triple {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:32:42,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1615#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:32:42,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-08 14:32:42,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-08 14:32:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:32:42,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:43,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:43,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210504619] [2022-04-08 14:32:43,197 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:43,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212495214] [2022-04-08 14:32:43,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212495214] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:32:43,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:32:43,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 14:32:43,197 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:43,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1973018821] [2022-04-08 14:32:43,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1973018821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:43,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:43,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:32:43,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341382501] [2022-04-08 14:32:43,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:43,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 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 14:32:43,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:43,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 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 14:32:43,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 14:32:43,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:32:43,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:43,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:32:43,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:32:43,226 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 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 14:32:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:43,489 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-08 14:32:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:32:43,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 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 14:32:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 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 14:32:43,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 14:32:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 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 14:32:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 14:32:43,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-08 14:32:43,529 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 14:32:43,529 INFO L225 Difference]: With dead ends: 44 [2022-04-08 14:32:43,529 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 14:32:43,530 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 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 14:32:43,530 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:43,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:32:43,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 14:32:43,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 14:32:43,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:43,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 14:32:43,556 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 14:32:43,556 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 14:32:43,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:43,557 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 14:32:43,557 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 14:32:43,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:43,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:43,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 38 states. [2022-04-08 14:32:43,558 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 38 states. [2022-04-08 14:32:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:43,559 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 14:32:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 14:32:43,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:43,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:43,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:43,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 14:32:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-08 14:32:43,560 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-08 14:32:43,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:43,560 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-08 14:32:43,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 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 14:32:43,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-08 14:32:43,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:43,681 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 14:32:43,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 14:32:43,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:43,681 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:32:43,700 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 14:32:43,881 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 14:32:43,882 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:43,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:43,882 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-08 14:32:43,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:43,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [123750853] [2022-04-08 14:32:44,000 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:44,000 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:44,000 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-08 14:32:44,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:44,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418468220] [2022-04-08 14:32:44,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:44,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:44,009 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:44,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1327775909] [2022-04-08 14:32:44,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:32:44,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:44,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:44,010 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 14:32:44,018 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 14:32:44,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:32:44,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:44,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 14:32:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:44,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:44,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 14:32:44,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#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);~counter~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:44,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:44,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:44,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:44,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {1933#(<= ~counter~0 0)} 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; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:44,234 INFO L272 TraceCheckUtils]: 6: Hoare triple {1933#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:44,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:44,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:44,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:44,236 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1933#(<= ~counter~0 0)} {1933#(<= ~counter~0 0)} #53#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:44,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:44,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {1933#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:44,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:44,237 INFO L272 TraceCheckUtils]: 14: Hoare triple {1967#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:44,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:44,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:44,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:44,239 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1967#(<= ~counter~0 1)} {1967#(<= ~counter~0 1)} #55#return; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:44,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {1967#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:44,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {1967#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:44,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:44,240 INFO L272 TraceCheckUtils]: 22: Hoare triple {1992#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:44,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:44,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:44,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:44,241 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1992#(<= ~counter~0 2)} {1992#(<= ~counter~0 2)} #55#return; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:44,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {1992#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:44,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {1992#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2017#(<= |main_#t~post5| 2)} is VALID [2022-04-08 14:32:44,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-08 14:32:44,242 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1926#false} is VALID [2022-04-08 14:32:44,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 14:32:44,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-08 14:32:44,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-08 14:32:44,243 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-08 14:32:44,243 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-08 14:32:44,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 14:32:44,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 14:32:44,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 14:32:44,243 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:32:44,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:44,456 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 14:32:44,456 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 14:32:44,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 14:32:44,457 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-08 14:32:44,457 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-08 14:32:44,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:32:44,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:32:44,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:32:44,457 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1925#true} is VALID [2022-04-08 14:32:44,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-08 14:32:44,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:32:44,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {2079#(< ~counter~0 20)} is VALID [2022-04-08 14:32:44,463 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 20)} #55#return; {2079#(< ~counter~0 20)} is VALID [2022-04-08 14:32:44,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:32:44,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:32:44,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:32:44,463 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1925#true} is VALID [2022-04-08 14:32:44,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {2079#(< ~counter~0 20)} is VALID [2022-04-08 14:32:44,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 20)} is VALID [2022-04-08 14:32:44,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2104#(< ~counter~0 19)} is VALID [2022-04-08 14:32:44,465 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 19)} #55#return; {2104#(< ~counter~0 19)} is VALID [2022-04-08 14:32:44,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:32:44,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:32:44,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:32:44,466 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1925#true} is VALID [2022-04-08 14:32:44,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {2104#(< ~counter~0 19)} is VALID [2022-04-08 14:32:44,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 19)} is VALID [2022-04-08 14:32:44,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< ~counter~0 18)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2129#(< ~counter~0 18)} is VALID [2022-04-08 14:32:44,467 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 18)} #53#return; {2129#(< ~counter~0 18)} is VALID [2022-04-08 14:32:44,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:32:44,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:32:44,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:32:44,467 INFO L272 TraceCheckUtils]: 6: Hoare triple {2129#(< ~counter~0 18)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-08 14:32:44,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(< ~counter~0 18)} 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; {2129#(< ~counter~0 18)} is VALID [2022-04-08 14:32:44,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 18)} call #t~ret6 := main(); {2129#(< ~counter~0 18)} is VALID [2022-04-08 14:32:44,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 18)} {1925#true} #61#return; {2129#(< ~counter~0 18)} is VALID [2022-04-08 14:32:44,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 18)} assume true; {2129#(< ~counter~0 18)} is VALID [2022-04-08 14:32:44,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#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);~counter~0 := 0; {2129#(< ~counter~0 18)} is VALID [2022-04-08 14:32:44,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 14:32:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:32:44,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:44,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418468220] [2022-04-08 14:32:44,469 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:44,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327775909] [2022-04-08 14:32:44,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327775909] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:32:44,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:32:44,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 14:32:44,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:44,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [123750853] [2022-04-08 14:32:44,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [123750853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:44,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:44,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:32:44,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648295450] [2022-04-08 14:32:44,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:44,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-08 14:32:44,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:44,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:32:44,493 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 14:32:44,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:32:44,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:44,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:32:44,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:32:44,494 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:32:44,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:44,652 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-08 14:32:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:32:44,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-08 14:32:44,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:32:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 14:32:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:32:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 14:32:44,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-08 14:32:44,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:44,693 INFO L225 Difference]: With dead ends: 54 [2022-04-08 14:32:44,693 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 14:32:44,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:32:44,694 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:44,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:32:44,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 14:32:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 14:32:44,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:44,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:32:44,729 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:32:44,729 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:32:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:44,730 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 14:32:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 14:32:44,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:44,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:44,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-08 14:32:44,731 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-08 14:32:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:44,732 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 14:32:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 14:32:44,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:44,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:44,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:44,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:44,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:32:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-08 14:32:44,733 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-08 14:32:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:44,734 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-08 14:32:44,734 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:32:44,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-08 14:32:44,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 14:32:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 14:32:44,826 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:44,826 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:32:44,843 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 14:32:45,026 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 14:32:45,027 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:45,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:45,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-08 14:32:45,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:45,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2119224099] [2022-04-08 14:32:45,144 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:45,145 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:45,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-08 14:32:45,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:45,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820901449] [2022-04-08 14:32:45,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:45,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:45,168 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:45,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132773724] [2022-04-08 14:32:45,169 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:32:45,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:45,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:45,173 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 14:32:45,198 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 14:32:45,219 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:32:45,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:45,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 14:32:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:45,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:45,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-08 14:32:45,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {2456#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);~counter~0 := 0; {2456#true} is VALID [2022-04-08 14:32:45,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:32:45,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-08 14:32:45,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-08 14:32:45,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {2456#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; {2456#true} is VALID [2022-04-08 14:32:45,504 INFO L272 TraceCheckUtils]: 6: Hoare triple {2456#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2456#true} is VALID [2022-04-08 14:32:45,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:32:45,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:32:45,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:32:45,505 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-08 14:32:45,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {2456#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:45,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:45,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:45,506 INFO L272 TraceCheckUtils]: 14: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-08 14:32:45,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:32:45,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:32:45,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:32:45,507 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2456#true} {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:45,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {2494#(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 * ~y~0 * ~y~0 + ~x~0; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:32:45,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:32:45,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:32:45,508 INFO L272 TraceCheckUtils]: 22: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-08 14:32:45,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:32:45,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:32:45,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:32:45,509 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2456#true} {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:32:45,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {2519#(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 * ~y~0 * ~y~0 + ~x~0; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:32:45,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:32:45,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:32:45,510 INFO L272 TraceCheckUtils]: 30: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-08 14:32:45,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:32:45,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:32:45,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:32:45,511 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2456#true} {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #55#return; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:32:45,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 14:32:45,512 INFO L272 TraceCheckUtils]: 36: Hoare triple {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-08 14:32:45,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:32:45,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:32:45,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:32:45,512 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2456#true} {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #57#return; {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 14:32:45,513 INFO L272 TraceCheckUtils]: 41: Hoare triple {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:32:45,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:32:45,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-08 14:32:45,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-08 14:32:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 14:32:45,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:45,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:45,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820901449] [2022-04-08 14:32:45,774 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:45,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132773724] [2022-04-08 14:32:45,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132773724] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:32:45,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:32:45,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 14:32:45,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:45,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2119224099] [2022-04-08 14:32:45,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2119224099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:45,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:45,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:32:45,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666868537] [2022-04-08 14:32:45,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:45,775 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 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 45 [2022-04-08 14:32:45,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:45,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 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 14:32:45,803 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 14:32:45,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:32:45,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:45,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:32:45,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 14:32:45,804 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 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 14:32:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:46,065 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-08 14:32:46,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:32:46,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 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 45 [2022-04-08 14:32:46,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 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 14:32:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 14:32:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 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 14:32:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 14:32:46,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-08 14:32:46,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:46,104 INFO L225 Difference]: With dead ends: 52 [2022-04-08 14:32:46,104 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 14:32:46,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 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 14:32:46,105 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:46,105 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 181 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:32:46,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 14:32:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 14:32:46,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:46,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:32:46,192 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:32:46,192 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:32:46,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:46,194 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-08 14:32:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 14:32:46,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:46,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:46,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-08 14:32:46,194 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-08 14:32:46,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:46,195 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-08 14:32:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 14:32:46,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:46,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:46,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:46,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:32:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-08 14:32:46,197 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-08 14:32:46,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:46,197 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-08 14:32:46,197 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 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 14:32:46,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-08 14:32:46,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 14:32:46,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 14:32:46,385 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:46,385 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:32:46,434 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 14:32:46,592 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 14:32:46,593 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:46,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:46,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-08 14:32:46,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:46,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [103856643] [2022-04-08 14:32:46,714 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:46,714 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:46,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-08 14:32:46,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:46,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249679922] [2022-04-08 14:32:46,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:46,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:46,723 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:46,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798837578] [2022-04-08 14:32:46,723 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:32:46,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:46,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:46,724 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 14:32:46,726 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 14:32:46,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:32:46,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:46,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:32:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:46,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:46,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-08 14:32:46,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#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);~counter~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:46,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:46,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:46,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:46,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {2958#(<= ~counter~0 0)} 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; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:46,988 INFO L272 TraceCheckUtils]: 6: Hoare triple {2958#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:46,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:46,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:46,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:46,989 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2958#(<= ~counter~0 0)} {2958#(<= ~counter~0 0)} #53#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:46,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {2958#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:46,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {2958#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:46,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:46,990 INFO L272 TraceCheckUtils]: 14: Hoare triple {2992#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:46,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:46,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:46,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:46,992 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2992#(<= ~counter~0 1)} {2992#(<= ~counter~0 1)} #55#return; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:46,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {2992#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:46,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {2992#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:46,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:46,993 INFO L272 TraceCheckUtils]: 22: Hoare triple {3017#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:46,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:46,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:46,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:46,995 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3017#(<= ~counter~0 2)} {3017#(<= ~counter~0 2)} #55#return; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:46,995 INFO L290 TraceCheckUtils]: 27: Hoare triple {3017#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:46,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {3017#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:46,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {3042#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:46,996 INFO L272 TraceCheckUtils]: 30: Hoare triple {3042#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:46,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:46,997 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:46,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:46,997 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3042#(<= ~counter~0 3)} {3042#(<= ~counter~0 3)} #55#return; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:46,998 INFO L290 TraceCheckUtils]: 35: Hoare triple {3042#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:46,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {3042#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3067#(<= |main_#t~post5| 3)} is VALID [2022-04-08 14:32:46,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-08 14:32:46,998 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2951#false} is VALID [2022-04-08 14:32:46,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 14:32:46,999 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-08 14:32:46,999 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-08 14:32:46,999 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-08 14:32:46,999 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-08 14:32:46,999 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 14:32:46,999 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-08 14:32:46,999 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-08 14:32:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:32:46,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:47,256 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-08 14:32:47,256 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-08 14:32:47,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 14:32:47,256 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-08 14:32:47,256 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-08 14:32:47,256 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:32:47,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:32:47,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:32:47,257 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-08 14:32:47,258 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-08 14:32:47,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {3129#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:32:47,258 INFO L290 TraceCheckUtils]: 35: Hoare triple {3129#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {3129#(< ~counter~0 20)} is VALID [2022-04-08 14:32:47,261 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 20)} #55#return; {3129#(< ~counter~0 20)} is VALID [2022-04-08 14:32:47,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:32:47,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:32:47,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:32:47,262 INFO L272 TraceCheckUtils]: 30: Hoare triple {3129#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-08 14:32:47,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {3129#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {3129#(< ~counter~0 20)} is VALID [2022-04-08 14:32:47,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {3154#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3129#(< ~counter~0 20)} is VALID [2022-04-08 14:32:47,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {3154#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3154#(< ~counter~0 19)} is VALID [2022-04-08 14:32:47,263 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 19)} #55#return; {3154#(< ~counter~0 19)} is VALID [2022-04-08 14:32:47,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:32:47,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:32:47,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:32:47,264 INFO L272 TraceCheckUtils]: 22: Hoare triple {3154#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-08 14:32:47,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {3154#(< ~counter~0 19)} is VALID [2022-04-08 14:32:47,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3154#(< ~counter~0 19)} is VALID [2022-04-08 14:32:47,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {3179#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {3179#(< ~counter~0 18)} is VALID [2022-04-08 14:32:47,265 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 18)} #55#return; {3179#(< ~counter~0 18)} is VALID [2022-04-08 14:32:47,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:32:47,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:32:47,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:32:47,266 INFO L272 TraceCheckUtils]: 14: Hoare triple {3179#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-08 14:32:47,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {3179#(< ~counter~0 18)} is VALID [2022-04-08 14:32:47,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {3204#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3179#(< ~counter~0 18)} is VALID [2022-04-08 14:32:47,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {3204#(< ~counter~0 17)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3204#(< ~counter~0 17)} is VALID [2022-04-08 14:32:47,267 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 17)} #53#return; {3204#(< ~counter~0 17)} is VALID [2022-04-08 14:32:47,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:32:47,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:32:47,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:32:47,267 INFO L272 TraceCheckUtils]: 6: Hoare triple {3204#(< ~counter~0 17)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2950#true} is VALID [2022-04-08 14:32:47,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#(< ~counter~0 17)} 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; {3204#(< ~counter~0 17)} is VALID [2022-04-08 14:32:47,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 17)} call #t~ret6 := main(); {3204#(< ~counter~0 17)} is VALID [2022-04-08 14:32:47,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 17)} {2950#true} #61#return; {3204#(< ~counter~0 17)} is VALID [2022-04-08 14:32:47,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 17)} assume true; {3204#(< ~counter~0 17)} is VALID [2022-04-08 14:32:47,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#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);~counter~0 := 0; {3204#(< ~counter~0 17)} is VALID [2022-04-08 14:32:47,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-08 14:32:47,269 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 14:32:47,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:47,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249679922] [2022-04-08 14:32:47,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:47,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798837578] [2022-04-08 14:32:47,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798837578] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:32:47,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:32:47,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 14:32:47,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:47,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [103856643] [2022-04-08 14:32:47,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [103856643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:47,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:47,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:32:47,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517001658] [2022-04-08 14:32:47,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:47,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-08 14:32:47,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:47,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:32:47,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:47,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:32:47,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:47,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:32:47,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:32:47,305 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:32:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:47,454 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-08 14:32:47,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:32:47,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-08 14:32:47,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:32:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 14:32:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:32:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 14:32:47,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-08 14:32:47,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:47,503 INFO L225 Difference]: With dead ends: 62 [2022-04-08 14:32:47,503 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 14:32:47,503 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-08 14:32:47,504 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:47,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:32:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 14:32:47,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 14:32:47,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:47,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:32:47,546 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:32:47,546 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:32:47,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:47,548 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 14:32:47,549 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 14:32:47,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:47,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:47,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-08 14:32:47,549 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-08 14:32:47,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:47,550 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 14:32:47,550 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 14:32:47,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:47,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:47,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:47,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:32:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-08 14:32:47,551 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-08 14:32:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:47,552 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-08 14:32:47,552 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:32:47,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-08 14:32:47,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 14:32:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 14:32:47,700 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:47,700 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:32:47,717 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 14:32:47,908 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 14:32:47,908 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:47,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-08 14:32:47,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:47,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [877985012] [2022-04-08 14:32:48,031 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:48,032 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:48,032 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-08 14:32:48,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:48,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901968948] [2022-04-08 14:32:48,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:48,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:48,057 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:48,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160566692] [2022-04-08 14:32:48,057 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:32:48,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:48,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:48,058 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 14:32:48,059 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 14:32:54,755 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:32:54,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:54,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 14:32:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:54,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:55,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-08 14:32:55,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {3581#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);~counter~0 := 0; {3581#true} is VALID [2022-04-08 14:32:55,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:32:55,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-08 14:32:55,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-08 14:32:55,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {3581#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; {3581#true} is VALID [2022-04-08 14:32:55,064 INFO L272 TraceCheckUtils]: 6: Hoare triple {3581#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3581#true} is VALID [2022-04-08 14:32:55,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:32:55,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:32:55,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:32:55,065 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-08 14:32:55,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {3581#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:55,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:55,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:55,067 INFO L272 TraceCheckUtils]: 14: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-08 14:32:55,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:32:55,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:32:55,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:32:55,067 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3581#true} {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:55,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {3619#(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 * ~y~0 * ~y~0 + ~x~0; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:32:55,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:32:55,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:32:55,069 INFO L272 TraceCheckUtils]: 22: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-08 14:32:55,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:32:55,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:32:55,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:32:55,069 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3581#true} {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:32:55,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {3644#(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 * ~y~0 * ~y~0 + ~x~0; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:32:55,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:32:55,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:32:55,071 INFO L272 TraceCheckUtils]: 30: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-08 14:32:55,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:32:55,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:32:55,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:32:55,071 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3581#true} {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:32:55,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {3669#(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 * ~y~0 * ~y~0 + ~x~0; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:32:55,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:32:55,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:32:55,073 INFO L272 TraceCheckUtils]: 38: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-08 14:32:55,073 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:32:55,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:32:55,073 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:32:55,073 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3581#true} {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #55#return; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:32:55,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:32:55,074 INFO L272 TraceCheckUtils]: 44: Hoare triple {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-08 14:32:55,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:32:55,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:32:55,074 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:32:55,076 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3581#true} {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:32:55,077 INFO L272 TraceCheckUtils]: 49: Hoare triple {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:32:55,077 INFO L290 TraceCheckUtils]: 50: Hoare triple {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3742#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:32:55,077 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-08 14:32:55,078 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-08 14:32:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 14:32:55,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:55,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:55,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901968948] [2022-04-08 14:32:55,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:55,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160566692] [2022-04-08 14:32:55,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160566692] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:32:55,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:32:55,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 14:32:55,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:55,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [877985012] [2022-04-08 14:32:55,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [877985012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:55,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:55,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:32:55,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032109620] [2022-04-08 14:32:55,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:55,315 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 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 53 [2022-04-08 14:32:55,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:55,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 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 14:32:55,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:55,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:32:55,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:55,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:32:55,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:32:55,342 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 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 14:32:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:55,722 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-08 14:32:55,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 14:32:55,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 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 53 [2022-04-08 14:32:55,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 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 14:32:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 14:32:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 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 14:32:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 14:32:55,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-08 14:32:55,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:55,775 INFO L225 Difference]: With dead ends: 60 [2022-04-08 14:32:55,775 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 14:32:55,775 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 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 14:32:55,776 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:55,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 223 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:32:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 14:32:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 14:32:55,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:55,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:32:55,863 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:32:55,864 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:32:55,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:55,865 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-08 14:32:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 14:32:55,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:55,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:55,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-08 14:32:55,865 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-08 14:32:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:55,866 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-08 14:32:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 14:32:55,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:55,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:55,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:55,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:32:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-08 14:32:55,867 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-08 14:32:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:55,868 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-08 14:32:55,868 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 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 14:32:55,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-08 14:32:56,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 14:32:56,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 14:32:56,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:56,102 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:32:56,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 14:32:56,302 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 14:32:56,302 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:56,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:56,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-08 14:32:56,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:56,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [97691967] [2022-04-08 14:32:56,403 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:56,404 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:56,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-08 14:32:56,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:56,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988096137] [2022-04-08 14:32:56,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:56,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:56,415 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:56,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1887637587] [2022-04-08 14:32:56,415 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:32:56,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:56,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:56,416 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 14:32:56,453 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 14:32:56,834 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 14:32:56,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:56,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 14:32:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:56,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:57,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-08 14:32:57,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#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);~counter~0 := 0; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:57,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:57,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4156#(<= ~counter~0 0)} {4148#true} #61#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:57,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {4156#(<= ~counter~0 0)} call #t~ret6 := main(); {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:57,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {4156#(<= ~counter~0 0)} 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; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:57,057 INFO L272 TraceCheckUtils]: 6: Hoare triple {4156#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:57,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {4156#(<= ~counter~0 0)} ~cond := #in~cond; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:57,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {4156#(<= ~counter~0 0)} assume !(0 == ~cond); {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:57,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:57,058 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4156#(<= ~counter~0 0)} {4156#(<= ~counter~0 0)} #53#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:57,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {4156#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:57,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {4156#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:57,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {4190#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:57,060 INFO L272 TraceCheckUtils]: 14: Hoare triple {4190#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:57,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(<= ~counter~0 1)} ~cond := #in~cond; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:57,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= ~counter~0 1)} assume !(0 == ~cond); {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:57,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= ~counter~0 1)} assume true; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:57,061 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4190#(<= ~counter~0 1)} {4190#(<= ~counter~0 1)} #55#return; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:57,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {4190#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:57,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {4190#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:57,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {4215#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:57,062 INFO L272 TraceCheckUtils]: 22: Hoare triple {4215#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:57,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= ~counter~0 2)} ~cond := #in~cond; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:57,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {4215#(<= ~counter~0 2)} assume !(0 == ~cond); {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:57,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {4215#(<= ~counter~0 2)} assume true; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:57,063 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4215#(<= ~counter~0 2)} {4215#(<= ~counter~0 2)} #55#return; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:57,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {4215#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:32:57,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {4215#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:57,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {4240#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:57,064 INFO L272 TraceCheckUtils]: 30: Hoare triple {4240#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:57,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {4240#(<= ~counter~0 3)} ~cond := #in~cond; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:57,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {4240#(<= ~counter~0 3)} assume !(0 == ~cond); {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:57,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {4240#(<= ~counter~0 3)} assume true; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:57,073 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4240#(<= ~counter~0 3)} {4240#(<= ~counter~0 3)} #55#return; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:57,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {4240#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:32:57,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {4240#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:57,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {4265#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:57,075 INFO L272 TraceCheckUtils]: 38: Hoare triple {4265#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:57,075 INFO L290 TraceCheckUtils]: 39: Hoare triple {4265#(<= ~counter~0 4)} ~cond := #in~cond; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:57,075 INFO L290 TraceCheckUtils]: 40: Hoare triple {4265#(<= ~counter~0 4)} assume !(0 == ~cond); {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:57,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {4265#(<= ~counter~0 4)} assume true; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:57,076 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4265#(<= ~counter~0 4)} {4265#(<= ~counter~0 4)} #55#return; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:57,076 INFO L290 TraceCheckUtils]: 43: Hoare triple {4265#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:32:57,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {4265#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4290#(<= |main_#t~post5| 4)} is VALID [2022-04-08 14:32:57,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-08 14:32:57,076 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4149#false} is VALID [2022-04-08 14:32:57,077 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 14:32:57,077 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(0 == ~cond); {4149#false} is VALID [2022-04-08 14:32:57,077 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume true; {4149#false} is VALID [2022-04-08 14:32:57,077 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4149#false} {4149#false} #57#return; {4149#false} is VALID [2022-04-08 14:32:57,077 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-08 14:32:57,077 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 14:32:57,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-08 14:32:57,077 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-08 14:32:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:32:57,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:57,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-08 14:32:57,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-08 14:32:57,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 14:32:57,240 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-08 14:32:57,240 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4148#true} {4149#false} #57#return; {4149#false} is VALID [2022-04-08 14:32:57,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:32:57,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:32:57,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:32:57,240 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-08 14:32:57,240 INFO L290 TraceCheckUtils]: 45: Hoare triple {4348#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-08 14:32:57,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {4352#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4348#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:32:57,241 INFO L290 TraceCheckUtils]: 43: Hoare triple {4352#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {4352#(< ~counter~0 20)} is VALID [2022-04-08 14:32:57,241 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4148#true} {4352#(< ~counter~0 20)} #55#return; {4352#(< ~counter~0 20)} is VALID [2022-04-08 14:32:57,241 INFO L290 TraceCheckUtils]: 41: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:32:57,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:32:57,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:32:57,241 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-08 14:32:57,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {4352#(< ~counter~0 20)} is VALID [2022-04-08 14:32:57,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {4377#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4352#(< ~counter~0 20)} is VALID [2022-04-08 14:32:57,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {4377#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4377#(< ~counter~0 19)} is VALID [2022-04-08 14:32:57,242 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4148#true} {4377#(< ~counter~0 19)} #55#return; {4377#(< ~counter~0 19)} is VALID [2022-04-08 14:32:57,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:32:57,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:32:57,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:32:57,243 INFO L272 TraceCheckUtils]: 30: Hoare triple {4377#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-08 14:32:57,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {4377#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {4377#(< ~counter~0 19)} is VALID [2022-04-08 14:32:57,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {4402#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4377#(< ~counter~0 19)} is VALID [2022-04-08 14:32:57,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {4402#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {4402#(< ~counter~0 18)} is VALID [2022-04-08 14:32:57,244 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4148#true} {4402#(< ~counter~0 18)} #55#return; {4402#(< ~counter~0 18)} is VALID [2022-04-08 14:32:57,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:32:57,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:32:57,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:32:57,244 INFO L272 TraceCheckUtils]: 22: Hoare triple {4402#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-08 14:32:57,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {4402#(< ~counter~0 18)} is VALID [2022-04-08 14:32:57,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {4427#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4402#(< ~counter~0 18)} is VALID [2022-04-08 14:32:57,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {4427#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {4427#(< ~counter~0 17)} is VALID [2022-04-08 14:32:57,245 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4148#true} {4427#(< ~counter~0 17)} #55#return; {4427#(< ~counter~0 17)} is VALID [2022-04-08 14:32:57,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:32:57,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:32:57,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:32:57,245 INFO L272 TraceCheckUtils]: 14: Hoare triple {4427#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-08 14:32:57,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {4427#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {4427#(< ~counter~0 17)} is VALID [2022-04-08 14:32:57,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {4452#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4427#(< ~counter~0 17)} is VALID [2022-04-08 14:32:57,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {4452#(< ~counter~0 16)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4452#(< ~counter~0 16)} is VALID [2022-04-08 14:32:57,246 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4148#true} {4452#(< ~counter~0 16)} #53#return; {4452#(< ~counter~0 16)} is VALID [2022-04-08 14:32:57,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:32:57,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:32:57,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:32:57,247 INFO L272 TraceCheckUtils]: 6: Hoare triple {4452#(< ~counter~0 16)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4148#true} is VALID [2022-04-08 14:32:57,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#(< ~counter~0 16)} 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; {4452#(< ~counter~0 16)} is VALID [2022-04-08 14:32:57,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#(< ~counter~0 16)} call #t~ret6 := main(); {4452#(< ~counter~0 16)} is VALID [2022-04-08 14:32:57,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#(< ~counter~0 16)} {4148#true} #61#return; {4452#(< ~counter~0 16)} is VALID [2022-04-08 14:32:57,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#(< ~counter~0 16)} assume true; {4452#(< ~counter~0 16)} is VALID [2022-04-08 14:32:57,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#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);~counter~0 := 0; {4452#(< ~counter~0 16)} is VALID [2022-04-08 14:32:57,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-08 14:32:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 14:32:57,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:57,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988096137] [2022-04-08 14:32:57,248 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:57,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887637587] [2022-04-08 14:32:57,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887637587] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:32:57,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:32:57,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 14:32:57,249 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:57,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [97691967] [2022-04-08 14:32:57,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [97691967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:57,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:57,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:32:57,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800719390] [2022-04-08 14:32:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:57,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-08 14:32:57,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:57,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:32:57,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:57,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:32:57,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:57,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:32:57,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:32:57,274 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:32:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:57,400 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-08 14:32:57,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:32:57,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-08 14:32:57,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:32:57,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-08 14:32:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:32:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-08 14:32:57,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-08 14:32:57,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:57,434 INFO L225 Difference]: With dead ends: 70 [2022-04-08 14:32:57,434 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 14:32:57,434 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:32:57,434 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:57,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 96 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:32:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 14:32:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-08 14:32:57,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:57,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:32:57,476 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:32:57,477 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:32:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:57,478 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-08 14:32:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 14:32:57,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:57,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:57,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-08 14:32:57,478 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-08 14:32:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:57,479 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-08 14:32:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 14:32:57,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:57,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:57,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:57,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:32:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-08 14:32:57,481 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-08 14:32:57,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:57,481 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-08 14:32:57,481 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:32:57,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-08 14:32:57,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 14:32:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 14:32:57,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:57,584 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:32:57,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-08 14:32:57,788 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 14:32:57,789 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:57,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:57,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-08 14:32:57,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:57,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1431140038] [2022-04-08 14:32:57,910 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:57,910 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:57,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-08 14:32:57,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:57,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071236943] [2022-04-08 14:32:57,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:57,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:57,920 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:57,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2036047514] [2022-04-08 14:32:57,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:32:57,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:57,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:57,921 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 14:32:57,922 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 14:32:58,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:32:58,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:58,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 14:32:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:58,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:58,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-08 14:32:58,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {4879#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);~counter~0 := 0; {4879#true} is VALID [2022-04-08 14:32:58,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:32:58,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-08 14:32:58,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-08 14:32:58,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {4879#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; {4879#true} is VALID [2022-04-08 14:32:58,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {4879#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:32:58,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:32:58,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:32:58,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:32:58,914 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-08 14:32:58,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {4879#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:58,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:58,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:58,916 INFO L272 TraceCheckUtils]: 14: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:32:58,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:32:58,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:32:58,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:32:58,916 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4879#true} {4917#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:58,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#(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 * ~y~0 * ~y~0 + ~x~0; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:32:58,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:32:58,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 20);havoc #t~post5; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:32:58,918 INFO L272 TraceCheckUtils]: 22: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:32:58,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:32:58,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:32:58,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:32:58,918 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4879#true} {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:32:58,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,920 INFO L272 TraceCheckUtils]: 30: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:32:58,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:32:58,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:32:58,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:32:58,921 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4879#true} {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #55#return; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= 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 * ~y~0 * ~y~0 + ~x~0; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,922 INFO L272 TraceCheckUtils]: 38: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:32:58,922 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:32:58,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:32:58,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:32:58,923 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4879#true} {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #55#return; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,923 INFO L290 TraceCheckUtils]: 43: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:32:58,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:32:58,924 INFO L290 TraceCheckUtils]: 45: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:32:58,924 INFO L272 TraceCheckUtils]: 46: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:32:58,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:32:58,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:32:58,924 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:32:58,925 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4879#true} {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #55#return; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:32:58,925 INFO L290 TraceCheckUtils]: 51: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 14:32:58,925 INFO L272 TraceCheckUtils]: 52: Hoare triple {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:32:58,926 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:32:58,926 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:32:58,926 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:32:58,926 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4879#true} {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #57#return; {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 14:32:58,927 INFO L272 TraceCheckUtils]: 57: Hoare triple {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:32:58,927 INFO L290 TraceCheckUtils]: 58: Hoare triple {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:32:58,927 INFO L290 TraceCheckUtils]: 59: Hoare triple {5065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-08 14:32:58,927 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-08 14:32:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 14:32:58,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:59,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:59,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071236943] [2022-04-08 14:32:59,585 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:59,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036047514] [2022-04-08 14:32:59,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036047514] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:32:59,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:32:59,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 14:32:59,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:59,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1431140038] [2022-04-08 14:32:59,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1431140038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:59,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:59,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:32:59,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986737419] [2022-04-08 14:32:59,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:59,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 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 61 [2022-04-08 14:32:59,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:59,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 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 14:32:59,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:59,611 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:32:59,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:59,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:32:59,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:32:59,612 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 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 14:33:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:00,137 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-08 14:33:00,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:33:00,137 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 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 61 [2022-04-08 14:33:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 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 14:33:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-08 14:33:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 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 14:33:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-08 14:33:00,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-08 14:33:00,189 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 14:33:00,190 INFO L225 Difference]: With dead ends: 68 [2022-04-08 14:33:00,190 INFO L226 Difference]: Without dead ends: 62 [2022-04-08 14:33:00,190 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:33:00,191 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:00,191 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 264 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:33:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-08 14:33:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-08 14:33:00,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:00,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:00,267 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:00,267 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:00,268 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-08 14:33:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 14:33:00,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:00,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:00,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-08 14:33:00,269 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-08 14:33:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:00,270 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-08 14:33:00,270 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 14:33:00,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:00,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:00,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:00,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-08 14:33:00,271 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-08 14:33:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:00,271 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-08 14:33:00,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 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 14:33:00,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-08 14:33:00,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 14:33:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 14:33:00,395 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:00,395 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:00,402 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 14:33:00,596 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 14:33:00,596 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-08 14:33:00,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:00,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [410198243] [2022-04-08 14:33:00,696 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:00,696 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:00,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-08 14:33:00,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:00,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367538020] [2022-04-08 14:33:00,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:00,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:00,705 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:00,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355086628] [2022-04-08 14:33:00,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:33:00,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:00,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:00,710 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 14:33:00,714 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 14:33:00,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:33:00,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:00,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 14:33:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:00,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:01,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-08 14:33:01,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#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);~counter~0 := 0; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5602#(<= ~counter~0 0)} {5594#true} #61#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {5602#(<= ~counter~0 0)} call #t~ret6 := main(); {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {5602#(<= ~counter~0 0)} 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; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,038 INFO L272 TraceCheckUtils]: 6: Hoare triple {5602#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {5602#(<= ~counter~0 0)} ~cond := #in~cond; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {5602#(<= ~counter~0 0)} assume !(0 == ~cond); {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,040 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5602#(<= ~counter~0 0)} {5602#(<= ~counter~0 0)} #53#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {5602#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {5602#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:01,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {5636#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:01,041 INFO L272 TraceCheckUtils]: 14: Hoare triple {5636#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:01,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {5636#(<= ~counter~0 1)} ~cond := #in~cond; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:01,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {5636#(<= ~counter~0 1)} assume !(0 == ~cond); {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:01,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {5636#(<= ~counter~0 1)} assume true; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:01,042 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5636#(<= ~counter~0 1)} {5636#(<= ~counter~0 1)} #55#return; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:01,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {5636#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:01,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {5636#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:01,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:01,044 INFO L272 TraceCheckUtils]: 22: Hoare triple {5661#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:01,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 2)} ~cond := #in~cond; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:01,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 2)} assume !(0 == ~cond); {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:01,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {5661#(<= ~counter~0 2)} assume true; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:01,045 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5661#(<= ~counter~0 2)} {5661#(<= ~counter~0 2)} #55#return; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:01,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {5661#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:01,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {5661#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:01,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {5686#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:01,046 INFO L272 TraceCheckUtils]: 30: Hoare triple {5686#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:01,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {5686#(<= ~counter~0 3)} ~cond := #in~cond; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:01,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {5686#(<= ~counter~0 3)} assume !(0 == ~cond); {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:01,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {5686#(<= ~counter~0 3)} assume true; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:01,047 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5686#(<= ~counter~0 3)} {5686#(<= ~counter~0 3)} #55#return; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:01,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {5686#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:01,049 INFO L290 TraceCheckUtils]: 36: Hoare triple {5686#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:01,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {5711#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:01,049 INFO L272 TraceCheckUtils]: 38: Hoare triple {5711#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:01,050 INFO L290 TraceCheckUtils]: 39: Hoare triple {5711#(<= ~counter~0 4)} ~cond := #in~cond; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:01,050 INFO L290 TraceCheckUtils]: 40: Hoare triple {5711#(<= ~counter~0 4)} assume !(0 == ~cond); {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:01,050 INFO L290 TraceCheckUtils]: 41: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:01,051 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5711#(<= ~counter~0 4)} {5711#(<= ~counter~0 4)} #55#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:01,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {5711#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:01,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {5711#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:01,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:01,058 INFO L272 TraceCheckUtils]: 46: Hoare triple {5736#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:01,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {5736#(<= ~counter~0 5)} ~cond := #in~cond; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:01,059 INFO L290 TraceCheckUtils]: 48: Hoare triple {5736#(<= ~counter~0 5)} assume !(0 == ~cond); {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:01,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {5736#(<= ~counter~0 5)} assume true; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:01,059 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5736#(<= ~counter~0 5)} {5736#(<= ~counter~0 5)} #55#return; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:01,060 INFO L290 TraceCheckUtils]: 51: Hoare triple {5736#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:01,060 INFO L290 TraceCheckUtils]: 52: Hoare triple {5736#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5761#(<= |main_#t~post5| 5)} is VALID [2022-04-08 14:33:01,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {5761#(<= |main_#t~post5| 5)} assume !(#t~post5 < 20);havoc #t~post5; {5595#false} is VALID [2022-04-08 14:33:01,060 INFO L272 TraceCheckUtils]: 54: Hoare triple {5595#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5595#false} is VALID [2022-04-08 14:33:01,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-08 14:33:01,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {5595#false} assume !(0 == ~cond); {5595#false} is VALID [2022-04-08 14:33:01,061 INFO L290 TraceCheckUtils]: 57: Hoare triple {5595#false} assume true; {5595#false} is VALID [2022-04-08 14:33:01,061 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5595#false} {5595#false} #57#return; {5595#false} is VALID [2022-04-08 14:33:01,061 INFO L272 TraceCheckUtils]: 59: Hoare triple {5595#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5595#false} is VALID [2022-04-08 14:33:01,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-08 14:33:01,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-08 14:33:01,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-08 14:33:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:33:01,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:01,406 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-08 14:33:01,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-08 14:33:01,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-08 14:33:01,406 INFO L272 TraceCheckUtils]: 59: Hoare triple {5595#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5595#false} is VALID [2022-04-08 14:33:01,406 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5594#true} {5595#false} #57#return; {5595#false} is VALID [2022-04-08 14:33:01,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:33:01,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:33:01,407 INFO L290 TraceCheckUtils]: 55: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:33:01,407 INFO L272 TraceCheckUtils]: 54: Hoare triple {5595#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-08 14:33:01,407 INFO L290 TraceCheckUtils]: 53: Hoare triple {5819#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {5595#false} is VALID [2022-04-08 14:33:01,407 INFO L290 TraceCheckUtils]: 52: Hoare triple {5823#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5819#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:33:01,408 INFO L290 TraceCheckUtils]: 51: Hoare triple {5823#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {5823#(< ~counter~0 20)} is VALID [2022-04-08 14:33:01,408 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5594#true} {5823#(< ~counter~0 20)} #55#return; {5823#(< ~counter~0 20)} is VALID [2022-04-08 14:33:01,408 INFO L290 TraceCheckUtils]: 49: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:33:01,408 INFO L290 TraceCheckUtils]: 48: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:33:01,408 INFO L290 TraceCheckUtils]: 47: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:33:01,408 INFO L272 TraceCheckUtils]: 46: Hoare triple {5823#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-08 14:33:01,409 INFO L290 TraceCheckUtils]: 45: Hoare triple {5823#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {5823#(< ~counter~0 20)} is VALID [2022-04-08 14:33:01,409 INFO L290 TraceCheckUtils]: 44: Hoare triple {5848#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5823#(< ~counter~0 20)} is VALID [2022-04-08 14:33:01,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5848#(< ~counter~0 19)} is VALID [2022-04-08 14:33:01,410 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5594#true} {5848#(< ~counter~0 19)} #55#return; {5848#(< ~counter~0 19)} is VALID [2022-04-08 14:33:01,410 INFO L290 TraceCheckUtils]: 41: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:33:01,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:33:01,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:33:01,410 INFO L272 TraceCheckUtils]: 38: Hoare triple {5848#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-08 14:33:01,411 INFO L290 TraceCheckUtils]: 37: Hoare triple {5848#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {5848#(< ~counter~0 19)} is VALID [2022-04-08 14:33:01,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {5873#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5848#(< ~counter~0 19)} is VALID [2022-04-08 14:33:01,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {5873#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {5873#(< ~counter~0 18)} is VALID [2022-04-08 14:33:01,412 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5594#true} {5873#(< ~counter~0 18)} #55#return; {5873#(< ~counter~0 18)} is VALID [2022-04-08 14:33:01,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:33:01,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:33:01,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:33:01,412 INFO L272 TraceCheckUtils]: 30: Hoare triple {5873#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-08 14:33:01,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {5873#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {5873#(< ~counter~0 18)} is VALID [2022-04-08 14:33:01,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {5898#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5873#(< ~counter~0 18)} is VALID [2022-04-08 14:33:01,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {5898#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {5898#(< ~counter~0 17)} is VALID [2022-04-08 14:33:01,414 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5594#true} {5898#(< ~counter~0 17)} #55#return; {5898#(< ~counter~0 17)} is VALID [2022-04-08 14:33:01,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:33:01,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:33:01,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:33:01,414 INFO L272 TraceCheckUtils]: 22: Hoare triple {5898#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-08 14:33:01,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {5898#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {5898#(< ~counter~0 17)} is VALID [2022-04-08 14:33:01,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {5923#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5898#(< ~counter~0 17)} is VALID [2022-04-08 14:33:01,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {5923#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {5923#(< ~counter~0 16)} is VALID [2022-04-08 14:33:01,415 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5594#true} {5923#(< ~counter~0 16)} #55#return; {5923#(< ~counter~0 16)} is VALID [2022-04-08 14:33:01,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:33:01,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:33:01,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:33:01,416 INFO L272 TraceCheckUtils]: 14: Hoare triple {5923#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-08 14:33:01,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {5923#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {5923#(< ~counter~0 16)} is VALID [2022-04-08 14:33:01,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {5948#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5923#(< ~counter~0 16)} is VALID [2022-04-08 14:33:01,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {5948#(< ~counter~0 15)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5948#(< ~counter~0 15)} is VALID [2022-04-08 14:33:01,417 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5594#true} {5948#(< ~counter~0 15)} #53#return; {5948#(< ~counter~0 15)} is VALID [2022-04-08 14:33:01,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:33:01,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:33:01,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:33:01,418 INFO L272 TraceCheckUtils]: 6: Hoare triple {5948#(< ~counter~0 15)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5594#true} is VALID [2022-04-08 14:33:01,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {5948#(< ~counter~0 15)} 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; {5948#(< ~counter~0 15)} is VALID [2022-04-08 14:33:01,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {5948#(< ~counter~0 15)} call #t~ret6 := main(); {5948#(< ~counter~0 15)} is VALID [2022-04-08 14:33:01,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5948#(< ~counter~0 15)} {5594#true} #61#return; {5948#(< ~counter~0 15)} is VALID [2022-04-08 14:33:01,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#(< ~counter~0 15)} assume true; {5948#(< ~counter~0 15)} is VALID [2022-04-08 14:33:01,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#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);~counter~0 := 0; {5948#(< ~counter~0 15)} is VALID [2022-04-08 14:33:01,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-08 14:33:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 14:33:01,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:01,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367538020] [2022-04-08 14:33:01,420 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:01,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355086628] [2022-04-08 14:33:01,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355086628] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:33:01,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:33:01,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 14:33:01,420 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:01,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [410198243] [2022-04-08 14:33:01,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [410198243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:01,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:01,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:33:01,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608308065] [2022-04-08 14:33:01,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:01,421 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-08 14:33:01,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:01,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:33:01,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:01,469 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:33:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:01,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:33:01,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:33:01,469 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:33:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:01,692 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-08 14:33:01,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:33:01,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-08 14:33:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:33:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-08 14:33:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:33:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-08 14:33:01,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-08 14:33:01,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:01,740 INFO L225 Difference]: With dead ends: 78 [2022-04-08 14:33:01,740 INFO L226 Difference]: Without dead ends: 68 [2022-04-08 14:33:01,740 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-08 14:33:01,741 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:01,741 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 111 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:33:01,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-08 14:33:01,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-08 14:33:01,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:01,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:01,828 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:01,828 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:01,830 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-08 14:33:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 14:33:01,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:01,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:01,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 68 states. [2022-04-08 14:33:01,831 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 68 states. [2022-04-08 14:33:01,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:01,833 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-08 14:33:01,833 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 14:33:01,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:01,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:01,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:01,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-08 14:33:01,835 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2022-04-08 14:33:01,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:01,835 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-08 14:33:01,835 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:33:01,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-08 14:33:02,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 14:33:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 14:33:02,032 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:02,032 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:02,051 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 14:33:02,232 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 14:33:02,232 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:02,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 9 times [2022-04-08 14:33:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:02,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1246165118] [2022-04-08 14:33:02,321 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:02,321 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:02,321 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 10 times [2022-04-08 14:33:02,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:02,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610595609] [2022-04-08 14:33:02,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:02,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:02,332 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:02,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [331025730] [2022-04-08 14:33:02,332 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:33:02,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:02,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:02,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 14:33:02,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 14:33:02,373 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:33:02,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:02,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 14:33:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:02,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:02,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {6425#true} call ULTIMATE.init(); {6425#true} is VALID [2022-04-08 14:33:02,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {6425#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);~counter~0 := 0; {6425#true} is VALID [2022-04-08 14:33:02,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:33:02,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6425#true} {6425#true} #61#return; {6425#true} is VALID [2022-04-08 14:33:02,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {6425#true} call #t~ret6 := main(); {6425#true} is VALID [2022-04-08 14:33:02,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {6425#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; {6425#true} is VALID [2022-04-08 14:33:02,808 INFO L272 TraceCheckUtils]: 6: Hoare triple {6425#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:33:02,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:33:02,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:33:02,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:33:02,808 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6425#true} {6425#true} #53#return; {6425#true} is VALID [2022-04-08 14:33:02,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {6425#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:02,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:02,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:02,809 INFO L272 TraceCheckUtils]: 14: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:33:02,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:33:02,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:33:02,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:33:02,810 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6425#true} {6463#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:02,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {6463#(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 * ~y~0 * ~y~0 + ~x~0; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:02,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:02,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:02,811 INFO L272 TraceCheckUtils]: 22: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:33:02,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:33:02,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:33:02,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:33:02,826 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6425#true} {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:02,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {6488#(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 * ~y~0 * ~y~0 + ~x~0; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:02,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:02,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:02,827 INFO L272 TraceCheckUtils]: 30: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:33:02,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:33:02,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:33:02,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:33:02,828 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6425#true} {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:02,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {6513#(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 * ~y~0 * ~y~0 + ~x~0; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:33:02,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:33:02,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:33:02,829 INFO L272 TraceCheckUtils]: 38: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:33:02,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:33:02,829 INFO L290 TraceCheckUtils]: 40: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:33:02,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:33:02,830 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6425#true} {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:33:02,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {6538#(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 * ~y~0 * ~y~0 + ~x~0; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:33:02,831 INFO L290 TraceCheckUtils]: 44: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:33:02,831 INFO L290 TraceCheckUtils]: 45: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:33:02,831 INFO L272 TraceCheckUtils]: 46: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:33:02,831 INFO L290 TraceCheckUtils]: 47: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:33:02,831 INFO L290 TraceCheckUtils]: 48: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:33:02,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:33:02,832 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6425#true} {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:33:02,832 INFO L290 TraceCheckUtils]: 51: Hoare triple {6563#(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 * ~y~0 * ~y~0 + ~x~0; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:33:02,832 INFO L290 TraceCheckUtils]: 52: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:33:02,833 INFO L290 TraceCheckUtils]: 53: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:33:02,833 INFO L272 TraceCheckUtils]: 54: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:33:02,833 INFO L290 TraceCheckUtils]: 55: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:33:02,833 INFO L290 TraceCheckUtils]: 56: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:33:02,833 INFO L290 TraceCheckUtils]: 57: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:33:02,834 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6425#true} {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #55#return; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:33:02,834 INFO L290 TraceCheckUtils]: 59: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:33:02,834 INFO L272 TraceCheckUtils]: 60: Hoare triple {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 14:33:02,834 INFO L290 TraceCheckUtils]: 61: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 14:33:02,834 INFO L290 TraceCheckUtils]: 62: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 14:33:02,834 INFO L290 TraceCheckUtils]: 63: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 14:33:02,836 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6425#true} {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:33:02,836 INFO L272 TraceCheckUtils]: 65: Hoare triple {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:33:02,837 INFO L290 TraceCheckUtils]: 66: Hoare triple {6632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:33:02,837 INFO L290 TraceCheckUtils]: 67: Hoare triple {6636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6426#false} is VALID [2022-04-08 14:33:02,837 INFO L290 TraceCheckUtils]: 68: Hoare triple {6426#false} assume !false; {6426#false} is VALID [2022-04-08 14:33:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 14:33:02,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:03,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:03,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610595609] [2022-04-08 14:33:03,083 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:03,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331025730] [2022-04-08 14:33:03,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331025730] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:33:03,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:33:03,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 14:33:03,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:03,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1246165118] [2022-04-08 14:33:03,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1246165118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:03,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:03,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:33:03,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397027013] [2022-04-08 14:33:03,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:03,085 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 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 69 [2022-04-08 14:33:03,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:03,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 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 14:33:03,110 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 14:33:03,110 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:33:03,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:03,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:33:03,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:33:03,111 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 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 14:33:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:03,735 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-08 14:33:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 14:33:03,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 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 69 [2022-04-08 14:33:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 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 14:33:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 14:33:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 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 14:33:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 14:33:03,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-08 14:33:03,793 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 14:33:03,802 INFO L225 Difference]: With dead ends: 76 [2022-04-08 14:33:03,802 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 14:33:03,802 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 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 14:33:03,803 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:03,803 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:33:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 14:33:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 14:33:03,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:03,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:03,868 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:03,868 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:03,869 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-08 14:33:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 14:33:03,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:03,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:03,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-08 14:33:03,870 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-08 14:33:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:03,871 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-08 14:33:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 14:33:03,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:03,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:03,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:03,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-08 14:33:03,872 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 69 [2022-04-08 14:33:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:03,873 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-08 14:33:03,873 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 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 14:33:03,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-08 14:33:03,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 14:33:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 14:33:03,985 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:03,985 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:04,004 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 14:33:04,191 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 14:33:04,191 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:04,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 9 times [2022-04-08 14:33:04,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:04,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1776572576] [2022-04-08 14:33:04,272 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:04,273 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 10 times [2022-04-08 14:33:04,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:04,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206361868] [2022-04-08 14:33:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:04,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:04,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [874249092] [2022-04-08 14:33:04,303 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:33:04,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:04,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:04,307 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 14:33:04,309 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 14:33:04,377 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:33:04,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:04,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 14:33:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:04,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:04,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2022-04-08 14:33:04,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {7138#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);~counter~0 := 0; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:04,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {7146#(<= ~counter~0 0)} assume true; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:04,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7146#(<= ~counter~0 0)} {7138#true} #61#return; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:04,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {7146#(<= ~counter~0 0)} call #t~ret6 := main(); {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:04,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {7146#(<= ~counter~0 0)} 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; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:04,604 INFO L272 TraceCheckUtils]: 6: Hoare triple {7146#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:04,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {7146#(<= ~counter~0 0)} ~cond := #in~cond; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:04,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {7146#(<= ~counter~0 0)} assume !(0 == ~cond); {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:04,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {7146#(<= ~counter~0 0)} assume true; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:04,605 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7146#(<= ~counter~0 0)} {7146#(<= ~counter~0 0)} #53#return; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:04,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {7146#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:04,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {7146#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:04,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {7180#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:04,606 INFO L272 TraceCheckUtils]: 14: Hoare triple {7180#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:04,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {7180#(<= ~counter~0 1)} ~cond := #in~cond; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:04,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {7180#(<= ~counter~0 1)} assume !(0 == ~cond); {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:04,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {7180#(<= ~counter~0 1)} assume true; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:04,607 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7180#(<= ~counter~0 1)} {7180#(<= ~counter~0 1)} #55#return; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:04,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {7180#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:04,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {7180#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:04,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {7205#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:04,608 INFO L272 TraceCheckUtils]: 22: Hoare triple {7205#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:04,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {7205#(<= ~counter~0 2)} ~cond := #in~cond; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:04,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {7205#(<= ~counter~0 2)} assume !(0 == ~cond); {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:04,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {7205#(<= ~counter~0 2)} assume true; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:04,608 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7205#(<= ~counter~0 2)} {7205#(<= ~counter~0 2)} #55#return; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:04,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {7205#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:04,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {7205#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:04,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {7230#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:04,609 INFO L272 TraceCheckUtils]: 30: Hoare triple {7230#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:04,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {7230#(<= ~counter~0 3)} ~cond := #in~cond; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:04,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {7230#(<= ~counter~0 3)} assume !(0 == ~cond); {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:04,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {7230#(<= ~counter~0 3)} assume true; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:04,611 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7230#(<= ~counter~0 3)} {7230#(<= ~counter~0 3)} #55#return; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:04,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {7230#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:04,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {7230#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:04,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {7255#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:04,613 INFO L272 TraceCheckUtils]: 38: Hoare triple {7255#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:04,613 INFO L290 TraceCheckUtils]: 39: Hoare triple {7255#(<= ~counter~0 4)} ~cond := #in~cond; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:04,613 INFO L290 TraceCheckUtils]: 40: Hoare triple {7255#(<= ~counter~0 4)} assume !(0 == ~cond); {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:04,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {7255#(<= ~counter~0 4)} assume true; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:04,614 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7255#(<= ~counter~0 4)} {7255#(<= ~counter~0 4)} #55#return; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:04,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {7255#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:04,614 INFO L290 TraceCheckUtils]: 44: Hoare triple {7255#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:04,614 INFO L290 TraceCheckUtils]: 45: Hoare triple {7280#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:04,615 INFO L272 TraceCheckUtils]: 46: Hoare triple {7280#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:04,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {7280#(<= ~counter~0 5)} ~cond := #in~cond; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:04,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {7280#(<= ~counter~0 5)} assume !(0 == ~cond); {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:04,619 INFO L290 TraceCheckUtils]: 49: Hoare triple {7280#(<= ~counter~0 5)} assume true; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:04,619 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7280#(<= ~counter~0 5)} {7280#(<= ~counter~0 5)} #55#return; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:04,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {7280#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:04,620 INFO L290 TraceCheckUtils]: 52: Hoare triple {7280#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:04,620 INFO L290 TraceCheckUtils]: 53: Hoare triple {7305#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:04,620 INFO L272 TraceCheckUtils]: 54: Hoare triple {7305#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:04,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {7305#(<= ~counter~0 6)} ~cond := #in~cond; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:04,621 INFO L290 TraceCheckUtils]: 56: Hoare triple {7305#(<= ~counter~0 6)} assume !(0 == ~cond); {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:04,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {7305#(<= ~counter~0 6)} assume true; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:04,621 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7305#(<= ~counter~0 6)} {7305#(<= ~counter~0 6)} #55#return; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:04,621 INFO L290 TraceCheckUtils]: 59: Hoare triple {7305#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:04,621 INFO L290 TraceCheckUtils]: 60: Hoare triple {7305#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7330#(<= |main_#t~post5| 6)} is VALID [2022-04-08 14:33:04,622 INFO L290 TraceCheckUtils]: 61: Hoare triple {7330#(<= |main_#t~post5| 6)} assume !(#t~post5 < 20);havoc #t~post5; {7139#false} is VALID [2022-04-08 14:33:04,622 INFO L272 TraceCheckUtils]: 62: Hoare triple {7139#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7139#false} is VALID [2022-04-08 14:33:04,622 INFO L290 TraceCheckUtils]: 63: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-08 14:33:04,622 INFO L290 TraceCheckUtils]: 64: Hoare triple {7139#false} assume !(0 == ~cond); {7139#false} is VALID [2022-04-08 14:33:04,622 INFO L290 TraceCheckUtils]: 65: Hoare triple {7139#false} assume true; {7139#false} is VALID [2022-04-08 14:33:04,622 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7139#false} {7139#false} #57#return; {7139#false} is VALID [2022-04-08 14:33:04,622 INFO L272 TraceCheckUtils]: 67: Hoare triple {7139#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7139#false} is VALID [2022-04-08 14:33:04,622 INFO L290 TraceCheckUtils]: 68: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-08 14:33:04,622 INFO L290 TraceCheckUtils]: 69: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2022-04-08 14:33:04,622 INFO L290 TraceCheckUtils]: 70: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2022-04-08 14:33:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 36 proven. 132 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:33:04,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:04,875 INFO L290 TraceCheckUtils]: 70: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2022-04-08 14:33:04,876 INFO L290 TraceCheckUtils]: 69: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2022-04-08 14:33:04,876 INFO L290 TraceCheckUtils]: 68: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-08 14:33:04,876 INFO L272 TraceCheckUtils]: 67: Hoare triple {7139#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7139#false} is VALID [2022-04-08 14:33:04,876 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7138#true} {7139#false} #57#return; {7139#false} is VALID [2022-04-08 14:33:04,876 INFO L290 TraceCheckUtils]: 65: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:33:04,876 INFO L290 TraceCheckUtils]: 64: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:33:04,876 INFO L290 TraceCheckUtils]: 63: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:33:04,876 INFO L272 TraceCheckUtils]: 62: Hoare triple {7139#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:33:04,876 INFO L290 TraceCheckUtils]: 61: Hoare triple {7388#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {7139#false} is VALID [2022-04-08 14:33:04,877 INFO L290 TraceCheckUtils]: 60: Hoare triple {7392#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7388#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:33:04,877 INFO L290 TraceCheckUtils]: 59: Hoare triple {7392#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {7392#(< ~counter~0 20)} is VALID [2022-04-08 14:33:04,877 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7138#true} {7392#(< ~counter~0 20)} #55#return; {7392#(< ~counter~0 20)} is VALID [2022-04-08 14:33:04,877 INFO L290 TraceCheckUtils]: 57: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:33:04,877 INFO L290 TraceCheckUtils]: 56: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:33:04,878 INFO L290 TraceCheckUtils]: 55: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:33:04,878 INFO L272 TraceCheckUtils]: 54: Hoare triple {7392#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:33:04,878 INFO L290 TraceCheckUtils]: 53: Hoare triple {7392#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {7392#(< ~counter~0 20)} is VALID [2022-04-08 14:33:04,878 INFO L290 TraceCheckUtils]: 52: Hoare triple {7417#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7392#(< ~counter~0 20)} is VALID [2022-04-08 14:33:04,878 INFO L290 TraceCheckUtils]: 51: Hoare triple {7417#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7417#(< ~counter~0 19)} is VALID [2022-04-08 14:33:04,879 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7138#true} {7417#(< ~counter~0 19)} #55#return; {7417#(< ~counter~0 19)} is VALID [2022-04-08 14:33:04,879 INFO L290 TraceCheckUtils]: 49: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:33:04,879 INFO L290 TraceCheckUtils]: 48: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:33:04,879 INFO L290 TraceCheckUtils]: 47: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:33:04,879 INFO L272 TraceCheckUtils]: 46: Hoare triple {7417#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:33:04,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {7417#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {7417#(< ~counter~0 19)} is VALID [2022-04-08 14:33:04,880 INFO L290 TraceCheckUtils]: 44: Hoare triple {7442#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7417#(< ~counter~0 19)} is VALID [2022-04-08 14:33:04,880 INFO L290 TraceCheckUtils]: 43: Hoare triple {7442#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {7442#(< ~counter~0 18)} is VALID [2022-04-08 14:33:04,880 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7138#true} {7442#(< ~counter~0 18)} #55#return; {7442#(< ~counter~0 18)} is VALID [2022-04-08 14:33:04,880 INFO L290 TraceCheckUtils]: 41: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:33:04,880 INFO L290 TraceCheckUtils]: 40: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:33:04,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:33:04,881 INFO L272 TraceCheckUtils]: 38: Hoare triple {7442#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:33:04,881 INFO L290 TraceCheckUtils]: 37: Hoare triple {7442#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {7442#(< ~counter~0 18)} is VALID [2022-04-08 14:33:04,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {7467#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7442#(< ~counter~0 18)} is VALID [2022-04-08 14:33:04,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {7467#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {7467#(< ~counter~0 17)} is VALID [2022-04-08 14:33:04,882 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7138#true} {7467#(< ~counter~0 17)} #55#return; {7467#(< ~counter~0 17)} is VALID [2022-04-08 14:33:04,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:33:04,882 INFO L290 TraceCheckUtils]: 32: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:33:04,882 INFO L290 TraceCheckUtils]: 31: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:33:04,882 INFO L272 TraceCheckUtils]: 30: Hoare triple {7467#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:33:04,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {7467#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {7467#(< ~counter~0 17)} is VALID [2022-04-08 14:33:04,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {7492#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7467#(< ~counter~0 17)} is VALID [2022-04-08 14:33:04,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {7492#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {7492#(< ~counter~0 16)} is VALID [2022-04-08 14:33:04,883 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7138#true} {7492#(< ~counter~0 16)} #55#return; {7492#(< ~counter~0 16)} is VALID [2022-04-08 14:33:04,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:33:04,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:33:04,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:33:04,883 INFO L272 TraceCheckUtils]: 22: Hoare triple {7492#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:33:04,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {7492#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {7492#(< ~counter~0 16)} is VALID [2022-04-08 14:33:04,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {7517#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7492#(< ~counter~0 16)} is VALID [2022-04-08 14:33:04,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {7517#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {7517#(< ~counter~0 15)} is VALID [2022-04-08 14:33:04,884 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7138#true} {7517#(< ~counter~0 15)} #55#return; {7517#(< ~counter~0 15)} is VALID [2022-04-08 14:33:04,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:33:04,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:33:04,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:33:04,885 INFO L272 TraceCheckUtils]: 14: Hoare triple {7517#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:33:04,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {7517#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {7517#(< ~counter~0 15)} is VALID [2022-04-08 14:33:04,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {7542#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7517#(< ~counter~0 15)} is VALID [2022-04-08 14:33:04,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {7542#(< ~counter~0 14)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7542#(< ~counter~0 14)} is VALID [2022-04-08 14:33:04,886 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7138#true} {7542#(< ~counter~0 14)} #53#return; {7542#(< ~counter~0 14)} is VALID [2022-04-08 14:33:04,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 14:33:04,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 14:33:04,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 14:33:04,886 INFO L272 TraceCheckUtils]: 6: Hoare triple {7542#(< ~counter~0 14)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7138#true} is VALID [2022-04-08 14:33:04,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {7542#(< ~counter~0 14)} 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; {7542#(< ~counter~0 14)} is VALID [2022-04-08 14:33:04,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {7542#(< ~counter~0 14)} call #t~ret6 := main(); {7542#(< ~counter~0 14)} is VALID [2022-04-08 14:33:04,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7542#(< ~counter~0 14)} {7138#true} #61#return; {7542#(< ~counter~0 14)} is VALID [2022-04-08 14:33:04,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {7542#(< ~counter~0 14)} assume true; {7542#(< ~counter~0 14)} is VALID [2022-04-08 14:33:04,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {7138#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);~counter~0 := 0; {7542#(< ~counter~0 14)} is VALID [2022-04-08 14:33:04,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2022-04-08 14:33:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 14 proven. 72 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 14:33:04,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:04,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206361868] [2022-04-08 14:33:04,888 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:04,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874249092] [2022-04-08 14:33:04,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874249092] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:33:04,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:33:04,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 14:33:04,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:04,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1776572576] [2022-04-08 14:33:04,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1776572576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:04,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:04,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:33:04,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921040798] [2022-04-08 14:33:04,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:04,891 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-08 14:33:04,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:04,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:04,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:04,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:33:04,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:04,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:33:04,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:33:04,924 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:05,118 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-04-08 14:33:05,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 14:33:05,129 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-08 14:33:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-08 14:33:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-08 14:33:05,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-08 14:33:05,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:05,208 INFO L225 Difference]: With dead ends: 86 [2022-04-08 14:33:05,208 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 14:33:05,208 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:33:05,209 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:05,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 126 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:33:05,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 14:33:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-08 14:33:05,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:05,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:05,296 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:05,296 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:05,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:05,297 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-08 14:33:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 14:33:05,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:05,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:05,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 76 states. [2022-04-08 14:33:05,298 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 76 states. [2022-04-08 14:33:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:05,299 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-08 14:33:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 14:33:05,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:05,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:05,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:05,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-08 14:33:05,300 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2022-04-08 14:33:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:05,300 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-08 14:33:05,301 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:05,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-08 14:33:05,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 14:33:05,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 14:33:05,434 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:05,434 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:05,454 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 14:33:05,635 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 14:33:05,635 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:05,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:05,636 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 11 times [2022-04-08 14:33:05,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:05,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1105040678] [2022-04-08 14:33:05,771 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:05,771 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:05,771 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 12 times [2022-04-08 14:33:05,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:05,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769024919] [2022-04-08 14:33:05,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:05,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:05,791 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:05,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [735144519] [2022-04-08 14:33:05,791 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:33:05,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:05,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:05,792 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 14:33:05,794 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 14:33:11,172 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 14:33:11,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:11,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 14:33:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:11,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:11,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {8069#true} call ULTIMATE.init(); {8069#true} is VALID [2022-04-08 14:33:11,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {8069#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);~counter~0 := 0; {8069#true} is VALID [2022-04-08 14:33:11,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:33:11,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8069#true} {8069#true} #61#return; {8069#true} is VALID [2022-04-08 14:33:11,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {8069#true} call #t~ret6 := main(); {8069#true} is VALID [2022-04-08 14:33:11,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {8069#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; {8069#true} is VALID [2022-04-08 14:33:11,807 INFO L272 TraceCheckUtils]: 6: Hoare triple {8069#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:33:11,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:33:11,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:33:11,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:33:11,807 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8069#true} {8069#true} #53#return; {8069#true} is VALID [2022-04-08 14:33:11,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {8069#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:11,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:11,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:11,809 INFO L272 TraceCheckUtils]: 14: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:33:11,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:33:11,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:33:11,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:33:11,810 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8069#true} {8107#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:11,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {8107#(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 * ~y~0 * ~y~0 + ~x~0; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:11,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:11,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:11,811 INFO L272 TraceCheckUtils]: 22: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:33:11,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:33:11,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:33:11,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:33:11,812 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8069#true} {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:11,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {8132#(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 * ~y~0 * ~y~0 + ~x~0; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:11,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:11,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:11,813 INFO L272 TraceCheckUtils]: 30: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:33:11,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:33:11,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:33:11,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:33:11,814 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8069#true} {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #55#return; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:11,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~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 * ~y~0 * ~y~0 + ~x~0; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:33:11,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:33:11,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:33:11,815 INFO L272 TraceCheckUtils]: 38: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:33:11,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:33:11,816 INFO L290 TraceCheckUtils]: 40: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:33:11,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:33:11,816 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8069#true} {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:33:11,817 INFO L290 TraceCheckUtils]: 43: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:11,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:11,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:11,817 INFO L272 TraceCheckUtils]: 46: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:33:11,817 INFO L290 TraceCheckUtils]: 47: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:33:11,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:33:11,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:33:11,818 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8069#true} {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #55#return; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:11,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 14:33:11,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 14:33:11,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(#t~post5 < 20);havoc #t~post5; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 14:33:11,819 INFO L272 TraceCheckUtils]: 54: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:33:11,820 INFO L290 TraceCheckUtils]: 55: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:33:11,820 INFO L290 TraceCheckUtils]: 56: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:33:11,820 INFO L290 TraceCheckUtils]: 57: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:33:11,820 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8069#true} {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #55#return; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 14:33:11,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:33:11,821 INFO L290 TraceCheckUtils]: 60: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:33:11,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:33:11,821 INFO L272 TraceCheckUtils]: 62: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:33:11,822 INFO L290 TraceCheckUtils]: 63: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:33:11,822 INFO L290 TraceCheckUtils]: 64: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:33:11,822 INFO L290 TraceCheckUtils]: 65: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:33:11,822 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8069#true} {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:33:11,823 INFO L290 TraceCheckUtils]: 67: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 14:33:11,823 INFO L272 TraceCheckUtils]: 68: Hoare triple {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 14:33:11,823 INFO L290 TraceCheckUtils]: 69: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 14:33:11,823 INFO L290 TraceCheckUtils]: 70: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 14:33:11,823 INFO L290 TraceCheckUtils]: 71: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 14:33:11,824 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8069#true} {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 14:33:11,824 INFO L272 TraceCheckUtils]: 73: Hoare triple {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:33:11,825 INFO L290 TraceCheckUtils]: 74: Hoare triple {8301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:33:11,825 INFO L290 TraceCheckUtils]: 75: Hoare triple {8305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8070#false} is VALID [2022-04-08 14:33:11,825 INFO L290 TraceCheckUtils]: 76: Hoare triple {8070#false} assume !false; {8070#false} is VALID [2022-04-08 14:33:11,825 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 14:33:11,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:12,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:12,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769024919] [2022-04-08 14:33:12,442 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:12,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735144519] [2022-04-08 14:33:12,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735144519] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:33:12,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:33:12,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 14:33:12,442 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:12,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1105040678] [2022-04-08 14:33:12,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1105040678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:12,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:12,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:33:12,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688466951] [2022-04-08 14:33:12,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:12,443 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 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 77 [2022-04-08 14:33:12,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:12,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 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 14:33:12,471 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 14:33:12,471 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:33:12,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:12,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:33:12,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:33:12,472 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 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 14:33:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:13,028 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-08 14:33:13,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:33:13,028 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 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 77 [2022-04-08 14:33:13,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 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 14:33:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 14:33:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 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 14:33:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 14:33:13,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-08 14:33:13,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:13,083 INFO L225 Difference]: With dead ends: 84 [2022-04-08 14:33:13,083 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 14:33:13,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-08 14:33:13,084 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:13,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 369 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:33:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 14:33:13,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-08 14:33:13,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:13,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:33:13,146 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:33:13,146 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:33:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:13,147 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-08 14:33:13,147 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 14:33:13,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:13,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:13,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-08 14:33:13,148 INFO L87 Difference]: Start difference. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-08 14:33:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:13,149 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-08 14:33:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 14:33:13,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:13,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:13,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:13,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:33:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-08 14:33:13,152 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 77 [2022-04-08 14:33:13,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:13,152 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-08 14:33:13,152 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 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 14:33:13,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-08 14:33:13,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 14:33:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 14:33:13,399 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:13,399 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:13,410 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 14:33:13,610 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 14:33:13,610 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:13,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:13,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 11 times [2022-04-08 14:33:13,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:13,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1367360082] [2022-04-08 14:33:13,686 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:13,686 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 12 times [2022-04-08 14:33:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:13,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511072689] [2022-04-08 14:33:13,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:13,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:13,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392852740] [2022-04-08 14:33:13,703 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:33:13,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:13,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:13,704 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 14:33:13,731 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 14:33:13,893 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 14:33:13,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:13,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 14:33:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:13,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:14,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-08 14:33:14,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#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);~counter~0 := 0; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:14,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {8963#(<= ~counter~0 0)} assume true; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:14,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8963#(<= ~counter~0 0)} {8955#true} #61#return; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:14,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {8963#(<= ~counter~0 0)} call #t~ret6 := main(); {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:14,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {8963#(<= ~counter~0 0)} 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; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:14,134 INFO L272 TraceCheckUtils]: 6: Hoare triple {8963#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:14,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {8963#(<= ~counter~0 0)} ~cond := #in~cond; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:14,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {8963#(<= ~counter~0 0)} assume !(0 == ~cond); {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:14,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {8963#(<= ~counter~0 0)} assume true; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:14,135 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8963#(<= ~counter~0 0)} {8963#(<= ~counter~0 0)} #53#return; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:14,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {8963#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:14,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {8963#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:14,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {8997#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:14,136 INFO L272 TraceCheckUtils]: 14: Hoare triple {8997#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:14,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {8997#(<= ~counter~0 1)} ~cond := #in~cond; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:14,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {8997#(<= ~counter~0 1)} assume !(0 == ~cond); {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:14,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {8997#(<= ~counter~0 1)} assume true; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:14,137 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8997#(<= ~counter~0 1)} {8997#(<= ~counter~0 1)} #55#return; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:14,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {8997#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:14,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {8997#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:14,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {9022#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:14,138 INFO L272 TraceCheckUtils]: 22: Hoare triple {9022#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:14,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {9022#(<= ~counter~0 2)} ~cond := #in~cond; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:14,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {9022#(<= ~counter~0 2)} assume !(0 == ~cond); {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:14,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {9022#(<= ~counter~0 2)} assume true; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:14,139 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9022#(<= ~counter~0 2)} {9022#(<= ~counter~0 2)} #55#return; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:14,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {9022#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:14,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {9022#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:14,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {9047#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:14,140 INFO L272 TraceCheckUtils]: 30: Hoare triple {9047#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:14,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {9047#(<= ~counter~0 3)} ~cond := #in~cond; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:14,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {9047#(<= ~counter~0 3)} assume !(0 == ~cond); {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:14,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {9047#(<= ~counter~0 3)} assume true; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:14,141 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9047#(<= ~counter~0 3)} {9047#(<= ~counter~0 3)} #55#return; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:14,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {9047#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:14,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {9047#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:14,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {9072#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:14,142 INFO L272 TraceCheckUtils]: 38: Hoare triple {9072#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:14,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {9072#(<= ~counter~0 4)} ~cond := #in~cond; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:14,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {9072#(<= ~counter~0 4)} assume !(0 == ~cond); {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:14,142 INFO L290 TraceCheckUtils]: 41: Hoare triple {9072#(<= ~counter~0 4)} assume true; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:14,143 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9072#(<= ~counter~0 4)} {9072#(<= ~counter~0 4)} #55#return; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:14,143 INFO L290 TraceCheckUtils]: 43: Hoare triple {9072#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:14,143 INFO L290 TraceCheckUtils]: 44: Hoare triple {9072#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:14,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {9097#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:14,144 INFO L272 TraceCheckUtils]: 46: Hoare triple {9097#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:14,144 INFO L290 TraceCheckUtils]: 47: Hoare triple {9097#(<= ~counter~0 5)} ~cond := #in~cond; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:14,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {9097#(<= ~counter~0 5)} assume !(0 == ~cond); {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:14,144 INFO L290 TraceCheckUtils]: 49: Hoare triple {9097#(<= ~counter~0 5)} assume true; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:14,145 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9097#(<= ~counter~0 5)} {9097#(<= ~counter~0 5)} #55#return; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:14,145 INFO L290 TraceCheckUtils]: 51: Hoare triple {9097#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:14,145 INFO L290 TraceCheckUtils]: 52: Hoare triple {9097#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:14,145 INFO L290 TraceCheckUtils]: 53: Hoare triple {9122#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:14,146 INFO L272 TraceCheckUtils]: 54: Hoare triple {9122#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:14,146 INFO L290 TraceCheckUtils]: 55: Hoare triple {9122#(<= ~counter~0 6)} ~cond := #in~cond; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:14,146 INFO L290 TraceCheckUtils]: 56: Hoare triple {9122#(<= ~counter~0 6)} assume !(0 == ~cond); {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:14,146 INFO L290 TraceCheckUtils]: 57: Hoare triple {9122#(<= ~counter~0 6)} assume true; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:14,147 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9122#(<= ~counter~0 6)} {9122#(<= ~counter~0 6)} #55#return; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:14,147 INFO L290 TraceCheckUtils]: 59: Hoare triple {9122#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:14,148 INFO L290 TraceCheckUtils]: 60: Hoare triple {9122#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:14,148 INFO L290 TraceCheckUtils]: 61: Hoare triple {9147#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:14,149 INFO L272 TraceCheckUtils]: 62: Hoare triple {9147#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:14,149 INFO L290 TraceCheckUtils]: 63: Hoare triple {9147#(<= ~counter~0 7)} ~cond := #in~cond; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:14,149 INFO L290 TraceCheckUtils]: 64: Hoare triple {9147#(<= ~counter~0 7)} assume !(0 == ~cond); {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:14,149 INFO L290 TraceCheckUtils]: 65: Hoare triple {9147#(<= ~counter~0 7)} assume true; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:14,150 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9147#(<= ~counter~0 7)} {9147#(<= ~counter~0 7)} #55#return; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:14,150 INFO L290 TraceCheckUtils]: 67: Hoare triple {9147#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:14,150 INFO L290 TraceCheckUtils]: 68: Hoare triple {9147#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9172#(<= |main_#t~post5| 7)} is VALID [2022-04-08 14:33:14,150 INFO L290 TraceCheckUtils]: 69: Hoare triple {9172#(<= |main_#t~post5| 7)} assume !(#t~post5 < 20);havoc #t~post5; {8956#false} is VALID [2022-04-08 14:33:14,150 INFO L272 TraceCheckUtils]: 70: Hoare triple {8956#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8956#false} is VALID [2022-04-08 14:33:14,150 INFO L290 TraceCheckUtils]: 71: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-08 14:33:14,151 INFO L290 TraceCheckUtils]: 72: Hoare triple {8956#false} assume !(0 == ~cond); {8956#false} is VALID [2022-04-08 14:33:14,151 INFO L290 TraceCheckUtils]: 73: Hoare triple {8956#false} assume true; {8956#false} is VALID [2022-04-08 14:33:14,151 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8956#false} {8956#false} #57#return; {8956#false} is VALID [2022-04-08 14:33:14,151 INFO L272 TraceCheckUtils]: 75: Hoare triple {8956#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8956#false} is VALID [2022-04-08 14:33:14,151 INFO L290 TraceCheckUtils]: 76: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-08 14:33:14,151 INFO L290 TraceCheckUtils]: 77: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-08 14:33:14,151 INFO L290 TraceCheckUtils]: 78: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-08 14:33:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:33:14,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:14,417 INFO L290 TraceCheckUtils]: 78: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-08 14:33:14,417 INFO L290 TraceCheckUtils]: 77: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-08 14:33:14,417 INFO L290 TraceCheckUtils]: 76: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-08 14:33:14,417 INFO L272 TraceCheckUtils]: 75: Hoare triple {8956#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8956#false} is VALID [2022-04-08 14:33:14,417 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8955#true} {8956#false} #57#return; {8956#false} is VALID [2022-04-08 14:33:14,417 INFO L290 TraceCheckUtils]: 73: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:33:14,417 INFO L290 TraceCheckUtils]: 72: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:33:14,418 INFO L290 TraceCheckUtils]: 71: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:33:14,418 INFO L272 TraceCheckUtils]: 70: Hoare triple {8956#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:33:14,418 INFO L290 TraceCheckUtils]: 69: Hoare triple {9230#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {8956#false} is VALID [2022-04-08 14:33:14,418 INFO L290 TraceCheckUtils]: 68: Hoare triple {9234#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9230#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:33:14,418 INFO L290 TraceCheckUtils]: 67: Hoare triple {9234#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {9234#(< ~counter~0 20)} is VALID [2022-04-08 14:33:14,419 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8955#true} {9234#(< ~counter~0 20)} #55#return; {9234#(< ~counter~0 20)} is VALID [2022-04-08 14:33:14,419 INFO L290 TraceCheckUtils]: 65: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:33:14,419 INFO L290 TraceCheckUtils]: 64: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:33:14,419 INFO L290 TraceCheckUtils]: 63: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:33:14,419 INFO L272 TraceCheckUtils]: 62: Hoare triple {9234#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:33:14,419 INFO L290 TraceCheckUtils]: 61: Hoare triple {9234#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {9234#(< ~counter~0 20)} is VALID [2022-04-08 14:33:14,420 INFO L290 TraceCheckUtils]: 60: Hoare triple {9259#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9234#(< ~counter~0 20)} is VALID [2022-04-08 14:33:14,420 INFO L290 TraceCheckUtils]: 59: Hoare triple {9259#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9259#(< ~counter~0 19)} is VALID [2022-04-08 14:33:14,420 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8955#true} {9259#(< ~counter~0 19)} #55#return; {9259#(< ~counter~0 19)} is VALID [2022-04-08 14:33:14,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:33:14,420 INFO L290 TraceCheckUtils]: 56: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:33:14,420 INFO L290 TraceCheckUtils]: 55: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:33:14,421 INFO L272 TraceCheckUtils]: 54: Hoare triple {9259#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:33:14,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {9259#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {9259#(< ~counter~0 19)} is VALID [2022-04-08 14:33:14,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {9284#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9259#(< ~counter~0 19)} is VALID [2022-04-08 14:33:14,421 INFO L290 TraceCheckUtils]: 51: Hoare triple {9284#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {9284#(< ~counter~0 18)} is VALID [2022-04-08 14:33:14,422 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8955#true} {9284#(< ~counter~0 18)} #55#return; {9284#(< ~counter~0 18)} is VALID [2022-04-08 14:33:14,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:33:14,422 INFO L290 TraceCheckUtils]: 48: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:33:14,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:33:14,422 INFO L272 TraceCheckUtils]: 46: Hoare triple {9284#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:33:14,422 INFO L290 TraceCheckUtils]: 45: Hoare triple {9284#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {9284#(< ~counter~0 18)} is VALID [2022-04-08 14:33:14,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {9309#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9284#(< ~counter~0 18)} is VALID [2022-04-08 14:33:14,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {9309#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {9309#(< ~counter~0 17)} is VALID [2022-04-08 14:33:14,423 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8955#true} {9309#(< ~counter~0 17)} #55#return; {9309#(< ~counter~0 17)} is VALID [2022-04-08 14:33:14,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:33:14,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:33:14,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:33:14,424 INFO L272 TraceCheckUtils]: 38: Hoare triple {9309#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:33:14,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {9309#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {9309#(< ~counter~0 17)} is VALID [2022-04-08 14:33:14,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {9334#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9309#(< ~counter~0 17)} is VALID [2022-04-08 14:33:14,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {9334#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {9334#(< ~counter~0 16)} is VALID [2022-04-08 14:33:14,425 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8955#true} {9334#(< ~counter~0 16)} #55#return; {9334#(< ~counter~0 16)} is VALID [2022-04-08 14:33:14,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:33:14,425 INFO L290 TraceCheckUtils]: 32: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:33:14,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:33:14,425 INFO L272 TraceCheckUtils]: 30: Hoare triple {9334#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:33:14,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {9334#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {9334#(< ~counter~0 16)} is VALID [2022-04-08 14:33:14,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {9359#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9334#(< ~counter~0 16)} is VALID [2022-04-08 14:33:14,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {9359#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {9359#(< ~counter~0 15)} is VALID [2022-04-08 14:33:14,426 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8955#true} {9359#(< ~counter~0 15)} #55#return; {9359#(< ~counter~0 15)} is VALID [2022-04-08 14:33:14,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:33:14,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:33:14,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:33:14,426 INFO L272 TraceCheckUtils]: 22: Hoare triple {9359#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:33:14,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {9359#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {9359#(< ~counter~0 15)} is VALID [2022-04-08 14:33:14,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {9384#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9359#(< ~counter~0 15)} is VALID [2022-04-08 14:33:14,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {9384#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {9384#(< ~counter~0 14)} is VALID [2022-04-08 14:33:14,427 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8955#true} {9384#(< ~counter~0 14)} #55#return; {9384#(< ~counter~0 14)} is VALID [2022-04-08 14:33:14,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:33:14,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:33:14,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:33:14,428 INFO L272 TraceCheckUtils]: 14: Hoare triple {9384#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:33:14,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {9384#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {9384#(< ~counter~0 14)} is VALID [2022-04-08 14:33:14,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {9409#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9384#(< ~counter~0 14)} is VALID [2022-04-08 14:33:14,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {9409#(< ~counter~0 13)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9409#(< ~counter~0 13)} is VALID [2022-04-08 14:33:14,429 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8955#true} {9409#(< ~counter~0 13)} #53#return; {9409#(< ~counter~0 13)} is VALID [2022-04-08 14:33:14,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 14:33:14,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 14:33:14,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 14:33:14,429 INFO L272 TraceCheckUtils]: 6: Hoare triple {9409#(< ~counter~0 13)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8955#true} is VALID [2022-04-08 14:33:14,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {9409#(< ~counter~0 13)} 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; {9409#(< ~counter~0 13)} is VALID [2022-04-08 14:33:14,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {9409#(< ~counter~0 13)} call #t~ret6 := main(); {9409#(< ~counter~0 13)} is VALID [2022-04-08 14:33:14,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9409#(< ~counter~0 13)} {8955#true} #61#return; {9409#(< ~counter~0 13)} is VALID [2022-04-08 14:33:14,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {9409#(< ~counter~0 13)} assume true; {9409#(< ~counter~0 13)} is VALID [2022-04-08 14:33:14,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#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);~counter~0 := 0; {9409#(< ~counter~0 13)} is VALID [2022-04-08 14:33:14,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-08 14:33:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 16 proven. 98 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 14:33:14,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:14,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511072689] [2022-04-08 14:33:14,431 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:14,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392852740] [2022-04-08 14:33:14,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392852740] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:33:14,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:33:14,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 14:33:14,432 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:14,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1367360082] [2022-04-08 14:33:14,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1367360082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:14,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:14,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:33:14,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469451786] [2022-04-08 14:33:14,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:14,433 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-08 14:33:14,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:14,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:14,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:14,481 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:33:14,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:14,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:33:14,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 14:33:14,483 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:14,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:14,752 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-04-08 14:33:14,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 14:33:14,753 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-08 14:33:14,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-08 14:33:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-08 14:33:14,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2022-04-08 14:33:14,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:14,823 INFO L225 Difference]: With dead ends: 94 [2022-04-08 14:33:14,823 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 14:33:14,823 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-08 14:33:14,824 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:14,824 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 141 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:33:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 14:33:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-08 14:33:14,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:14,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:33:14,940 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:33:14,940 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:33:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:14,942 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-08 14:33:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 14:33:14,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:14,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:14,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-08 14:33:14,943 INFO L87 Difference]: Start difference. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-08 14:33:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:14,945 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-08 14:33:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 14:33:14,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:14,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:14,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:14,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:33:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-08 14:33:14,947 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2022-04-08 14:33:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:14,947 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-08 14:33:14,947 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:14,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-08 14:33:15,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 14:33:15,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 14:33:15,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:15,154 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:15,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-08 14:33:15,357 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 14:33:15,357 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:15,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:15,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 13 times [2022-04-08 14:33:15,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:15,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [995827859] [2022-04-08 14:33:15,457 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:15,457 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:15,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 14 times [2022-04-08 14:33:15,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:15,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032870651] [2022-04-08 14:33:15,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:15,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:15,467 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:15,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1950439312] [2022-04-08 14:33:15,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:33:15,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:15,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:15,469 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 14:33:15,484 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 14:33:16,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:33:16,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:16,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 14:33:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:16,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:16,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {9986#true} call ULTIMATE.init(); {9986#true} is VALID [2022-04-08 14:33:16,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {9986#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);~counter~0 := 0; {9986#true} is VALID [2022-04-08 14:33:16,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:33:16,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9986#true} {9986#true} #61#return; {9986#true} is VALID [2022-04-08 14:33:16,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {9986#true} call #t~ret6 := main(); {9986#true} is VALID [2022-04-08 14:33:16,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {9986#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; {9986#true} is VALID [2022-04-08 14:33:16,965 INFO L272 TraceCheckUtils]: 6: Hoare triple {9986#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:33:16,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:33:16,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:33:16,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:33:16,966 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9986#true} {9986#true} #53#return; {9986#true} is VALID [2022-04-08 14:33:16,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {9986#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:16,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:16,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:16,967 INFO L272 TraceCheckUtils]: 14: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:33:16,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:33:16,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:33:16,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:33:16,967 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9986#true} {10024#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:16,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {10024#(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 * ~y~0 * ~y~0 + ~x~0; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:33:16,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:33:16,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:33:16,968 INFO L272 TraceCheckUtils]: 22: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:33:16,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:33:16,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:33:16,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:33:16,970 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9986#true} {10049#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:33:16,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {10049#(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 * ~y~0 * ~y~0 + ~x~0; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:33:16,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:33:16,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:33:16,971 INFO L272 TraceCheckUtils]: 30: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:33:16,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:33:16,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:33:16,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:33:16,971 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9986#true} {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:33:16,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {10074#(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 * ~y~0 * ~y~0 + ~x~0; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:33:16,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:33:16,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:33:16,972 INFO L272 TraceCheckUtils]: 38: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:33:16,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:33:16,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:33:16,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:33:16,973 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9986#true} {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:33:16,973 INFO L290 TraceCheckUtils]: 43: Hoare triple {10099#(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 * ~y~0 * ~y~0 + ~x~0; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:33:16,973 INFO L290 TraceCheckUtils]: 44: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:33:16,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:33:16,974 INFO L272 TraceCheckUtils]: 46: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:33:16,974 INFO L290 TraceCheckUtils]: 47: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:33:16,974 INFO L290 TraceCheckUtils]: 48: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:33:16,974 INFO L290 TraceCheckUtils]: 49: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:33:16,974 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9986#true} {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #55#return; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:33:16,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {10124#(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 * ~y~0 * ~y~0 + ~x~0; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:33:16,975 INFO L290 TraceCheckUtils]: 52: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:33:16,975 INFO L290 TraceCheckUtils]: 53: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:33:16,975 INFO L272 TraceCheckUtils]: 54: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:33:16,975 INFO L290 TraceCheckUtils]: 55: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:33:16,975 INFO L290 TraceCheckUtils]: 56: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:33:16,975 INFO L290 TraceCheckUtils]: 57: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:33:16,976 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9986#true} {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #55#return; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:33:16,976 INFO L290 TraceCheckUtils]: 59: Hoare triple {10149#(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 * ~y~0 * ~y~0 + ~x~0; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:33:16,976 INFO L290 TraceCheckUtils]: 60: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:33:16,976 INFO L290 TraceCheckUtils]: 61: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:33:16,977 INFO L272 TraceCheckUtils]: 62: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:33:16,977 INFO L290 TraceCheckUtils]: 63: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:33:16,977 INFO L290 TraceCheckUtils]: 64: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:33:16,977 INFO L290 TraceCheckUtils]: 65: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:33:16,977 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9986#true} {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #55#return; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:33:16,978 INFO L290 TraceCheckUtils]: 67: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:33:16,978 INFO L290 TraceCheckUtils]: 68: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:33:16,978 INFO L290 TraceCheckUtils]: 69: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:33:16,978 INFO L272 TraceCheckUtils]: 70: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:33:16,978 INFO L290 TraceCheckUtils]: 71: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:33:16,979 INFO L290 TraceCheckUtils]: 72: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:33:16,979 INFO L290 TraceCheckUtils]: 73: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:33:16,979 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9986#true} {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #55#return; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:33:16,980 INFO L290 TraceCheckUtils]: 75: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:33:16,980 INFO L272 TraceCheckUtils]: 76: Hoare triple {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 14:33:16,980 INFO L290 TraceCheckUtils]: 77: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 14:33:16,980 INFO L290 TraceCheckUtils]: 78: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 14:33:16,980 INFO L290 TraceCheckUtils]: 79: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 14:33:16,980 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9986#true} {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #57#return; {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:33:16,981 INFO L272 TraceCheckUtils]: 81: Hoare triple {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10243#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:33:16,981 INFO L290 TraceCheckUtils]: 82: Hoare triple {10243#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10247#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:33:16,981 INFO L290 TraceCheckUtils]: 83: Hoare triple {10247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9987#false} is VALID [2022-04-08 14:33:16,981 INFO L290 TraceCheckUtils]: 84: Hoare triple {9987#false} assume !false; {9987#false} is VALID [2022-04-08 14:33:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 14:33:16,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:17,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:17,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032870651] [2022-04-08 14:33:17,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:17,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950439312] [2022-04-08 14:33:17,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950439312] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:33:17,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:33:17,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 14:33:17,208 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:17,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [995827859] [2022-04-08 14:33:17,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [995827859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:17,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:17,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:33:17,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273783040] [2022-04-08 14:33:17,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:17,209 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 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 85 [2022-04-08 14:33:17,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:17,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 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 14:33:17,239 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 14:33:17,239 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:33:17,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:17,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:33:17,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:33:17,240 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 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 14:33:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:17,894 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-08 14:33:17,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 14:33:17,895 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 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 85 [2022-04-08 14:33:17,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 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 14:33:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-08 14:33:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 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 14:33:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-08 14:33:17,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-08 14:33:17,960 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 14:33:17,961 INFO L225 Difference]: With dead ends: 92 [2022-04-08 14:33:17,961 INFO L226 Difference]: Without dead ends: 86 [2022-04-08 14:33:17,963 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 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 14:33:17,963 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:17,963 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 431 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 14:33:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-08 14:33:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-08 14:33:18,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:18,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:33:18,044 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:33:18,044 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:33:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:18,045 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-08 14:33:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 14:33:18,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:18,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:18,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-08 14:33:18,046 INFO L87 Difference]: Start difference. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-08 14:33:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:18,047 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-08 14:33:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 14:33:18,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:18,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:18,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:18,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:33:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-08 14:33:18,049 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 85 [2022-04-08 14:33:18,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:18,049 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-08 14:33:18,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 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 14:33:18,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-08 14:33:18,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 14:33:18,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 14:33:18,284 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:18,285 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:18,296 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 14:33:18,485 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 14:33:18,485 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:18,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:18,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 13 times [2022-04-08 14:33:18,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:18,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [647085823] [2022-04-08 14:33:18,572 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:18,572 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:18,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 14 times [2022-04-08 14:33:18,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:18,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65992923] [2022-04-08 14:33:18,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:18,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:18,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:18,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1877634907] [2022-04-08 14:33:18,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:33:18,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:18,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:18,600 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 14:33:18,601 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 14:33:18,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:33:18,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:18,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 14:33:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:18,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:18,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2022-04-08 14:33:18,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {10845#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);~counter~0 := 0; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:18,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {10853#(<= ~counter~0 0)} assume true; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:18,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10853#(<= ~counter~0 0)} {10845#true} #61#return; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:18,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {10853#(<= ~counter~0 0)} call #t~ret6 := main(); {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:18,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {10853#(<= ~counter~0 0)} 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; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:18,994 INFO L272 TraceCheckUtils]: 6: Hoare triple {10853#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:18,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {10853#(<= ~counter~0 0)} ~cond := #in~cond; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:18,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {10853#(<= ~counter~0 0)} assume !(0 == ~cond); {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:18,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {10853#(<= ~counter~0 0)} assume true; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:18,995 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10853#(<= ~counter~0 0)} {10853#(<= ~counter~0 0)} #53#return; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:18,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {10853#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:18,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {10853#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:18,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {10887#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:18,996 INFO L272 TraceCheckUtils]: 14: Hoare triple {10887#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:18,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {10887#(<= ~counter~0 1)} ~cond := #in~cond; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:18,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {10887#(<= ~counter~0 1)} assume !(0 == ~cond); {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:18,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {10887#(<= ~counter~0 1)} assume true; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:18,997 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10887#(<= ~counter~0 1)} {10887#(<= ~counter~0 1)} #55#return; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:18,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {10887#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:18,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {10887#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:18,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {10912#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:18,998 INFO L272 TraceCheckUtils]: 22: Hoare triple {10912#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:18,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {10912#(<= ~counter~0 2)} ~cond := #in~cond; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:18,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {10912#(<= ~counter~0 2)} assume !(0 == ~cond); {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:18,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {10912#(<= ~counter~0 2)} assume true; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:18,999 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10912#(<= ~counter~0 2)} {10912#(<= ~counter~0 2)} #55#return; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:18,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {10912#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:19,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {10912#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:19,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {10937#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:19,000 INFO L272 TraceCheckUtils]: 30: Hoare triple {10937#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:19,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {10937#(<= ~counter~0 3)} ~cond := #in~cond; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:19,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {10937#(<= ~counter~0 3)} assume !(0 == ~cond); {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:19,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {10937#(<= ~counter~0 3)} assume true; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:19,001 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10937#(<= ~counter~0 3)} {10937#(<= ~counter~0 3)} #55#return; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:19,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {10937#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:19,001 INFO L290 TraceCheckUtils]: 36: Hoare triple {10937#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:19,002 INFO L290 TraceCheckUtils]: 37: Hoare triple {10962#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:19,002 INFO L272 TraceCheckUtils]: 38: Hoare triple {10962#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:19,002 INFO L290 TraceCheckUtils]: 39: Hoare triple {10962#(<= ~counter~0 4)} ~cond := #in~cond; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:19,002 INFO L290 TraceCheckUtils]: 40: Hoare triple {10962#(<= ~counter~0 4)} assume !(0 == ~cond); {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:19,002 INFO L290 TraceCheckUtils]: 41: Hoare triple {10962#(<= ~counter~0 4)} assume true; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:19,003 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10962#(<= ~counter~0 4)} {10962#(<= ~counter~0 4)} #55#return; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:19,003 INFO L290 TraceCheckUtils]: 43: Hoare triple {10962#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:19,003 INFO L290 TraceCheckUtils]: 44: Hoare triple {10962#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:19,003 INFO L290 TraceCheckUtils]: 45: Hoare triple {10987#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:19,004 INFO L272 TraceCheckUtils]: 46: Hoare triple {10987#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:19,004 INFO L290 TraceCheckUtils]: 47: Hoare triple {10987#(<= ~counter~0 5)} ~cond := #in~cond; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:19,004 INFO L290 TraceCheckUtils]: 48: Hoare triple {10987#(<= ~counter~0 5)} assume !(0 == ~cond); {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:19,004 INFO L290 TraceCheckUtils]: 49: Hoare triple {10987#(<= ~counter~0 5)} assume true; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:19,004 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10987#(<= ~counter~0 5)} {10987#(<= ~counter~0 5)} #55#return; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:19,005 INFO L290 TraceCheckUtils]: 51: Hoare triple {10987#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:19,005 INFO L290 TraceCheckUtils]: 52: Hoare triple {10987#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:19,005 INFO L290 TraceCheckUtils]: 53: Hoare triple {11012#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:19,005 INFO L272 TraceCheckUtils]: 54: Hoare triple {11012#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:19,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {11012#(<= ~counter~0 6)} ~cond := #in~cond; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:19,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {11012#(<= ~counter~0 6)} assume !(0 == ~cond); {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:19,006 INFO L290 TraceCheckUtils]: 57: Hoare triple {11012#(<= ~counter~0 6)} assume true; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:19,006 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11012#(<= ~counter~0 6)} {11012#(<= ~counter~0 6)} #55#return; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:19,006 INFO L290 TraceCheckUtils]: 59: Hoare triple {11012#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:19,007 INFO L290 TraceCheckUtils]: 60: Hoare triple {11012#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:19,007 INFO L290 TraceCheckUtils]: 61: Hoare triple {11037#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:19,007 INFO L272 TraceCheckUtils]: 62: Hoare triple {11037#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:19,007 INFO L290 TraceCheckUtils]: 63: Hoare triple {11037#(<= ~counter~0 7)} ~cond := #in~cond; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:19,008 INFO L290 TraceCheckUtils]: 64: Hoare triple {11037#(<= ~counter~0 7)} assume !(0 == ~cond); {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:19,008 INFO L290 TraceCheckUtils]: 65: Hoare triple {11037#(<= ~counter~0 7)} assume true; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:19,008 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11037#(<= ~counter~0 7)} {11037#(<= ~counter~0 7)} #55#return; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:19,008 INFO L290 TraceCheckUtils]: 67: Hoare triple {11037#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:19,009 INFO L290 TraceCheckUtils]: 68: Hoare triple {11037#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:19,009 INFO L290 TraceCheckUtils]: 69: Hoare triple {11062#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:19,009 INFO L272 TraceCheckUtils]: 70: Hoare triple {11062#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:19,009 INFO L290 TraceCheckUtils]: 71: Hoare triple {11062#(<= ~counter~0 8)} ~cond := #in~cond; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:19,009 INFO L290 TraceCheckUtils]: 72: Hoare triple {11062#(<= ~counter~0 8)} assume !(0 == ~cond); {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:19,010 INFO L290 TraceCheckUtils]: 73: Hoare triple {11062#(<= ~counter~0 8)} assume true; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:19,010 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11062#(<= ~counter~0 8)} {11062#(<= ~counter~0 8)} #55#return; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:19,010 INFO L290 TraceCheckUtils]: 75: Hoare triple {11062#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:19,010 INFO L290 TraceCheckUtils]: 76: Hoare triple {11062#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11087#(<= |main_#t~post5| 8)} is VALID [2022-04-08 14:33:19,011 INFO L290 TraceCheckUtils]: 77: Hoare triple {11087#(<= |main_#t~post5| 8)} assume !(#t~post5 < 20);havoc #t~post5; {10846#false} is VALID [2022-04-08 14:33:19,011 INFO L272 TraceCheckUtils]: 78: Hoare triple {10846#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10846#false} is VALID [2022-04-08 14:33:19,011 INFO L290 TraceCheckUtils]: 79: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-08 14:33:19,011 INFO L290 TraceCheckUtils]: 80: Hoare triple {10846#false} assume !(0 == ~cond); {10846#false} is VALID [2022-04-08 14:33:19,011 INFO L290 TraceCheckUtils]: 81: Hoare triple {10846#false} assume true; {10846#false} is VALID [2022-04-08 14:33:19,011 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10846#false} {10846#false} #57#return; {10846#false} is VALID [2022-04-08 14:33:19,011 INFO L272 TraceCheckUtils]: 83: Hoare triple {10846#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10846#false} is VALID [2022-04-08 14:33:19,011 INFO L290 TraceCheckUtils]: 84: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-08 14:33:19,011 INFO L290 TraceCheckUtils]: 85: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2022-04-08 14:33:19,011 INFO L290 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2022-04-08 14:33:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:33:19,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:19,326 INFO L290 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2022-04-08 14:33:19,326 INFO L290 TraceCheckUtils]: 85: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2022-04-08 14:33:19,326 INFO L290 TraceCheckUtils]: 84: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-08 14:33:19,326 INFO L272 TraceCheckUtils]: 83: Hoare triple {10846#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10846#false} is VALID [2022-04-08 14:33:19,326 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10845#true} {10846#false} #57#return; {10846#false} is VALID [2022-04-08 14:33:19,326 INFO L290 TraceCheckUtils]: 81: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:33:19,326 INFO L290 TraceCheckUtils]: 80: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:33:19,326 INFO L290 TraceCheckUtils]: 79: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:33:19,326 INFO L272 TraceCheckUtils]: 78: Hoare triple {10846#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:33:19,326 INFO L290 TraceCheckUtils]: 77: Hoare triple {11145#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {10846#false} is VALID [2022-04-08 14:33:19,327 INFO L290 TraceCheckUtils]: 76: Hoare triple {11149#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11145#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:33:19,327 INFO L290 TraceCheckUtils]: 75: Hoare triple {11149#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {11149#(< ~counter~0 20)} is VALID [2022-04-08 14:33:19,327 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10845#true} {11149#(< ~counter~0 20)} #55#return; {11149#(< ~counter~0 20)} is VALID [2022-04-08 14:33:19,327 INFO L290 TraceCheckUtils]: 73: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:33:19,327 INFO L290 TraceCheckUtils]: 72: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:33:19,327 INFO L290 TraceCheckUtils]: 71: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:33:19,328 INFO L272 TraceCheckUtils]: 70: Hoare triple {11149#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:33:19,328 INFO L290 TraceCheckUtils]: 69: Hoare triple {11149#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {11149#(< ~counter~0 20)} is VALID [2022-04-08 14:33:19,328 INFO L290 TraceCheckUtils]: 68: Hoare triple {11174#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11149#(< ~counter~0 20)} is VALID [2022-04-08 14:33:19,329 INFO L290 TraceCheckUtils]: 67: Hoare triple {11174#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11174#(< ~counter~0 19)} is VALID [2022-04-08 14:33:19,329 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10845#true} {11174#(< ~counter~0 19)} #55#return; {11174#(< ~counter~0 19)} is VALID [2022-04-08 14:33:19,329 INFO L290 TraceCheckUtils]: 65: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:33:19,329 INFO L290 TraceCheckUtils]: 64: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:33:19,329 INFO L290 TraceCheckUtils]: 63: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:33:19,329 INFO L272 TraceCheckUtils]: 62: Hoare triple {11174#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:33:19,329 INFO L290 TraceCheckUtils]: 61: Hoare triple {11174#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {11174#(< ~counter~0 19)} is VALID [2022-04-08 14:33:19,330 INFO L290 TraceCheckUtils]: 60: Hoare triple {11199#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11174#(< ~counter~0 19)} is VALID [2022-04-08 14:33:19,330 INFO L290 TraceCheckUtils]: 59: Hoare triple {11199#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {11199#(< ~counter~0 18)} is VALID [2022-04-08 14:33:19,330 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10845#true} {11199#(< ~counter~0 18)} #55#return; {11199#(< ~counter~0 18)} is VALID [2022-04-08 14:33:19,330 INFO L290 TraceCheckUtils]: 57: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:33:19,330 INFO L290 TraceCheckUtils]: 56: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:33:19,330 INFO L290 TraceCheckUtils]: 55: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:33:19,330 INFO L272 TraceCheckUtils]: 54: Hoare triple {11199#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:33:19,331 INFO L290 TraceCheckUtils]: 53: Hoare triple {11199#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {11199#(< ~counter~0 18)} is VALID [2022-04-08 14:33:19,331 INFO L290 TraceCheckUtils]: 52: Hoare triple {11224#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11199#(< ~counter~0 18)} is VALID [2022-04-08 14:33:19,331 INFO L290 TraceCheckUtils]: 51: Hoare triple {11224#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {11224#(< ~counter~0 17)} is VALID [2022-04-08 14:33:19,331 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10845#true} {11224#(< ~counter~0 17)} #55#return; {11224#(< ~counter~0 17)} is VALID [2022-04-08 14:33:19,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:33:19,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:33:19,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:33:19,332 INFO L272 TraceCheckUtils]: 46: Hoare triple {11224#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:33:19,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {11224#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {11224#(< ~counter~0 17)} is VALID [2022-04-08 14:33:19,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {11249#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11224#(< ~counter~0 17)} is VALID [2022-04-08 14:33:19,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {11249#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {11249#(< ~counter~0 16)} is VALID [2022-04-08 14:33:19,333 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10845#true} {11249#(< ~counter~0 16)} #55#return; {11249#(< ~counter~0 16)} is VALID [2022-04-08 14:33:19,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:33:19,333 INFO L290 TraceCheckUtils]: 40: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:33:19,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:33:19,333 INFO L272 TraceCheckUtils]: 38: Hoare triple {11249#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:33:19,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {11249#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {11249#(< ~counter~0 16)} is VALID [2022-04-08 14:33:19,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {11274#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11249#(< ~counter~0 16)} is VALID [2022-04-08 14:33:19,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {11274#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {11274#(< ~counter~0 15)} is VALID [2022-04-08 14:33:19,334 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10845#true} {11274#(< ~counter~0 15)} #55#return; {11274#(< ~counter~0 15)} is VALID [2022-04-08 14:33:19,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:33:19,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:33:19,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:33:19,334 INFO L272 TraceCheckUtils]: 30: Hoare triple {11274#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:33:19,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {11274#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {11274#(< ~counter~0 15)} is VALID [2022-04-08 14:33:19,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {11299#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11274#(< ~counter~0 15)} is VALID [2022-04-08 14:33:19,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {11299#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {11299#(< ~counter~0 14)} is VALID [2022-04-08 14:33:19,335 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10845#true} {11299#(< ~counter~0 14)} #55#return; {11299#(< ~counter~0 14)} is VALID [2022-04-08 14:33:19,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:33:19,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:33:19,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:33:19,336 INFO L272 TraceCheckUtils]: 22: Hoare triple {11299#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:33:19,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {11299#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {11299#(< ~counter~0 14)} is VALID [2022-04-08 14:33:19,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {11324#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11299#(< ~counter~0 14)} is VALID [2022-04-08 14:33:19,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {11324#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {11324#(< ~counter~0 13)} is VALID [2022-04-08 14:33:19,337 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10845#true} {11324#(< ~counter~0 13)} #55#return; {11324#(< ~counter~0 13)} is VALID [2022-04-08 14:33:19,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:33:19,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:33:19,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:33:19,337 INFO L272 TraceCheckUtils]: 14: Hoare triple {11324#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:33:19,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {11324#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {11324#(< ~counter~0 13)} is VALID [2022-04-08 14:33:19,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {11349#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11324#(< ~counter~0 13)} is VALID [2022-04-08 14:33:19,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {11349#(< ~counter~0 12)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11349#(< ~counter~0 12)} is VALID [2022-04-08 14:33:19,338 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10845#true} {11349#(< ~counter~0 12)} #53#return; {11349#(< ~counter~0 12)} is VALID [2022-04-08 14:33:19,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 14:33:19,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 14:33:19,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 14:33:19,338 INFO L272 TraceCheckUtils]: 6: Hoare triple {11349#(< ~counter~0 12)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10845#true} is VALID [2022-04-08 14:33:19,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {11349#(< ~counter~0 12)} 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; {11349#(< ~counter~0 12)} is VALID [2022-04-08 14:33:19,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {11349#(< ~counter~0 12)} call #t~ret6 := main(); {11349#(< ~counter~0 12)} is VALID [2022-04-08 14:33:19,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11349#(< ~counter~0 12)} {10845#true} #61#return; {11349#(< ~counter~0 12)} is VALID [2022-04-08 14:33:19,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {11349#(< ~counter~0 12)} assume true; {11349#(< ~counter~0 12)} is VALID [2022-04-08 14:33:19,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {10845#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);~counter~0 := 0; {11349#(< ~counter~0 12)} is VALID [2022-04-08 14:33:19,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2022-04-08 14:33:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 18 proven. 128 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 14:33:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:19,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65992923] [2022-04-08 14:33:19,340 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:19,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877634907] [2022-04-08 14:33:19,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877634907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:33:19,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:33:19,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 14:33:19,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:19,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [647085823] [2022-04-08 14:33:19,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [647085823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:19,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:19,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:33:19,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116929393] [2022-04-08 14:33:19,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:19,341 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-08 14:33:19,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:19,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:33:19,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:19,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:33:19,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:19,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:33:19,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 14:33:19,381 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:33:19,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:19,632 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-04-08 14:33:19,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 14:33:19,632 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-08 14:33:19,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:19,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:33:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-08 14:33:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:33:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-08 14:33:19,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-08 14:33:19,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:19,729 INFO L225 Difference]: With dead ends: 102 [2022-04-08 14:33:19,729 INFO L226 Difference]: Without dead ends: 92 [2022-04-08 14:33:19,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=363, Invalid=507, Unknown=0, NotChecked=0, Total=870 [2022-04-08 14:33:19,730 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:19,730 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 129 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:33:19,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-08 14:33:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-08 14:33:19,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:19,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:33:19,860 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:33:19,860 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:33:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:19,861 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-08 14:33:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 14:33:19,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:19,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:19,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 92 states. [2022-04-08 14:33:19,862 INFO L87 Difference]: Start difference. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 92 states. [2022-04-08 14:33:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:19,863 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-08 14:33:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 14:33:19,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:19,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:19,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:19,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:33:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-08 14:33:19,865 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-08 14:33:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:19,866 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-08 14:33:19,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:33:19,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-08 14:33:20,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:20,027 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 14:33:20,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-08 14:33:20,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:20,028 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:20,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 14:33:20,228 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 14:33:20,229 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:20,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:20,229 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 15 times [2022-04-08 14:33:20,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:20,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [371230480] [2022-04-08 14:33:20,320 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:20,320 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:20,320 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 16 times [2022-04-08 14:33:20,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:20,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518893130] [2022-04-08 14:33:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:20,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:20,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:20,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531886199] [2022-04-08 14:33:20,330 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:33:20,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:20,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:20,331 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 14:33:20,333 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 14:33:20,392 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:33:20,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:20,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 14:33:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:20,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:20,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {11976#true} call ULTIMATE.init(); {11976#true} is VALID [2022-04-08 14:33:20,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {11976#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);~counter~0 := 0; {11976#true} is VALID [2022-04-08 14:33:20,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:33:20,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11976#true} {11976#true} #61#return; {11976#true} is VALID [2022-04-08 14:33:20,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {11976#true} call #t~ret6 := main(); {11976#true} is VALID [2022-04-08 14:33:20,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {11976#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; {11976#true} is VALID [2022-04-08 14:33:20,766 INFO L272 TraceCheckUtils]: 6: Hoare triple {11976#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:33:20,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:33:20,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:33:20,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:33:20,767 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11976#true} {11976#true} #53#return; {11976#true} is VALID [2022-04-08 14:33:20,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {11976#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:20,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:20,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:20,777 INFO L272 TraceCheckUtils]: 14: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:33:20,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:33:20,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:33:20,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:33:20,777 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11976#true} {12014#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:20,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {12014#(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 * ~y~0 * ~y~0 + ~x~0; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:20,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:20,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:20,778 INFO L272 TraceCheckUtils]: 22: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:33:20,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:33:20,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:33:20,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:33:20,779 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11976#true} {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:20,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {12039#(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 * ~y~0 * ~y~0 + ~x~0; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:33:20,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:33:20,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:33:20,780 INFO L272 TraceCheckUtils]: 30: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:33:20,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:33:20,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:33:20,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:33:20,780 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11976#true} {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #55#return; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:33:20,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {12064#(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 * ~y~0 * ~y~0 + ~x~0; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:33:20,781 INFO L290 TraceCheckUtils]: 36: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:33:20,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:33:20,781 INFO L272 TraceCheckUtils]: 38: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:33:20,781 INFO L290 TraceCheckUtils]: 39: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:33:20,781 INFO L290 TraceCheckUtils]: 40: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:33:20,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:33:20,782 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11976#true} {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:33:20,782 INFO L290 TraceCheckUtils]: 43: Hoare triple {12089#(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 * ~y~0 * ~y~0 + ~x~0; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:33:20,783 INFO L290 TraceCheckUtils]: 44: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:33:20,783 INFO L290 TraceCheckUtils]: 45: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:33:20,783 INFO L272 TraceCheckUtils]: 46: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:33:20,783 INFO L290 TraceCheckUtils]: 47: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:33:20,783 INFO L290 TraceCheckUtils]: 48: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:33:20,783 INFO L290 TraceCheckUtils]: 49: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:33:20,783 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11976#true} {12114#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:33:20,784 INFO L290 TraceCheckUtils]: 51: Hoare triple {12114#(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 * ~y~0 * ~y~0 + ~x~0; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:20,784 INFO L290 TraceCheckUtils]: 52: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:20,784 INFO L290 TraceCheckUtils]: 53: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:20,784 INFO L272 TraceCheckUtils]: 54: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:33:20,784 INFO L290 TraceCheckUtils]: 55: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:33:20,785 INFO L290 TraceCheckUtils]: 56: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:33:20,785 INFO L290 TraceCheckUtils]: 57: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:33:20,785 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11976#true} {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:33:20,785 INFO L290 TraceCheckUtils]: 59: Hoare triple {12139#(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 * ~y~0 * ~y~0 + ~x~0; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:33:20,785 INFO L290 TraceCheckUtils]: 60: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:33:20,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:33:20,786 INFO L272 TraceCheckUtils]: 62: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:33:20,786 INFO L290 TraceCheckUtils]: 63: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:33:20,786 INFO L290 TraceCheckUtils]: 64: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:33:20,786 INFO L290 TraceCheckUtils]: 65: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:33:20,786 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11976#true} {12164#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:33:20,786 INFO L290 TraceCheckUtils]: 67: Hoare triple {12164#(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 * ~y~0 * ~y~0 + ~x~0; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:20,787 INFO L290 TraceCheckUtils]: 68: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:20,787 INFO L290 TraceCheckUtils]: 69: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:20,787 INFO L272 TraceCheckUtils]: 70: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:33:20,787 INFO L290 TraceCheckUtils]: 71: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:33:20,787 INFO L290 TraceCheckUtils]: 72: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:33:20,787 INFO L290 TraceCheckUtils]: 73: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:33:20,788 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11976#true} {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:20,788 INFO L290 TraceCheckUtils]: 75: Hoare triple {12189#(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 * ~y~0 * ~y~0 + ~x~0; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:33:20,788 INFO L290 TraceCheckUtils]: 76: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:33:20,788 INFO L290 TraceCheckUtils]: 77: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:33:20,788 INFO L272 TraceCheckUtils]: 78: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:33:20,789 INFO L290 TraceCheckUtils]: 79: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:33:20,789 INFO L290 TraceCheckUtils]: 80: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:33:20,789 INFO L290 TraceCheckUtils]: 81: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:33:20,789 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11976#true} {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #55#return; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:33:20,789 INFO L290 TraceCheckUtils]: 83: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 14:33:20,789 INFO L272 TraceCheckUtils]: 84: Hoare triple {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 14:33:20,790 INFO L290 TraceCheckUtils]: 85: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 14:33:20,790 INFO L290 TraceCheckUtils]: 86: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 14:33:20,790 INFO L290 TraceCheckUtils]: 87: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 14:33:20,790 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11976#true} {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #57#return; {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 14:33:20,790 INFO L272 TraceCheckUtils]: 89: Hoare triple {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12258#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:33:20,791 INFO L290 TraceCheckUtils]: 90: Hoare triple {12258#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:33:20,791 INFO L290 TraceCheckUtils]: 91: Hoare triple {12262#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11977#false} is VALID [2022-04-08 14:33:20,792 INFO L290 TraceCheckUtils]: 92: Hoare triple {11977#false} assume !false; {11977#false} is VALID [2022-04-08 14:33:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 14:33:20,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:21,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:21,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518893130] [2022-04-08 14:33:21,012 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:21,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531886199] [2022-04-08 14:33:21,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531886199] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:33:21,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:33:21,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 14:33:21,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:21,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [371230480] [2022-04-08 14:33:21,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [371230480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:21,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:21,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 14:33:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244350797] [2022-04-08 14:33:21,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:21,013 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 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 93 [2022-04-08 14:33:21,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:21,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 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 14:33:21,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:21,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 14:33:21,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:21,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 14:33:21,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:33:21,054 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 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 14:33:22,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:22,104 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-08 14:33:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:33:22,104 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 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 93 [2022-04-08 14:33:22,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 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 14:33:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-08 14:33:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 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 14:33:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-08 14:33:22,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-08 14:33:22,170 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 14:33:22,171 INFO L225 Difference]: With dead ends: 100 [2022-04-08 14:33:22,171 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 14:33:22,171 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:33:22,172 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:22,172 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 491 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 14:33:22,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 14:33:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-08 14:33:22,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:22,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:33:22,260 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:33:22,260 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:33:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:22,262 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-08 14:33:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 14:33:22,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:22,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:22,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-08 14:33:22,262 INFO L87 Difference]: Start difference. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-08 14:33:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:22,263 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-08 14:33:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 14:33:22,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:22,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:22,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:22,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:33:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-08 14:33:22,265 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-04-08 14:33:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:22,265 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-08 14:33:22,265 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 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 14:33:22,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-08 14:33:22,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 14:33:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-08 14:33:22,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:22,658 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:22,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-08 14:33:22,877 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 14:33:22,878 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:22,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 15 times [2022-04-08 14:33:22,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:22,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [136222864] [2022-04-08 14:33:22,969 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:22,969 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:22,969 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 16 times [2022-04-08 14:33:22,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:22,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940153052] [2022-04-08 14:33:22,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:22,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:22,982 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:22,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1601234860] [2022-04-08 14:33:22,982 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:33:22,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:22,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:22,983 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 14:33:22,984 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 14:33:23,053 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:33:23,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:23,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 14:33:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:23,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:23,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-08 14:33:23,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {12908#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);~counter~0 := 0; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:23,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {12916#(<= ~counter~0 0)} assume true; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:23,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12916#(<= ~counter~0 0)} {12908#true} #61#return; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:23,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {12916#(<= ~counter~0 0)} call #t~ret6 := main(); {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:23,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {12916#(<= ~counter~0 0)} 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; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:23,433 INFO L272 TraceCheckUtils]: 6: Hoare triple {12916#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:23,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {12916#(<= ~counter~0 0)} ~cond := #in~cond; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:23,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {12916#(<= ~counter~0 0)} assume !(0 == ~cond); {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:23,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {12916#(<= ~counter~0 0)} assume true; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:23,434 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12916#(<= ~counter~0 0)} {12916#(<= ~counter~0 0)} #53#return; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:23,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {12916#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:23,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {12916#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:23,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {12950#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:23,435 INFO L272 TraceCheckUtils]: 14: Hoare triple {12950#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:23,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {12950#(<= ~counter~0 1)} ~cond := #in~cond; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:23,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {12950#(<= ~counter~0 1)} assume !(0 == ~cond); {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:23,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {12950#(<= ~counter~0 1)} assume true; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:23,436 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12950#(<= ~counter~0 1)} {12950#(<= ~counter~0 1)} #55#return; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:23,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {12950#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:23,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {12950#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:23,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {12975#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:23,437 INFO L272 TraceCheckUtils]: 22: Hoare triple {12975#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:23,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {12975#(<= ~counter~0 2)} ~cond := #in~cond; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:23,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {12975#(<= ~counter~0 2)} assume !(0 == ~cond); {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:23,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {12975#(<= ~counter~0 2)} assume true; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:23,438 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12975#(<= ~counter~0 2)} {12975#(<= ~counter~0 2)} #55#return; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:23,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {12975#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:23,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {12975#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:23,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {13000#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:23,439 INFO L272 TraceCheckUtils]: 30: Hoare triple {13000#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:23,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {13000#(<= ~counter~0 3)} ~cond := #in~cond; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:23,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {13000#(<= ~counter~0 3)} assume !(0 == ~cond); {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:23,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {13000#(<= ~counter~0 3)} assume true; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:23,440 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13000#(<= ~counter~0 3)} {13000#(<= ~counter~0 3)} #55#return; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:23,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {13000#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:23,440 INFO L290 TraceCheckUtils]: 36: Hoare triple {13000#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:23,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {13025#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:23,441 INFO L272 TraceCheckUtils]: 38: Hoare triple {13025#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:23,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {13025#(<= ~counter~0 4)} ~cond := #in~cond; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:23,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {13025#(<= ~counter~0 4)} assume !(0 == ~cond); {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:23,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {13025#(<= ~counter~0 4)} assume true; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:23,441 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13025#(<= ~counter~0 4)} {13025#(<= ~counter~0 4)} #55#return; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:23,442 INFO L290 TraceCheckUtils]: 43: Hoare triple {13025#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:23,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {13025#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:23,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {13050#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:23,442 INFO L272 TraceCheckUtils]: 46: Hoare triple {13050#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:23,443 INFO L290 TraceCheckUtils]: 47: Hoare triple {13050#(<= ~counter~0 5)} ~cond := #in~cond; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:23,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {13050#(<= ~counter~0 5)} assume !(0 == ~cond); {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:23,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {13050#(<= ~counter~0 5)} assume true; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:23,443 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13050#(<= ~counter~0 5)} {13050#(<= ~counter~0 5)} #55#return; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:23,443 INFO L290 TraceCheckUtils]: 51: Hoare triple {13050#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:23,444 INFO L290 TraceCheckUtils]: 52: Hoare triple {13050#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:23,444 INFO L290 TraceCheckUtils]: 53: Hoare triple {13075#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:23,444 INFO L272 TraceCheckUtils]: 54: Hoare triple {13075#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:23,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {13075#(<= ~counter~0 6)} ~cond := #in~cond; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:23,445 INFO L290 TraceCheckUtils]: 56: Hoare triple {13075#(<= ~counter~0 6)} assume !(0 == ~cond); {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:23,445 INFO L290 TraceCheckUtils]: 57: Hoare triple {13075#(<= ~counter~0 6)} assume true; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:23,445 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13075#(<= ~counter~0 6)} {13075#(<= ~counter~0 6)} #55#return; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:23,445 INFO L290 TraceCheckUtils]: 59: Hoare triple {13075#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:23,446 INFO L290 TraceCheckUtils]: 60: Hoare triple {13075#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:23,446 INFO L290 TraceCheckUtils]: 61: Hoare triple {13100#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:23,446 INFO L272 TraceCheckUtils]: 62: Hoare triple {13100#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:23,446 INFO L290 TraceCheckUtils]: 63: Hoare triple {13100#(<= ~counter~0 7)} ~cond := #in~cond; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:23,446 INFO L290 TraceCheckUtils]: 64: Hoare triple {13100#(<= ~counter~0 7)} assume !(0 == ~cond); {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:23,447 INFO L290 TraceCheckUtils]: 65: Hoare triple {13100#(<= ~counter~0 7)} assume true; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:23,447 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13100#(<= ~counter~0 7)} {13100#(<= ~counter~0 7)} #55#return; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:23,447 INFO L290 TraceCheckUtils]: 67: Hoare triple {13100#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 14:33:23,447 INFO L290 TraceCheckUtils]: 68: Hoare triple {13100#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:23,448 INFO L290 TraceCheckUtils]: 69: Hoare triple {13125#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:23,448 INFO L272 TraceCheckUtils]: 70: Hoare triple {13125#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:23,448 INFO L290 TraceCheckUtils]: 71: Hoare triple {13125#(<= ~counter~0 8)} ~cond := #in~cond; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:23,448 INFO L290 TraceCheckUtils]: 72: Hoare triple {13125#(<= ~counter~0 8)} assume !(0 == ~cond); {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:23,448 INFO L290 TraceCheckUtils]: 73: Hoare triple {13125#(<= ~counter~0 8)} assume true; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:23,449 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13125#(<= ~counter~0 8)} {13125#(<= ~counter~0 8)} #55#return; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:23,449 INFO L290 TraceCheckUtils]: 75: Hoare triple {13125#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 14:33:23,449 INFO L290 TraceCheckUtils]: 76: Hoare triple {13125#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:23,450 INFO L290 TraceCheckUtils]: 77: Hoare triple {13150#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:23,450 INFO L272 TraceCheckUtils]: 78: Hoare triple {13150#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:23,450 INFO L290 TraceCheckUtils]: 79: Hoare triple {13150#(<= ~counter~0 9)} ~cond := #in~cond; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:23,450 INFO L290 TraceCheckUtils]: 80: Hoare triple {13150#(<= ~counter~0 9)} assume !(0 == ~cond); {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:23,450 INFO L290 TraceCheckUtils]: 81: Hoare triple {13150#(<= ~counter~0 9)} assume true; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:23,451 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13150#(<= ~counter~0 9)} {13150#(<= ~counter~0 9)} #55#return; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:23,451 INFO L290 TraceCheckUtils]: 83: Hoare triple {13150#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 14:33:23,451 INFO L290 TraceCheckUtils]: 84: Hoare triple {13150#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13175#(<= |main_#t~post5| 9)} is VALID [2022-04-08 14:33:23,451 INFO L290 TraceCheckUtils]: 85: Hoare triple {13175#(<= |main_#t~post5| 9)} assume !(#t~post5 < 20);havoc #t~post5; {12909#false} is VALID [2022-04-08 14:33:23,451 INFO L272 TraceCheckUtils]: 86: Hoare triple {12909#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12909#false} is VALID [2022-04-08 14:33:23,451 INFO L290 TraceCheckUtils]: 87: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-08 14:33:23,452 INFO L290 TraceCheckUtils]: 88: Hoare triple {12909#false} assume !(0 == ~cond); {12909#false} is VALID [2022-04-08 14:33:23,452 INFO L290 TraceCheckUtils]: 89: Hoare triple {12909#false} assume true; {12909#false} is VALID [2022-04-08 14:33:23,452 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12909#false} {12909#false} #57#return; {12909#false} is VALID [2022-04-08 14:33:23,452 INFO L272 TraceCheckUtils]: 91: Hoare triple {12909#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12909#false} is VALID [2022-04-08 14:33:23,452 INFO L290 TraceCheckUtils]: 92: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-08 14:33:23,452 INFO L290 TraceCheckUtils]: 93: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2022-04-08 14:33:23,452 INFO L290 TraceCheckUtils]: 94: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-08 14:33:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:33:23,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:23,767 INFO L290 TraceCheckUtils]: 94: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-08 14:33:23,768 INFO L290 TraceCheckUtils]: 93: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2022-04-08 14:33:23,768 INFO L290 TraceCheckUtils]: 92: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-08 14:33:23,768 INFO L272 TraceCheckUtils]: 91: Hoare triple {12909#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12909#false} is VALID [2022-04-08 14:33:23,768 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12908#true} {12909#false} #57#return; {12909#false} is VALID [2022-04-08 14:33:23,768 INFO L290 TraceCheckUtils]: 89: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:33:23,768 INFO L290 TraceCheckUtils]: 88: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:33:23,768 INFO L290 TraceCheckUtils]: 87: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:33:23,768 INFO L272 TraceCheckUtils]: 86: Hoare triple {12909#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:33:23,768 INFO L290 TraceCheckUtils]: 85: Hoare triple {13233#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {12909#false} is VALID [2022-04-08 14:33:23,769 INFO L290 TraceCheckUtils]: 84: Hoare triple {13237#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13233#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:33:23,769 INFO L290 TraceCheckUtils]: 83: Hoare triple {13237#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {13237#(< ~counter~0 20)} is VALID [2022-04-08 14:33:23,769 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12908#true} {13237#(< ~counter~0 20)} #55#return; {13237#(< ~counter~0 20)} is VALID [2022-04-08 14:33:23,769 INFO L290 TraceCheckUtils]: 81: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:33:23,769 INFO L290 TraceCheckUtils]: 80: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:33:23,769 INFO L290 TraceCheckUtils]: 79: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:33:23,769 INFO L272 TraceCheckUtils]: 78: Hoare triple {13237#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:33:23,770 INFO L290 TraceCheckUtils]: 77: Hoare triple {13237#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {13237#(< ~counter~0 20)} is VALID [2022-04-08 14:33:23,770 INFO L290 TraceCheckUtils]: 76: Hoare triple {13262#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13237#(< ~counter~0 20)} is VALID [2022-04-08 14:33:23,770 INFO L290 TraceCheckUtils]: 75: Hoare triple {13262#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13262#(< ~counter~0 19)} is VALID [2022-04-08 14:33:23,771 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12908#true} {13262#(< ~counter~0 19)} #55#return; {13262#(< ~counter~0 19)} is VALID [2022-04-08 14:33:23,771 INFO L290 TraceCheckUtils]: 73: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:33:23,771 INFO L290 TraceCheckUtils]: 72: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:33:23,771 INFO L290 TraceCheckUtils]: 71: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:33:23,771 INFO L272 TraceCheckUtils]: 70: Hoare triple {13262#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:33:23,771 INFO L290 TraceCheckUtils]: 69: Hoare triple {13262#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {13262#(< ~counter~0 19)} is VALID [2022-04-08 14:33:23,772 INFO L290 TraceCheckUtils]: 68: Hoare triple {13287#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13262#(< ~counter~0 19)} is VALID [2022-04-08 14:33:23,772 INFO L290 TraceCheckUtils]: 67: Hoare triple {13287#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {13287#(< ~counter~0 18)} is VALID [2022-04-08 14:33:23,772 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12908#true} {13287#(< ~counter~0 18)} #55#return; {13287#(< ~counter~0 18)} is VALID [2022-04-08 14:33:23,772 INFO L290 TraceCheckUtils]: 65: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:33:23,772 INFO L290 TraceCheckUtils]: 64: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:33:23,772 INFO L290 TraceCheckUtils]: 63: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:33:23,772 INFO L272 TraceCheckUtils]: 62: Hoare triple {13287#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:33:23,772 INFO L290 TraceCheckUtils]: 61: Hoare triple {13287#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {13287#(< ~counter~0 18)} is VALID [2022-04-08 14:33:23,773 INFO L290 TraceCheckUtils]: 60: Hoare triple {13312#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13287#(< ~counter~0 18)} is VALID [2022-04-08 14:33:23,773 INFO L290 TraceCheckUtils]: 59: Hoare triple {13312#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {13312#(< ~counter~0 17)} is VALID [2022-04-08 14:33:23,773 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12908#true} {13312#(< ~counter~0 17)} #55#return; {13312#(< ~counter~0 17)} is VALID [2022-04-08 14:33:23,773 INFO L290 TraceCheckUtils]: 57: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:33:23,773 INFO L290 TraceCheckUtils]: 56: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:33:23,773 INFO L290 TraceCheckUtils]: 55: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:33:23,774 INFO L272 TraceCheckUtils]: 54: Hoare triple {13312#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:33:23,774 INFO L290 TraceCheckUtils]: 53: Hoare triple {13312#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {13312#(< ~counter~0 17)} is VALID [2022-04-08 14:33:23,774 INFO L290 TraceCheckUtils]: 52: Hoare triple {13337#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13312#(< ~counter~0 17)} is VALID [2022-04-08 14:33:23,774 INFO L290 TraceCheckUtils]: 51: Hoare triple {13337#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {13337#(< ~counter~0 16)} is VALID [2022-04-08 14:33:23,775 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12908#true} {13337#(< ~counter~0 16)} #55#return; {13337#(< ~counter~0 16)} is VALID [2022-04-08 14:33:23,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:33:23,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:33:23,775 INFO L290 TraceCheckUtils]: 47: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:33:23,775 INFO L272 TraceCheckUtils]: 46: Hoare triple {13337#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:33:23,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {13337#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {13337#(< ~counter~0 16)} is VALID [2022-04-08 14:33:23,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {13362#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13337#(< ~counter~0 16)} is VALID [2022-04-08 14:33:23,776 INFO L290 TraceCheckUtils]: 43: Hoare triple {13362#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {13362#(< ~counter~0 15)} is VALID [2022-04-08 14:33:23,776 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12908#true} {13362#(< ~counter~0 15)} #55#return; {13362#(< ~counter~0 15)} is VALID [2022-04-08 14:33:23,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:33:23,776 INFO L290 TraceCheckUtils]: 40: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:33:23,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:33:23,776 INFO L272 TraceCheckUtils]: 38: Hoare triple {13362#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:33:23,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {13362#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {13362#(< ~counter~0 15)} is VALID [2022-04-08 14:33:23,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {13387#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13362#(< ~counter~0 15)} is VALID [2022-04-08 14:33:23,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {13387#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {13387#(< ~counter~0 14)} is VALID [2022-04-08 14:33:23,777 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12908#true} {13387#(< ~counter~0 14)} #55#return; {13387#(< ~counter~0 14)} is VALID [2022-04-08 14:33:23,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:33:23,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:33:23,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:33:23,778 INFO L272 TraceCheckUtils]: 30: Hoare triple {13387#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:33:23,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {13387#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {13387#(< ~counter~0 14)} is VALID [2022-04-08 14:33:23,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {13412#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13387#(< ~counter~0 14)} is VALID [2022-04-08 14:33:23,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {13412#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {13412#(< ~counter~0 13)} is VALID [2022-04-08 14:33:23,779 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12908#true} {13412#(< ~counter~0 13)} #55#return; {13412#(< ~counter~0 13)} is VALID [2022-04-08 14:33:23,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:33:23,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:33:23,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:33:23,779 INFO L272 TraceCheckUtils]: 22: Hoare triple {13412#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:33:23,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {13412#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {13412#(< ~counter~0 13)} is VALID [2022-04-08 14:33:23,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {13437#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13412#(< ~counter~0 13)} is VALID [2022-04-08 14:33:23,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {13437#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {13437#(< ~counter~0 12)} is VALID [2022-04-08 14:33:23,780 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12908#true} {13437#(< ~counter~0 12)} #55#return; {13437#(< ~counter~0 12)} is VALID [2022-04-08 14:33:23,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:33:23,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:33:23,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:33:23,780 INFO L272 TraceCheckUtils]: 14: Hoare triple {13437#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:33:23,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {13437#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {13437#(< ~counter~0 12)} is VALID [2022-04-08 14:33:23,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {13462#(< ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13437#(< ~counter~0 12)} is VALID [2022-04-08 14:33:23,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {13462#(< ~counter~0 11)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13462#(< ~counter~0 11)} is VALID [2022-04-08 14:33:23,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12908#true} {13462#(< ~counter~0 11)} #53#return; {13462#(< ~counter~0 11)} is VALID [2022-04-08 14:33:23,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 14:33:23,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 14:33:23,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 14:33:23,781 INFO L272 TraceCheckUtils]: 6: Hoare triple {13462#(< ~counter~0 11)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12908#true} is VALID [2022-04-08 14:33:23,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {13462#(< ~counter~0 11)} 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; {13462#(< ~counter~0 11)} is VALID [2022-04-08 14:33:23,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {13462#(< ~counter~0 11)} call #t~ret6 := main(); {13462#(< ~counter~0 11)} is VALID [2022-04-08 14:33:23,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13462#(< ~counter~0 11)} {12908#true} #61#return; {13462#(< ~counter~0 11)} is VALID [2022-04-08 14:33:23,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {13462#(< ~counter~0 11)} assume true; {13462#(< ~counter~0 11)} is VALID [2022-04-08 14:33:23,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {12908#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);~counter~0 := 0; {13462#(< ~counter~0 11)} is VALID [2022-04-08 14:33:23,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-08 14:33:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 20 proven. 162 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 14:33:23,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:23,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940153052] [2022-04-08 14:33:23,786 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:23,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601234860] [2022-04-08 14:33:23,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601234860] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:33:23,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:33:23,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 14:33:23,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:23,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [136222864] [2022-04-08 14:33:23,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [136222864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:23,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:23,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:33:23,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869094299] [2022-04-08 14:33:23,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:23,787 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-08 14:33:23,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:23,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:33:23,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:23,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:33:23,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:23,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:33:23,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:33:23,885 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:33:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:24,236 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2022-04-08 14:33:24,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 14:33:24,236 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-08 14:33:24,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:33:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-08 14:33:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:33:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-08 14:33:24,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 110 transitions. [2022-04-08 14:33:24,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:24,320 INFO L225 Difference]: With dead ends: 110 [2022-04-08 14:33:24,320 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 14:33:24,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=613, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 14:33:24,321 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:24,321 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:33:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 14:33:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-08 14:33:24,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:24,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:33:24,460 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:33:24,460 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:33:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:24,461 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-08 14:33:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 14:33:24,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:24,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:24,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-08 14:33:24,465 INFO L87 Difference]: Start difference. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-08 14:33:24,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:24,467 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-08 14:33:24,467 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 14:33:24,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:24,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:24,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:24,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:33:24,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-08 14:33:24,469 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2022-04-08 14:33:24,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:24,469 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-08 14:33:24,469 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:33:24,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 102 transitions. [2022-04-08 14:33:24,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 14:33:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 14:33:24,668 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:24,669 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:24,686 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 14:33:24,871 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 14:33:24,872 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:24,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:24,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 17 times [2022-04-08 14:33:24,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:24,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [297308670] [2022-04-08 14:33:24,962 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:24,962 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:24,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 18 times [2022-04-08 14:33:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:24,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94255811] [2022-04-08 14:33:24,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:24,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:24,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171103981] [2022-04-08 14:33:24,981 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:33:24,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:24,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:24,983 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 14:33:24,984 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 14:34:31,158 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 14:34:31,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:31,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 14:34:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:31,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:31,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {14139#true} call ULTIMATE.init(); {14139#true} is VALID [2022-04-08 14:34:31,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {14139#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);~counter~0 := 0; {14139#true} is VALID [2022-04-08 14:34:31,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:34:31,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14139#true} {14139#true} #61#return; {14139#true} is VALID [2022-04-08 14:34:31,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {14139#true} call #t~ret6 := main(); {14139#true} is VALID [2022-04-08 14:34:31,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {14139#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; {14139#true} is VALID [2022-04-08 14:34:31,846 INFO L272 TraceCheckUtils]: 6: Hoare triple {14139#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:34:31,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:34:31,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:34:31,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:34:31,846 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14139#true} {14139#true} #53#return; {14139#true} is VALID [2022-04-08 14:34:31,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {14139#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:31,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:31,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:31,847 INFO L272 TraceCheckUtils]: 14: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:34:31,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:34:31,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:34:31,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:34:31,848 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14139#true} {14177#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:31,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {14177#(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 * ~y~0 * ~y~0 + ~x~0; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:34:31,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:34:31,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:34:31,849 INFO L272 TraceCheckUtils]: 22: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:34:31,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:34:31,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:34:31,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:34:31,850 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14139#true} {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:34:31,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {14202#(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 * ~y~0 * ~y~0 + ~x~0; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:31,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:31,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:31,851 INFO L272 TraceCheckUtils]: 30: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:34:31,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:34:31,851 INFO L290 TraceCheckUtils]: 32: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:34:31,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:34:31,851 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14139#true} {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #55#return; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:31,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {14227#(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 * ~y~0 * ~y~0 + ~x~0; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 14:34:31,852 INFO L290 TraceCheckUtils]: 36: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 14:34:31,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 14:34:31,853 INFO L272 TraceCheckUtils]: 38: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:34:31,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:34:31,853 INFO L290 TraceCheckUtils]: 40: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:34:31,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:34:31,853 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {14139#true} {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #55#return; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 14:34:31,854 INFO L290 TraceCheckUtils]: 43: Hoare triple {14252#(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 * ~y~0 * ~y~0 + ~x~0; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:34:31,854 INFO L290 TraceCheckUtils]: 44: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:34:31,854 INFO L290 TraceCheckUtils]: 45: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:34:31,854 INFO L272 TraceCheckUtils]: 46: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:34:31,855 INFO L290 TraceCheckUtils]: 47: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:34:31,855 INFO L290 TraceCheckUtils]: 48: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:34:31,855 INFO L290 TraceCheckUtils]: 49: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:34:31,855 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14139#true} {14277#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:34:31,856 INFO L290 TraceCheckUtils]: 51: Hoare triple {14277#(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 * ~y~0 * ~y~0 + ~x~0; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:31,856 INFO L290 TraceCheckUtils]: 52: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:31,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:31,856 INFO L272 TraceCheckUtils]: 54: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:34:31,856 INFO L290 TraceCheckUtils]: 55: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:34:31,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:34:31,857 INFO L290 TraceCheckUtils]: 57: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:34:31,857 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {14139#true} {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:31,857 INFO L290 TraceCheckUtils]: 59: Hoare triple {14302#(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 * ~y~0 * ~y~0 + ~x~0; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:31,858 INFO L290 TraceCheckUtils]: 60: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:31,858 INFO L290 TraceCheckUtils]: 61: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:31,858 INFO L272 TraceCheckUtils]: 62: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:34:31,858 INFO L290 TraceCheckUtils]: 63: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:34:31,858 INFO L290 TraceCheckUtils]: 64: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:34:31,858 INFO L290 TraceCheckUtils]: 65: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:34:31,859 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14139#true} {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #55#return; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:31,859 INFO L290 TraceCheckUtils]: 67: Hoare triple {14327#(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 * ~y~0 * ~y~0 + ~x~0; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:31,860 INFO L290 TraceCheckUtils]: 68: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:31,860 INFO L290 TraceCheckUtils]: 69: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:31,860 INFO L272 TraceCheckUtils]: 70: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:34:31,860 INFO L290 TraceCheckUtils]: 71: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:34:31,860 INFO L290 TraceCheckUtils]: 72: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:34:31,860 INFO L290 TraceCheckUtils]: 73: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:34:31,861 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14139#true} {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #55#return; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:31,861 INFO L290 TraceCheckUtils]: 75: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:34:31,861 INFO L290 TraceCheckUtils]: 76: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:34:31,862 INFO L290 TraceCheckUtils]: 77: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:34:31,862 INFO L272 TraceCheckUtils]: 78: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:34:31,862 INFO L290 TraceCheckUtils]: 79: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:34:31,862 INFO L290 TraceCheckUtils]: 80: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:34:31,862 INFO L290 TraceCheckUtils]: 81: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:34:31,863 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {14139#true} {14377#(and (= main_~y~0 8) (= main_~c~0 8))} #55#return; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:34:31,863 INFO L290 TraceCheckUtils]: 83: Hoare triple {14377#(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 * ~y~0 * ~y~0 + ~x~0; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 14:34:31,863 INFO L290 TraceCheckUtils]: 84: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 14:34:31,864 INFO L290 TraceCheckUtils]: 85: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 14:34:31,864 INFO L272 TraceCheckUtils]: 86: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:34:31,864 INFO L290 TraceCheckUtils]: 87: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:34:31,864 INFO L290 TraceCheckUtils]: 88: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:34:31,864 INFO L290 TraceCheckUtils]: 89: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:34:31,865 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {14139#true} {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} #55#return; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 14:34:31,865 INFO L290 TraceCheckUtils]: 91: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 14:34:31,866 INFO L272 TraceCheckUtils]: 92: Hoare triple {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 14:34:31,866 INFO L290 TraceCheckUtils]: 93: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 14:34:31,866 INFO L290 TraceCheckUtils]: 94: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 14:34:31,866 INFO L290 TraceCheckUtils]: 95: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 14:34:31,866 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {14139#true} {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} #57#return; {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 14:34:31,867 INFO L272 TraceCheckUtils]: 97: Hoare triple {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {14446#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:34:31,867 INFO L290 TraceCheckUtils]: 98: Hoare triple {14446#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14450#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:34:31,867 INFO L290 TraceCheckUtils]: 99: Hoare triple {14450#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14140#false} is VALID [2022-04-08 14:34:31,867 INFO L290 TraceCheckUtils]: 100: Hoare triple {14140#false} assume !false; {14140#false} is VALID [2022-04-08 14:34:31,868 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 22 proven. 180 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 14:34:31,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:32,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:32,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94255811] [2022-04-08 14:34:32,080 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:32,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171103981] [2022-04-08 14:34:32,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171103981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:34:32,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:34:32,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 14:34:32,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:32,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [297308670] [2022-04-08 14:34:32,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [297308670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:32,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:32,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 14:34:32,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959331610] [2022-04-08 14:34:32,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:32,081 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 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 101 [2022-04-08 14:34:32,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:32,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 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 14:34:32,142 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 14:34:32,143 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 14:34:32,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:32,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 14:34:32,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:34:32,143 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 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 14:34:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:33,290 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-08 14:34:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 14:34:33,290 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 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 101 [2022-04-08 14:34:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 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 14:34:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-08 14:34:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 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 14:34:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-08 14:34:33,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2022-04-08 14:34:33,358 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 14:34:33,359 INFO L225 Difference]: With dead ends: 108 [2022-04-08 14:34:33,359 INFO L226 Difference]: Without dead ends: 102 [2022-04-08 14:34:33,359 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 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 14:34:33,360 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:33,360 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 557 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 14:34:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-08 14:34:33,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-08 14:34:33,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:33,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:34:33,482 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:34:33,483 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:34:33,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:33,484 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-08 14:34:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-08 14:34:33,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:33,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:33,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 102 states. [2022-04-08 14:34:33,484 INFO L87 Difference]: Start difference. First operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 102 states. [2022-04-08 14:34:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:33,486 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-08 14:34:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-08 14:34:33,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:33,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:33,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:33,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:33,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:34:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-08 14:34:33,487 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 101 [2022-04-08 14:34:33,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:33,487 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-08 14:34:33,488 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 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 14:34:33,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-08 14:34:33,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-08 14:34:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-08 14:34:33,734 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:33,734 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:33,775 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 14:34:33,935 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 14:34:33,935 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:33,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:33,935 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 17 times [2022-04-08 14:34:33,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:33,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1202131754] [2022-04-08 14:34:34,022 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:34,023 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:34,023 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 18 times [2022-04-08 14:34:34,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:34,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946424067] [2022-04-08 14:34:34,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:34,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:34,036 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:34,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2126608863] [2022-04-08 14:34:34,036 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:34:34,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:34,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:34,037 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 14:34:34,038 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 14:34:34,689 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-08 14:34:34,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:34,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 14:34:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:34,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:35,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {15144#true} call ULTIMATE.init(); {15144#true} is VALID [2022-04-08 14:34:35,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {15144#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);~counter~0 := 0; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:35,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {15152#(<= ~counter~0 0)} assume true; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:35,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15152#(<= ~counter~0 0)} {15144#true} #61#return; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:35,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {15152#(<= ~counter~0 0)} call #t~ret6 := main(); {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:35,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {15152#(<= ~counter~0 0)} 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; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:35,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {15152#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:35,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {15152#(<= ~counter~0 0)} ~cond := #in~cond; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:35,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {15152#(<= ~counter~0 0)} assume !(0 == ~cond); {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:35,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {15152#(<= ~counter~0 0)} assume true; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:35,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15152#(<= ~counter~0 0)} {15152#(<= ~counter~0 0)} #53#return; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:35,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {15152#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:35,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {15152#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:35,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {15186#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:35,232 INFO L272 TraceCheckUtils]: 14: Hoare triple {15186#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:35,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {15186#(<= ~counter~0 1)} ~cond := #in~cond; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:35,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {15186#(<= ~counter~0 1)} assume !(0 == ~cond); {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:35,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {15186#(<= ~counter~0 1)} assume true; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:35,233 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15186#(<= ~counter~0 1)} {15186#(<= ~counter~0 1)} #55#return; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:35,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {15186#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:35,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {15186#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:35,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {15211#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:35,234 INFO L272 TraceCheckUtils]: 22: Hoare triple {15211#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:35,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {15211#(<= ~counter~0 2)} ~cond := #in~cond; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:35,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {15211#(<= ~counter~0 2)} assume !(0 == ~cond); {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:35,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {15211#(<= ~counter~0 2)} assume true; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:35,235 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15211#(<= ~counter~0 2)} {15211#(<= ~counter~0 2)} #55#return; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:35,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {15211#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:35,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {15211#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:35,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {15236#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:35,236 INFO L272 TraceCheckUtils]: 30: Hoare triple {15236#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:35,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {15236#(<= ~counter~0 3)} ~cond := #in~cond; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:35,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {15236#(<= ~counter~0 3)} assume !(0 == ~cond); {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:35,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {15236#(<= ~counter~0 3)} assume true; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:35,237 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15236#(<= ~counter~0 3)} {15236#(<= ~counter~0 3)} #55#return; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:35,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {15236#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:35,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {15236#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:35,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {15261#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:35,238 INFO L272 TraceCheckUtils]: 38: Hoare triple {15261#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:35,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {15261#(<= ~counter~0 4)} ~cond := #in~cond; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:35,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {15261#(<= ~counter~0 4)} assume !(0 == ~cond); {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:35,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {15261#(<= ~counter~0 4)} assume true; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:35,239 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15261#(<= ~counter~0 4)} {15261#(<= ~counter~0 4)} #55#return; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:35,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {15261#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:35,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {15261#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:35,239 INFO L290 TraceCheckUtils]: 45: Hoare triple {15286#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:35,240 INFO L272 TraceCheckUtils]: 46: Hoare triple {15286#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:35,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {15286#(<= ~counter~0 5)} ~cond := #in~cond; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:35,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {15286#(<= ~counter~0 5)} assume !(0 == ~cond); {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:35,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {15286#(<= ~counter~0 5)} assume true; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:35,241 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15286#(<= ~counter~0 5)} {15286#(<= ~counter~0 5)} #55#return; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:35,241 INFO L290 TraceCheckUtils]: 51: Hoare triple {15286#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:35,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {15286#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:35,242 INFO L290 TraceCheckUtils]: 53: Hoare triple {15311#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:35,242 INFO L272 TraceCheckUtils]: 54: Hoare triple {15311#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:35,242 INFO L290 TraceCheckUtils]: 55: Hoare triple {15311#(<= ~counter~0 6)} ~cond := #in~cond; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:35,242 INFO L290 TraceCheckUtils]: 56: Hoare triple {15311#(<= ~counter~0 6)} assume !(0 == ~cond); {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:35,242 INFO L290 TraceCheckUtils]: 57: Hoare triple {15311#(<= ~counter~0 6)} assume true; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:35,243 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15311#(<= ~counter~0 6)} {15311#(<= ~counter~0 6)} #55#return; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:35,243 INFO L290 TraceCheckUtils]: 59: Hoare triple {15311#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:35,243 INFO L290 TraceCheckUtils]: 60: Hoare triple {15311#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:35,243 INFO L290 TraceCheckUtils]: 61: Hoare triple {15336#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:35,244 INFO L272 TraceCheckUtils]: 62: Hoare triple {15336#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:35,244 INFO L290 TraceCheckUtils]: 63: Hoare triple {15336#(<= ~counter~0 7)} ~cond := #in~cond; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:35,244 INFO L290 TraceCheckUtils]: 64: Hoare triple {15336#(<= ~counter~0 7)} assume !(0 == ~cond); {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:35,244 INFO L290 TraceCheckUtils]: 65: Hoare triple {15336#(<= ~counter~0 7)} assume true; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:35,245 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15336#(<= ~counter~0 7)} {15336#(<= ~counter~0 7)} #55#return; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:35,245 INFO L290 TraceCheckUtils]: 67: Hoare triple {15336#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:35,245 INFO L290 TraceCheckUtils]: 68: Hoare triple {15336#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:35,246 INFO L290 TraceCheckUtils]: 69: Hoare triple {15361#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:35,246 INFO L272 TraceCheckUtils]: 70: Hoare triple {15361#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:35,246 INFO L290 TraceCheckUtils]: 71: Hoare triple {15361#(<= ~counter~0 8)} ~cond := #in~cond; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:35,246 INFO L290 TraceCheckUtils]: 72: Hoare triple {15361#(<= ~counter~0 8)} assume !(0 == ~cond); {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:35,246 INFO L290 TraceCheckUtils]: 73: Hoare triple {15361#(<= ~counter~0 8)} assume true; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:35,247 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15361#(<= ~counter~0 8)} {15361#(<= ~counter~0 8)} #55#return; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:35,247 INFO L290 TraceCheckUtils]: 75: Hoare triple {15361#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:35,247 INFO L290 TraceCheckUtils]: 76: Hoare triple {15361#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:35,248 INFO L290 TraceCheckUtils]: 77: Hoare triple {15386#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:35,248 INFO L272 TraceCheckUtils]: 78: Hoare triple {15386#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:35,248 INFO L290 TraceCheckUtils]: 79: Hoare triple {15386#(<= ~counter~0 9)} ~cond := #in~cond; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:35,248 INFO L290 TraceCheckUtils]: 80: Hoare triple {15386#(<= ~counter~0 9)} assume !(0 == ~cond); {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:35,248 INFO L290 TraceCheckUtils]: 81: Hoare triple {15386#(<= ~counter~0 9)} assume true; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:35,249 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15386#(<= ~counter~0 9)} {15386#(<= ~counter~0 9)} #55#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:35,249 INFO L290 TraceCheckUtils]: 83: Hoare triple {15386#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:35,249 INFO L290 TraceCheckUtils]: 84: Hoare triple {15386#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:35,250 INFO L290 TraceCheckUtils]: 85: Hoare triple {15411#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:35,250 INFO L272 TraceCheckUtils]: 86: Hoare triple {15411#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:35,250 INFO L290 TraceCheckUtils]: 87: Hoare triple {15411#(<= ~counter~0 10)} ~cond := #in~cond; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:35,250 INFO L290 TraceCheckUtils]: 88: Hoare triple {15411#(<= ~counter~0 10)} assume !(0 == ~cond); {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:35,250 INFO L290 TraceCheckUtils]: 89: Hoare triple {15411#(<= ~counter~0 10)} assume true; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:35,251 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15411#(<= ~counter~0 10)} {15411#(<= ~counter~0 10)} #55#return; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:35,251 INFO L290 TraceCheckUtils]: 91: Hoare triple {15411#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:35,251 INFO L290 TraceCheckUtils]: 92: Hoare triple {15411#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15436#(<= |main_#t~post5| 10)} is VALID [2022-04-08 14:34:35,251 INFO L290 TraceCheckUtils]: 93: Hoare triple {15436#(<= |main_#t~post5| 10)} assume !(#t~post5 < 20);havoc #t~post5; {15145#false} is VALID [2022-04-08 14:34:35,252 INFO L272 TraceCheckUtils]: 94: Hoare triple {15145#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15145#false} is VALID [2022-04-08 14:34:35,252 INFO L290 TraceCheckUtils]: 95: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-08 14:34:35,252 INFO L290 TraceCheckUtils]: 96: Hoare triple {15145#false} assume !(0 == ~cond); {15145#false} is VALID [2022-04-08 14:34:35,252 INFO L290 TraceCheckUtils]: 97: Hoare triple {15145#false} assume true; {15145#false} is VALID [2022-04-08 14:34:35,252 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15145#false} {15145#false} #57#return; {15145#false} is VALID [2022-04-08 14:34:35,252 INFO L272 TraceCheckUtils]: 99: Hoare triple {15145#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {15145#false} is VALID [2022-04-08 14:34:35,252 INFO L290 TraceCheckUtils]: 100: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-08 14:34:35,252 INFO L290 TraceCheckUtils]: 101: Hoare triple {15145#false} assume 0 == ~cond; {15145#false} is VALID [2022-04-08 14:34:35,252 INFO L290 TraceCheckUtils]: 102: Hoare triple {15145#false} assume !false; {15145#false} is VALID [2022-04-08 14:34:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 60 proven. 380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:34:35,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:35,620 INFO L290 TraceCheckUtils]: 102: Hoare triple {15145#false} assume !false; {15145#false} is VALID [2022-04-08 14:34:35,621 INFO L290 TraceCheckUtils]: 101: Hoare triple {15145#false} assume 0 == ~cond; {15145#false} is VALID [2022-04-08 14:34:35,621 INFO L290 TraceCheckUtils]: 100: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-08 14:34:35,621 INFO L272 TraceCheckUtils]: 99: Hoare triple {15145#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {15145#false} is VALID [2022-04-08 14:34:35,621 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15144#true} {15145#false} #57#return; {15145#false} is VALID [2022-04-08 14:34:35,621 INFO L290 TraceCheckUtils]: 97: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:34:35,621 INFO L290 TraceCheckUtils]: 96: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:34:35,621 INFO L290 TraceCheckUtils]: 95: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:34:35,621 INFO L272 TraceCheckUtils]: 94: Hoare triple {15145#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:34:35,621 INFO L290 TraceCheckUtils]: 93: Hoare triple {15494#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {15145#false} is VALID [2022-04-08 14:34:35,622 INFO L290 TraceCheckUtils]: 92: Hoare triple {15498#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15494#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:34:35,622 INFO L290 TraceCheckUtils]: 91: Hoare triple {15498#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15498#(< ~counter~0 20)} is VALID [2022-04-08 14:34:35,623 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15144#true} {15498#(< ~counter~0 20)} #55#return; {15498#(< ~counter~0 20)} is VALID [2022-04-08 14:34:35,623 INFO L290 TraceCheckUtils]: 89: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:34:35,623 INFO L290 TraceCheckUtils]: 88: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:34:35,623 INFO L290 TraceCheckUtils]: 87: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:34:35,623 INFO L272 TraceCheckUtils]: 86: Hoare triple {15498#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:34:35,623 INFO L290 TraceCheckUtils]: 85: Hoare triple {15498#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {15498#(< ~counter~0 20)} is VALID [2022-04-08 14:34:35,624 INFO L290 TraceCheckUtils]: 84: Hoare triple {15523#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15498#(< ~counter~0 20)} is VALID [2022-04-08 14:34:35,624 INFO L290 TraceCheckUtils]: 83: Hoare triple {15523#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15523#(< ~counter~0 19)} is VALID [2022-04-08 14:34:35,625 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15144#true} {15523#(< ~counter~0 19)} #55#return; {15523#(< ~counter~0 19)} is VALID [2022-04-08 14:34:35,625 INFO L290 TraceCheckUtils]: 81: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:34:35,625 INFO L290 TraceCheckUtils]: 80: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:34:35,625 INFO L290 TraceCheckUtils]: 79: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:34:35,625 INFO L272 TraceCheckUtils]: 78: Hoare triple {15523#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:34:35,625 INFO L290 TraceCheckUtils]: 77: Hoare triple {15523#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {15523#(< ~counter~0 19)} is VALID [2022-04-08 14:34:35,626 INFO L290 TraceCheckUtils]: 76: Hoare triple {15548#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15523#(< ~counter~0 19)} is VALID [2022-04-08 14:34:35,626 INFO L290 TraceCheckUtils]: 75: Hoare triple {15548#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15548#(< ~counter~0 18)} is VALID [2022-04-08 14:34:35,626 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15144#true} {15548#(< ~counter~0 18)} #55#return; {15548#(< ~counter~0 18)} is VALID [2022-04-08 14:34:35,627 INFO L290 TraceCheckUtils]: 73: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:34:35,627 INFO L290 TraceCheckUtils]: 72: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:34:35,627 INFO L290 TraceCheckUtils]: 71: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:34:35,627 INFO L272 TraceCheckUtils]: 70: Hoare triple {15548#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:34:35,627 INFO L290 TraceCheckUtils]: 69: Hoare triple {15548#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {15548#(< ~counter~0 18)} is VALID [2022-04-08 14:34:35,627 INFO L290 TraceCheckUtils]: 68: Hoare triple {15573#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15548#(< ~counter~0 18)} is VALID [2022-04-08 14:34:35,628 INFO L290 TraceCheckUtils]: 67: Hoare triple {15573#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15573#(< ~counter~0 17)} is VALID [2022-04-08 14:34:35,628 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15144#true} {15573#(< ~counter~0 17)} #55#return; {15573#(< ~counter~0 17)} is VALID [2022-04-08 14:34:35,628 INFO L290 TraceCheckUtils]: 65: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:34:35,628 INFO L290 TraceCheckUtils]: 64: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:34:35,628 INFO L290 TraceCheckUtils]: 63: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:34:35,628 INFO L272 TraceCheckUtils]: 62: Hoare triple {15573#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:34:35,629 INFO L290 TraceCheckUtils]: 61: Hoare triple {15573#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {15573#(< ~counter~0 17)} is VALID [2022-04-08 14:34:35,629 INFO L290 TraceCheckUtils]: 60: Hoare triple {15598#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15573#(< ~counter~0 17)} is VALID [2022-04-08 14:34:35,630 INFO L290 TraceCheckUtils]: 59: Hoare triple {15598#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15598#(< ~counter~0 16)} is VALID [2022-04-08 14:34:35,630 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15144#true} {15598#(< ~counter~0 16)} #55#return; {15598#(< ~counter~0 16)} is VALID [2022-04-08 14:34:35,630 INFO L290 TraceCheckUtils]: 57: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:34:35,630 INFO L290 TraceCheckUtils]: 56: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:34:35,630 INFO L290 TraceCheckUtils]: 55: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:34:35,630 INFO L272 TraceCheckUtils]: 54: Hoare triple {15598#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:34:35,631 INFO L290 TraceCheckUtils]: 53: Hoare triple {15598#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {15598#(< ~counter~0 16)} is VALID [2022-04-08 14:34:35,632 INFO L290 TraceCheckUtils]: 52: Hoare triple {15623#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15598#(< ~counter~0 16)} is VALID [2022-04-08 14:34:35,632 INFO L290 TraceCheckUtils]: 51: Hoare triple {15623#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15623#(< ~counter~0 15)} is VALID [2022-04-08 14:34:35,633 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15144#true} {15623#(< ~counter~0 15)} #55#return; {15623#(< ~counter~0 15)} is VALID [2022-04-08 14:34:35,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:34:35,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:34:35,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:34:35,633 INFO L272 TraceCheckUtils]: 46: Hoare triple {15623#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:34:35,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {15623#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {15623#(< ~counter~0 15)} is VALID [2022-04-08 14:34:35,634 INFO L290 TraceCheckUtils]: 44: Hoare triple {15648#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15623#(< ~counter~0 15)} is VALID [2022-04-08 14:34:35,634 INFO L290 TraceCheckUtils]: 43: Hoare triple {15648#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15648#(< ~counter~0 14)} is VALID [2022-04-08 14:34:35,634 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15144#true} {15648#(< ~counter~0 14)} #55#return; {15648#(< ~counter~0 14)} is VALID [2022-04-08 14:34:35,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:34:35,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:34:35,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:34:35,635 INFO L272 TraceCheckUtils]: 38: Hoare triple {15648#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:34:35,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {15648#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {15648#(< ~counter~0 14)} is VALID [2022-04-08 14:34:35,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {15673#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15648#(< ~counter~0 14)} is VALID [2022-04-08 14:34:35,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {15673#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15673#(< ~counter~0 13)} is VALID [2022-04-08 14:34:35,636 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15144#true} {15673#(< ~counter~0 13)} #55#return; {15673#(< ~counter~0 13)} is VALID [2022-04-08 14:34:35,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:34:35,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:34:35,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:34:35,636 INFO L272 TraceCheckUtils]: 30: Hoare triple {15673#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:34:35,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {15673#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {15673#(< ~counter~0 13)} is VALID [2022-04-08 14:34:35,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {15698#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15673#(< ~counter~0 13)} is VALID [2022-04-08 14:34:35,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {15698#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15698#(< ~counter~0 12)} is VALID [2022-04-08 14:34:35,638 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15144#true} {15698#(< ~counter~0 12)} #55#return; {15698#(< ~counter~0 12)} is VALID [2022-04-08 14:34:35,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:34:35,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:34:35,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:34:35,638 INFO L272 TraceCheckUtils]: 22: Hoare triple {15698#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:34:35,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {15698#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {15698#(< ~counter~0 12)} is VALID [2022-04-08 14:34:35,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {15411#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15698#(< ~counter~0 12)} is VALID [2022-04-08 14:34:35,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {15411#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:35,640 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15144#true} {15411#(<= ~counter~0 10)} #55#return; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:35,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:34:35,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:34:35,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:34:35,643 INFO L272 TraceCheckUtils]: 14: Hoare triple {15411#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:34:35,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {15411#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:35,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {15386#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:35,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {15386#(<= ~counter~0 9)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:35,645 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15144#true} {15386#(<= ~counter~0 9)} #53#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:35,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 14:34:35,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 14:34:35,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 14:34:35,645 INFO L272 TraceCheckUtils]: 6: Hoare triple {15386#(<= ~counter~0 9)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {15144#true} is VALID [2022-04-08 14:34:35,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {15386#(<= ~counter~0 9)} 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; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:35,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {15386#(<= ~counter~0 9)} call #t~ret6 := main(); {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:35,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15386#(<= ~counter~0 9)} {15144#true} #61#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:35,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {15386#(<= ~counter~0 9)} assume true; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:35,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {15144#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);~counter~0 := 0; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:35,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {15144#true} call ULTIMATE.init(); {15144#true} is VALID [2022-04-08 14:34:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 22 proven. 200 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 14:34:35,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:35,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946424067] [2022-04-08 14:34:35,648 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:35,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126608863] [2022-04-08 14:34:35,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126608863] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:34:35,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:34:35,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-08 14:34:35,648 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:35,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1202131754] [2022-04-08 14:34:35,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1202131754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:35,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:35,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 14:34:35,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493651252] [2022-04-08 14:34:35,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:35,649 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Word has length 103 [2022-04-08 14:34:35,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:35,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:34:35,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:35,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 14:34:35,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:35,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 14:34:35,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:34:35,727 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:34:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:36,170 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2022-04-08 14:34:36,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 14:34:36,170 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Word has length 103 [2022-04-08 14:34:36,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:34:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2022-04-08 14:34:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:34:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2022-04-08 14:34:36,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 118 transitions. [2022-04-08 14:34:36,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:36,266 INFO L225 Difference]: With dead ends: 118 [2022-04-08 14:34:36,266 INFO L226 Difference]: Without dead ends: 108 [2022-04-08 14:34:36,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=466, Invalid=656, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 14:34:36,267 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:36,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:34:36,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-08 14:34:36,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-04-08 14:34:36,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:36,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:34:36,421 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:34:36,422 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:34:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:36,423 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2022-04-08 14:34:36,423 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-08 14:34:36,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:36,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:36,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 108 states. [2022-04-08 14:34:36,424 INFO L87 Difference]: Start difference. First operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 108 states. [2022-04-08 14:34:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:36,425 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2022-04-08 14:34:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-08 14:34:36,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:36,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:36,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:36,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:34:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2022-04-08 14:34:36,427 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 103 [2022-04-08 14:34:36,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:36,428 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2022-04-08 14:34:36,428 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:34:36,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 110 transitions. [2022-04-08 14:34:36,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-08 14:34:36,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-08 14:34:36,809 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:36,809 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:36,818 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 14:34:37,009 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 14:34:37,009 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:37,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:37,010 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 19 times [2022-04-08 14:34:37,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:37,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1942571788] [2022-04-08 14:34:37,102 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:37,103 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 20 times [2022-04-08 14:34:37,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:37,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696940826] [2022-04-08 14:34:37,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:37,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:37,123 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:37,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156632883] [2022-04-08 14:34:37,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:34:37,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:37,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:37,124 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 14:34:37,125 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 14:34:38,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:34:38,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:38,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 14:34:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:38,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:38,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {16473#true} call ULTIMATE.init(); {16473#true} is VALID [2022-04-08 14:34:38,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {16473#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);~counter~0 := 0; {16473#true} is VALID [2022-04-08 14:34:38,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 14:34:38,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16473#true} {16473#true} #61#return; {16473#true} is VALID [2022-04-08 14:34:38,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {16473#true} call #t~ret6 := main(); {16473#true} is VALID [2022-04-08 14:34:38,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {16473#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; {16473#true} is VALID [2022-04-08 14:34:38,720 INFO L272 TraceCheckUtils]: 6: Hoare triple {16473#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {16473#true} is VALID [2022-04-08 14:34:38,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 14:34:38,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 14:34:38,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 14:34:38,721 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16473#true} {16473#true} #53#return; {16473#true} is VALID [2022-04-08 14:34:38,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {16473#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:38,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {16511#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:38,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {16511#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:38,722 INFO L272 TraceCheckUtils]: 14: Hoare triple {16511#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 14:34:38,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 14:34:38,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 14:34:38,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 14:34:38,723 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16473#true} {16511#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:38,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {16511#(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 * ~y~0 * ~y~0 + ~x~0; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:34:38,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {16536#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:34:38,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {16536#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:34:38,724 INFO L272 TraceCheckUtils]: 22: Hoare triple {16536#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 14:34:38,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 14:34:38,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 14:34:38,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 14:34:38,725 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16473#true} {16536#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:34:38,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {16536#(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 * ~y~0 * ~y~0 + ~x~0; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:34:38,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:34:38,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:34:38,726 INFO L272 TraceCheckUtils]: 30: Hoare triple {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 14:34:38,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 14:34:38,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 14:34:38,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 14:34:38,727 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16473#true} {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #55#return; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:34:38,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {16561#(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 * ~y~0 * ~y~0 + ~x~0; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 14:34:38,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 14:34:38,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 14:34:38,728 INFO L272 TraceCheckUtils]: 38: Hoare triple {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 14:34:38,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 14:34:38,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 14:34:38,728 INFO L290 TraceCheckUtils]: 41: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 14:34:38,729 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16473#true} {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #55#return; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 14:34:38,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {16586#(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 * ~y~0 * ~y~0 + ~x~0; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:34:38,730 INFO L290 TraceCheckUtils]: 44: Hoare triple {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:34:38,730 INFO L290 TraceCheckUtils]: 45: Hoare triple {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:34:38,730 INFO L272 TraceCheckUtils]: 46: Hoare triple {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 14:34:38,730 INFO L290 TraceCheckUtils]: 47: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 14:34:38,730 INFO L290 TraceCheckUtils]: 48: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 14:34:38,730 INFO L290 TraceCheckUtils]: 49: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 14:34:38,731 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16473#true} {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #55#return; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:34:38,731 INFO L290 TraceCheckUtils]: 51: Hoare triple {16611#(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 * ~y~0 * ~y~0 + ~x~0; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:38,732 INFO L290 TraceCheckUtils]: 52: Hoare triple {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:38,732 INFO L290 TraceCheckUtils]: 53: Hoare triple {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:38,732 INFO L272 TraceCheckUtils]: 54: Hoare triple {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 14:34:38,732 INFO L290 TraceCheckUtils]: 55: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 14:34:38,732 INFO L290 TraceCheckUtils]: 56: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 14:34:38,732 INFO L290 TraceCheckUtils]: 57: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 14:34:38,733 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16473#true} {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #55#return; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:38,733 INFO L290 TraceCheckUtils]: 59: Hoare triple {16636#(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 * ~y~0 * ~y~0 + ~x~0; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:38,733 INFO L290 TraceCheckUtils]: 60: Hoare triple {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:38,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:38,734 INFO L272 TraceCheckUtils]: 62: Hoare triple {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 14:34:38,734 INFO L290 TraceCheckUtils]: 63: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 14:34:38,734 INFO L290 TraceCheckUtils]: 64: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 14:34:38,734 INFO L290 TraceCheckUtils]: 65: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 14:34:38,735 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16473#true} {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #55#return; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:38,735 INFO L290 TraceCheckUtils]: 67: Hoare triple {16661#(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 * ~y~0 * ~y~0 + ~x~0; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 14:34:38,735 INFO L290 TraceCheckUtils]: 68: Hoare triple {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 14:34:38,736 INFO L290 TraceCheckUtils]: 69: Hoare triple {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(#t~post5 < 20);havoc #t~post5; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 14:34:38,736 INFO L272 TraceCheckUtils]: 70: Hoare triple {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 14:34:38,736 INFO L290 TraceCheckUtils]: 71: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 14:34:38,736 INFO L290 TraceCheckUtils]: 72: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 14:34:38,736 INFO L290 TraceCheckUtils]: 73: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 14:34:38,737 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16473#true} {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #55#return; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 14:34:38,737 INFO L290 TraceCheckUtils]: 75: Hoare triple {16686#(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 * ~y~0 * ~y~0 + ~x~0; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 14:34:38,737 INFO L290 TraceCheckUtils]: 76: Hoare triple {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 14:34:38,738 INFO L290 TraceCheckUtils]: 77: Hoare triple {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 14:34:38,738 INFO L272 TraceCheckUtils]: 78: Hoare triple {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 14:34:38,738 INFO L290 TraceCheckUtils]: 79: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 14:34:38,738 INFO L290 TraceCheckUtils]: 80: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 14:34:38,738 INFO L290 TraceCheckUtils]: 81: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 14:34:38,738 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16473#true} {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #55#return; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 14:34:38,739 INFO L290 TraceCheckUtils]: 83: Hoare triple {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 14:34:38,739 INFO L290 TraceCheckUtils]: 84: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 14:34:38,740 INFO L290 TraceCheckUtils]: 85: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} assume !!(#t~post5 < 20);havoc #t~post5; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 14:34:38,740 INFO L272 TraceCheckUtils]: 86: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 14:34:38,740 INFO L290 TraceCheckUtils]: 87: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 14:34:38,740 INFO L290 TraceCheckUtils]: 88: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 14:34:38,740 INFO L290 TraceCheckUtils]: 89: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 14:34:38,740 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16473#true} {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} #55#return; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 14:34:38,741 INFO L290 TraceCheckUtils]: 91: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 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 * ~y~0 * ~y~0 + ~x~0; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:34:38,741 INFO L290 TraceCheckUtils]: 92: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:34:38,742 INFO L290 TraceCheckUtils]: 93: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:34:38,742 INFO L272 TraceCheckUtils]: 94: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 14:34:38,742 INFO L290 TraceCheckUtils]: 95: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 14:34:38,742 INFO L290 TraceCheckUtils]: 96: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 14:34:38,742 INFO L290 TraceCheckUtils]: 97: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 14:34:38,742 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16473#true} {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} #55#return; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:34:38,743 INFO L290 TraceCheckUtils]: 99: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:34:38,743 INFO L272 TraceCheckUtils]: 100: Hoare triple {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 14:34:38,744 INFO L290 TraceCheckUtils]: 101: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 14:34:38,744 INFO L290 TraceCheckUtils]: 102: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 14:34:38,744 INFO L290 TraceCheckUtils]: 103: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 14:34:38,744 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {16473#true} {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} #57#return; {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:34:38,745 INFO L272 TraceCheckUtils]: 105: Hoare triple {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {16805#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:34:38,745 INFO L290 TraceCheckUtils]: 106: Hoare triple {16805#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16809#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:34:38,745 INFO L290 TraceCheckUtils]: 107: Hoare triple {16809#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16474#false} is VALID [2022-04-08 14:34:38,745 INFO L290 TraceCheckUtils]: 108: Hoare triple {16474#false} assume !false; {16474#false} is VALID [2022-04-08 14:34:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 24 proven. 220 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 14:34:38,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:39,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:39,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696940826] [2022-04-08 14:34:39,060 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:39,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156632883] [2022-04-08 14:34:39,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156632883] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:34:39,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:34:39,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-08 14:34:39,060 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:39,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1942571788] [2022-04-08 14:34:39,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1942571788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:39,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:39,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 14:34:39,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119094071] [2022-04-08 14:34:39,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:39,061 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 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 109 [2022-04-08 14:34:39,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:39,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 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 14:34:39,121 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 14:34:39,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 14:34:39,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:39,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 14:34:39,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:34:39,122 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 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 14:34:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:40,628 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2022-04-08 14:34:40,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 14:34:40,628 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 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 109 [2022-04-08 14:34:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 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 14:34:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-08 14:34:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 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 14:34:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-08 14:34:40,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 89 transitions. [2022-04-08 14:34:40,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:40,714 INFO L225 Difference]: With dead ends: 116 [2022-04-08 14:34:40,714 INFO L226 Difference]: Without dead ends: 110 [2022-04-08 14:34:40,715 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 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 14:34:40,715 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:40,715 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 627 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 14:34:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-08 14:34:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-08 14:34:40,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:40,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:34:40,860 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:34:40,860 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:34:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:40,862 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2022-04-08 14:34:40,862 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-08 14:34:40,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:40,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:40,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 110 states. [2022-04-08 14:34:40,862 INFO L87 Difference]: Start difference. First operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 110 states. [2022-04-08 14:34:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:40,864 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2022-04-08 14:34:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-08 14:34:40,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:40,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:40,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:40,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:34:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2022-04-08 14:34:40,865 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 109 [2022-04-08 14:34:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:40,866 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2022-04-08 14:34:40,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 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 14:34:40,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 113 transitions. [2022-04-08 14:34:41,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-08 14:34:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 14:34:41,068 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:41,068 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:41,076 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 14:34:41,269 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 14:34:41,269 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:41,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:41,269 INFO L85 PathProgramCache]: Analyzing trace with hash 509212939, now seen corresponding path program 19 times [2022-04-08 14:34:41,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:41,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [375932460] [2022-04-08 14:34:41,359 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:41,359 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:41,359 INFO L85 PathProgramCache]: Analyzing trace with hash 509212939, now seen corresponding path program 20 times [2022-04-08 14:34:41,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:41,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459018447] [2022-04-08 14:34:41,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:41,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:41,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:41,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1529865762] [2022-04-08 14:34:41,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:34:41,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:41,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:41,408 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 14:34:41,409 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 14:34:41,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:34:41,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:41,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 14:34:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:41,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:41,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {17551#true} call ULTIMATE.init(); {17551#true} is VALID [2022-04-08 14:34:41,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {17551#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);~counter~0 := 0; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:41,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {17559#(<= ~counter~0 0)} assume true; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:41,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17559#(<= ~counter~0 0)} {17551#true} #61#return; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:41,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {17559#(<= ~counter~0 0)} call #t~ret6 := main(); {17559#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:41,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {17559#(<= ~counter~0 0)} 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; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:41,787 INFO L272 TraceCheckUtils]: 6: Hoare triple {17559#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {17559#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:41,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {17559#(<= ~counter~0 0)} ~cond := #in~cond; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:41,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {17559#(<= ~counter~0 0)} assume !(0 == ~cond); {17559#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:41,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {17559#(<= ~counter~0 0)} assume true; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:41,788 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17559#(<= ~counter~0 0)} {17559#(<= ~counter~0 0)} #53#return; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:41,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {17559#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:41,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {17559#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17593#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:41,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {17593#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {17593#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:41,789 INFO L272 TraceCheckUtils]: 14: Hoare triple {17593#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17593#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:41,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {17593#(<= ~counter~0 1)} ~cond := #in~cond; {17593#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:41,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {17593#(<= ~counter~0 1)} assume !(0 == ~cond); {17593#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:41,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {17593#(<= ~counter~0 1)} assume true; {17593#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:41,790 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17593#(<= ~counter~0 1)} {17593#(<= ~counter~0 1)} #55#return; {17593#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:41,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {17593#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17593#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:41,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {17593#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17618#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:41,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {17618#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {17618#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:41,791 INFO L272 TraceCheckUtils]: 22: Hoare triple {17618#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17618#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:41,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {17618#(<= ~counter~0 2)} ~cond := #in~cond; {17618#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:41,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {17618#(<= ~counter~0 2)} assume !(0 == ~cond); {17618#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:41,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {17618#(<= ~counter~0 2)} assume true; {17618#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:41,792 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17618#(<= ~counter~0 2)} {17618#(<= ~counter~0 2)} #55#return; {17618#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:41,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {17618#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17618#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:41,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {17618#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17643#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:41,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {17643#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {17643#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:41,793 INFO L272 TraceCheckUtils]: 30: Hoare triple {17643#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17643#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:41,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {17643#(<= ~counter~0 3)} ~cond := #in~cond; {17643#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:41,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {17643#(<= ~counter~0 3)} assume !(0 == ~cond); {17643#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:41,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {17643#(<= ~counter~0 3)} assume true; {17643#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:41,794 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17643#(<= ~counter~0 3)} {17643#(<= ~counter~0 3)} #55#return; {17643#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:41,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {17643#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17643#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:41,795 INFO L290 TraceCheckUtils]: 36: Hoare triple {17643#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17668#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:41,795 INFO L290 TraceCheckUtils]: 37: Hoare triple {17668#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {17668#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:41,795 INFO L272 TraceCheckUtils]: 38: Hoare triple {17668#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17668#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:41,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {17668#(<= ~counter~0 4)} ~cond := #in~cond; {17668#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:41,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {17668#(<= ~counter~0 4)} assume !(0 == ~cond); {17668#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:41,796 INFO L290 TraceCheckUtils]: 41: Hoare triple {17668#(<= ~counter~0 4)} assume true; {17668#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:41,796 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17668#(<= ~counter~0 4)} {17668#(<= ~counter~0 4)} #55#return; {17668#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:41,796 INFO L290 TraceCheckUtils]: 43: Hoare triple {17668#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17668#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:41,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {17668#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17693#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:41,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {17693#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {17693#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:41,797 INFO L272 TraceCheckUtils]: 46: Hoare triple {17693#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17693#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:41,797 INFO L290 TraceCheckUtils]: 47: Hoare triple {17693#(<= ~counter~0 5)} ~cond := #in~cond; {17693#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:41,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {17693#(<= ~counter~0 5)} assume !(0 == ~cond); {17693#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:41,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {17693#(<= ~counter~0 5)} assume true; {17693#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:41,798 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17693#(<= ~counter~0 5)} {17693#(<= ~counter~0 5)} #55#return; {17693#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:41,798 INFO L290 TraceCheckUtils]: 51: Hoare triple {17693#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17693#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:41,798 INFO L290 TraceCheckUtils]: 52: Hoare triple {17693#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17718#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:41,798 INFO L290 TraceCheckUtils]: 53: Hoare triple {17718#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {17718#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:41,799 INFO L272 TraceCheckUtils]: 54: Hoare triple {17718#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17718#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:41,799 INFO L290 TraceCheckUtils]: 55: Hoare triple {17718#(<= ~counter~0 6)} ~cond := #in~cond; {17718#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:41,799 INFO L290 TraceCheckUtils]: 56: Hoare triple {17718#(<= ~counter~0 6)} assume !(0 == ~cond); {17718#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:41,799 INFO L290 TraceCheckUtils]: 57: Hoare triple {17718#(<= ~counter~0 6)} assume true; {17718#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:41,799 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17718#(<= ~counter~0 6)} {17718#(<= ~counter~0 6)} #55#return; {17718#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:41,800 INFO L290 TraceCheckUtils]: 59: Hoare triple {17718#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17718#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:41,800 INFO L290 TraceCheckUtils]: 60: Hoare triple {17718#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17743#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:41,800 INFO L290 TraceCheckUtils]: 61: Hoare triple {17743#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {17743#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:41,801 INFO L272 TraceCheckUtils]: 62: Hoare triple {17743#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17743#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:41,801 INFO L290 TraceCheckUtils]: 63: Hoare triple {17743#(<= ~counter~0 7)} ~cond := #in~cond; {17743#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:41,801 INFO L290 TraceCheckUtils]: 64: Hoare triple {17743#(<= ~counter~0 7)} assume !(0 == ~cond); {17743#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:41,801 INFO L290 TraceCheckUtils]: 65: Hoare triple {17743#(<= ~counter~0 7)} assume true; {17743#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:41,801 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17743#(<= ~counter~0 7)} {17743#(<= ~counter~0 7)} #55#return; {17743#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:41,802 INFO L290 TraceCheckUtils]: 67: Hoare triple {17743#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17743#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:41,802 INFO L290 TraceCheckUtils]: 68: Hoare triple {17743#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:41,802 INFO L290 TraceCheckUtils]: 69: Hoare triple {17768#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:41,802 INFO L272 TraceCheckUtils]: 70: Hoare triple {17768#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17768#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:41,803 INFO L290 TraceCheckUtils]: 71: Hoare triple {17768#(<= ~counter~0 8)} ~cond := #in~cond; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:41,803 INFO L290 TraceCheckUtils]: 72: Hoare triple {17768#(<= ~counter~0 8)} assume !(0 == ~cond); {17768#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:41,803 INFO L290 TraceCheckUtils]: 73: Hoare triple {17768#(<= ~counter~0 8)} assume true; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:41,803 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17768#(<= ~counter~0 8)} {17768#(<= ~counter~0 8)} #55#return; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:41,803 INFO L290 TraceCheckUtils]: 75: Hoare triple {17768#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:41,804 INFO L290 TraceCheckUtils]: 76: Hoare triple {17768#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:41,804 INFO L290 TraceCheckUtils]: 77: Hoare triple {17793#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:41,804 INFO L272 TraceCheckUtils]: 78: Hoare triple {17793#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17793#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:41,804 INFO L290 TraceCheckUtils]: 79: Hoare triple {17793#(<= ~counter~0 9)} ~cond := #in~cond; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:41,805 INFO L290 TraceCheckUtils]: 80: Hoare triple {17793#(<= ~counter~0 9)} assume !(0 == ~cond); {17793#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:41,805 INFO L290 TraceCheckUtils]: 81: Hoare triple {17793#(<= ~counter~0 9)} assume true; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:41,805 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17793#(<= ~counter~0 9)} {17793#(<= ~counter~0 9)} #55#return; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:41,805 INFO L290 TraceCheckUtils]: 83: Hoare triple {17793#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:41,806 INFO L290 TraceCheckUtils]: 84: Hoare triple {17793#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:41,806 INFO L290 TraceCheckUtils]: 85: Hoare triple {17818#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:41,806 INFO L272 TraceCheckUtils]: 86: Hoare triple {17818#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17818#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:41,806 INFO L290 TraceCheckUtils]: 87: Hoare triple {17818#(<= ~counter~0 10)} ~cond := #in~cond; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:41,806 INFO L290 TraceCheckUtils]: 88: Hoare triple {17818#(<= ~counter~0 10)} assume !(0 == ~cond); {17818#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:41,807 INFO L290 TraceCheckUtils]: 89: Hoare triple {17818#(<= ~counter~0 10)} assume true; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:41,807 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17818#(<= ~counter~0 10)} {17818#(<= ~counter~0 10)} #55#return; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:41,807 INFO L290 TraceCheckUtils]: 91: Hoare triple {17818#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:41,807 INFO L290 TraceCheckUtils]: 92: Hoare triple {17818#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:41,808 INFO L290 TraceCheckUtils]: 93: Hoare triple {17843#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:41,808 INFO L272 TraceCheckUtils]: 94: Hoare triple {17843#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17843#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:41,808 INFO L290 TraceCheckUtils]: 95: Hoare triple {17843#(<= ~counter~0 11)} ~cond := #in~cond; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:41,808 INFO L290 TraceCheckUtils]: 96: Hoare triple {17843#(<= ~counter~0 11)} assume !(0 == ~cond); {17843#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:41,808 INFO L290 TraceCheckUtils]: 97: Hoare triple {17843#(<= ~counter~0 11)} assume true; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:41,809 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17843#(<= ~counter~0 11)} {17843#(<= ~counter~0 11)} #55#return; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:41,809 INFO L290 TraceCheckUtils]: 99: Hoare triple {17843#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:41,809 INFO L290 TraceCheckUtils]: 100: Hoare triple {17843#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17868#(<= |main_#t~post5| 11)} is VALID [2022-04-08 14:34:41,809 INFO L290 TraceCheckUtils]: 101: Hoare triple {17868#(<= |main_#t~post5| 11)} assume !(#t~post5 < 20);havoc #t~post5; {17552#false} is VALID [2022-04-08 14:34:41,809 INFO L272 TraceCheckUtils]: 102: Hoare triple {17552#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17552#false} is VALID [2022-04-08 14:34:41,810 INFO L290 TraceCheckUtils]: 103: Hoare triple {17552#false} ~cond := #in~cond; {17552#false} is VALID [2022-04-08 14:34:41,810 INFO L290 TraceCheckUtils]: 104: Hoare triple {17552#false} assume !(0 == ~cond); {17552#false} is VALID [2022-04-08 14:34:41,810 INFO L290 TraceCheckUtils]: 105: Hoare triple {17552#false} assume true; {17552#false} is VALID [2022-04-08 14:34:41,810 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17552#false} {17552#false} #57#return; {17552#false} is VALID [2022-04-08 14:34:41,810 INFO L272 TraceCheckUtils]: 107: Hoare triple {17552#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {17552#false} is VALID [2022-04-08 14:34:41,810 INFO L290 TraceCheckUtils]: 108: Hoare triple {17552#false} ~cond := #in~cond; {17552#false} is VALID [2022-04-08 14:34:41,810 INFO L290 TraceCheckUtils]: 109: Hoare triple {17552#false} assume 0 == ~cond; {17552#false} is VALID [2022-04-08 14:34:41,810 INFO L290 TraceCheckUtils]: 110: Hoare triple {17552#false} assume !false; {17552#false} is VALID [2022-04-08 14:34:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 66 proven. 462 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:34:41,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:42,229 INFO L290 TraceCheckUtils]: 110: Hoare triple {17552#false} assume !false; {17552#false} is VALID [2022-04-08 14:34:42,229 INFO L290 TraceCheckUtils]: 109: Hoare triple {17552#false} assume 0 == ~cond; {17552#false} is VALID [2022-04-08 14:34:42,229 INFO L290 TraceCheckUtils]: 108: Hoare triple {17552#false} ~cond := #in~cond; {17552#false} is VALID [2022-04-08 14:34:42,229 INFO L272 TraceCheckUtils]: 107: Hoare triple {17552#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {17552#false} is VALID [2022-04-08 14:34:42,229 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17551#true} {17552#false} #57#return; {17552#false} is VALID [2022-04-08 14:34:42,229 INFO L290 TraceCheckUtils]: 105: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 14:34:42,229 INFO L290 TraceCheckUtils]: 104: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 14:34:42,230 INFO L290 TraceCheckUtils]: 103: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 14:34:42,230 INFO L272 TraceCheckUtils]: 102: Hoare triple {17552#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 14:34:42,230 INFO L290 TraceCheckUtils]: 101: Hoare triple {17926#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {17552#false} is VALID [2022-04-08 14:34:42,230 INFO L290 TraceCheckUtils]: 100: Hoare triple {17930#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17926#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:34:42,230 INFO L290 TraceCheckUtils]: 99: Hoare triple {17930#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17930#(< ~counter~0 20)} is VALID [2022-04-08 14:34:42,231 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17551#true} {17930#(< ~counter~0 20)} #55#return; {17930#(< ~counter~0 20)} is VALID [2022-04-08 14:34:42,231 INFO L290 TraceCheckUtils]: 97: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 14:34:42,231 INFO L290 TraceCheckUtils]: 96: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 14:34:42,231 INFO L290 TraceCheckUtils]: 95: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 14:34:42,231 INFO L272 TraceCheckUtils]: 94: Hoare triple {17930#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 14:34:42,232 INFO L290 TraceCheckUtils]: 93: Hoare triple {17930#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {17930#(< ~counter~0 20)} is VALID [2022-04-08 14:34:42,233 INFO L290 TraceCheckUtils]: 92: Hoare triple {17955#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17930#(< ~counter~0 20)} is VALID [2022-04-08 14:34:42,233 INFO L290 TraceCheckUtils]: 91: Hoare triple {17955#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17955#(< ~counter~0 19)} is VALID [2022-04-08 14:34:42,234 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17551#true} {17955#(< ~counter~0 19)} #55#return; {17955#(< ~counter~0 19)} is VALID [2022-04-08 14:34:42,234 INFO L290 TraceCheckUtils]: 89: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 14:34:42,234 INFO L290 TraceCheckUtils]: 88: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 14:34:42,234 INFO L290 TraceCheckUtils]: 87: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 14:34:42,234 INFO L272 TraceCheckUtils]: 86: Hoare triple {17955#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 14:34:42,235 INFO L290 TraceCheckUtils]: 85: Hoare triple {17955#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {17955#(< ~counter~0 19)} is VALID [2022-04-08 14:34:42,235 INFO L290 TraceCheckUtils]: 84: Hoare triple {17980#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17955#(< ~counter~0 19)} is VALID [2022-04-08 14:34:42,236 INFO L290 TraceCheckUtils]: 83: Hoare triple {17980#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17980#(< ~counter~0 18)} is VALID [2022-04-08 14:34:42,236 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17551#true} {17980#(< ~counter~0 18)} #55#return; {17980#(< ~counter~0 18)} is VALID [2022-04-08 14:34:42,236 INFO L290 TraceCheckUtils]: 81: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 14:34:42,236 INFO L290 TraceCheckUtils]: 80: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 14:34:42,236 INFO L290 TraceCheckUtils]: 79: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 14:34:42,236 INFO L272 TraceCheckUtils]: 78: Hoare triple {17980#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 14:34:42,237 INFO L290 TraceCheckUtils]: 77: Hoare triple {17980#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {17980#(< ~counter~0 18)} is VALID [2022-04-08 14:34:42,237 INFO L290 TraceCheckUtils]: 76: Hoare triple {18005#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17980#(< ~counter~0 18)} is VALID [2022-04-08 14:34:42,237 INFO L290 TraceCheckUtils]: 75: Hoare triple {18005#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {18005#(< ~counter~0 17)} is VALID [2022-04-08 14:34:42,238 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17551#true} {18005#(< ~counter~0 17)} #55#return; {18005#(< ~counter~0 17)} is VALID [2022-04-08 14:34:42,238 INFO L290 TraceCheckUtils]: 73: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 14:34:42,238 INFO L290 TraceCheckUtils]: 72: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 14:34:42,238 INFO L290 TraceCheckUtils]: 71: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 14:34:42,238 INFO L272 TraceCheckUtils]: 70: Hoare triple {18005#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 14:34:42,238 INFO L290 TraceCheckUtils]: 69: Hoare triple {18005#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {18005#(< ~counter~0 17)} is VALID [2022-04-08 14:34:42,239 INFO L290 TraceCheckUtils]: 68: Hoare triple {18030#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18005#(< ~counter~0 17)} is VALID [2022-04-08 14:34:42,239 INFO L290 TraceCheckUtils]: 67: Hoare triple {18030#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {18030#(< ~counter~0 16)} is VALID [2022-04-08 14:34:42,240 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17551#true} {18030#(< ~counter~0 16)} #55#return; {18030#(< ~counter~0 16)} is VALID [2022-04-08 14:34:42,240 INFO L290 TraceCheckUtils]: 65: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 14:34:42,240 INFO L290 TraceCheckUtils]: 64: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 14:34:42,240 INFO L290 TraceCheckUtils]: 63: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 14:34:42,240 INFO L272 TraceCheckUtils]: 62: Hoare triple {18030#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 14:34:42,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {18030#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {18030#(< ~counter~0 16)} is VALID [2022-04-08 14:34:42,241 INFO L290 TraceCheckUtils]: 60: Hoare triple {18055#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18030#(< ~counter~0 16)} is VALID [2022-04-08 14:34:42,241 INFO L290 TraceCheckUtils]: 59: Hoare triple {18055#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {18055#(< ~counter~0 15)} is VALID [2022-04-08 14:34:42,241 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17551#true} {18055#(< ~counter~0 15)} #55#return; {18055#(< ~counter~0 15)} is VALID [2022-04-08 14:34:42,241 INFO L290 TraceCheckUtils]: 57: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 14:34:42,241 INFO L290 TraceCheckUtils]: 56: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 14:34:42,242 INFO L290 TraceCheckUtils]: 55: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 14:34:42,242 INFO L272 TraceCheckUtils]: 54: Hoare triple {18055#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 14:34:42,242 INFO L290 TraceCheckUtils]: 53: Hoare triple {18055#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {18055#(< ~counter~0 15)} is VALID [2022-04-08 14:34:42,242 INFO L290 TraceCheckUtils]: 52: Hoare triple {18080#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18055#(< ~counter~0 15)} is VALID [2022-04-08 14:34:42,243 INFO L290 TraceCheckUtils]: 51: Hoare triple {18080#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {18080#(< ~counter~0 14)} is VALID [2022-04-08 14:34:42,243 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17551#true} {18080#(< ~counter~0 14)} #55#return; {18080#(< ~counter~0 14)} is VALID [2022-04-08 14:34:42,243 INFO L290 TraceCheckUtils]: 49: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 14:34:42,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 14:34:42,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 14:34:42,243 INFO L272 TraceCheckUtils]: 46: Hoare triple {18080#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 14:34:42,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {18080#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {18080#(< ~counter~0 14)} is VALID [2022-04-08 14:34:42,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {18105#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18080#(< ~counter~0 14)} is VALID [2022-04-08 14:34:42,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {18105#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {18105#(< ~counter~0 13)} is VALID [2022-04-08 14:34:42,245 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17551#true} {18105#(< ~counter~0 13)} #55#return; {18105#(< ~counter~0 13)} is VALID [2022-04-08 14:34:42,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 14:34:42,245 INFO L290 TraceCheckUtils]: 40: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 14:34:42,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 14:34:42,245 INFO L272 TraceCheckUtils]: 38: Hoare triple {18105#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 14:34:42,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {18105#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {18105#(< ~counter~0 13)} is VALID [2022-04-08 14:34:42,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {17843#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18105#(< ~counter~0 13)} is VALID [2022-04-08 14:34:42,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {17843#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:42,247 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17551#true} {17843#(<= ~counter~0 11)} #55#return; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:42,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 14:34:42,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 14:34:42,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 14:34:42,247 INFO L272 TraceCheckUtils]: 30: Hoare triple {17843#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 14:34:42,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {17843#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:42,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {17818#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:42,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {17818#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:42,249 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17551#true} {17818#(<= ~counter~0 10)} #55#return; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:42,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 14:34:42,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 14:34:42,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 14:34:42,249 INFO L272 TraceCheckUtils]: 22: Hoare triple {17818#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 14:34:42,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {17818#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:42,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {17793#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:42,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {17793#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:42,250 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17551#true} {17793#(<= ~counter~0 9)} #55#return; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:42,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 14:34:42,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 14:34:42,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 14:34:42,251 INFO L272 TraceCheckUtils]: 14: Hoare triple {17793#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 14:34:42,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {17793#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:42,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {17768#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:42,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {17768#(<= ~counter~0 8)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:42,252 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17551#true} {17768#(<= ~counter~0 8)} #53#return; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:42,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 14:34:42,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 14:34:42,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 14:34:42,252 INFO L272 TraceCheckUtils]: 6: Hoare triple {17768#(<= ~counter~0 8)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {17551#true} is VALID [2022-04-08 14:34:42,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {17768#(<= ~counter~0 8)} 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; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:42,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {17768#(<= ~counter~0 8)} call #t~ret6 := main(); {17768#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:42,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17768#(<= ~counter~0 8)} {17551#true} #61#return; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:42,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {17768#(<= ~counter~0 8)} assume true; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:42,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {17551#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);~counter~0 := 0; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:42,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {17551#true} call ULTIMATE.init(); {17551#true} is VALID [2022-04-08 14:34:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 24 proven. 242 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 14:34:42,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:42,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459018447] [2022-04-08 14:34:42,255 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:42,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529865762] [2022-04-08 14:34:42,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529865762] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:34:42,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:34:42,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-08 14:34:42,255 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:42,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [375932460] [2022-04-08 14:34:42,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [375932460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:42,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:42,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 14:34:42,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332686037] [2022-04-08 14:34:42,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:42,256 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Word has length 111 [2022-04-08 14:34:42,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:42,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:34:42,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:42,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 14:34:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:42,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 14:34:42,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:34:42,343 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:34:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:42,762 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2022-04-08 14:34:42,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 14:34:42,762 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Word has length 111 [2022-04-08 14:34:42,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:34:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 126 transitions. [2022-04-08 14:34:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:34:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 126 transitions. [2022-04-08 14:34:42,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 126 transitions. [2022-04-08 14:34:42,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:42,835 INFO L225 Difference]: With dead ends: 126 [2022-04-08 14:34:42,835 INFO L226 Difference]: Without dead ends: 116 [2022-04-08 14:34:42,836 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=489, Invalid=701, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 14:34:42,836 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:42,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 147 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:34:42,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-08 14:34:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-08 14:34:42,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:42,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:34:42,940 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:34:42,941 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:34:42,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:42,942 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-04-08 14:34:42,942 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-08 14:34:42,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:42,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:42,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 116 states. [2022-04-08 14:34:42,943 INFO L87 Difference]: Start difference. First operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 116 states. [2022-04-08 14:34:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:42,944 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-04-08 14:34:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-08 14:34:42,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:42,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:42,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:42,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:34:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2022-04-08 14:34:42,946 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 111 [2022-04-08 14:34:42,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:42,946 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2022-04-08 14:34:42,946 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:34:42,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 118 transitions. [2022-04-08 14:34:43,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:43,188 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-08 14:34:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-08 14:34:43,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:43,189 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:43,206 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 14:34:43,389 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 14:34:43,390 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:43,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:43,390 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 21 times [2022-04-08 14:34:43,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:43,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1727430382] [2022-04-08 14:34:43,469 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:43,469 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:43,469 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 22 times [2022-04-08 14:34:43,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:43,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424985160] [2022-04-08 14:34:43,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:43,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:43,483 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:43,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [708270908] [2022-04-08 14:34:43,484 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:34:43,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:43,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:43,485 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 14:34:43,488 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 14:34:43,543 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:34:43,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:43,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 14:34:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:43,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:43,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {18978#true} call ULTIMATE.init(); {18978#true} is VALID [2022-04-08 14:34:43,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {18978#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);~counter~0 := 0; {18978#true} is VALID [2022-04-08 14:34:43,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 14:34:43,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18978#true} {18978#true} #61#return; {18978#true} is VALID [2022-04-08 14:34:43,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {18978#true} call #t~ret6 := main(); {18978#true} is VALID [2022-04-08 14:34:43,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {18978#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; {18978#true} is VALID [2022-04-08 14:34:43,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {18978#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {18978#true} is VALID [2022-04-08 14:34:43,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 14:34:43,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 14:34:43,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 14:34:43,907 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18978#true} {18978#true} #53#return; {18978#true} is VALID [2022-04-08 14:34:43,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {18978#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:43,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {19016#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:43,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {19016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:43,907 INFO L272 TraceCheckUtils]: 14: Hoare triple {19016#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 14:34:43,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 14:34:43,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 14:34:43,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 14:34:43,908 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18978#true} {19016#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:43,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {19016#(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 * ~y~0 * ~y~0 + ~x~0; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:34:43,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:34:43,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:34:43,909 INFO L272 TraceCheckUtils]: 22: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 14:34:43,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 14:34:43,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 14:34:43,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 14:34:43,909 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18978#true} {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:34:43,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {19041#(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 * ~y~0 * ~y~0 + ~x~0; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:34:43,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:34:43,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:34:43,910 INFO L272 TraceCheckUtils]: 30: Hoare triple {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 14:34:43,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 14:34:43,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 14:34:43,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 14:34:43,911 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18978#true} {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:34:43,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {19066#(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 * ~y~0 * ~y~0 + ~x~0; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:34:43,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {19091#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:34:43,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {19091#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:34:43,912 INFO L272 TraceCheckUtils]: 38: Hoare triple {19091#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 14:34:43,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 14:34:43,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 14:34:43,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 14:34:43,912 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18978#true} {19091#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:34:43,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {19091#(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 * ~y~0 * ~y~0 + ~x~0; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:34:43,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:34:43,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:34:43,913 INFO L272 TraceCheckUtils]: 46: Hoare triple {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 14:34:43,913 INFO L290 TraceCheckUtils]: 47: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 14:34:43,913 INFO L290 TraceCheckUtils]: 48: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 14:34:43,913 INFO L290 TraceCheckUtils]: 49: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 14:34:43,914 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18978#true} {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:34:43,914 INFO L290 TraceCheckUtils]: 51: Hoare triple {19116#(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 * ~y~0 * ~y~0 + ~x~0; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:43,914 INFO L290 TraceCheckUtils]: 52: Hoare triple {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:43,914 INFO L290 TraceCheckUtils]: 53: Hoare triple {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:43,915 INFO L272 TraceCheckUtils]: 54: Hoare triple {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 14:34:43,915 INFO L290 TraceCheckUtils]: 55: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 14:34:43,915 INFO L290 TraceCheckUtils]: 56: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 14:34:43,915 INFO L290 TraceCheckUtils]: 57: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 14:34:43,915 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18978#true} {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:43,915 INFO L290 TraceCheckUtils]: 59: Hoare triple {19141#(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 * ~y~0 * ~y~0 + ~x~0; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:43,916 INFO L290 TraceCheckUtils]: 60: Hoare triple {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:43,916 INFO L290 TraceCheckUtils]: 61: Hoare triple {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:43,916 INFO L272 TraceCheckUtils]: 62: Hoare triple {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 14:34:43,916 INFO L290 TraceCheckUtils]: 63: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 14:34:43,916 INFO L290 TraceCheckUtils]: 64: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 14:34:43,916 INFO L290 TraceCheckUtils]: 65: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 14:34:43,916 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18978#true} {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #55#return; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:34:43,917 INFO L290 TraceCheckUtils]: 67: Hoare triple {19166#(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 * ~y~0 * ~y~0 + ~x~0; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:43,917 INFO L290 TraceCheckUtils]: 68: Hoare triple {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:43,917 INFO L290 TraceCheckUtils]: 69: Hoare triple {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:43,917 INFO L272 TraceCheckUtils]: 70: Hoare triple {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 14:34:43,917 INFO L290 TraceCheckUtils]: 71: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 14:34:43,917 INFO L290 TraceCheckUtils]: 72: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 14:34:43,918 INFO L290 TraceCheckUtils]: 73: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 14:34:43,918 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18978#true} {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:43,918 INFO L290 TraceCheckUtils]: 75: Hoare triple {19191#(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 * ~y~0 * ~y~0 + ~x~0; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 14:34:43,918 INFO L290 TraceCheckUtils]: 76: Hoare triple {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 14:34:43,919 INFO L290 TraceCheckUtils]: 77: Hoare triple {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(#t~post5 < 20);havoc #t~post5; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 14:34:43,919 INFO L272 TraceCheckUtils]: 78: Hoare triple {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 14:34:43,919 INFO L290 TraceCheckUtils]: 79: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 14:34:43,919 INFO L290 TraceCheckUtils]: 80: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 14:34:43,919 INFO L290 TraceCheckUtils]: 81: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 14:34:43,919 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {18978#true} {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #55#return; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 14:34:43,920 INFO L290 TraceCheckUtils]: 83: Hoare triple {19216#(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 * ~y~0 * ~y~0 + ~x~0; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 14:34:43,920 INFO L290 TraceCheckUtils]: 84: Hoare triple {19241#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 14:34:43,920 INFO L290 TraceCheckUtils]: 85: Hoare triple {19241#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 14:34:43,920 INFO L272 TraceCheckUtils]: 86: Hoare triple {19241#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 14:34:43,920 INFO L290 TraceCheckUtils]: 87: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 14:34:43,920 INFO L290 TraceCheckUtils]: 88: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 14:34:43,920 INFO L290 TraceCheckUtils]: 89: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 14:34:43,921 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {18978#true} {19241#(and (= main_~y~0 9) (= main_~c~0 9))} #55#return; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 14:34:43,921 INFO L290 TraceCheckUtils]: 91: Hoare triple {19241#(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 * ~y~0 * ~y~0 + ~x~0; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 14:34:43,921 INFO L290 TraceCheckUtils]: 92: Hoare triple {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 14:34:43,921 INFO L290 TraceCheckUtils]: 93: Hoare triple {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(#t~post5 < 20);havoc #t~post5; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 14:34:43,922 INFO L272 TraceCheckUtils]: 94: Hoare triple {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 14:34:43,922 INFO L290 TraceCheckUtils]: 95: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 14:34:43,922 INFO L290 TraceCheckUtils]: 96: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 14:34:43,922 INFO L290 TraceCheckUtils]: 97: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 14:34:43,922 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {18978#true} {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #55#return; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 14:34:43,922 INFO L290 TraceCheckUtils]: 99: Hoare triple {19266#(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 * ~y~0 * ~y~0 + ~x~0; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 14:34:43,923 INFO L290 TraceCheckUtils]: 100: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 14:34:43,923 INFO L290 TraceCheckUtils]: 101: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !!(#t~post5 < 20);havoc #t~post5; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 14:34:43,923 INFO L272 TraceCheckUtils]: 102: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 14:34:43,923 INFO L290 TraceCheckUtils]: 103: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 14:34:43,923 INFO L290 TraceCheckUtils]: 104: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 14:34:43,923 INFO L290 TraceCheckUtils]: 105: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 14:34:43,923 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {18978#true} {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} #55#return; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 14:34:43,924 INFO L290 TraceCheckUtils]: 107: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !(~c~0 < ~k~0); {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-08 14:34:43,924 INFO L272 TraceCheckUtils]: 108: Hoare triple {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 14:34:43,924 INFO L290 TraceCheckUtils]: 109: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 14:34:43,924 INFO L290 TraceCheckUtils]: 110: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 14:34:43,924 INFO L290 TraceCheckUtils]: 111: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 14:34:43,925 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {18978#true} {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} #57#return; {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-08 14:34:43,925 INFO L272 TraceCheckUtils]: 113: Hoare triple {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {19335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:34:43,925 INFO L290 TraceCheckUtils]: 114: Hoare triple {19335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:34:43,925 INFO L290 TraceCheckUtils]: 115: Hoare triple {19339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18979#false} is VALID [2022-04-08 14:34:43,925 INFO L290 TraceCheckUtils]: 116: Hoare triple {18979#false} assume !false; {18979#false} is VALID [2022-04-08 14:34:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 14:34:43,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:44,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:44,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424985160] [2022-04-08 14:34:44,199 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:44,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708270908] [2022-04-08 14:34:44,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708270908] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:34:44,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:34:44,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-08 14:34:44,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:44,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1727430382] [2022-04-08 14:34:44,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1727430382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:44,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:44,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 14:34:44,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181881409] [2022-04-08 14:34:44,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:44,201 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 117 [2022-04-08 14:34:44,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:44,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 14:34:44,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:44,263 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 14:34:44,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:44,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 14:34:44,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-08 14:34:44,264 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 14:34:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:45,958 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2022-04-08 14:34:45,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 14:34:45,959 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 117 [2022-04-08 14:34:45,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 14:34:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-08 14:34:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 14:34:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-08 14:34:45,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2022-04-08 14:34:46,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:46,040 INFO L225 Difference]: With dead ends: 124 [2022-04-08 14:34:46,040 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 14:34:46,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-08 14:34:46,041 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:46,041 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 703 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 14:34:46,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 14:34:46,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-08 14:34:46,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:46,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:34:46,203 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:34:46,204 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:34:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:46,205 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-08 14:34:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-08 14:34:46,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:46,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:46,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 118 states. [2022-04-08 14:34:46,206 INFO L87 Difference]: Start difference. First operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 118 states. [2022-04-08 14:34:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:46,207 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-08 14:34:46,207 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-08 14:34:46,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:46,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:46,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:46,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:34:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2022-04-08 14:34:46,209 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 117 [2022-04-08 14:34:46,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:46,209 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2022-04-08 14:34:46,209 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 14:34:46,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 121 transitions. [2022-04-08 14:34:46,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-08 14:34:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-08 14:34:46,452 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:46,452 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:46,469 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 14:34:46,652 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 14:34:46,653 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:46,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:46,653 INFO L85 PathProgramCache]: Analyzing trace with hash -738576212, now seen corresponding path program 21 times [2022-04-08 14:34:46,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:46,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [643428491] [2022-04-08 14:34:46,751 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:46,751 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:46,751 INFO L85 PathProgramCache]: Analyzing trace with hash -738576212, now seen corresponding path program 22 times [2022-04-08 14:34:46,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:46,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468991440] [2022-04-08 14:34:46,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:46,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:46,765 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:46,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614685934] [2022-04-08 14:34:46,765 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:34:46,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:46,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:46,781 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 14:34:46,782 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 14:34:46,843 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:34:46,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:46,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 14:34:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:46,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:47,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {20129#true} call ULTIMATE.init(); {20129#true} is VALID [2022-04-08 14:34:47,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {20129#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);~counter~0 := 0; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:47,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {20137#(<= ~counter~0 0)} assume true; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:47,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20137#(<= ~counter~0 0)} {20129#true} #61#return; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:47,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {20137#(<= ~counter~0 0)} call #t~ret6 := main(); {20137#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:47,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {20137#(<= ~counter~0 0)} 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; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:47,525 INFO L272 TraceCheckUtils]: 6: Hoare triple {20137#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {20137#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:47,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {20137#(<= ~counter~0 0)} ~cond := #in~cond; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:47,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {20137#(<= ~counter~0 0)} assume !(0 == ~cond); {20137#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:47,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {20137#(<= ~counter~0 0)} assume true; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:47,526 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20137#(<= ~counter~0 0)} {20137#(<= ~counter~0 0)} #53#return; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:47,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {20137#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:47,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {20137#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20171#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:47,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {20171#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {20171#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:47,535 INFO L272 TraceCheckUtils]: 14: Hoare triple {20171#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20171#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:47,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {20171#(<= ~counter~0 1)} ~cond := #in~cond; {20171#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:47,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {20171#(<= ~counter~0 1)} assume !(0 == ~cond); {20171#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:47,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {20171#(<= ~counter~0 1)} assume true; {20171#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:47,536 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20171#(<= ~counter~0 1)} {20171#(<= ~counter~0 1)} #55#return; {20171#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:47,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {20171#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20171#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:47,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {20171#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20196#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:47,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {20196#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {20196#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:47,538 INFO L272 TraceCheckUtils]: 22: Hoare triple {20196#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20196#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:47,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {20196#(<= ~counter~0 2)} ~cond := #in~cond; {20196#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:47,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {20196#(<= ~counter~0 2)} assume !(0 == ~cond); {20196#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:47,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {20196#(<= ~counter~0 2)} assume true; {20196#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:47,539 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20196#(<= ~counter~0 2)} {20196#(<= ~counter~0 2)} #55#return; {20196#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:47,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {20196#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20196#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:47,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {20196#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20221#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:47,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {20221#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {20221#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:47,541 INFO L272 TraceCheckUtils]: 30: Hoare triple {20221#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20221#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:47,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {20221#(<= ~counter~0 3)} ~cond := #in~cond; {20221#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:47,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {20221#(<= ~counter~0 3)} assume !(0 == ~cond); {20221#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:47,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {20221#(<= ~counter~0 3)} assume true; {20221#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:47,542 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20221#(<= ~counter~0 3)} {20221#(<= ~counter~0 3)} #55#return; {20221#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:47,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {20221#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20221#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:47,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {20221#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20246#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:47,544 INFO L290 TraceCheckUtils]: 37: Hoare triple {20246#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {20246#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:47,544 INFO L272 TraceCheckUtils]: 38: Hoare triple {20246#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20246#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:47,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {20246#(<= ~counter~0 4)} ~cond := #in~cond; {20246#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:47,545 INFO L290 TraceCheckUtils]: 40: Hoare triple {20246#(<= ~counter~0 4)} assume !(0 == ~cond); {20246#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:47,545 INFO L290 TraceCheckUtils]: 41: Hoare triple {20246#(<= ~counter~0 4)} assume true; {20246#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:47,546 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20246#(<= ~counter~0 4)} {20246#(<= ~counter~0 4)} #55#return; {20246#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:47,546 INFO L290 TraceCheckUtils]: 43: Hoare triple {20246#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20246#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:47,547 INFO L290 TraceCheckUtils]: 44: Hoare triple {20246#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20271#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:47,547 INFO L290 TraceCheckUtils]: 45: Hoare triple {20271#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {20271#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:47,548 INFO L272 TraceCheckUtils]: 46: Hoare triple {20271#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20271#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:47,549 INFO L290 TraceCheckUtils]: 47: Hoare triple {20271#(<= ~counter~0 5)} ~cond := #in~cond; {20271#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:47,549 INFO L290 TraceCheckUtils]: 48: Hoare triple {20271#(<= ~counter~0 5)} assume !(0 == ~cond); {20271#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:47,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {20271#(<= ~counter~0 5)} assume true; {20271#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:47,560 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20271#(<= ~counter~0 5)} {20271#(<= ~counter~0 5)} #55#return; {20271#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:47,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {20271#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20271#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:47,561 INFO L290 TraceCheckUtils]: 52: Hoare triple {20271#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20296#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:47,561 INFO L290 TraceCheckUtils]: 53: Hoare triple {20296#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {20296#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:47,562 INFO L272 TraceCheckUtils]: 54: Hoare triple {20296#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20296#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:47,562 INFO L290 TraceCheckUtils]: 55: Hoare triple {20296#(<= ~counter~0 6)} ~cond := #in~cond; {20296#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:47,562 INFO L290 TraceCheckUtils]: 56: Hoare triple {20296#(<= ~counter~0 6)} assume !(0 == ~cond); {20296#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:47,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {20296#(<= ~counter~0 6)} assume true; {20296#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:47,563 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20296#(<= ~counter~0 6)} {20296#(<= ~counter~0 6)} #55#return; {20296#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:47,563 INFO L290 TraceCheckUtils]: 59: Hoare triple {20296#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20296#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:47,564 INFO L290 TraceCheckUtils]: 60: Hoare triple {20296#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:47,564 INFO L290 TraceCheckUtils]: 61: Hoare triple {20321#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:47,564 INFO L272 TraceCheckUtils]: 62: Hoare triple {20321#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20321#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:47,564 INFO L290 TraceCheckUtils]: 63: Hoare triple {20321#(<= ~counter~0 7)} ~cond := #in~cond; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:47,565 INFO L290 TraceCheckUtils]: 64: Hoare triple {20321#(<= ~counter~0 7)} assume !(0 == ~cond); {20321#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:47,565 INFO L290 TraceCheckUtils]: 65: Hoare triple {20321#(<= ~counter~0 7)} assume true; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:47,565 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20321#(<= ~counter~0 7)} {20321#(<= ~counter~0 7)} #55#return; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:47,565 INFO L290 TraceCheckUtils]: 67: Hoare triple {20321#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:47,566 INFO L290 TraceCheckUtils]: 68: Hoare triple {20321#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:47,566 INFO L290 TraceCheckUtils]: 69: Hoare triple {20346#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:47,566 INFO L272 TraceCheckUtils]: 70: Hoare triple {20346#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20346#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:47,567 INFO L290 TraceCheckUtils]: 71: Hoare triple {20346#(<= ~counter~0 8)} ~cond := #in~cond; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:47,567 INFO L290 TraceCheckUtils]: 72: Hoare triple {20346#(<= ~counter~0 8)} assume !(0 == ~cond); {20346#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:47,567 INFO L290 TraceCheckUtils]: 73: Hoare triple {20346#(<= ~counter~0 8)} assume true; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:47,568 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20346#(<= ~counter~0 8)} {20346#(<= ~counter~0 8)} #55#return; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:47,568 INFO L290 TraceCheckUtils]: 75: Hoare triple {20346#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:47,568 INFO L290 TraceCheckUtils]: 76: Hoare triple {20346#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:47,568 INFO L290 TraceCheckUtils]: 77: Hoare triple {20371#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:47,569 INFO L272 TraceCheckUtils]: 78: Hoare triple {20371#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20371#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:47,569 INFO L290 TraceCheckUtils]: 79: Hoare triple {20371#(<= ~counter~0 9)} ~cond := #in~cond; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:47,569 INFO L290 TraceCheckUtils]: 80: Hoare triple {20371#(<= ~counter~0 9)} assume !(0 == ~cond); {20371#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:47,570 INFO L290 TraceCheckUtils]: 81: Hoare triple {20371#(<= ~counter~0 9)} assume true; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:47,570 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {20371#(<= ~counter~0 9)} {20371#(<= ~counter~0 9)} #55#return; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:47,570 INFO L290 TraceCheckUtils]: 83: Hoare triple {20371#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:47,571 INFO L290 TraceCheckUtils]: 84: Hoare triple {20371#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:47,571 INFO L290 TraceCheckUtils]: 85: Hoare triple {20396#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:47,571 INFO L272 TraceCheckUtils]: 86: Hoare triple {20396#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20396#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:47,572 INFO L290 TraceCheckUtils]: 87: Hoare triple {20396#(<= ~counter~0 10)} ~cond := #in~cond; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:47,572 INFO L290 TraceCheckUtils]: 88: Hoare triple {20396#(<= ~counter~0 10)} assume !(0 == ~cond); {20396#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:47,572 INFO L290 TraceCheckUtils]: 89: Hoare triple {20396#(<= ~counter~0 10)} assume true; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:47,572 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20396#(<= ~counter~0 10)} {20396#(<= ~counter~0 10)} #55#return; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:47,573 INFO L290 TraceCheckUtils]: 91: Hoare triple {20396#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:47,573 INFO L290 TraceCheckUtils]: 92: Hoare triple {20396#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:47,573 INFO L290 TraceCheckUtils]: 93: Hoare triple {20421#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:47,574 INFO L272 TraceCheckUtils]: 94: Hoare triple {20421#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20421#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:47,574 INFO L290 TraceCheckUtils]: 95: Hoare triple {20421#(<= ~counter~0 11)} ~cond := #in~cond; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:47,574 INFO L290 TraceCheckUtils]: 96: Hoare triple {20421#(<= ~counter~0 11)} assume !(0 == ~cond); {20421#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:47,574 INFO L290 TraceCheckUtils]: 97: Hoare triple {20421#(<= ~counter~0 11)} assume true; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:47,575 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20421#(<= ~counter~0 11)} {20421#(<= ~counter~0 11)} #55#return; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:47,575 INFO L290 TraceCheckUtils]: 99: Hoare triple {20421#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:47,575 INFO L290 TraceCheckUtils]: 100: Hoare triple {20421#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:47,576 INFO L290 TraceCheckUtils]: 101: Hoare triple {20446#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:47,576 INFO L272 TraceCheckUtils]: 102: Hoare triple {20446#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20446#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:47,576 INFO L290 TraceCheckUtils]: 103: Hoare triple {20446#(<= ~counter~0 12)} ~cond := #in~cond; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:47,576 INFO L290 TraceCheckUtils]: 104: Hoare triple {20446#(<= ~counter~0 12)} assume !(0 == ~cond); {20446#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:47,577 INFO L290 TraceCheckUtils]: 105: Hoare triple {20446#(<= ~counter~0 12)} assume true; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:47,577 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20446#(<= ~counter~0 12)} {20446#(<= ~counter~0 12)} #55#return; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:47,577 INFO L290 TraceCheckUtils]: 107: Hoare triple {20446#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:47,577 INFO L290 TraceCheckUtils]: 108: Hoare triple {20446#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20471#(<= |main_#t~post5| 12)} is VALID [2022-04-08 14:34:47,578 INFO L290 TraceCheckUtils]: 109: Hoare triple {20471#(<= |main_#t~post5| 12)} assume !(#t~post5 < 20);havoc #t~post5; {20130#false} is VALID [2022-04-08 14:34:47,578 INFO L272 TraceCheckUtils]: 110: Hoare triple {20130#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20130#false} is VALID [2022-04-08 14:34:47,578 INFO L290 TraceCheckUtils]: 111: Hoare triple {20130#false} ~cond := #in~cond; {20130#false} is VALID [2022-04-08 14:34:47,578 INFO L290 TraceCheckUtils]: 112: Hoare triple {20130#false} assume !(0 == ~cond); {20130#false} is VALID [2022-04-08 14:34:47,578 INFO L290 TraceCheckUtils]: 113: Hoare triple {20130#false} assume true; {20130#false} is VALID [2022-04-08 14:34:47,578 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20130#false} {20130#false} #57#return; {20130#false} is VALID [2022-04-08 14:34:47,578 INFO L272 TraceCheckUtils]: 115: Hoare triple {20130#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {20130#false} is VALID [2022-04-08 14:34:47,578 INFO L290 TraceCheckUtils]: 116: Hoare triple {20130#false} ~cond := #in~cond; {20130#false} is VALID [2022-04-08 14:34:47,578 INFO L290 TraceCheckUtils]: 117: Hoare triple {20130#false} assume 0 == ~cond; {20130#false} is VALID [2022-04-08 14:34:47,578 INFO L290 TraceCheckUtils]: 118: Hoare triple {20130#false} assume !false; {20130#false} is VALID [2022-04-08 14:34:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 72 proven. 552 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:34:47,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:48,163 INFO L290 TraceCheckUtils]: 118: Hoare triple {20130#false} assume !false; {20130#false} is VALID [2022-04-08 14:34:48,163 INFO L290 TraceCheckUtils]: 117: Hoare triple {20130#false} assume 0 == ~cond; {20130#false} is VALID [2022-04-08 14:34:48,163 INFO L290 TraceCheckUtils]: 116: Hoare triple {20130#false} ~cond := #in~cond; {20130#false} is VALID [2022-04-08 14:34:48,163 INFO L272 TraceCheckUtils]: 115: Hoare triple {20130#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {20130#false} is VALID [2022-04-08 14:34:48,163 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20129#true} {20130#false} #57#return; {20130#false} is VALID [2022-04-08 14:34:48,163 INFO L290 TraceCheckUtils]: 113: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 14:34:48,164 INFO L290 TraceCheckUtils]: 112: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 14:34:48,164 INFO L290 TraceCheckUtils]: 111: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 14:34:48,164 INFO L272 TraceCheckUtils]: 110: Hoare triple {20130#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 14:34:48,164 INFO L290 TraceCheckUtils]: 109: Hoare triple {20529#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {20130#false} is VALID [2022-04-08 14:34:48,164 INFO L290 TraceCheckUtils]: 108: Hoare triple {20533#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20529#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:34:48,164 INFO L290 TraceCheckUtils]: 107: Hoare triple {20533#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20533#(< ~counter~0 20)} is VALID [2022-04-08 14:34:48,165 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20129#true} {20533#(< ~counter~0 20)} #55#return; {20533#(< ~counter~0 20)} is VALID [2022-04-08 14:34:48,165 INFO L290 TraceCheckUtils]: 105: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 14:34:48,165 INFO L290 TraceCheckUtils]: 104: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 14:34:48,165 INFO L290 TraceCheckUtils]: 103: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 14:34:48,165 INFO L272 TraceCheckUtils]: 102: Hoare triple {20533#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 14:34:48,165 INFO L290 TraceCheckUtils]: 101: Hoare triple {20533#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {20533#(< ~counter~0 20)} is VALID [2022-04-08 14:34:48,166 INFO L290 TraceCheckUtils]: 100: Hoare triple {20558#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20533#(< ~counter~0 20)} is VALID [2022-04-08 14:34:48,167 INFO L290 TraceCheckUtils]: 99: Hoare triple {20558#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20558#(< ~counter~0 19)} is VALID [2022-04-08 14:34:48,167 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20129#true} {20558#(< ~counter~0 19)} #55#return; {20558#(< ~counter~0 19)} is VALID [2022-04-08 14:34:48,167 INFO L290 TraceCheckUtils]: 97: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 14:34:48,167 INFO L290 TraceCheckUtils]: 96: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 14:34:48,167 INFO L290 TraceCheckUtils]: 95: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 14:34:48,167 INFO L272 TraceCheckUtils]: 94: Hoare triple {20558#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 14:34:48,168 INFO L290 TraceCheckUtils]: 93: Hoare triple {20558#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {20558#(< ~counter~0 19)} is VALID [2022-04-08 14:34:48,168 INFO L290 TraceCheckUtils]: 92: Hoare triple {20583#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20558#(< ~counter~0 19)} is VALID [2022-04-08 14:34:48,168 INFO L290 TraceCheckUtils]: 91: Hoare triple {20583#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20583#(< ~counter~0 18)} is VALID [2022-04-08 14:34:48,169 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20129#true} {20583#(< ~counter~0 18)} #55#return; {20583#(< ~counter~0 18)} is VALID [2022-04-08 14:34:48,169 INFO L290 TraceCheckUtils]: 89: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 14:34:48,169 INFO L290 TraceCheckUtils]: 88: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 14:34:48,169 INFO L290 TraceCheckUtils]: 87: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 14:34:48,169 INFO L272 TraceCheckUtils]: 86: Hoare triple {20583#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 14:34:48,169 INFO L290 TraceCheckUtils]: 85: Hoare triple {20583#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {20583#(< ~counter~0 18)} is VALID [2022-04-08 14:34:48,170 INFO L290 TraceCheckUtils]: 84: Hoare triple {20608#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20583#(< ~counter~0 18)} is VALID [2022-04-08 14:34:48,170 INFO L290 TraceCheckUtils]: 83: Hoare triple {20608#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20608#(< ~counter~0 17)} is VALID [2022-04-08 14:34:48,170 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {20129#true} {20608#(< ~counter~0 17)} #55#return; {20608#(< ~counter~0 17)} is VALID [2022-04-08 14:34:48,171 INFO L290 TraceCheckUtils]: 81: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 14:34:48,171 INFO L290 TraceCheckUtils]: 80: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 14:34:48,171 INFO L290 TraceCheckUtils]: 79: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 14:34:48,171 INFO L272 TraceCheckUtils]: 78: Hoare triple {20608#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 14:34:48,171 INFO L290 TraceCheckUtils]: 77: Hoare triple {20608#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {20608#(< ~counter~0 17)} is VALID [2022-04-08 14:34:48,172 INFO L290 TraceCheckUtils]: 76: Hoare triple {20633#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20608#(< ~counter~0 17)} is VALID [2022-04-08 14:34:48,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {20633#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20633#(< ~counter~0 16)} is VALID [2022-04-08 14:34:48,172 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20129#true} {20633#(< ~counter~0 16)} #55#return; {20633#(< ~counter~0 16)} is VALID [2022-04-08 14:34:48,172 INFO L290 TraceCheckUtils]: 73: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 14:34:48,172 INFO L290 TraceCheckUtils]: 72: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 14:34:48,172 INFO L290 TraceCheckUtils]: 71: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 14:34:48,173 INFO L272 TraceCheckUtils]: 70: Hoare triple {20633#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 14:34:48,173 INFO L290 TraceCheckUtils]: 69: Hoare triple {20633#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {20633#(< ~counter~0 16)} is VALID [2022-04-08 14:34:48,173 INFO L290 TraceCheckUtils]: 68: Hoare triple {20658#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20633#(< ~counter~0 16)} is VALID [2022-04-08 14:34:48,174 INFO L290 TraceCheckUtils]: 67: Hoare triple {20658#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20658#(< ~counter~0 15)} is VALID [2022-04-08 14:34:48,174 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20129#true} {20658#(< ~counter~0 15)} #55#return; {20658#(< ~counter~0 15)} is VALID [2022-04-08 14:34:48,174 INFO L290 TraceCheckUtils]: 65: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 14:34:48,174 INFO L290 TraceCheckUtils]: 64: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 14:34:48,174 INFO L290 TraceCheckUtils]: 63: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 14:34:48,174 INFO L272 TraceCheckUtils]: 62: Hoare triple {20658#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 14:34:48,174 INFO L290 TraceCheckUtils]: 61: Hoare triple {20658#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {20658#(< ~counter~0 15)} is VALID [2022-04-08 14:34:48,175 INFO L290 TraceCheckUtils]: 60: Hoare triple {20683#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20658#(< ~counter~0 15)} is VALID [2022-04-08 14:34:48,175 INFO L290 TraceCheckUtils]: 59: Hoare triple {20683#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20683#(< ~counter~0 14)} is VALID [2022-04-08 14:34:48,176 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20129#true} {20683#(< ~counter~0 14)} #55#return; {20683#(< ~counter~0 14)} is VALID [2022-04-08 14:34:48,176 INFO L290 TraceCheckUtils]: 57: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 14:34:48,176 INFO L290 TraceCheckUtils]: 56: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 14:34:48,176 INFO L290 TraceCheckUtils]: 55: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 14:34:48,176 INFO L272 TraceCheckUtils]: 54: Hoare triple {20683#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 14:34:48,176 INFO L290 TraceCheckUtils]: 53: Hoare triple {20683#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {20683#(< ~counter~0 14)} is VALID [2022-04-08 14:34:48,177 INFO L290 TraceCheckUtils]: 52: Hoare triple {20446#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20683#(< ~counter~0 14)} is VALID [2022-04-08 14:34:48,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {20446#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:48,177 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20129#true} {20446#(<= ~counter~0 12)} #55#return; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:48,177 INFO L290 TraceCheckUtils]: 49: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 14:34:48,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 14:34:48,178 INFO L290 TraceCheckUtils]: 47: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 14:34:48,178 INFO L272 TraceCheckUtils]: 46: Hoare triple {20446#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 14:34:48,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {20446#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:48,178 INFO L290 TraceCheckUtils]: 44: Hoare triple {20421#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 14:34:48,179 INFO L290 TraceCheckUtils]: 43: Hoare triple {20421#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:48,179 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20129#true} {20421#(<= ~counter~0 11)} #55#return; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:48,179 INFO L290 TraceCheckUtils]: 41: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 14:34:48,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 14:34:48,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 14:34:48,179 INFO L272 TraceCheckUtils]: 38: Hoare triple {20421#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 14:34:48,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {20421#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:48,180 INFO L290 TraceCheckUtils]: 36: Hoare triple {20396#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 14:34:48,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {20396#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:48,181 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20129#true} {20396#(<= ~counter~0 10)} #55#return; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:48,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 14:34:48,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 14:34:48,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 14:34:48,181 INFO L272 TraceCheckUtils]: 30: Hoare triple {20396#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 14:34:48,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {20396#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:48,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {20371#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 14:34:48,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {20371#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:48,182 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20129#true} {20371#(<= ~counter~0 9)} #55#return; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:48,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 14:34:48,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 14:34:48,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 14:34:48,183 INFO L272 TraceCheckUtils]: 22: Hoare triple {20371#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 14:34:48,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {20371#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:48,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {20346#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:48,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {20346#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:48,184 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20129#true} {20346#(<= ~counter~0 8)} #55#return; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:48,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 14:34:48,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 14:34:48,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 14:34:48,184 INFO L272 TraceCheckUtils]: 14: Hoare triple {20346#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 14:34:48,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {20346#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:48,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {20321#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:48,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {20321#(<= ~counter~0 7)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:48,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20129#true} {20321#(<= ~counter~0 7)} #53#return; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:48,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 14:34:48,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 14:34:48,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 14:34:48,186 INFO L272 TraceCheckUtils]: 6: Hoare triple {20321#(<= ~counter~0 7)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {20129#true} is VALID [2022-04-08 14:34:48,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {20321#(<= ~counter~0 7)} 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; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:48,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {20321#(<= ~counter~0 7)} call #t~ret6 := main(); {20321#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:48,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20321#(<= ~counter~0 7)} {20129#true} #61#return; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:48,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {20321#(<= ~counter~0 7)} assume true; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:48,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {20129#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);~counter~0 := 0; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:48,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {20129#true} call ULTIMATE.init(); {20129#true} is VALID [2022-04-08 14:34:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 26 proven. 288 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 14:34:48,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:48,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468991440] [2022-04-08 14:34:48,188 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:48,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614685934] [2022-04-08 14:34:48,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614685934] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:34:48,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:34:48,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-08 14:34:48,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:48,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [643428491] [2022-04-08 14:34:48,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [643428491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:48,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:48,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 14:34:48,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733989065] [2022-04-08 14:34:48,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:48,189 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Word has length 119 [2022-04-08 14:34:48,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:48,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:34:48,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:48,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 14:34:48,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:48,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 14:34:48,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:34:48,263 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:34:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:48,708 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2022-04-08 14:34:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 14:34:48,709 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Word has length 119 [2022-04-08 14:34:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:34:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 134 transitions. [2022-04-08 14:34:48,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:34:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 134 transitions. [2022-04-08 14:34:48,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 134 transitions. [2022-04-08 14:34:48,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:48,852 INFO L225 Difference]: With dead ends: 134 [2022-04-08 14:34:48,852 INFO L226 Difference]: Without dead ends: 124 [2022-04-08 14:34:48,853 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=512, Invalid=748, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 14:34:48,853 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:48,853 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 162 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:34:48,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-08 14:34:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-04-08 14:34:48,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:48,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:34:48,994 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:34:48,994 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:34:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:48,996 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2022-04-08 14:34:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-08 14:34:48,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:48,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:48,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 124 states. [2022-04-08 14:34:48,997 INFO L87 Difference]: Start difference. First operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 124 states. [2022-04-08 14:34:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:48,998 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2022-04-08 14:34:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-08 14:34:48,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:48,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:48,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:48,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:34:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2022-04-08 14:34:49,000 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 119 [2022-04-08 14:34:49,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:49,000 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2022-04-08 14:34:49,000 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:34:49,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 126 transitions. [2022-04-08 14:34:49,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-08 14:34:49,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-08 14:34:49,287 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:49,287 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:49,303 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 14:34:49,487 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 14:34:49,487 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:49,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:49,488 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 23 times [2022-04-08 14:34:49,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:49,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [956462790] [2022-04-08 14:34:49,551 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:49,551 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 24 times [2022-04-08 14:34:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:49,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41140973] [2022-04-08 14:34:49,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:49,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:49,581 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:49,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [127605021] [2022-04-08 14:34:49,581 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:34:49,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:49,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:49,596 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 14:34:49,597 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 14:44:50,742 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 14:44:50,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:44:50,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-08 14:44:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:44:50,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:44:51,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {21654#true} call ULTIMATE.init(); {21654#true} is VALID [2022-04-08 14:44:51,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {21654#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);~counter~0 := 0; {21654#true} is VALID [2022-04-08 14:44:51,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21654#true} {21654#true} #61#return; {21654#true} is VALID [2022-04-08 14:44:51,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {21654#true} call #t~ret6 := main(); {21654#true} is VALID [2022-04-08 14:44:51,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {21654#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; {21654#true} is VALID [2022-04-08 14:44:51,539 INFO L272 TraceCheckUtils]: 6: Hoare triple {21654#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {21654#true} is VALID [2022-04-08 14:44:51,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 14:44:51,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 14:44:51,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21654#true} {21654#true} #53#return; {21654#true} is VALID [2022-04-08 14:44:51,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {21654#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {21692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:44:51,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {21692#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:44:51,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {21692#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {21692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:44:51,540 INFO L272 TraceCheckUtils]: 14: Hoare triple {21692#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 14:44:51,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 14:44:51,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 14:44:51,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,541 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {21654#true} {21692#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {21692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:44:51,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {21692#(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 * ~y~0 * ~y~0 + ~x~0; {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:44:51,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:44:51,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:44:51,542 INFO L272 TraceCheckUtils]: 22: Hoare triple {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 14:44:51,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 14:44:51,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 14:44:51,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,543 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21654#true} {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:44:51,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {21717#(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 * ~y~0 * ~y~0 + ~x~0; {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 14:44:51,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 14:44:51,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 14:44:51,553 INFO L272 TraceCheckUtils]: 30: Hoare triple {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 14:44:51,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 14:44:51,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 14:44:51,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,554 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {21654#true} {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #55#return; {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 14:44:51,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {21742#(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 * ~y~0 * ~y~0 + ~x~0; {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:44:51,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:44:51,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:44:51,555 INFO L272 TraceCheckUtils]: 38: Hoare triple {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 14:44:51,555 INFO L290 TraceCheckUtils]: 39: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 14:44:51,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 14:44:51,555 INFO L290 TraceCheckUtils]: 41: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,556 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {21654#true} {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:44:51,556 INFO L290 TraceCheckUtils]: 43: Hoare triple {21767#(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 * ~y~0 * ~y~0 + ~x~0; {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:44:51,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:44:51,557 INFO L290 TraceCheckUtils]: 45: Hoare triple {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:44:51,557 INFO L272 TraceCheckUtils]: 46: Hoare triple {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 14:44:51,557 INFO L290 TraceCheckUtils]: 47: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 14:44:51,557 INFO L290 TraceCheckUtils]: 48: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 14:44:51,557 INFO L290 TraceCheckUtils]: 49: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,558 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21654#true} {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #55#return; {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:44:51,558 INFO L290 TraceCheckUtils]: 51: Hoare triple {21792#(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 * ~y~0 * ~y~0 + ~x~0; {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:44:51,559 INFO L290 TraceCheckUtils]: 52: Hoare triple {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:44:51,559 INFO L290 TraceCheckUtils]: 53: Hoare triple {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 20);havoc #t~post5; {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:44:51,559 INFO L272 TraceCheckUtils]: 54: Hoare triple {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 14:44:51,559 INFO L290 TraceCheckUtils]: 55: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 14:44:51,560 INFO L290 TraceCheckUtils]: 56: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 14:44:51,560 INFO L290 TraceCheckUtils]: 57: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,560 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {21654#true} {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:44:51,561 INFO L290 TraceCheckUtils]: 59: Hoare triple {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< 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 * ~y~0 * ~y~0 + ~x~0; {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:44:51,562 INFO L290 TraceCheckUtils]: 60: Hoare triple {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:44:51,562 INFO L290 TraceCheckUtils]: 61: Hoare triple {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:44:51,562 INFO L272 TraceCheckUtils]: 62: Hoare triple {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 14:44:51,563 INFO L290 TraceCheckUtils]: 63: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 14:44:51,563 INFO L290 TraceCheckUtils]: 64: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 14:44:51,563 INFO L290 TraceCheckUtils]: 65: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,563 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {21654#true} {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} #55#return; {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:44:51,564 INFO L290 TraceCheckUtils]: 67: Hoare triple {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 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 * ~y~0 * ~y~0 + ~x~0; {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 14:44:51,565 INFO L290 TraceCheckUtils]: 68: Hoare triple {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 14:44:51,565 INFO L290 TraceCheckUtils]: 69: Hoare triple {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 14:44:51,565 INFO L272 TraceCheckUtils]: 70: Hoare triple {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 14:44:51,565 INFO L290 TraceCheckUtils]: 71: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 14:44:51,565 INFO L290 TraceCheckUtils]: 72: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 14:44:51,565 INFO L290 TraceCheckUtils]: 73: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,566 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {21654#true} {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} #55#return; {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 14:44:51,567 INFO L290 TraceCheckUtils]: 75: Hoare triple {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~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 * ~y~0 * ~y~0 + ~x~0; {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,567 INFO L290 TraceCheckUtils]: 76: Hoare triple {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,568 INFO L290 TraceCheckUtils]: 77: Hoare triple {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,568 INFO L272 TraceCheckUtils]: 78: Hoare triple {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 14:44:51,568 INFO L290 TraceCheckUtils]: 79: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 14:44:51,568 INFO L290 TraceCheckUtils]: 80: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 14:44:51,568 INFO L290 TraceCheckUtils]: 81: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,569 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {21654#true} {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} #55#return; {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,569 INFO L290 TraceCheckUtils]: 83: Hoare triple {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,570 INFO L290 TraceCheckUtils]: 84: Hoare triple {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,570 INFO L290 TraceCheckUtils]: 85: Hoare triple {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,570 INFO L272 TraceCheckUtils]: 86: Hoare triple {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 14:44:51,570 INFO L290 TraceCheckUtils]: 87: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 14:44:51,570 INFO L290 TraceCheckUtils]: 88: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 14:44:51,570 INFO L290 TraceCheckUtils]: 89: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,571 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {21654#true} {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} #55#return; {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,571 INFO L290 TraceCheckUtils]: 91: Hoare triple {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,572 INFO L290 TraceCheckUtils]: 92: Hoare triple {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,572 INFO L290 TraceCheckUtils]: 93: Hoare triple {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,572 INFO L272 TraceCheckUtils]: 94: Hoare triple {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 14:44:51,572 INFO L290 TraceCheckUtils]: 95: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 14:44:51,573 INFO L290 TraceCheckUtils]: 96: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 14:44:51,573 INFO L290 TraceCheckUtils]: 97: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,573 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {21654#true} {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} #55#return; {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,574 INFO L290 TraceCheckUtils]: 99: Hoare triple {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,574 INFO L290 TraceCheckUtils]: 100: Hoare triple {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,574 INFO L290 TraceCheckUtils]: 101: Hoare triple {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,574 INFO L272 TraceCheckUtils]: 102: Hoare triple {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 14:44:51,574 INFO L290 TraceCheckUtils]: 103: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 14:44:51,575 INFO L290 TraceCheckUtils]: 104: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 14:44:51,575 INFO L290 TraceCheckUtils]: 105: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,575 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {21654#true} {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} #55#return; {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} is VALID [2022-04-08 14:44:51,576 INFO L290 TraceCheckUtils]: 107: Hoare triple {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 14:44:51,576 INFO L290 TraceCheckUtils]: 108: Hoare triple {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 14:44:51,576 INFO L290 TraceCheckUtils]: 109: Hoare triple {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 14:44:51,576 INFO L272 TraceCheckUtils]: 110: Hoare triple {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 14:44:51,577 INFO L290 TraceCheckUtils]: 111: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 14:44:51,577 INFO L290 TraceCheckUtils]: 112: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 14:44:51,577 INFO L290 TraceCheckUtils]: 113: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,577 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {21654#true} {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #55#return; {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 14:44:51,578 INFO L290 TraceCheckUtils]: 115: Hoare triple {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {22017#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-08 14:44:51,578 INFO L272 TraceCheckUtils]: 116: Hoare triple {22017#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 14:44:51,578 INFO L290 TraceCheckUtils]: 117: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 14:44:51,578 INFO L290 TraceCheckUtils]: 118: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 14:44:51,578 INFO L290 TraceCheckUtils]: 119: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 14:44:51,578 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {21654#true} {22017#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} #57#return; {22017#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-08 14:44:51,579 INFO L272 TraceCheckUtils]: 121: Hoare triple {22017#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {22036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:44:51,579 INFO L290 TraceCheckUtils]: 122: Hoare triple {22036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:44:51,580 INFO L290 TraceCheckUtils]: 123: Hoare triple {22040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21655#false} is VALID [2022-04-08 14:44:51,580 INFO L290 TraceCheckUtils]: 124: Hoare triple {21655#false} assume !false; {21655#false} is VALID [2022-04-08 14:44:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 28 proven. 312 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-08 14:44:51,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:44:52,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:44:52,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41140973] [2022-04-08 14:44:52,499 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:44:52,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127605021] [2022-04-08 14:44:52,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127605021] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:44:52,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:44:52,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-08 14:44:52,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:44:52,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [956462790] [2022-04-08 14:44:52,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [956462790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:44:52,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:44:52,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 14:44:52,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365904290] [2022-04-08 14:44:52,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:44:52,500 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 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 125 [2022-04-08 14:44:52,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:44:52,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 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 14:44:52,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:44:52,576 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 14:44:52,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:44:52,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 14:44:52,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2022-04-08 14:44:52,577 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 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 14:44:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:44:54,522 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2022-04-08 14:44:54,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 14:44:54,522 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 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 125 [2022-04-08 14:44:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:44:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 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 14:44:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 99 transitions. [2022-04-08 14:44:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 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 14:44:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 99 transitions. [2022-04-08 14:44:54,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 99 transitions. [2022-04-08 14:44:54,634 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 14:44:54,635 INFO L225 Difference]: With dead ends: 132 [2022-04-08 14:44:54,636 INFO L226 Difference]: Without dead ends: 126 [2022-04-08 14:44:54,636 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2022-04-08 14:44:54,636 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 14:44:54,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 774 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 14:44:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-08 14:44:54,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-04-08 14:44:54,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:44:54,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:44:54,858 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:44:54,858 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:44:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:44:54,866 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2022-04-08 14:44:54,866 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-08 14:44:54,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:44:54,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:44:54,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 126 states. [2022-04-08 14:44:54,866 INFO L87 Difference]: Start difference. First operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 126 states. [2022-04-08 14:44:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:44:54,868 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2022-04-08 14:44:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-08 14:44:54,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:44:54,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:44:54,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:44:54,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:44:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 19 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:44:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 129 transitions. [2022-04-08 14:44:54,870 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 129 transitions. Word has length 125 [2022-04-08 14:44:54,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:44:54,870 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 129 transitions. [2022-04-08 14:44:54,870 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 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 14:44:54,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 129 transitions. [2022-04-08 14:44:55,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:44:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-08 14:44:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-08 14:44:55,087 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:44:55,087 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:44:55,155 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 14:44:55,288 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 14:44:55,288 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:44:55,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:44:55,288 INFO L85 PathProgramCache]: Analyzing trace with hash -702643, now seen corresponding path program 23 times [2022-04-08 14:44:55,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:44:55,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [273431408] [2022-04-08 14:44:55,362 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:44:55,362 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:44:55,362 INFO L85 PathProgramCache]: Analyzing trace with hash -702643, now seen corresponding path program 24 times [2022-04-08 14:44:55,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:44:55,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930608317] [2022-04-08 14:44:55,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:44:55,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:44:55,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:44:55,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1356450091] [2022-04-08 14:44:55,396 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:44:55,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:44:55,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:44:55,397 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 14:44:55,407 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 14:44:56,513 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-04-08 14:44:56,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:44:56,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 14:44:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:44:56,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:44:57,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {23053#true} call ULTIMATE.init(); {23053#true} is VALID [2022-04-08 14:44:57,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {23053#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);~counter~0 := 0; {23061#(<= ~counter~0 0)} is VALID [2022-04-08 14:44:57,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {23061#(<= ~counter~0 0)} assume true; {23061#(<= ~counter~0 0)} is VALID [2022-04-08 14:44:57,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23061#(<= ~counter~0 0)} {23053#true} #61#return; {23061#(<= ~counter~0 0)} is VALID [2022-04-08 14:44:57,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {23061#(<= ~counter~0 0)} call #t~ret6 := main(); {23061#(<= ~counter~0 0)} is VALID [2022-04-08 14:44:57,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {23061#(<= ~counter~0 0)} 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; {23061#(<= ~counter~0 0)} is VALID [2022-04-08 14:44:57,181 INFO L272 TraceCheckUtils]: 6: Hoare triple {23061#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {23061#(<= ~counter~0 0)} is VALID [2022-04-08 14:44:57,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {23061#(<= ~counter~0 0)} ~cond := #in~cond; {23061#(<= ~counter~0 0)} is VALID [2022-04-08 14:44:57,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {23061#(<= ~counter~0 0)} assume !(0 == ~cond); {23061#(<= ~counter~0 0)} is VALID [2022-04-08 14:44:57,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {23061#(<= ~counter~0 0)} assume true; {23061#(<= ~counter~0 0)} is VALID [2022-04-08 14:44:57,182 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23061#(<= ~counter~0 0)} {23061#(<= ~counter~0 0)} #53#return; {23061#(<= ~counter~0 0)} is VALID [2022-04-08 14:44:57,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {23061#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {23061#(<= ~counter~0 0)} is VALID [2022-04-08 14:44:57,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {23061#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23095#(<= ~counter~0 1)} is VALID [2022-04-08 14:44:57,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {23095#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {23095#(<= ~counter~0 1)} is VALID [2022-04-08 14:44:57,184 INFO L272 TraceCheckUtils]: 14: Hoare triple {23095#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23095#(<= ~counter~0 1)} is VALID [2022-04-08 14:44:57,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {23095#(<= ~counter~0 1)} ~cond := #in~cond; {23095#(<= ~counter~0 1)} is VALID [2022-04-08 14:44:57,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {23095#(<= ~counter~0 1)} assume !(0 == ~cond); {23095#(<= ~counter~0 1)} is VALID [2022-04-08 14:44:57,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {23095#(<= ~counter~0 1)} assume true; {23095#(<= ~counter~0 1)} is VALID [2022-04-08 14:44:57,185 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23095#(<= ~counter~0 1)} {23095#(<= ~counter~0 1)} #55#return; {23095#(<= ~counter~0 1)} is VALID [2022-04-08 14:44:57,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {23095#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23095#(<= ~counter~0 1)} is VALID [2022-04-08 14:44:57,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {23095#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23120#(<= ~counter~0 2)} is VALID [2022-04-08 14:44:57,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {23120#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {23120#(<= ~counter~0 2)} is VALID [2022-04-08 14:44:57,187 INFO L272 TraceCheckUtils]: 22: Hoare triple {23120#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23120#(<= ~counter~0 2)} is VALID [2022-04-08 14:44:57,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {23120#(<= ~counter~0 2)} ~cond := #in~cond; {23120#(<= ~counter~0 2)} is VALID [2022-04-08 14:44:57,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {23120#(<= ~counter~0 2)} assume !(0 == ~cond); {23120#(<= ~counter~0 2)} is VALID [2022-04-08 14:44:57,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {23120#(<= ~counter~0 2)} assume true; {23120#(<= ~counter~0 2)} is VALID [2022-04-08 14:44:57,188 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23120#(<= ~counter~0 2)} {23120#(<= ~counter~0 2)} #55#return; {23120#(<= ~counter~0 2)} is VALID [2022-04-08 14:44:57,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {23120#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23120#(<= ~counter~0 2)} is VALID [2022-04-08 14:44:57,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {23120#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23145#(<= ~counter~0 3)} is VALID [2022-04-08 14:44:57,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {23145#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {23145#(<= ~counter~0 3)} is VALID [2022-04-08 14:44:57,190 INFO L272 TraceCheckUtils]: 30: Hoare triple {23145#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23145#(<= ~counter~0 3)} is VALID [2022-04-08 14:44:57,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {23145#(<= ~counter~0 3)} ~cond := #in~cond; {23145#(<= ~counter~0 3)} is VALID [2022-04-08 14:44:57,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {23145#(<= ~counter~0 3)} assume !(0 == ~cond); {23145#(<= ~counter~0 3)} is VALID [2022-04-08 14:44:57,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {23145#(<= ~counter~0 3)} assume true; {23145#(<= ~counter~0 3)} is VALID [2022-04-08 14:44:57,191 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23145#(<= ~counter~0 3)} {23145#(<= ~counter~0 3)} #55#return; {23145#(<= ~counter~0 3)} is VALID [2022-04-08 14:44:57,191 INFO L290 TraceCheckUtils]: 35: Hoare triple {23145#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23145#(<= ~counter~0 3)} is VALID [2022-04-08 14:44:57,192 INFO L290 TraceCheckUtils]: 36: Hoare triple {23145#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23170#(<= ~counter~0 4)} is VALID [2022-04-08 14:44:57,192 INFO L290 TraceCheckUtils]: 37: Hoare triple {23170#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {23170#(<= ~counter~0 4)} is VALID [2022-04-08 14:44:57,193 INFO L272 TraceCheckUtils]: 38: Hoare triple {23170#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23170#(<= ~counter~0 4)} is VALID [2022-04-08 14:44:57,193 INFO L290 TraceCheckUtils]: 39: Hoare triple {23170#(<= ~counter~0 4)} ~cond := #in~cond; {23170#(<= ~counter~0 4)} is VALID [2022-04-08 14:44:57,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {23170#(<= ~counter~0 4)} assume !(0 == ~cond); {23170#(<= ~counter~0 4)} is VALID [2022-04-08 14:44:57,194 INFO L290 TraceCheckUtils]: 41: Hoare triple {23170#(<= ~counter~0 4)} assume true; {23170#(<= ~counter~0 4)} is VALID [2022-04-08 14:44:57,194 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23170#(<= ~counter~0 4)} {23170#(<= ~counter~0 4)} #55#return; {23170#(<= ~counter~0 4)} is VALID [2022-04-08 14:44:57,194 INFO L290 TraceCheckUtils]: 43: Hoare triple {23170#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23170#(<= ~counter~0 4)} is VALID [2022-04-08 14:44:57,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {23170#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23195#(<= ~counter~0 5)} is VALID [2022-04-08 14:44:57,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {23195#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {23195#(<= ~counter~0 5)} is VALID [2022-04-08 14:44:57,196 INFO L272 TraceCheckUtils]: 46: Hoare triple {23195#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23195#(<= ~counter~0 5)} is VALID [2022-04-08 14:44:57,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {23195#(<= ~counter~0 5)} ~cond := #in~cond; {23195#(<= ~counter~0 5)} is VALID [2022-04-08 14:44:57,196 INFO L290 TraceCheckUtils]: 48: Hoare triple {23195#(<= ~counter~0 5)} assume !(0 == ~cond); {23195#(<= ~counter~0 5)} is VALID [2022-04-08 14:44:57,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {23195#(<= ~counter~0 5)} assume true; {23195#(<= ~counter~0 5)} is VALID [2022-04-08 14:44:57,197 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23195#(<= ~counter~0 5)} {23195#(<= ~counter~0 5)} #55#return; {23195#(<= ~counter~0 5)} is VALID [2022-04-08 14:44:57,197 INFO L290 TraceCheckUtils]: 51: Hoare triple {23195#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23195#(<= ~counter~0 5)} is VALID [2022-04-08 14:44:57,198 INFO L290 TraceCheckUtils]: 52: Hoare triple {23195#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23220#(<= ~counter~0 6)} is VALID [2022-04-08 14:44:57,198 INFO L290 TraceCheckUtils]: 53: Hoare triple {23220#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {23220#(<= ~counter~0 6)} is VALID [2022-04-08 14:44:57,198 INFO L272 TraceCheckUtils]: 54: Hoare triple {23220#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23220#(<= ~counter~0 6)} is VALID [2022-04-08 14:44:57,199 INFO L290 TraceCheckUtils]: 55: Hoare triple {23220#(<= ~counter~0 6)} ~cond := #in~cond; {23220#(<= ~counter~0 6)} is VALID [2022-04-08 14:44:57,199 INFO L290 TraceCheckUtils]: 56: Hoare triple {23220#(<= ~counter~0 6)} assume !(0 == ~cond); {23220#(<= ~counter~0 6)} is VALID [2022-04-08 14:44:57,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {23220#(<= ~counter~0 6)} assume true; {23220#(<= ~counter~0 6)} is VALID [2022-04-08 14:44:57,200 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23220#(<= ~counter~0 6)} {23220#(<= ~counter~0 6)} #55#return; {23220#(<= ~counter~0 6)} is VALID [2022-04-08 14:44:57,200 INFO L290 TraceCheckUtils]: 59: Hoare triple {23220#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23220#(<= ~counter~0 6)} is VALID [2022-04-08 14:44:57,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {23220#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23245#(<= ~counter~0 7)} is VALID [2022-04-08 14:44:57,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {23245#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {23245#(<= ~counter~0 7)} is VALID [2022-04-08 14:44:57,201 INFO L272 TraceCheckUtils]: 62: Hoare triple {23245#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23245#(<= ~counter~0 7)} is VALID [2022-04-08 14:44:57,202 INFO L290 TraceCheckUtils]: 63: Hoare triple {23245#(<= ~counter~0 7)} ~cond := #in~cond; {23245#(<= ~counter~0 7)} is VALID [2022-04-08 14:44:57,202 INFO L290 TraceCheckUtils]: 64: Hoare triple {23245#(<= ~counter~0 7)} assume !(0 == ~cond); {23245#(<= ~counter~0 7)} is VALID [2022-04-08 14:44:57,202 INFO L290 TraceCheckUtils]: 65: Hoare triple {23245#(<= ~counter~0 7)} assume true; {23245#(<= ~counter~0 7)} is VALID [2022-04-08 14:44:57,203 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {23245#(<= ~counter~0 7)} {23245#(<= ~counter~0 7)} #55#return; {23245#(<= ~counter~0 7)} is VALID [2022-04-08 14:44:57,203 INFO L290 TraceCheckUtils]: 67: Hoare triple {23245#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23245#(<= ~counter~0 7)} is VALID [2022-04-08 14:44:57,203 INFO L290 TraceCheckUtils]: 68: Hoare triple {23245#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23270#(<= ~counter~0 8)} is VALID [2022-04-08 14:44:57,204 INFO L290 TraceCheckUtils]: 69: Hoare triple {23270#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {23270#(<= ~counter~0 8)} is VALID [2022-04-08 14:44:57,204 INFO L272 TraceCheckUtils]: 70: Hoare triple {23270#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23270#(<= ~counter~0 8)} is VALID [2022-04-08 14:44:57,204 INFO L290 TraceCheckUtils]: 71: Hoare triple {23270#(<= ~counter~0 8)} ~cond := #in~cond; {23270#(<= ~counter~0 8)} is VALID [2022-04-08 14:44:57,205 INFO L290 TraceCheckUtils]: 72: Hoare triple {23270#(<= ~counter~0 8)} assume !(0 == ~cond); {23270#(<= ~counter~0 8)} is VALID [2022-04-08 14:44:57,205 INFO L290 TraceCheckUtils]: 73: Hoare triple {23270#(<= ~counter~0 8)} assume true; {23270#(<= ~counter~0 8)} is VALID [2022-04-08 14:44:57,205 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23270#(<= ~counter~0 8)} {23270#(<= ~counter~0 8)} #55#return; {23270#(<= ~counter~0 8)} is VALID [2022-04-08 14:44:57,206 INFO L290 TraceCheckUtils]: 75: Hoare triple {23270#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23270#(<= ~counter~0 8)} is VALID [2022-04-08 14:44:57,206 INFO L290 TraceCheckUtils]: 76: Hoare triple {23270#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23295#(<= ~counter~0 9)} is VALID [2022-04-08 14:44:57,207 INFO L290 TraceCheckUtils]: 77: Hoare triple {23295#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {23295#(<= ~counter~0 9)} is VALID [2022-04-08 14:44:57,207 INFO L272 TraceCheckUtils]: 78: Hoare triple {23295#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23295#(<= ~counter~0 9)} is VALID [2022-04-08 14:44:57,207 INFO L290 TraceCheckUtils]: 79: Hoare triple {23295#(<= ~counter~0 9)} ~cond := #in~cond; {23295#(<= ~counter~0 9)} is VALID [2022-04-08 14:44:57,208 INFO L290 TraceCheckUtils]: 80: Hoare triple {23295#(<= ~counter~0 9)} assume !(0 == ~cond); {23295#(<= ~counter~0 9)} is VALID [2022-04-08 14:44:57,208 INFO L290 TraceCheckUtils]: 81: Hoare triple {23295#(<= ~counter~0 9)} assume true; {23295#(<= ~counter~0 9)} is VALID [2022-04-08 14:44:57,208 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {23295#(<= ~counter~0 9)} {23295#(<= ~counter~0 9)} #55#return; {23295#(<= ~counter~0 9)} is VALID [2022-04-08 14:44:57,209 INFO L290 TraceCheckUtils]: 83: Hoare triple {23295#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23295#(<= ~counter~0 9)} is VALID [2022-04-08 14:44:57,209 INFO L290 TraceCheckUtils]: 84: Hoare triple {23295#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23320#(<= ~counter~0 10)} is VALID [2022-04-08 14:44:57,209 INFO L290 TraceCheckUtils]: 85: Hoare triple {23320#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {23320#(<= ~counter~0 10)} is VALID [2022-04-08 14:44:57,210 INFO L272 TraceCheckUtils]: 86: Hoare triple {23320#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23320#(<= ~counter~0 10)} is VALID [2022-04-08 14:44:57,210 INFO L290 TraceCheckUtils]: 87: Hoare triple {23320#(<= ~counter~0 10)} ~cond := #in~cond; {23320#(<= ~counter~0 10)} is VALID [2022-04-08 14:44:57,210 INFO L290 TraceCheckUtils]: 88: Hoare triple {23320#(<= ~counter~0 10)} assume !(0 == ~cond); {23320#(<= ~counter~0 10)} is VALID [2022-04-08 14:44:57,211 INFO L290 TraceCheckUtils]: 89: Hoare triple {23320#(<= ~counter~0 10)} assume true; {23320#(<= ~counter~0 10)} is VALID [2022-04-08 14:44:57,211 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {23320#(<= ~counter~0 10)} {23320#(<= ~counter~0 10)} #55#return; {23320#(<= ~counter~0 10)} is VALID [2022-04-08 14:44:57,211 INFO L290 TraceCheckUtils]: 91: Hoare triple {23320#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23320#(<= ~counter~0 10)} is VALID [2022-04-08 14:44:57,212 INFO L290 TraceCheckUtils]: 92: Hoare triple {23320#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23345#(<= ~counter~0 11)} is VALID [2022-04-08 14:44:57,212 INFO L290 TraceCheckUtils]: 93: Hoare triple {23345#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {23345#(<= ~counter~0 11)} is VALID [2022-04-08 14:44:57,213 INFO L272 TraceCheckUtils]: 94: Hoare triple {23345#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23345#(<= ~counter~0 11)} is VALID [2022-04-08 14:44:57,213 INFO L290 TraceCheckUtils]: 95: Hoare triple {23345#(<= ~counter~0 11)} ~cond := #in~cond; {23345#(<= ~counter~0 11)} is VALID [2022-04-08 14:44:57,213 INFO L290 TraceCheckUtils]: 96: Hoare triple {23345#(<= ~counter~0 11)} assume !(0 == ~cond); {23345#(<= ~counter~0 11)} is VALID [2022-04-08 14:44:57,214 INFO L290 TraceCheckUtils]: 97: Hoare triple {23345#(<= ~counter~0 11)} assume true; {23345#(<= ~counter~0 11)} is VALID [2022-04-08 14:44:57,214 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23345#(<= ~counter~0 11)} {23345#(<= ~counter~0 11)} #55#return; {23345#(<= ~counter~0 11)} is VALID [2022-04-08 14:44:57,214 INFO L290 TraceCheckUtils]: 99: Hoare triple {23345#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23345#(<= ~counter~0 11)} is VALID [2022-04-08 14:44:57,215 INFO L290 TraceCheckUtils]: 100: Hoare triple {23345#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23370#(<= ~counter~0 12)} is VALID [2022-04-08 14:44:57,215 INFO L290 TraceCheckUtils]: 101: Hoare triple {23370#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {23370#(<= ~counter~0 12)} is VALID [2022-04-08 14:44:57,216 INFO L272 TraceCheckUtils]: 102: Hoare triple {23370#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23370#(<= ~counter~0 12)} is VALID [2022-04-08 14:44:57,216 INFO L290 TraceCheckUtils]: 103: Hoare triple {23370#(<= ~counter~0 12)} ~cond := #in~cond; {23370#(<= ~counter~0 12)} is VALID [2022-04-08 14:44:57,216 INFO L290 TraceCheckUtils]: 104: Hoare triple {23370#(<= ~counter~0 12)} assume !(0 == ~cond); {23370#(<= ~counter~0 12)} is VALID [2022-04-08 14:44:57,216 INFO L290 TraceCheckUtils]: 105: Hoare triple {23370#(<= ~counter~0 12)} assume true; {23370#(<= ~counter~0 12)} is VALID [2022-04-08 14:44:57,217 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {23370#(<= ~counter~0 12)} {23370#(<= ~counter~0 12)} #55#return; {23370#(<= ~counter~0 12)} is VALID [2022-04-08 14:44:57,217 INFO L290 TraceCheckUtils]: 107: Hoare triple {23370#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23370#(<= ~counter~0 12)} is VALID [2022-04-08 14:44:57,218 INFO L290 TraceCheckUtils]: 108: Hoare triple {23370#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23395#(<= ~counter~0 13)} is VALID [2022-04-08 14:44:57,218 INFO L290 TraceCheckUtils]: 109: Hoare triple {23395#(<= ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {23395#(<= ~counter~0 13)} is VALID [2022-04-08 14:44:57,218 INFO L272 TraceCheckUtils]: 110: Hoare triple {23395#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23395#(<= ~counter~0 13)} is VALID [2022-04-08 14:44:57,219 INFO L290 TraceCheckUtils]: 111: Hoare triple {23395#(<= ~counter~0 13)} ~cond := #in~cond; {23395#(<= ~counter~0 13)} is VALID [2022-04-08 14:44:57,219 INFO L290 TraceCheckUtils]: 112: Hoare triple {23395#(<= ~counter~0 13)} assume !(0 == ~cond); {23395#(<= ~counter~0 13)} is VALID [2022-04-08 14:44:57,219 INFO L290 TraceCheckUtils]: 113: Hoare triple {23395#(<= ~counter~0 13)} assume true; {23395#(<= ~counter~0 13)} is VALID [2022-04-08 14:44:57,220 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {23395#(<= ~counter~0 13)} {23395#(<= ~counter~0 13)} #55#return; {23395#(<= ~counter~0 13)} is VALID [2022-04-08 14:44:57,220 INFO L290 TraceCheckUtils]: 115: Hoare triple {23395#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23395#(<= ~counter~0 13)} is VALID [2022-04-08 14:44:57,220 INFO L290 TraceCheckUtils]: 116: Hoare triple {23395#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23420#(<= |main_#t~post5| 13)} is VALID [2022-04-08 14:44:57,221 INFO L290 TraceCheckUtils]: 117: Hoare triple {23420#(<= |main_#t~post5| 13)} assume !(#t~post5 < 20);havoc #t~post5; {23054#false} is VALID [2022-04-08 14:44:57,221 INFO L272 TraceCheckUtils]: 118: Hoare triple {23054#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23054#false} is VALID [2022-04-08 14:44:57,221 INFO L290 TraceCheckUtils]: 119: Hoare triple {23054#false} ~cond := #in~cond; {23054#false} is VALID [2022-04-08 14:44:57,221 INFO L290 TraceCheckUtils]: 120: Hoare triple {23054#false} assume !(0 == ~cond); {23054#false} is VALID [2022-04-08 14:44:57,221 INFO L290 TraceCheckUtils]: 121: Hoare triple {23054#false} assume true; {23054#false} is VALID [2022-04-08 14:44:57,221 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23054#false} {23054#false} #57#return; {23054#false} is VALID [2022-04-08 14:44:57,221 INFO L272 TraceCheckUtils]: 123: Hoare triple {23054#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {23054#false} is VALID [2022-04-08 14:44:57,221 INFO L290 TraceCheckUtils]: 124: Hoare triple {23054#false} ~cond := #in~cond; {23054#false} is VALID [2022-04-08 14:44:57,221 INFO L290 TraceCheckUtils]: 125: Hoare triple {23054#false} assume 0 == ~cond; {23054#false} is VALID [2022-04-08 14:44:57,221 INFO L290 TraceCheckUtils]: 126: Hoare triple {23054#false} assume !false; {23054#false} is VALID [2022-04-08 14:44:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 78 proven. 650 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:44:57,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:44:57,800 INFO L290 TraceCheckUtils]: 126: Hoare triple {23054#false} assume !false; {23054#false} is VALID [2022-04-08 14:44:57,800 INFO L290 TraceCheckUtils]: 125: Hoare triple {23054#false} assume 0 == ~cond; {23054#false} is VALID [2022-04-08 14:44:57,800 INFO L290 TraceCheckUtils]: 124: Hoare triple {23054#false} ~cond := #in~cond; {23054#false} is VALID [2022-04-08 14:44:57,800 INFO L272 TraceCheckUtils]: 123: Hoare triple {23054#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {23054#false} is VALID [2022-04-08 14:44:57,800 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23053#true} {23054#false} #57#return; {23054#false} is VALID [2022-04-08 14:44:57,800 INFO L290 TraceCheckUtils]: 121: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-08 14:44:57,800 INFO L290 TraceCheckUtils]: 120: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-08 14:44:57,800 INFO L290 TraceCheckUtils]: 119: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-08 14:44:57,801 INFO L272 TraceCheckUtils]: 118: Hoare triple {23054#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-08 14:44:57,801 INFO L290 TraceCheckUtils]: 117: Hoare triple {23478#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {23054#false} is VALID [2022-04-08 14:44:57,801 INFO L290 TraceCheckUtils]: 116: Hoare triple {23482#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23478#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:44:57,801 INFO L290 TraceCheckUtils]: 115: Hoare triple {23482#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23482#(< ~counter~0 20)} is VALID [2022-04-08 14:44:57,802 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {23053#true} {23482#(< ~counter~0 20)} #55#return; {23482#(< ~counter~0 20)} is VALID [2022-04-08 14:44:57,802 INFO L290 TraceCheckUtils]: 113: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-08 14:44:57,802 INFO L290 TraceCheckUtils]: 112: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-08 14:44:57,802 INFO L290 TraceCheckUtils]: 111: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-08 14:44:57,802 INFO L272 TraceCheckUtils]: 110: Hoare triple {23482#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-08 14:44:57,802 INFO L290 TraceCheckUtils]: 109: Hoare triple {23482#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {23482#(< ~counter~0 20)} is VALID [2022-04-08 14:44:57,803 INFO L290 TraceCheckUtils]: 108: Hoare triple {23507#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23482#(< ~counter~0 20)} is VALID [2022-04-08 14:44:57,804 INFO L290 TraceCheckUtils]: 107: Hoare triple {23507#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23507#(< ~counter~0 19)} is VALID [2022-04-08 14:44:57,804 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {23053#true} {23507#(< ~counter~0 19)} #55#return; {23507#(< ~counter~0 19)} is VALID [2022-04-08 14:44:57,804 INFO L290 TraceCheckUtils]: 105: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-08 14:44:57,804 INFO L290 TraceCheckUtils]: 104: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-08 14:44:57,804 INFO L290 TraceCheckUtils]: 103: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-08 14:44:57,804 INFO L272 TraceCheckUtils]: 102: Hoare triple {23507#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-08 14:44:57,804 INFO L290 TraceCheckUtils]: 101: Hoare triple {23507#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {23507#(< ~counter~0 19)} is VALID [2022-04-08 14:44:57,805 INFO L290 TraceCheckUtils]: 100: Hoare triple {23532#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23507#(< ~counter~0 19)} is VALID [2022-04-08 14:44:57,805 INFO L290 TraceCheckUtils]: 99: Hoare triple {23532#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23532#(< ~counter~0 18)} is VALID [2022-04-08 14:44:57,805 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23053#true} {23532#(< ~counter~0 18)} #55#return; {23532#(< ~counter~0 18)} is VALID [2022-04-08 14:44:57,805 INFO L290 TraceCheckUtils]: 97: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-08 14:44:57,806 INFO L290 TraceCheckUtils]: 96: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-08 14:44:57,806 INFO L290 TraceCheckUtils]: 95: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-08 14:44:57,806 INFO L272 TraceCheckUtils]: 94: Hoare triple {23532#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-08 14:44:57,806 INFO L290 TraceCheckUtils]: 93: Hoare triple {23532#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {23532#(< ~counter~0 18)} is VALID [2022-04-08 14:44:57,806 INFO L290 TraceCheckUtils]: 92: Hoare triple {23557#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23532#(< ~counter~0 18)} is VALID [2022-04-08 14:44:57,807 INFO L290 TraceCheckUtils]: 91: Hoare triple {23557#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23557#(< ~counter~0 17)} is VALID [2022-04-08 14:44:57,807 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {23053#true} {23557#(< ~counter~0 17)} #55#return; {23557#(< ~counter~0 17)} is VALID [2022-04-08 14:44:57,807 INFO L290 TraceCheckUtils]: 89: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-08 14:44:57,807 INFO L290 TraceCheckUtils]: 88: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-08 14:44:57,807 INFO L290 TraceCheckUtils]: 87: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-08 14:44:57,807 INFO L272 TraceCheckUtils]: 86: Hoare triple {23557#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-08 14:44:57,807 INFO L290 TraceCheckUtils]: 85: Hoare triple {23557#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {23557#(< ~counter~0 17)} is VALID [2022-04-08 14:44:57,808 INFO L290 TraceCheckUtils]: 84: Hoare triple {23582#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23557#(< ~counter~0 17)} is VALID [2022-04-08 14:44:57,808 INFO L290 TraceCheckUtils]: 83: Hoare triple {23582#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23582#(< ~counter~0 16)} is VALID [2022-04-08 14:44:57,809 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {23053#true} {23582#(< ~counter~0 16)} #55#return; {23582#(< ~counter~0 16)} is VALID [2022-04-08 14:44:57,809 INFO L290 TraceCheckUtils]: 81: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-08 14:44:57,809 INFO L290 TraceCheckUtils]: 80: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-08 14:44:57,809 INFO L290 TraceCheckUtils]: 79: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-08 14:44:57,809 INFO L272 TraceCheckUtils]: 78: Hoare triple {23582#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-08 14:44:57,809 INFO L290 TraceCheckUtils]: 77: Hoare triple {23582#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {23582#(< ~counter~0 16)} is VALID [2022-04-08 14:44:57,810 INFO L290 TraceCheckUtils]: 76: Hoare triple {23607#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23582#(< ~counter~0 16)} is VALID [2022-04-08 14:44:57,810 INFO L290 TraceCheckUtils]: 75: Hoare triple {23607#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23607#(< ~counter~0 15)} is VALID [2022-04-08 14:44:57,810 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23053#true} {23607#(< ~counter~0 15)} #55#return; {23607#(< ~counter~0 15)} is VALID [2022-04-08 14:44:57,810 INFO L290 TraceCheckUtils]: 73: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-08 14:44:57,810 INFO L290 TraceCheckUtils]: 72: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-08 14:44:57,810 INFO L290 TraceCheckUtils]: 71: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-08 14:44:57,810 INFO L272 TraceCheckUtils]: 70: Hoare triple {23607#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-08 14:44:57,811 INFO L290 TraceCheckUtils]: 69: Hoare triple {23607#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {23607#(< ~counter~0 15)} is VALID [2022-04-08 14:44:57,811 INFO L290 TraceCheckUtils]: 68: Hoare triple {23395#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23607#(< ~counter~0 15)} is VALID [2022-04-08 14:44:57,811 INFO L290 TraceCheckUtils]: 67: Hoare triple {23395#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23395#(<= ~counter~0 13)} is VALID [2022-04-08 14:44:57,812 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {23053#true} {23395#(<= ~counter~0 13)} #55#return; {23395#(<= ~counter~0 13)} is VALID [2022-04-08 14:44:57,812 INFO L290 TraceCheckUtils]: 65: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-08 14:44:57,812 INFO L290 TraceCheckUtils]: 64: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-08 14:44:57,812 INFO L290 TraceCheckUtils]: 63: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-08 14:44:57,812 INFO L272 TraceCheckUtils]: 62: Hoare triple {23395#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-08 14:44:57,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {23395#(<= ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {23395#(<= ~counter~0 13)} is VALID [2022-04-08 14:44:57,813 INFO L290 TraceCheckUtils]: 60: Hoare triple {23370#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23395#(<= ~counter~0 13)} is VALID [2022-04-08 14:44:57,813 INFO L290 TraceCheckUtils]: 59: Hoare triple {23370#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23370#(<= ~counter~0 12)} is VALID [2022-04-08 14:44:57,813 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23053#true} {23370#(<= ~counter~0 12)} #55#return; {23370#(<= ~counter~0 12)} is VALID [2022-04-08 14:44:57,813 INFO L290 TraceCheckUtils]: 57: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-08 14:44:57,813 INFO L290 TraceCheckUtils]: 56: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-08 14:44:57,814 INFO L290 TraceCheckUtils]: 55: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-08 14:44:57,814 INFO L272 TraceCheckUtils]: 54: Hoare triple {23370#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-08 14:44:57,814 INFO L290 TraceCheckUtils]: 53: Hoare triple {23370#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {23370#(<= ~counter~0 12)} is VALID [2022-04-08 14:44:57,814 INFO L290 TraceCheckUtils]: 52: Hoare triple {23345#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23370#(<= ~counter~0 12)} is VALID [2022-04-08 14:44:57,815 INFO L290 TraceCheckUtils]: 51: Hoare triple {23345#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23345#(<= ~counter~0 11)} is VALID [2022-04-08 14:44:57,815 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23053#true} {23345#(<= ~counter~0 11)} #55#return; {23345#(<= ~counter~0 11)} is VALID [2022-04-08 14:44:57,815 INFO L290 TraceCheckUtils]: 49: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-08 14:44:57,815 INFO L290 TraceCheckUtils]: 48: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-08 14:44:57,815 INFO L290 TraceCheckUtils]: 47: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-08 14:44:57,815 INFO L272 TraceCheckUtils]: 46: Hoare triple {23345#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-08 14:44:57,815 INFO L290 TraceCheckUtils]: 45: Hoare triple {23345#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {23345#(<= ~counter~0 11)} is VALID [2022-04-08 14:44:57,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {23320#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23345#(<= ~counter~0 11)} is VALID [2022-04-08 14:44:57,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {23320#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23320#(<= ~counter~0 10)} is VALID [2022-04-08 14:44:57,816 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23053#true} {23320#(<= ~counter~0 10)} #55#return; {23320#(<= ~counter~0 10)} is VALID [2022-04-08 14:44:57,817 INFO L290 TraceCheckUtils]: 41: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-08 14:44:57,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-08 14:44:57,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-08 14:44:57,817 INFO L272 TraceCheckUtils]: 38: Hoare triple {23320#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-08 14:44:57,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {23320#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {23320#(<= ~counter~0 10)} is VALID [2022-04-08 14:44:57,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {23295#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23320#(<= ~counter~0 10)} is VALID [2022-04-08 14:44:57,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {23295#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23295#(<= ~counter~0 9)} is VALID [2022-04-08 14:44:57,818 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23053#true} {23295#(<= ~counter~0 9)} #55#return; {23295#(<= ~counter~0 9)} is VALID [2022-04-08 14:44:57,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-08 14:44:57,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-08 14:44:57,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-08 14:44:57,818 INFO L272 TraceCheckUtils]: 30: Hoare triple {23295#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-08 14:44:57,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {23295#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {23295#(<= ~counter~0 9)} is VALID [2022-04-08 14:44:57,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {23270#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23295#(<= ~counter~0 9)} is VALID [2022-04-08 14:44:57,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {23270#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {23270#(<= ~counter~0 8)} is VALID [2022-04-08 14:44:57,820 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23053#true} {23270#(<= ~counter~0 8)} #55#return; {23270#(<= ~counter~0 8)} is VALID [2022-04-08 14:44:57,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-08 14:44:57,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-08 14:44:57,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-08 14:44:57,820 INFO L272 TraceCheckUtils]: 22: Hoare triple {23270#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-08 14:44:57,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {23270#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {23270#(<= ~counter~0 8)} is VALID [2022-04-08 14:44:57,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {23245#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23270#(<= ~counter~0 8)} is VALID [2022-04-08 14:44:57,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {23245#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23245#(<= ~counter~0 7)} is VALID [2022-04-08 14:44:57,821 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23053#true} {23245#(<= ~counter~0 7)} #55#return; {23245#(<= ~counter~0 7)} is VALID [2022-04-08 14:44:57,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-08 14:44:57,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-08 14:44:57,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-08 14:44:57,821 INFO L272 TraceCheckUtils]: 14: Hoare triple {23245#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23053#true} is VALID [2022-04-08 14:44:57,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {23245#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {23245#(<= ~counter~0 7)} is VALID [2022-04-08 14:44:57,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {23220#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23245#(<= ~counter~0 7)} is VALID [2022-04-08 14:44:57,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {23220#(<= ~counter~0 6)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {23220#(<= ~counter~0 6)} is VALID [2022-04-08 14:44:57,823 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23053#true} {23220#(<= ~counter~0 6)} #53#return; {23220#(<= ~counter~0 6)} is VALID [2022-04-08 14:44:57,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-08 14:44:57,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-08 14:44:57,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-08 14:44:57,823 INFO L272 TraceCheckUtils]: 6: Hoare triple {23220#(<= ~counter~0 6)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {23053#true} is VALID [2022-04-08 14:44:57,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {23220#(<= ~counter~0 6)} 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; {23220#(<= ~counter~0 6)} is VALID [2022-04-08 14:44:57,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {23220#(<= ~counter~0 6)} call #t~ret6 := main(); {23220#(<= ~counter~0 6)} is VALID [2022-04-08 14:44:57,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23220#(<= ~counter~0 6)} {23053#true} #61#return; {23220#(<= ~counter~0 6)} is VALID [2022-04-08 14:44:57,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {23220#(<= ~counter~0 6)} assume true; {23220#(<= ~counter~0 6)} is VALID [2022-04-08 14:44:57,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {23053#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);~counter~0 := 0; {23220#(<= ~counter~0 6)} is VALID [2022-04-08 14:44:57,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {23053#true} call ULTIMATE.init(); {23053#true} is VALID [2022-04-08 14:44:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 28 proven. 338 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-08 14:44:57,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:44:57,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930608317] [2022-04-08 14:44:57,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:44:57,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356450091] [2022-04-08 14:44:57,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356450091] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:44:57,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:44:57,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-08 14:44:57,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:44:57,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [273431408] [2022-04-08 14:44:57,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [273431408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:44:57,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:44:57,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 14:44:57,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775123060] [2022-04-08 14:44:57,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:44:57,827 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Word has length 127 [2022-04-08 14:44:57,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:44:57,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:44:57,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:44:57,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 14:44:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:44:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 14:44:57,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:44:57,917 INFO L87 Difference]: Start difference. First operand 126 states and 129 transitions. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:44:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:44:58,477 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2022-04-08 14:44:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 14:44:58,477 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Word has length 127 [2022-04-08 14:44:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:44:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:44:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2022-04-08 14:44:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:44:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2022-04-08 14:44:58,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 142 transitions. [2022-04-08 14:44:58,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:44:58,594 INFO L225 Difference]: With dead ends: 142 [2022-04-08 14:44:58,594 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 14:44:58,594 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=535, Invalid=797, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 14:44:58,595 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:44:58,595 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 168 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:44:58,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 14:44:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-08 14:44:58,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:44:58,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:44:58,803 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:44:58,803 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:44:58,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:44:58,805 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-04-08 14:44:58,805 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-04-08 14:44:58,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:44:58,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:44:58,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-08 14:44:58,806 INFO L87 Difference]: Start difference. First operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-08 14:44:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:44:58,808 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-04-08 14:44:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-04-08 14:44:58,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:44:58,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:44:58,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:44:58,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:44:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:44:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2022-04-08 14:44:58,810 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 127 [2022-04-08 14:44:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:44:58,810 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2022-04-08 14:44:58,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:44:58,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 134 transitions. [2022-04-08 14:44:59,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:44:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-04-08 14:44:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-08 14:44:59,105 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:44:59,105 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:44:59,123 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 14:44:59,305 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 14:44:59,305 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:44:59,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:44:59,306 INFO L85 PathProgramCache]: Analyzing trace with hash 95437811, now seen corresponding path program 25 times [2022-04-08 14:44:59,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:44:59,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1403323767] [2022-04-08 14:44:59,385 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:44:59,385 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:44:59,385 INFO L85 PathProgramCache]: Analyzing trace with hash 95437811, now seen corresponding path program 26 times [2022-04-08 14:44:59,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:44:59,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471208190] [2022-04-08 14:44:59,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:44:59,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:44:59,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:44:59,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [913011204] [2022-04-08 14:44:59,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:44:59,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:44:59,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:44:59,400 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 14:44:59,435 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 14:45:01,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:45:01,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:45:01,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-08 14:45:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:45:01,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:45:01,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {24676#true} call ULTIMATE.init(); {24676#true} is VALID [2022-04-08 14:45:01,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {24676#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);~counter~0 := 0; {24676#true} is VALID [2022-04-08 14:45:01,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24676#true} {24676#true} #61#return; {24676#true} is VALID [2022-04-08 14:45:01,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {24676#true} call #t~ret6 := main(); {24676#true} is VALID [2022-04-08 14:45:01,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {24676#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; {24676#true} is VALID [2022-04-08 14:45:01,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {24676#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24676#true} {24676#true} #53#return; {24676#true} is VALID [2022-04-08 14:45:01,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {24676#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {24714#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:45:01,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {24714#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24714#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:45:01,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {24714#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {24714#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:45:01,771 INFO L272 TraceCheckUtils]: 14: Hoare triple {24714#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,772 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {24676#true} {24714#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {24714#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:45:01,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {24714#(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 * ~y~0 * ~y~0 + ~x~0; {24739#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:45:01,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {24739#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24739#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:45:01,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {24739#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {24739#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:45:01,773 INFO L272 TraceCheckUtils]: 22: Hoare triple {24739#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,773 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24676#true} {24739#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {24739#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:45:01,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {24739#(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 * ~y~0 * ~y~0 + ~x~0; {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:45:01,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:45:01,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:45:01,774 INFO L272 TraceCheckUtils]: 30: Hoare triple {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,775 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {24676#true} {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {24764#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:45:01,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {24764#(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 * ~y~0 * ~y~0 + ~x~0; {24789#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:45:01,775 INFO L290 TraceCheckUtils]: 36: Hoare triple {24789#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24789#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:45:01,775 INFO L290 TraceCheckUtils]: 37: Hoare triple {24789#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {24789#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:45:01,775 INFO L272 TraceCheckUtils]: 38: Hoare triple {24789#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,776 INFO L290 TraceCheckUtils]: 40: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,776 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {24676#true} {24789#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {24789#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:45:01,776 INFO L290 TraceCheckUtils]: 43: Hoare triple {24789#(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 * ~y~0 * ~y~0 + ~x~0; {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:45:01,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:45:01,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:45:01,777 INFO L272 TraceCheckUtils]: 46: Hoare triple {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,777 INFO L290 TraceCheckUtils]: 47: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,777 INFO L290 TraceCheckUtils]: 48: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,777 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {24676#true} {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #55#return; {24814#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:45:01,778 INFO L290 TraceCheckUtils]: 51: Hoare triple {24814#(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 * ~y~0 * ~y~0 + ~x~0; {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:45:01,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:45:01,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:45:01,778 INFO L272 TraceCheckUtils]: 54: Hoare triple {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,778 INFO L290 TraceCheckUtils]: 55: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,778 INFO L290 TraceCheckUtils]: 56: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,780 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24676#true} {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #55#return; {24839#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:45:01,781 INFO L290 TraceCheckUtils]: 59: Hoare triple {24839#(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 * ~y~0 * ~y~0 + ~x~0; {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:45:01,781 INFO L290 TraceCheckUtils]: 60: Hoare triple {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:45:01,782 INFO L290 TraceCheckUtils]: 61: Hoare triple {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:45:01,783 INFO L272 TraceCheckUtils]: 62: Hoare triple {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,783 INFO L290 TraceCheckUtils]: 63: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,783 INFO L290 TraceCheckUtils]: 64: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,783 INFO L290 TraceCheckUtils]: 65: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,784 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24676#true} {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} #55#return; {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:45:01,784 INFO L290 TraceCheckUtils]: 67: Hoare triple {24864#(and (= (+ main_~c~0 (- 3)) 3) (= (+ (- 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 * ~y~0 * ~y~0 + ~x~0; {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 14:45:01,785 INFO L290 TraceCheckUtils]: 68: Hoare triple {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 14:45:01,785 INFO L290 TraceCheckUtils]: 69: Hoare triple {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(#t~post5 < 20);havoc #t~post5; {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 14:45:01,785 INFO L272 TraceCheckUtils]: 70: Hoare triple {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,785 INFO L290 TraceCheckUtils]: 71: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,786 INFO L290 TraceCheckUtils]: 72: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,786 INFO L290 TraceCheckUtils]: 73: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,786 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24676#true} {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} #55#return; {24889#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 14:45:01,786 INFO L290 TraceCheckUtils]: 75: Hoare triple {24889#(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 * ~y~0 * ~y~0 + ~x~0; {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 14:45:01,786 INFO L290 TraceCheckUtils]: 76: Hoare triple {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 14:45:01,787 INFO L290 TraceCheckUtils]: 77: Hoare triple {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 14:45:01,787 INFO L272 TraceCheckUtils]: 78: Hoare triple {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,787 INFO L290 TraceCheckUtils]: 79: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,787 INFO L290 TraceCheckUtils]: 80: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,787 INFO L290 TraceCheckUtils]: 81: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,787 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {24676#true} {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #55#return; {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 14:45:01,788 INFO L290 TraceCheckUtils]: 83: Hoare triple {24914#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {24939#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 14:45:01,788 INFO L290 TraceCheckUtils]: 84: Hoare triple {24939#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24939#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 14:45:01,788 INFO L290 TraceCheckUtils]: 85: Hoare triple {24939#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {24939#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 14:45:01,788 INFO L272 TraceCheckUtils]: 86: Hoare triple {24939#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,788 INFO L290 TraceCheckUtils]: 87: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,788 INFO L290 TraceCheckUtils]: 88: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,788 INFO L290 TraceCheckUtils]: 89: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,789 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {24676#true} {24939#(and (= main_~y~0 9) (= main_~c~0 9))} #55#return; {24939#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 14:45:01,789 INFO L290 TraceCheckUtils]: 91: Hoare triple {24939#(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 * ~y~0 * ~y~0 + ~x~0; {24964#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:45:01,789 INFO L290 TraceCheckUtils]: 92: Hoare triple {24964#(and (= main_~y~0 10) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24964#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:45:01,789 INFO L290 TraceCheckUtils]: 93: Hoare triple {24964#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(#t~post5 < 20);havoc #t~post5; {24964#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:45:01,789 INFO L272 TraceCheckUtils]: 94: Hoare triple {24964#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,790 INFO L290 TraceCheckUtils]: 95: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,790 INFO L290 TraceCheckUtils]: 96: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,790 INFO L290 TraceCheckUtils]: 97: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,790 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {24676#true} {24964#(and (= main_~y~0 10) (= main_~c~0 10))} #55#return; {24964#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:45:01,790 INFO L290 TraceCheckUtils]: 99: Hoare triple {24964#(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 * ~y~0 * ~y~0 + ~x~0; {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 14:45:01,790 INFO L290 TraceCheckUtils]: 100: Hoare triple {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 14:45:01,791 INFO L290 TraceCheckUtils]: 101: Hoare triple {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} assume !!(#t~post5 < 20);havoc #t~post5; {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 14:45:01,791 INFO L272 TraceCheckUtils]: 102: Hoare triple {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,791 INFO L290 TraceCheckUtils]: 103: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,791 INFO L290 TraceCheckUtils]: 104: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,791 INFO L290 TraceCheckUtils]: 105: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,791 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {24676#true} {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} #55#return; {24989#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 14:45:01,792 INFO L290 TraceCheckUtils]: 107: Hoare triple {24989#(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 * ~y~0 * ~y~0 + ~x~0; {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 14:45:01,792 INFO L290 TraceCheckUtils]: 108: Hoare triple {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 14:45:01,792 INFO L290 TraceCheckUtils]: 109: Hoare triple {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} assume !!(#t~post5 < 20);havoc #t~post5; {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 14:45:01,792 INFO L272 TraceCheckUtils]: 110: Hoare triple {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,792 INFO L290 TraceCheckUtils]: 111: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,792 INFO L290 TraceCheckUtils]: 112: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,792 INFO L290 TraceCheckUtils]: 113: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,793 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {24676#true} {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} #55#return; {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-08 14:45:01,793 INFO L290 TraceCheckUtils]: 115: Hoare triple {25014#(and (= (+ (- 2) main_~y~0) 10) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 14:45:01,793 INFO L290 TraceCheckUtils]: 116: Hoare triple {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 14:45:01,793 INFO L290 TraceCheckUtils]: 117: Hoare triple {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !!(#t~post5 < 20);havoc #t~post5; {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 14:45:01,794 INFO L272 TraceCheckUtils]: 118: Hoare triple {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,794 INFO L290 TraceCheckUtils]: 119: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,794 INFO L290 TraceCheckUtils]: 120: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,794 INFO L290 TraceCheckUtils]: 121: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,794 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {24676#true} {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} #55#return; {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 14:45:01,795 INFO L290 TraceCheckUtils]: 123: Hoare triple {25039#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} assume !(~c~0 < ~k~0); {25064#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-08 14:45:01,795 INFO L272 TraceCheckUtils]: 124: Hoare triple {25064#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24676#true} is VALID [2022-04-08 14:45:01,795 INFO L290 TraceCheckUtils]: 125: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-08 14:45:01,795 INFO L290 TraceCheckUtils]: 126: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-08 14:45:01,795 INFO L290 TraceCheckUtils]: 127: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-08 14:45:01,795 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {24676#true} {25064#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} #57#return; {25064#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-08 14:45:01,796 INFO L272 TraceCheckUtils]: 129: Hoare triple {25064#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {25083#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:45:01,796 INFO L290 TraceCheckUtils]: 130: Hoare triple {25083#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25087#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:45:01,796 INFO L290 TraceCheckUtils]: 131: Hoare triple {25087#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24677#false} is VALID [2022-04-08 14:45:01,796 INFO L290 TraceCheckUtils]: 132: Hoare triple {24677#false} assume !false; {24677#false} is VALID [2022-04-08 14:45:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 30 proven. 364 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-08 14:45:01,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:45:02,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:45:02,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471208190] [2022-04-08 14:45:02,038 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:45:02,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913011204] [2022-04-08 14:45:02,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913011204] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:45:02,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:45:02,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-08 14:45:02,039 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:45:02,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1403323767] [2022-04-08 14:45:02,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1403323767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:45:02,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:45:02,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 14:45:02,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693847533] [2022-04-08 14:45:02,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:45:02,039 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 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 133 [2022-04-08 14:45:02,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:45:02,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 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 14:45:02,092 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 14:45:02,093 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 14:45:02,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:45:02,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 14:45:02,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-08 14:45:02,098 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 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 14:45:03,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:45:03,978 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-08 14:45:03,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 14:45:03,978 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 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 133 [2022-04-08 14:45:03,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:45:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 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 14:45:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2022-04-08 14:45:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 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 14:45:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2022-04-08 14:45:03,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 104 transitions. [2022-04-08 14:45:04,072 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 14:45:04,074 INFO L225 Difference]: With dead ends: 140 [2022-04-08 14:45:04,074 INFO L226 Difference]: Without dead ends: 134 [2022-04-08 14:45:04,074 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:45:04,075 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 14:45:04,075 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 861 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 14:45:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-08 14:45:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-04-08 14:45:04,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:45:04,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:45:04,248 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:45:04,248 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:45:04,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:45:04,255 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2022-04-08 14:45:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-08 14:45:04,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:45:04,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:45:04,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 134 states. [2022-04-08 14:45:04,256 INFO L87 Difference]: Start difference. First operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 134 states. [2022-04-08 14:45:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:45:04,258 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2022-04-08 14:45:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-08 14:45:04,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:45:04,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:45:04,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:45:04,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:45:04,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 20 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:45:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2022-04-08 14:45:04,261 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 133 [2022-04-08 14:45:04,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:45:04,261 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2022-04-08 14:45:04,261 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 16 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 14:45:04,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 137 transitions. [2022-04-08 14:45:04,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:45:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-08 14:45:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-08 14:45:04,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:45:04,590 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:45:04,597 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 14:45:04,790 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 14:45:04,791 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:45:04,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:45:04,791 INFO L85 PathProgramCache]: Analyzing trace with hash -32758546, now seen corresponding path program 25 times [2022-04-08 14:45:04,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:45:04,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1616310466] [2022-04-08 14:45:04,863 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:45:04,863 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:45:04,863 INFO L85 PathProgramCache]: Analyzing trace with hash -32758546, now seen corresponding path program 26 times [2022-04-08 14:45:04,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:45:04,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165588808] [2022-04-08 14:45:04,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:45:04,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:45:04,877 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:45:04,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1831071512] [2022-04-08 14:45:04,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:45:04,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:45:04,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:45:04,878 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 14:45:04,882 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 14:45:04,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:45:04,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:45:04,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 14:45:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:45:04,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:45:05,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {25973#true} call ULTIMATE.init(); {25973#true} is VALID [2022-04-08 14:45:05,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {25973#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);~counter~0 := 0; {25981#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:05,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {25981#(<= ~counter~0 0)} assume true; {25981#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:05,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25981#(<= ~counter~0 0)} {25973#true} #61#return; {25981#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:05,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {25981#(<= ~counter~0 0)} call #t~ret6 := main(); {25981#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:05,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {25981#(<= ~counter~0 0)} 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; {25981#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:05,505 INFO L272 TraceCheckUtils]: 6: Hoare triple {25981#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {25981#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:05,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {25981#(<= ~counter~0 0)} ~cond := #in~cond; {25981#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:05,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {25981#(<= ~counter~0 0)} assume !(0 == ~cond); {25981#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:05,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {25981#(<= ~counter~0 0)} assume true; {25981#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:05,506 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25981#(<= ~counter~0 0)} {25981#(<= ~counter~0 0)} #53#return; {25981#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:05,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {25981#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {25981#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:05,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {25981#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26015#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:05,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {26015#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {26015#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:05,508 INFO L272 TraceCheckUtils]: 14: Hoare triple {26015#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26015#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:05,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {26015#(<= ~counter~0 1)} ~cond := #in~cond; {26015#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:05,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {26015#(<= ~counter~0 1)} assume !(0 == ~cond); {26015#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:05,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {26015#(<= ~counter~0 1)} assume true; {26015#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:05,509 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {26015#(<= ~counter~0 1)} {26015#(<= ~counter~0 1)} #55#return; {26015#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:05,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {26015#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26015#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:05,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {26015#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26040#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:05,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {26040#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {26040#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:05,510 INFO L272 TraceCheckUtils]: 22: Hoare triple {26040#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26040#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:05,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {26040#(<= ~counter~0 2)} ~cond := #in~cond; {26040#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:05,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {26040#(<= ~counter~0 2)} assume !(0 == ~cond); {26040#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:05,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {26040#(<= ~counter~0 2)} assume true; {26040#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:05,511 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {26040#(<= ~counter~0 2)} {26040#(<= ~counter~0 2)} #55#return; {26040#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:05,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {26040#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26040#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:05,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {26040#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26065#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:05,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {26065#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {26065#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:05,512 INFO L272 TraceCheckUtils]: 30: Hoare triple {26065#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26065#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:05,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {26065#(<= ~counter~0 3)} ~cond := #in~cond; {26065#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:05,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {26065#(<= ~counter~0 3)} assume !(0 == ~cond); {26065#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:05,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {26065#(<= ~counter~0 3)} assume true; {26065#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:05,513 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {26065#(<= ~counter~0 3)} {26065#(<= ~counter~0 3)} #55#return; {26065#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:05,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {26065#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26065#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:05,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {26065#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26090#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:05,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {26090#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {26090#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:05,514 INFO L272 TraceCheckUtils]: 38: Hoare triple {26090#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26090#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:05,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {26090#(<= ~counter~0 4)} ~cond := #in~cond; {26090#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:05,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {26090#(<= ~counter~0 4)} assume !(0 == ~cond); {26090#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:05,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {26090#(<= ~counter~0 4)} assume true; {26090#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:05,515 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {26090#(<= ~counter~0 4)} {26090#(<= ~counter~0 4)} #55#return; {26090#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:05,515 INFO L290 TraceCheckUtils]: 43: Hoare triple {26090#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26090#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:05,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {26090#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26115#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:05,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {26115#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {26115#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:05,516 INFO L272 TraceCheckUtils]: 46: Hoare triple {26115#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26115#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:05,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {26115#(<= ~counter~0 5)} ~cond := #in~cond; {26115#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:05,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {26115#(<= ~counter~0 5)} assume !(0 == ~cond); {26115#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:05,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {26115#(<= ~counter~0 5)} assume true; {26115#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:05,517 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26115#(<= ~counter~0 5)} {26115#(<= ~counter~0 5)} #55#return; {26115#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:05,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {26115#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26115#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:05,518 INFO L290 TraceCheckUtils]: 52: Hoare triple {26115#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26140#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:05,518 INFO L290 TraceCheckUtils]: 53: Hoare triple {26140#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {26140#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:05,518 INFO L272 TraceCheckUtils]: 54: Hoare triple {26140#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26140#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:05,518 INFO L290 TraceCheckUtils]: 55: Hoare triple {26140#(<= ~counter~0 6)} ~cond := #in~cond; {26140#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:05,519 INFO L290 TraceCheckUtils]: 56: Hoare triple {26140#(<= ~counter~0 6)} assume !(0 == ~cond); {26140#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:05,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {26140#(<= ~counter~0 6)} assume true; {26140#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:05,519 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {26140#(<= ~counter~0 6)} {26140#(<= ~counter~0 6)} #55#return; {26140#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:05,519 INFO L290 TraceCheckUtils]: 59: Hoare triple {26140#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26140#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:05,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {26140#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26165#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:05,520 INFO L290 TraceCheckUtils]: 61: Hoare triple {26165#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {26165#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:05,520 INFO L272 TraceCheckUtils]: 62: Hoare triple {26165#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26165#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:05,520 INFO L290 TraceCheckUtils]: 63: Hoare triple {26165#(<= ~counter~0 7)} ~cond := #in~cond; {26165#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:05,521 INFO L290 TraceCheckUtils]: 64: Hoare triple {26165#(<= ~counter~0 7)} assume !(0 == ~cond); {26165#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:05,521 INFO L290 TraceCheckUtils]: 65: Hoare triple {26165#(<= ~counter~0 7)} assume true; {26165#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:05,521 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {26165#(<= ~counter~0 7)} {26165#(<= ~counter~0 7)} #55#return; {26165#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:05,521 INFO L290 TraceCheckUtils]: 67: Hoare triple {26165#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26165#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:05,522 INFO L290 TraceCheckUtils]: 68: Hoare triple {26165#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26190#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:05,522 INFO L290 TraceCheckUtils]: 69: Hoare triple {26190#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {26190#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:05,522 INFO L272 TraceCheckUtils]: 70: Hoare triple {26190#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26190#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:05,522 INFO L290 TraceCheckUtils]: 71: Hoare triple {26190#(<= ~counter~0 8)} ~cond := #in~cond; {26190#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:05,523 INFO L290 TraceCheckUtils]: 72: Hoare triple {26190#(<= ~counter~0 8)} assume !(0 == ~cond); {26190#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:05,523 INFO L290 TraceCheckUtils]: 73: Hoare triple {26190#(<= ~counter~0 8)} assume true; {26190#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:05,523 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {26190#(<= ~counter~0 8)} {26190#(<= ~counter~0 8)} #55#return; {26190#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:05,523 INFO L290 TraceCheckUtils]: 75: Hoare triple {26190#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26190#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:05,524 INFO L290 TraceCheckUtils]: 76: Hoare triple {26190#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26215#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:05,524 INFO L290 TraceCheckUtils]: 77: Hoare triple {26215#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {26215#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:05,524 INFO L272 TraceCheckUtils]: 78: Hoare triple {26215#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26215#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:05,524 INFO L290 TraceCheckUtils]: 79: Hoare triple {26215#(<= ~counter~0 9)} ~cond := #in~cond; {26215#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:05,525 INFO L290 TraceCheckUtils]: 80: Hoare triple {26215#(<= ~counter~0 9)} assume !(0 == ~cond); {26215#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:05,525 INFO L290 TraceCheckUtils]: 81: Hoare triple {26215#(<= ~counter~0 9)} assume true; {26215#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:05,525 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {26215#(<= ~counter~0 9)} {26215#(<= ~counter~0 9)} #55#return; {26215#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:05,525 INFO L290 TraceCheckUtils]: 83: Hoare triple {26215#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26215#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:05,526 INFO L290 TraceCheckUtils]: 84: Hoare triple {26215#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26240#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:05,526 INFO L290 TraceCheckUtils]: 85: Hoare triple {26240#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {26240#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:05,526 INFO L272 TraceCheckUtils]: 86: Hoare triple {26240#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26240#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:05,526 INFO L290 TraceCheckUtils]: 87: Hoare triple {26240#(<= ~counter~0 10)} ~cond := #in~cond; {26240#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:05,527 INFO L290 TraceCheckUtils]: 88: Hoare triple {26240#(<= ~counter~0 10)} assume !(0 == ~cond); {26240#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:05,527 INFO L290 TraceCheckUtils]: 89: Hoare triple {26240#(<= ~counter~0 10)} assume true; {26240#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:05,527 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {26240#(<= ~counter~0 10)} {26240#(<= ~counter~0 10)} #55#return; {26240#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:05,527 INFO L290 TraceCheckUtils]: 91: Hoare triple {26240#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26240#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:05,528 INFO L290 TraceCheckUtils]: 92: Hoare triple {26240#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26265#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:05,528 INFO L290 TraceCheckUtils]: 93: Hoare triple {26265#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {26265#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:05,528 INFO L272 TraceCheckUtils]: 94: Hoare triple {26265#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26265#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:05,528 INFO L290 TraceCheckUtils]: 95: Hoare triple {26265#(<= ~counter~0 11)} ~cond := #in~cond; {26265#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:05,529 INFO L290 TraceCheckUtils]: 96: Hoare triple {26265#(<= ~counter~0 11)} assume !(0 == ~cond); {26265#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:05,529 INFO L290 TraceCheckUtils]: 97: Hoare triple {26265#(<= ~counter~0 11)} assume true; {26265#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:05,529 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {26265#(<= ~counter~0 11)} {26265#(<= ~counter~0 11)} #55#return; {26265#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:05,529 INFO L290 TraceCheckUtils]: 99: Hoare triple {26265#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26265#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:05,530 INFO L290 TraceCheckUtils]: 100: Hoare triple {26265#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26290#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:05,530 INFO L290 TraceCheckUtils]: 101: Hoare triple {26290#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {26290#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:05,530 INFO L272 TraceCheckUtils]: 102: Hoare triple {26290#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26290#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:05,530 INFO L290 TraceCheckUtils]: 103: Hoare triple {26290#(<= ~counter~0 12)} ~cond := #in~cond; {26290#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:05,531 INFO L290 TraceCheckUtils]: 104: Hoare triple {26290#(<= ~counter~0 12)} assume !(0 == ~cond); {26290#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:05,531 INFO L290 TraceCheckUtils]: 105: Hoare triple {26290#(<= ~counter~0 12)} assume true; {26290#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:05,531 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {26290#(<= ~counter~0 12)} {26290#(<= ~counter~0 12)} #55#return; {26290#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:05,531 INFO L290 TraceCheckUtils]: 107: Hoare triple {26290#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26290#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:05,551 INFO L290 TraceCheckUtils]: 108: Hoare triple {26290#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26315#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:05,552 INFO L290 TraceCheckUtils]: 109: Hoare triple {26315#(<= ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {26315#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:05,552 INFO L272 TraceCheckUtils]: 110: Hoare triple {26315#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26315#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:05,553 INFO L290 TraceCheckUtils]: 111: Hoare triple {26315#(<= ~counter~0 13)} ~cond := #in~cond; {26315#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:05,553 INFO L290 TraceCheckUtils]: 112: Hoare triple {26315#(<= ~counter~0 13)} assume !(0 == ~cond); {26315#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:05,553 INFO L290 TraceCheckUtils]: 113: Hoare triple {26315#(<= ~counter~0 13)} assume true; {26315#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:05,553 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {26315#(<= ~counter~0 13)} {26315#(<= ~counter~0 13)} #55#return; {26315#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:05,553 INFO L290 TraceCheckUtils]: 115: Hoare triple {26315#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26315#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:05,555 INFO L290 TraceCheckUtils]: 116: Hoare triple {26315#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26340#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:05,555 INFO L290 TraceCheckUtils]: 117: Hoare triple {26340#(<= ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {26340#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:05,555 INFO L272 TraceCheckUtils]: 118: Hoare triple {26340#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26340#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:05,555 INFO L290 TraceCheckUtils]: 119: Hoare triple {26340#(<= ~counter~0 14)} ~cond := #in~cond; {26340#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:05,555 INFO L290 TraceCheckUtils]: 120: Hoare triple {26340#(<= ~counter~0 14)} assume !(0 == ~cond); {26340#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:05,556 INFO L290 TraceCheckUtils]: 121: Hoare triple {26340#(<= ~counter~0 14)} assume true; {26340#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:05,556 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {26340#(<= ~counter~0 14)} {26340#(<= ~counter~0 14)} #55#return; {26340#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:05,556 INFO L290 TraceCheckUtils]: 123: Hoare triple {26340#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26340#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:05,556 INFO L290 TraceCheckUtils]: 124: Hoare triple {26340#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26365#(<= |main_#t~post5| 14)} is VALID [2022-04-08 14:45:05,557 INFO L290 TraceCheckUtils]: 125: Hoare triple {26365#(<= |main_#t~post5| 14)} assume !(#t~post5 < 20);havoc #t~post5; {25974#false} is VALID [2022-04-08 14:45:05,557 INFO L272 TraceCheckUtils]: 126: Hoare triple {25974#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25974#false} is VALID [2022-04-08 14:45:05,557 INFO L290 TraceCheckUtils]: 127: Hoare triple {25974#false} ~cond := #in~cond; {25974#false} is VALID [2022-04-08 14:45:05,557 INFO L290 TraceCheckUtils]: 128: Hoare triple {25974#false} assume !(0 == ~cond); {25974#false} is VALID [2022-04-08 14:45:05,557 INFO L290 TraceCheckUtils]: 129: Hoare triple {25974#false} assume true; {25974#false} is VALID [2022-04-08 14:45:05,557 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25974#false} {25974#false} #57#return; {25974#false} is VALID [2022-04-08 14:45:05,557 INFO L272 TraceCheckUtils]: 131: Hoare triple {25974#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {25974#false} is VALID [2022-04-08 14:45:05,557 INFO L290 TraceCheckUtils]: 132: Hoare triple {25974#false} ~cond := #in~cond; {25974#false} is VALID [2022-04-08 14:45:05,557 INFO L290 TraceCheckUtils]: 133: Hoare triple {25974#false} assume 0 == ~cond; {25974#false} is VALID [2022-04-08 14:45:05,557 INFO L290 TraceCheckUtils]: 134: Hoare triple {25974#false} assume !false; {25974#false} is VALID [2022-04-08 14:45:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 84 proven. 756 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:45:05,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:45:06,078 INFO L290 TraceCheckUtils]: 134: Hoare triple {25974#false} assume !false; {25974#false} is VALID [2022-04-08 14:45:06,078 INFO L290 TraceCheckUtils]: 133: Hoare triple {25974#false} assume 0 == ~cond; {25974#false} is VALID [2022-04-08 14:45:06,078 INFO L290 TraceCheckUtils]: 132: Hoare triple {25974#false} ~cond := #in~cond; {25974#false} is VALID [2022-04-08 14:45:06,078 INFO L272 TraceCheckUtils]: 131: Hoare triple {25974#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {25974#false} is VALID [2022-04-08 14:45:06,078 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25973#true} {25974#false} #57#return; {25974#false} is VALID [2022-04-08 14:45:06,079 INFO L290 TraceCheckUtils]: 129: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,079 INFO L290 TraceCheckUtils]: 128: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,079 INFO L290 TraceCheckUtils]: 127: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,079 INFO L272 TraceCheckUtils]: 126: Hoare triple {25974#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,079 INFO L290 TraceCheckUtils]: 125: Hoare triple {26423#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {25974#false} is VALID [2022-04-08 14:45:06,079 INFO L290 TraceCheckUtils]: 124: Hoare triple {26427#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26423#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:45:06,080 INFO L290 TraceCheckUtils]: 123: Hoare triple {26427#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26427#(< ~counter~0 20)} is VALID [2022-04-08 14:45:06,080 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {25973#true} {26427#(< ~counter~0 20)} #55#return; {26427#(< ~counter~0 20)} is VALID [2022-04-08 14:45:06,080 INFO L290 TraceCheckUtils]: 121: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,080 INFO L290 TraceCheckUtils]: 120: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,080 INFO L290 TraceCheckUtils]: 119: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,080 INFO L272 TraceCheckUtils]: 118: Hoare triple {26427#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,081 INFO L290 TraceCheckUtils]: 117: Hoare triple {26427#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {26427#(< ~counter~0 20)} is VALID [2022-04-08 14:45:06,082 INFO L290 TraceCheckUtils]: 116: Hoare triple {26452#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26427#(< ~counter~0 20)} is VALID [2022-04-08 14:45:06,082 INFO L290 TraceCheckUtils]: 115: Hoare triple {26452#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26452#(< ~counter~0 19)} is VALID [2022-04-08 14:45:06,083 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {25973#true} {26452#(< ~counter~0 19)} #55#return; {26452#(< ~counter~0 19)} is VALID [2022-04-08 14:45:06,083 INFO L290 TraceCheckUtils]: 113: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,083 INFO L290 TraceCheckUtils]: 112: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,083 INFO L290 TraceCheckUtils]: 111: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,083 INFO L272 TraceCheckUtils]: 110: Hoare triple {26452#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,083 INFO L290 TraceCheckUtils]: 109: Hoare triple {26452#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {26452#(< ~counter~0 19)} is VALID [2022-04-08 14:45:06,084 INFO L290 TraceCheckUtils]: 108: Hoare triple {26477#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26452#(< ~counter~0 19)} is VALID [2022-04-08 14:45:06,084 INFO L290 TraceCheckUtils]: 107: Hoare triple {26477#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26477#(< ~counter~0 18)} is VALID [2022-04-08 14:45:06,085 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {25973#true} {26477#(< ~counter~0 18)} #55#return; {26477#(< ~counter~0 18)} is VALID [2022-04-08 14:45:06,085 INFO L290 TraceCheckUtils]: 105: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,085 INFO L290 TraceCheckUtils]: 104: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,085 INFO L290 TraceCheckUtils]: 103: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,085 INFO L272 TraceCheckUtils]: 102: Hoare triple {26477#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,085 INFO L290 TraceCheckUtils]: 101: Hoare triple {26477#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {26477#(< ~counter~0 18)} is VALID [2022-04-08 14:45:06,086 INFO L290 TraceCheckUtils]: 100: Hoare triple {26502#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26477#(< ~counter~0 18)} is VALID [2022-04-08 14:45:06,086 INFO L290 TraceCheckUtils]: 99: Hoare triple {26502#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26502#(< ~counter~0 17)} is VALID [2022-04-08 14:45:06,086 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25973#true} {26502#(< ~counter~0 17)} #55#return; {26502#(< ~counter~0 17)} is VALID [2022-04-08 14:45:06,087 INFO L290 TraceCheckUtils]: 97: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,087 INFO L290 TraceCheckUtils]: 96: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,087 INFO L290 TraceCheckUtils]: 95: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,087 INFO L272 TraceCheckUtils]: 94: Hoare triple {26502#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,087 INFO L290 TraceCheckUtils]: 93: Hoare triple {26502#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {26502#(< ~counter~0 17)} is VALID [2022-04-08 14:45:06,088 INFO L290 TraceCheckUtils]: 92: Hoare triple {26527#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26502#(< ~counter~0 17)} is VALID [2022-04-08 14:45:06,088 INFO L290 TraceCheckUtils]: 91: Hoare triple {26527#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26527#(< ~counter~0 16)} is VALID [2022-04-08 14:45:06,088 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {25973#true} {26527#(< ~counter~0 16)} #55#return; {26527#(< ~counter~0 16)} is VALID [2022-04-08 14:45:06,088 INFO L290 TraceCheckUtils]: 89: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,088 INFO L290 TraceCheckUtils]: 88: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,089 INFO L290 TraceCheckUtils]: 87: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,089 INFO L272 TraceCheckUtils]: 86: Hoare triple {26527#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,089 INFO L290 TraceCheckUtils]: 85: Hoare triple {26527#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {26527#(< ~counter~0 16)} is VALID [2022-04-08 14:45:06,090 INFO L290 TraceCheckUtils]: 84: Hoare triple {26340#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26527#(< ~counter~0 16)} is VALID [2022-04-08 14:45:06,090 INFO L290 TraceCheckUtils]: 83: Hoare triple {26340#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26340#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:06,090 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {25973#true} {26340#(<= ~counter~0 14)} #55#return; {26340#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:06,090 INFO L290 TraceCheckUtils]: 81: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,090 INFO L290 TraceCheckUtils]: 80: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,090 INFO L290 TraceCheckUtils]: 79: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,091 INFO L272 TraceCheckUtils]: 78: Hoare triple {26340#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,091 INFO L290 TraceCheckUtils]: 77: Hoare triple {26340#(<= ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {26340#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:06,091 INFO L290 TraceCheckUtils]: 76: Hoare triple {26315#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26340#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:06,092 INFO L290 TraceCheckUtils]: 75: Hoare triple {26315#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26315#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:06,092 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {25973#true} {26315#(<= ~counter~0 13)} #55#return; {26315#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:06,092 INFO L290 TraceCheckUtils]: 73: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,092 INFO L290 TraceCheckUtils]: 72: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,092 INFO L290 TraceCheckUtils]: 71: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,092 INFO L272 TraceCheckUtils]: 70: Hoare triple {26315#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,093 INFO L290 TraceCheckUtils]: 69: Hoare triple {26315#(<= ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {26315#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:06,093 INFO L290 TraceCheckUtils]: 68: Hoare triple {26290#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26315#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:06,094 INFO L290 TraceCheckUtils]: 67: Hoare triple {26290#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26290#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:06,094 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {25973#true} {26290#(<= ~counter~0 12)} #55#return; {26290#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:06,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,094 INFO L272 TraceCheckUtils]: 62: Hoare triple {26290#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,119 INFO L290 TraceCheckUtils]: 61: Hoare triple {26290#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {26290#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:06,120 INFO L290 TraceCheckUtils]: 60: Hoare triple {26265#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26290#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:06,120 INFO L290 TraceCheckUtils]: 59: Hoare triple {26265#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26265#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:06,121 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {25973#true} {26265#(<= ~counter~0 11)} #55#return; {26265#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:06,121 INFO L290 TraceCheckUtils]: 57: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,121 INFO L290 TraceCheckUtils]: 56: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,121 INFO L290 TraceCheckUtils]: 55: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,121 INFO L272 TraceCheckUtils]: 54: Hoare triple {26265#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,121 INFO L290 TraceCheckUtils]: 53: Hoare triple {26265#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {26265#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:06,122 INFO L290 TraceCheckUtils]: 52: Hoare triple {26240#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26265#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:06,122 INFO L290 TraceCheckUtils]: 51: Hoare triple {26240#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26240#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:06,123 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25973#true} {26240#(<= ~counter~0 10)} #55#return; {26240#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:06,123 INFO L290 TraceCheckUtils]: 49: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,123 INFO L290 TraceCheckUtils]: 48: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,123 INFO L290 TraceCheckUtils]: 47: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,123 INFO L272 TraceCheckUtils]: 46: Hoare triple {26240#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {26240#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {26240#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:06,124 INFO L290 TraceCheckUtils]: 44: Hoare triple {26215#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26240#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:06,124 INFO L290 TraceCheckUtils]: 43: Hoare triple {26215#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26215#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:06,125 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {25973#true} {26215#(<= ~counter~0 9)} #55#return; {26215#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:06,125 INFO L290 TraceCheckUtils]: 41: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,125 INFO L272 TraceCheckUtils]: 38: Hoare triple {26215#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {26215#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {26215#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:06,126 INFO L290 TraceCheckUtils]: 36: Hoare triple {26190#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26215#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:06,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {26190#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26190#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:06,126 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {25973#true} {26190#(<= ~counter~0 8)} #55#return; {26190#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:06,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,127 INFO L272 TraceCheckUtils]: 30: Hoare triple {26190#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {26190#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {26190#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:06,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {26165#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26190#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:06,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {26165#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26165#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:06,128 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {25973#true} {26165#(<= ~counter~0 7)} #55#return; {26165#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:06,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,129 INFO L272 TraceCheckUtils]: 22: Hoare triple {26165#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {26165#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {26165#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:06,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {26140#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26165#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:06,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {26140#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {26140#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:06,130 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25973#true} {26140#(<= ~counter~0 6)} #55#return; {26140#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:06,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,131 INFO L272 TraceCheckUtils]: 14: Hoare triple {26140#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {26140#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {26140#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:06,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {26115#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26140#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:06,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {26115#(<= ~counter~0 5)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {26115#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:06,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25973#true} {26115#(<= ~counter~0 5)} #53#return; {26115#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:06,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {25973#true} assume true; {25973#true} is VALID [2022-04-08 14:45:06,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {25973#true} assume !(0 == ~cond); {25973#true} is VALID [2022-04-08 14:45:06,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {25973#true} ~cond := #in~cond; {25973#true} is VALID [2022-04-08 14:45:06,132 INFO L272 TraceCheckUtils]: 6: Hoare triple {26115#(<= ~counter~0 5)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {25973#true} is VALID [2022-04-08 14:45:06,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {26115#(<= ~counter~0 5)} 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; {26115#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:06,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {26115#(<= ~counter~0 5)} call #t~ret6 := main(); {26115#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:06,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26115#(<= ~counter~0 5)} {25973#true} #61#return; {26115#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:06,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {26115#(<= ~counter~0 5)} assume true; {26115#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:06,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {25973#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);~counter~0 := 0; {26115#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:06,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {25973#true} call ULTIMATE.init(); {25973#true} is VALID [2022-04-08 14:45:06,135 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 30 proven. 392 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-08 14:45:06,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:45:06,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165588808] [2022-04-08 14:45:06,135 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:45:06,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831071512] [2022-04-08 14:45:06,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831071512] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:45:06,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:45:06,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-04-08 14:45:06,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:45:06,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1616310466] [2022-04-08 14:45:06,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1616310466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:45:06,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:45:06,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 14:45:06,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667004087] [2022-04-08 14:45:06,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:45:06,137 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Word has length 135 [2022-04-08 14:45:06,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:45:06,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:45:06,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:45:06,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 14:45:06,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:45:06,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 14:45:06,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:45:06,255 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:45:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:45:06,978 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2022-04-08 14:45:06,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 14:45:06,978 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Word has length 135 [2022-04-08 14:45:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:45:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:45:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 150 transitions. [2022-04-08 14:45:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:45:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 150 transitions. [2022-04-08 14:45:06,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 150 transitions. [2022-04-08 14:45:07,115 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 14:45:07,116 INFO L225 Difference]: With dead ends: 150 [2022-04-08 14:45:07,116 INFO L226 Difference]: Without dead ends: 140 [2022-04-08 14:45:07,117 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=558, Invalid=848, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 14:45:07,117 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:45:07,118 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 174 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:45:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-08 14:45:07,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-04-08 14:45:07,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:45:07,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:45:07,339 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:45:07,339 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:45:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:45:07,342 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2022-04-08 14:45:07,342 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2022-04-08 14:45:07,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:45:07,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:45:07,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 140 states. [2022-04-08 14:45:07,343 INFO L87 Difference]: Start difference. First operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 140 states. [2022-04-08 14:45:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:45:07,344 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2022-04-08 14:45:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2022-04-08 14:45:07,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:45:07,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:45:07,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:45:07,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:45:07,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:45:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2022-04-08 14:45:07,346 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 135 [2022-04-08 14:45:07,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:45:07,347 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2022-04-08 14:45:07,347 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:45:07,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 142 transitions. [2022-04-08 14:45:07,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:45:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2022-04-08 14:45:07,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-08 14:45:07,656 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:45:07,656 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:45:07,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-08 14:45:07,857 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 14:45:07,857 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:45:07,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:45:07,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1590123308, now seen corresponding path program 27 times [2022-04-08 14:45:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:45:07,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2088745417] [2022-04-08 14:45:07,943 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:45:07,943 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:45:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1590123308, now seen corresponding path program 28 times [2022-04-08 14:45:07,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:45:07,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392849854] [2022-04-08 14:45:07,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:45:07,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:45:07,958 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:45:07,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [993527007] [2022-04-08 14:45:07,958 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:45:07,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:45:07,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:45:07,959 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 14:45:07,960 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 14:45:08,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:45:08,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:45:08,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-08 14:45:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:45:08,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:45:08,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {27694#true} call ULTIMATE.init(); {27694#true} is VALID [2022-04-08 14:45:08,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {27694#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);~counter~0 := 0; {27694#true} is VALID [2022-04-08 14:45:08,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27694#true} {27694#true} #61#return; {27694#true} is VALID [2022-04-08 14:45:08,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {27694#true} call #t~ret6 := main(); {27694#true} is VALID [2022-04-08 14:45:08,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {27694#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; {27694#true} is VALID [2022-04-08 14:45:08,866 INFO L272 TraceCheckUtils]: 6: Hoare triple {27694#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,866 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27694#true} {27694#true} #53#return; {27694#true} is VALID [2022-04-08 14:45:08,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {27694#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {27732#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:45:08,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {27732#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27732#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:45:08,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {27732#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {27732#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:45:08,867 INFO L272 TraceCheckUtils]: 14: Hoare triple {27732#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,868 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {27694#true} {27732#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {27732#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:45:08,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {27732#(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 * ~y~0 * ~y~0 + ~x~0; {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:45:08,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:45:08,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:45:08,869 INFO L272 TraceCheckUtils]: 22: Hoare triple {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,870 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27694#true} {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {27757#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:45:08,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {27757#(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 * ~y~0 * ~y~0 + ~x~0; {27782#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:45:08,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {27782#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27782#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:45:08,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {27782#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {27782#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:45:08,871 INFO L272 TraceCheckUtils]: 30: Hoare triple {27782#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,871 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {27694#true} {27782#(and (= main_~y~0 2) (= main_~c~0 2))} #55#return; {27782#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:45:08,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {27782#(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 * ~y~0 * ~y~0 + ~x~0; {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:45:08,872 INFO L290 TraceCheckUtils]: 36: Hoare triple {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:45:08,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:45:08,873 INFO L272 TraceCheckUtils]: 38: Hoare triple {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,873 INFO L290 TraceCheckUtils]: 40: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,873 INFO L290 TraceCheckUtils]: 41: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,873 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {27694#true} {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #55#return; {27807#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:45:08,874 INFO L290 TraceCheckUtils]: 43: Hoare triple {27807#(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 * ~y~0 * ~y~0 + ~x~0; {27832#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:45:08,874 INFO L290 TraceCheckUtils]: 44: Hoare triple {27832#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27832#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:45:08,874 INFO L290 TraceCheckUtils]: 45: Hoare triple {27832#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {27832#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:45:08,874 INFO L272 TraceCheckUtils]: 46: Hoare triple {27832#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,875 INFO L290 TraceCheckUtils]: 47: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,875 INFO L290 TraceCheckUtils]: 48: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,875 INFO L290 TraceCheckUtils]: 49: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,875 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {27694#true} {27832#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {27832#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:45:08,875 INFO L290 TraceCheckUtils]: 51: Hoare triple {27832#(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 * ~y~0 * ~y~0 + ~x~0; {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:45:08,876 INFO L290 TraceCheckUtils]: 52: Hoare triple {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:45:08,876 INFO L290 TraceCheckUtils]: 53: Hoare triple {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:45:08,876 INFO L272 TraceCheckUtils]: 54: Hoare triple {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,876 INFO L290 TraceCheckUtils]: 55: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,876 INFO L290 TraceCheckUtils]: 56: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,876 INFO L290 TraceCheckUtils]: 57: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,877 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27694#true} {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {27857#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:45:08,877 INFO L290 TraceCheckUtils]: 59: Hoare triple {27857#(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 * ~y~0 * ~y~0 + ~x~0; {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:45:08,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:45:08,878 INFO L290 TraceCheckUtils]: 61: Hoare triple {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:45:08,878 INFO L272 TraceCheckUtils]: 62: Hoare triple {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,878 INFO L290 TraceCheckUtils]: 63: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,878 INFO L290 TraceCheckUtils]: 64: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,878 INFO L290 TraceCheckUtils]: 65: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,879 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27694#true} {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} #55#return; {27882#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:45:08,879 INFO L290 TraceCheckUtils]: 67: Hoare triple {27882#(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 * ~y~0 * ~y~0 + ~x~0; {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 14:45:08,880 INFO L290 TraceCheckUtils]: 68: Hoare triple {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 14:45:08,880 INFO L290 TraceCheckUtils]: 69: Hoare triple {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 14:45:08,880 INFO L272 TraceCheckUtils]: 70: Hoare triple {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,880 INFO L290 TraceCheckUtils]: 73: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,881 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27694#true} {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} #55#return; {27907#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 14:45:08,881 INFO L290 TraceCheckUtils]: 75: Hoare triple {27907#(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 * ~y~0 * ~y~0 + ~x~0; {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 14:45:08,881 INFO L290 TraceCheckUtils]: 76: Hoare triple {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 14:45:08,882 INFO L290 TraceCheckUtils]: 77: Hoare triple {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} assume !!(#t~post5 < 20);havoc #t~post5; {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 14:45:08,882 INFO L272 TraceCheckUtils]: 78: Hoare triple {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,882 INFO L290 TraceCheckUtils]: 79: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,882 INFO L290 TraceCheckUtils]: 80: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,882 INFO L290 TraceCheckUtils]: 81: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,882 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {27694#true} {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} #55#return; {27932#(and (= 7 (+ (- 1) main_~y~0)) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 14:45:08,883 INFO L290 TraceCheckUtils]: 83: Hoare triple {27932#(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 * ~y~0 * ~y~0 + ~x~0; {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 14:45:08,883 INFO L290 TraceCheckUtils]: 84: Hoare triple {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 14:45:08,884 INFO L290 TraceCheckUtils]: 85: Hoare triple {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 14:45:08,884 INFO L272 TraceCheckUtils]: 86: Hoare triple {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,884 INFO L290 TraceCheckUtils]: 87: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,884 INFO L290 TraceCheckUtils]: 88: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,884 INFO L290 TraceCheckUtils]: 89: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,884 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {27694#true} {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} #55#return; {27957#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-08 14:45:08,885 INFO L290 TraceCheckUtils]: 91: Hoare triple {27957#(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 * ~y~0 * ~y~0 + ~x~0; {27982#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:45:08,885 INFO L290 TraceCheckUtils]: 92: Hoare triple {27982#(and (= main_~y~0 10) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27982#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:45:08,885 INFO L290 TraceCheckUtils]: 93: Hoare triple {27982#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(#t~post5 < 20);havoc #t~post5; {27982#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:45:08,885 INFO L272 TraceCheckUtils]: 94: Hoare triple {27982#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,886 INFO L290 TraceCheckUtils]: 95: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,886 INFO L290 TraceCheckUtils]: 96: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,886 INFO L290 TraceCheckUtils]: 97: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,886 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {27694#true} {27982#(and (= main_~y~0 10) (= main_~c~0 10))} #55#return; {27982#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:45:08,887 INFO L290 TraceCheckUtils]: 99: Hoare triple {27982#(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 * ~y~0 * ~y~0 + ~x~0; {28007#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 14:45:08,887 INFO L290 TraceCheckUtils]: 100: Hoare triple {28007#(and (= main_~c~0 11) (= main_~y~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28007#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 14:45:08,887 INFO L290 TraceCheckUtils]: 101: Hoare triple {28007#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(#t~post5 < 20);havoc #t~post5; {28007#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 14:45:08,887 INFO L272 TraceCheckUtils]: 102: Hoare triple {28007#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,887 INFO L290 TraceCheckUtils]: 103: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,887 INFO L290 TraceCheckUtils]: 104: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,888 INFO L290 TraceCheckUtils]: 105: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,888 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {27694#true} {28007#(and (= main_~c~0 11) (= main_~y~0 11))} #55#return; {28007#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 14:45:08,888 INFO L290 TraceCheckUtils]: 107: Hoare triple {28007#(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 * ~y~0 * ~y~0 + ~x~0; {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 14:45:08,889 INFO L290 TraceCheckUtils]: 108: Hoare triple {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 14:45:08,889 INFO L290 TraceCheckUtils]: 109: Hoare triple {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} assume !!(#t~post5 < 20);havoc #t~post5; {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 14:45:08,889 INFO L272 TraceCheckUtils]: 110: Hoare triple {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,889 INFO L290 TraceCheckUtils]: 111: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,889 INFO L290 TraceCheckUtils]: 112: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,889 INFO L290 TraceCheckUtils]: 113: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,890 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {27694#true} {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} #55#return; {28032#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 14:45:08,890 INFO L290 TraceCheckUtils]: 115: Hoare triple {28032#(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 * ~y~0 * ~y~0 + ~x~0; {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 14:45:08,891 INFO L290 TraceCheckUtils]: 116: Hoare triple {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 14:45:08,891 INFO L290 TraceCheckUtils]: 117: Hoare triple {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} assume !!(#t~post5 < 20);havoc #t~post5; {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 14:45:08,891 INFO L272 TraceCheckUtils]: 118: Hoare triple {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,891 INFO L290 TraceCheckUtils]: 119: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,891 INFO L290 TraceCheckUtils]: 120: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,891 INFO L290 TraceCheckUtils]: 121: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,892 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {27694#true} {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} #55#return; {28057#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-08 14:45:08,892 INFO L290 TraceCheckUtils]: 123: Hoare triple {28057#(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 * ~y~0 * ~y~0 + ~x~0; {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 14:45:08,892 INFO L290 TraceCheckUtils]: 124: Hoare triple {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 14:45:08,893 INFO L290 TraceCheckUtils]: 125: Hoare triple {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} assume !!(#t~post5 < 20);havoc #t~post5; {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 14:45:08,893 INFO L272 TraceCheckUtils]: 126: Hoare triple {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,893 INFO L290 TraceCheckUtils]: 127: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,893 INFO L290 TraceCheckUtils]: 128: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,893 INFO L290 TraceCheckUtils]: 129: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,894 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {27694#true} {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} #55#return; {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} is VALID [2022-04-08 14:45:08,894 INFO L290 TraceCheckUtils]: 131: Hoare triple {28082#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {28107#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-08 14:45:08,894 INFO L272 TraceCheckUtils]: 132: Hoare triple {28107#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~k~0 14))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27694#true} is VALID [2022-04-08 14:45:08,894 INFO L290 TraceCheckUtils]: 133: Hoare triple {27694#true} ~cond := #in~cond; {27694#true} is VALID [2022-04-08 14:45:08,894 INFO L290 TraceCheckUtils]: 134: Hoare triple {27694#true} assume !(0 == ~cond); {27694#true} is VALID [2022-04-08 14:45:08,894 INFO L290 TraceCheckUtils]: 135: Hoare triple {27694#true} assume true; {27694#true} is VALID [2022-04-08 14:45:08,895 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {27694#true} {28107#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~k~0 14))} #57#return; {28107#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~k~0 14))} is VALID [2022-04-08 14:45:08,895 INFO L272 TraceCheckUtils]: 137: Hoare triple {28107#(and (= (+ main_~y~0 (- 3)) 11) (< 13 main_~k~0) (<= main_~k~0 14))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {28126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:45:08,896 INFO L290 TraceCheckUtils]: 138: Hoare triple {28126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:45:08,896 INFO L290 TraceCheckUtils]: 139: Hoare triple {28130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27695#false} is VALID [2022-04-08 14:45:08,896 INFO L290 TraceCheckUtils]: 140: Hoare triple {27695#false} assume !false; {27695#false} is VALID [2022-04-08 14:45:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 32 proven. 420 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 14:45:08,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:45:09,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:45:09,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392849854] [2022-04-08 14:45:09,198 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:45:09,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993527007] [2022-04-08 14:45:09,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993527007] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:45:09,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:45:09,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-08 14:45:09,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:45:09,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2088745417] [2022-04-08 14:45:09,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2088745417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:45:09,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:45:09,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 14:45:09,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728980902] [2022-04-08 14:45:09,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:45:09,200 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 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 141 [2022-04-08 14:45:09,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:45:09,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 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 14:45:09,289 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 14:45:09,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 14:45:09,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:45:09,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 14:45:09,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-08 14:45:09,291 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 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 14:45:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:45:11,423 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2022-04-08 14:45:11,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 14:45:11,423 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 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 141 [2022-04-08 14:45:11,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:45:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 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 14:45:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2022-04-08 14:45:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 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 14:45:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2022-04-08 14:45:11,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 109 transitions. [2022-04-08 14:45:11,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:45:11,512 INFO L225 Difference]: With dead ends: 148 [2022-04-08 14:45:11,512 INFO L226 Difference]: Without dead ends: 142 [2022-04-08 14:45:11,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 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 14:45:11,513 INFO L913 BasicCegarLoop]: 83 mSDtfsCounter, 2 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 14:45:11,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 947 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 14:45:11,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-08 14:45:11,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-04-08 14:45:11,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:45:11,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:45:11,671 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:45:11,671 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:45:11,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:45:11,673 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2022-04-08 14:45:11,673 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2022-04-08 14:45:11,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:45:11,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:45:11,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 142 states. [2022-04-08 14:45:11,674 INFO L87 Difference]: Start difference. First operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 142 states. [2022-04-08 14:45:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:45:11,689 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2022-04-08 14:45:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2022-04-08 14:45:11,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:45:11,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:45:11,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:45:11,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:45:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:45:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2022-04-08 14:45:11,691 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 141 [2022-04-08 14:45:11,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:45:11,691 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2022-04-08 14:45:11,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 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 14:45:11,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 145 transitions. [2022-04-08 14:45:12,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:45:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2022-04-08 14:45:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-08 14:45:12,176 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:45:12,176 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:45:12,209 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 14:45:12,376 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 14:45:12,377 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:45:12,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:45:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash -654323313, now seen corresponding path program 27 times [2022-04-08 14:45:12,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:45:12,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [826324312] [2022-04-08 14:45:12,450 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:45:12,450 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:45:12,451 INFO L85 PathProgramCache]: Analyzing trace with hash -654323313, now seen corresponding path program 28 times [2022-04-08 14:45:12,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:45:12,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198876683] [2022-04-08 14:45:12,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:45:12,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:45:12,465 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:45:12,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538364178] [2022-04-08 14:45:12,465 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:45:12,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:45:12,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:45:12,467 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 14:45:12,487 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 14:45:12,560 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:45:12,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:45:12,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 14:45:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:45:12,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:45:13,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {29064#true} call ULTIMATE.init(); {29064#true} is VALID [2022-04-08 14:45:13,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {29064#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);~counter~0 := 0; {29072#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:13,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {29072#(<= ~counter~0 0)} assume true; {29072#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:13,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29072#(<= ~counter~0 0)} {29064#true} #61#return; {29072#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:13,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {29072#(<= ~counter~0 0)} call #t~ret6 := main(); {29072#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:13,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {29072#(<= ~counter~0 0)} 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; {29072#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:13,342 INFO L272 TraceCheckUtils]: 6: Hoare triple {29072#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {29072#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:13,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {29072#(<= ~counter~0 0)} ~cond := #in~cond; {29072#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:13,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {29072#(<= ~counter~0 0)} assume !(0 == ~cond); {29072#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:13,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {29072#(<= ~counter~0 0)} assume true; {29072#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:13,343 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29072#(<= ~counter~0 0)} {29072#(<= ~counter~0 0)} #53#return; {29072#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:13,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {29072#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {29072#(<= ~counter~0 0)} is VALID [2022-04-08 14:45:13,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {29072#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29106#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:13,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {29106#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {29106#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:13,345 INFO L272 TraceCheckUtils]: 14: Hoare triple {29106#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29106#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:13,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {29106#(<= ~counter~0 1)} ~cond := #in~cond; {29106#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:13,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {29106#(<= ~counter~0 1)} assume !(0 == ~cond); {29106#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:13,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {29106#(<= ~counter~0 1)} assume true; {29106#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:13,347 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29106#(<= ~counter~0 1)} {29106#(<= ~counter~0 1)} #55#return; {29106#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:13,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {29106#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29106#(<= ~counter~0 1)} is VALID [2022-04-08 14:45:13,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {29106#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29131#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:13,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {29131#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {29131#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:13,348 INFO L272 TraceCheckUtils]: 22: Hoare triple {29131#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29131#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:13,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {29131#(<= ~counter~0 2)} ~cond := #in~cond; {29131#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:13,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {29131#(<= ~counter~0 2)} assume !(0 == ~cond); {29131#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:13,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {29131#(<= ~counter~0 2)} assume true; {29131#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:13,349 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29131#(<= ~counter~0 2)} {29131#(<= ~counter~0 2)} #55#return; {29131#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:13,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {29131#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29131#(<= ~counter~0 2)} is VALID [2022-04-08 14:45:13,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {29131#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29156#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:13,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {29156#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {29156#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:13,351 INFO L272 TraceCheckUtils]: 30: Hoare triple {29156#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29156#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:13,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {29156#(<= ~counter~0 3)} ~cond := #in~cond; {29156#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:13,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {29156#(<= ~counter~0 3)} assume !(0 == ~cond); {29156#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:13,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {29156#(<= ~counter~0 3)} assume true; {29156#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:13,352 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29156#(<= ~counter~0 3)} {29156#(<= ~counter~0 3)} #55#return; {29156#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:13,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {29156#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29156#(<= ~counter~0 3)} is VALID [2022-04-08 14:45:13,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {29156#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29181#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:13,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {29181#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {29181#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:13,354 INFO L272 TraceCheckUtils]: 38: Hoare triple {29181#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29181#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:13,354 INFO L290 TraceCheckUtils]: 39: Hoare triple {29181#(<= ~counter~0 4)} ~cond := #in~cond; {29181#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:13,354 INFO L290 TraceCheckUtils]: 40: Hoare triple {29181#(<= ~counter~0 4)} assume !(0 == ~cond); {29181#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:13,355 INFO L290 TraceCheckUtils]: 41: Hoare triple {29181#(<= ~counter~0 4)} assume true; {29181#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:13,355 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29181#(<= ~counter~0 4)} {29181#(<= ~counter~0 4)} #55#return; {29181#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:13,355 INFO L290 TraceCheckUtils]: 43: Hoare triple {29181#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29181#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:13,356 INFO L290 TraceCheckUtils]: 44: Hoare triple {29181#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29206#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:13,356 INFO L290 TraceCheckUtils]: 45: Hoare triple {29206#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {29206#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:13,357 INFO L272 TraceCheckUtils]: 46: Hoare triple {29206#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29206#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:13,357 INFO L290 TraceCheckUtils]: 47: Hoare triple {29206#(<= ~counter~0 5)} ~cond := #in~cond; {29206#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:13,357 INFO L290 TraceCheckUtils]: 48: Hoare triple {29206#(<= ~counter~0 5)} assume !(0 == ~cond); {29206#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:13,358 INFO L290 TraceCheckUtils]: 49: Hoare triple {29206#(<= ~counter~0 5)} assume true; {29206#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:13,358 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29206#(<= ~counter~0 5)} {29206#(<= ~counter~0 5)} #55#return; {29206#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:13,358 INFO L290 TraceCheckUtils]: 51: Hoare triple {29206#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29206#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:13,359 INFO L290 TraceCheckUtils]: 52: Hoare triple {29206#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29231#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:13,359 INFO L290 TraceCheckUtils]: 53: Hoare triple {29231#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {29231#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:13,360 INFO L272 TraceCheckUtils]: 54: Hoare triple {29231#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29231#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:13,360 INFO L290 TraceCheckUtils]: 55: Hoare triple {29231#(<= ~counter~0 6)} ~cond := #in~cond; {29231#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:13,360 INFO L290 TraceCheckUtils]: 56: Hoare triple {29231#(<= ~counter~0 6)} assume !(0 == ~cond); {29231#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:13,361 INFO L290 TraceCheckUtils]: 57: Hoare triple {29231#(<= ~counter~0 6)} assume true; {29231#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:13,361 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29231#(<= ~counter~0 6)} {29231#(<= ~counter~0 6)} #55#return; {29231#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:13,361 INFO L290 TraceCheckUtils]: 59: Hoare triple {29231#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29231#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:13,362 INFO L290 TraceCheckUtils]: 60: Hoare triple {29231#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29256#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:13,362 INFO L290 TraceCheckUtils]: 61: Hoare triple {29256#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {29256#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:13,363 INFO L272 TraceCheckUtils]: 62: Hoare triple {29256#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29256#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:13,363 INFO L290 TraceCheckUtils]: 63: Hoare triple {29256#(<= ~counter~0 7)} ~cond := #in~cond; {29256#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:13,363 INFO L290 TraceCheckUtils]: 64: Hoare triple {29256#(<= ~counter~0 7)} assume !(0 == ~cond); {29256#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:13,363 INFO L290 TraceCheckUtils]: 65: Hoare triple {29256#(<= ~counter~0 7)} assume true; {29256#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:13,364 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29256#(<= ~counter~0 7)} {29256#(<= ~counter~0 7)} #55#return; {29256#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:13,364 INFO L290 TraceCheckUtils]: 67: Hoare triple {29256#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29256#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:13,365 INFO L290 TraceCheckUtils]: 68: Hoare triple {29256#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29281#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:13,365 INFO L290 TraceCheckUtils]: 69: Hoare triple {29281#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {29281#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:13,365 INFO L272 TraceCheckUtils]: 70: Hoare triple {29281#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29281#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:13,366 INFO L290 TraceCheckUtils]: 71: Hoare triple {29281#(<= ~counter~0 8)} ~cond := #in~cond; {29281#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:13,366 INFO L290 TraceCheckUtils]: 72: Hoare triple {29281#(<= ~counter~0 8)} assume !(0 == ~cond); {29281#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:13,366 INFO L290 TraceCheckUtils]: 73: Hoare triple {29281#(<= ~counter~0 8)} assume true; {29281#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:13,367 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29281#(<= ~counter~0 8)} {29281#(<= ~counter~0 8)} #55#return; {29281#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:13,367 INFO L290 TraceCheckUtils]: 75: Hoare triple {29281#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29281#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:13,368 INFO L290 TraceCheckUtils]: 76: Hoare triple {29281#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29306#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:13,368 INFO L290 TraceCheckUtils]: 77: Hoare triple {29306#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {29306#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:13,368 INFO L272 TraceCheckUtils]: 78: Hoare triple {29306#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29306#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:13,369 INFO L290 TraceCheckUtils]: 79: Hoare triple {29306#(<= ~counter~0 9)} ~cond := #in~cond; {29306#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:13,369 INFO L290 TraceCheckUtils]: 80: Hoare triple {29306#(<= ~counter~0 9)} assume !(0 == ~cond); {29306#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:13,369 INFO L290 TraceCheckUtils]: 81: Hoare triple {29306#(<= ~counter~0 9)} assume true; {29306#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:13,370 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29306#(<= ~counter~0 9)} {29306#(<= ~counter~0 9)} #55#return; {29306#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:13,370 INFO L290 TraceCheckUtils]: 83: Hoare triple {29306#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29306#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:13,370 INFO L290 TraceCheckUtils]: 84: Hoare triple {29306#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29331#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:13,371 INFO L290 TraceCheckUtils]: 85: Hoare triple {29331#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {29331#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:13,371 INFO L272 TraceCheckUtils]: 86: Hoare triple {29331#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29331#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:13,371 INFO L290 TraceCheckUtils]: 87: Hoare triple {29331#(<= ~counter~0 10)} ~cond := #in~cond; {29331#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:13,372 INFO L290 TraceCheckUtils]: 88: Hoare triple {29331#(<= ~counter~0 10)} assume !(0 == ~cond); {29331#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:13,372 INFO L290 TraceCheckUtils]: 89: Hoare triple {29331#(<= ~counter~0 10)} assume true; {29331#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:13,372 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29331#(<= ~counter~0 10)} {29331#(<= ~counter~0 10)} #55#return; {29331#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:13,373 INFO L290 TraceCheckUtils]: 91: Hoare triple {29331#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29331#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:13,373 INFO L290 TraceCheckUtils]: 92: Hoare triple {29331#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29356#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:13,374 INFO L290 TraceCheckUtils]: 93: Hoare triple {29356#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {29356#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:13,374 INFO L272 TraceCheckUtils]: 94: Hoare triple {29356#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29356#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:13,374 INFO L290 TraceCheckUtils]: 95: Hoare triple {29356#(<= ~counter~0 11)} ~cond := #in~cond; {29356#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:13,375 INFO L290 TraceCheckUtils]: 96: Hoare triple {29356#(<= ~counter~0 11)} assume !(0 == ~cond); {29356#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:13,375 INFO L290 TraceCheckUtils]: 97: Hoare triple {29356#(<= ~counter~0 11)} assume true; {29356#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:13,375 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29356#(<= ~counter~0 11)} {29356#(<= ~counter~0 11)} #55#return; {29356#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:13,376 INFO L290 TraceCheckUtils]: 99: Hoare triple {29356#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29356#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:13,376 INFO L290 TraceCheckUtils]: 100: Hoare triple {29356#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29381#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:13,377 INFO L290 TraceCheckUtils]: 101: Hoare triple {29381#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {29381#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:13,377 INFO L272 TraceCheckUtils]: 102: Hoare triple {29381#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29381#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:13,377 INFO L290 TraceCheckUtils]: 103: Hoare triple {29381#(<= ~counter~0 12)} ~cond := #in~cond; {29381#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:13,378 INFO L290 TraceCheckUtils]: 104: Hoare triple {29381#(<= ~counter~0 12)} assume !(0 == ~cond); {29381#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:13,378 INFO L290 TraceCheckUtils]: 105: Hoare triple {29381#(<= ~counter~0 12)} assume true; {29381#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:13,378 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29381#(<= ~counter~0 12)} {29381#(<= ~counter~0 12)} #55#return; {29381#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:13,379 INFO L290 TraceCheckUtils]: 107: Hoare triple {29381#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29381#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:13,379 INFO L290 TraceCheckUtils]: 108: Hoare triple {29381#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29406#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:13,379 INFO L290 TraceCheckUtils]: 109: Hoare triple {29406#(<= ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {29406#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:13,380 INFO L272 TraceCheckUtils]: 110: Hoare triple {29406#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29406#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:13,380 INFO L290 TraceCheckUtils]: 111: Hoare triple {29406#(<= ~counter~0 13)} ~cond := #in~cond; {29406#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:13,380 INFO L290 TraceCheckUtils]: 112: Hoare triple {29406#(<= ~counter~0 13)} assume !(0 == ~cond); {29406#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:13,381 INFO L290 TraceCheckUtils]: 113: Hoare triple {29406#(<= ~counter~0 13)} assume true; {29406#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:13,381 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29406#(<= ~counter~0 13)} {29406#(<= ~counter~0 13)} #55#return; {29406#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:13,381 INFO L290 TraceCheckUtils]: 115: Hoare triple {29406#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29406#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:13,382 INFO L290 TraceCheckUtils]: 116: Hoare triple {29406#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29431#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:13,382 INFO L290 TraceCheckUtils]: 117: Hoare triple {29431#(<= ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {29431#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:13,383 INFO L272 TraceCheckUtils]: 118: Hoare triple {29431#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29431#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:13,383 INFO L290 TraceCheckUtils]: 119: Hoare triple {29431#(<= ~counter~0 14)} ~cond := #in~cond; {29431#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:13,383 INFO L290 TraceCheckUtils]: 120: Hoare triple {29431#(<= ~counter~0 14)} assume !(0 == ~cond); {29431#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:13,384 INFO L290 TraceCheckUtils]: 121: Hoare triple {29431#(<= ~counter~0 14)} assume true; {29431#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:13,384 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29431#(<= ~counter~0 14)} {29431#(<= ~counter~0 14)} #55#return; {29431#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:13,384 INFO L290 TraceCheckUtils]: 123: Hoare triple {29431#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29431#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:13,385 INFO L290 TraceCheckUtils]: 124: Hoare triple {29431#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29456#(<= ~counter~0 15)} is VALID [2022-04-08 14:45:13,385 INFO L290 TraceCheckUtils]: 125: Hoare triple {29456#(<= ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {29456#(<= ~counter~0 15)} is VALID [2022-04-08 14:45:13,386 INFO L272 TraceCheckUtils]: 126: Hoare triple {29456#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29456#(<= ~counter~0 15)} is VALID [2022-04-08 14:45:13,386 INFO L290 TraceCheckUtils]: 127: Hoare triple {29456#(<= ~counter~0 15)} ~cond := #in~cond; {29456#(<= ~counter~0 15)} is VALID [2022-04-08 14:45:13,386 INFO L290 TraceCheckUtils]: 128: Hoare triple {29456#(<= ~counter~0 15)} assume !(0 == ~cond); {29456#(<= ~counter~0 15)} is VALID [2022-04-08 14:45:13,387 INFO L290 TraceCheckUtils]: 129: Hoare triple {29456#(<= ~counter~0 15)} assume true; {29456#(<= ~counter~0 15)} is VALID [2022-04-08 14:45:13,387 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29456#(<= ~counter~0 15)} {29456#(<= ~counter~0 15)} #55#return; {29456#(<= ~counter~0 15)} is VALID [2022-04-08 14:45:13,387 INFO L290 TraceCheckUtils]: 131: Hoare triple {29456#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29456#(<= ~counter~0 15)} is VALID [2022-04-08 14:45:13,388 INFO L290 TraceCheckUtils]: 132: Hoare triple {29456#(<= ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29481#(<= |main_#t~post5| 15)} is VALID [2022-04-08 14:45:13,388 INFO L290 TraceCheckUtils]: 133: Hoare triple {29481#(<= |main_#t~post5| 15)} assume !(#t~post5 < 20);havoc #t~post5; {29065#false} is VALID [2022-04-08 14:45:13,388 INFO L272 TraceCheckUtils]: 134: Hoare triple {29065#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29065#false} is VALID [2022-04-08 14:45:13,388 INFO L290 TraceCheckUtils]: 135: Hoare triple {29065#false} ~cond := #in~cond; {29065#false} is VALID [2022-04-08 14:45:13,388 INFO L290 TraceCheckUtils]: 136: Hoare triple {29065#false} assume !(0 == ~cond); {29065#false} is VALID [2022-04-08 14:45:13,388 INFO L290 TraceCheckUtils]: 137: Hoare triple {29065#false} assume true; {29065#false} is VALID [2022-04-08 14:45:13,388 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29065#false} {29065#false} #57#return; {29065#false} is VALID [2022-04-08 14:45:13,388 INFO L272 TraceCheckUtils]: 139: Hoare triple {29065#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {29065#false} is VALID [2022-04-08 14:45:13,388 INFO L290 TraceCheckUtils]: 140: Hoare triple {29065#false} ~cond := #in~cond; {29065#false} is VALID [2022-04-08 14:45:13,389 INFO L290 TraceCheckUtils]: 141: Hoare triple {29065#false} assume 0 == ~cond; {29065#false} is VALID [2022-04-08 14:45:13,389 INFO L290 TraceCheckUtils]: 142: Hoare triple {29065#false} assume !false; {29065#false} is VALID [2022-04-08 14:45:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 90 proven. 870 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:45:13,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:45:14,066 INFO L290 TraceCheckUtils]: 142: Hoare triple {29065#false} assume !false; {29065#false} is VALID [2022-04-08 14:45:14,067 INFO L290 TraceCheckUtils]: 141: Hoare triple {29065#false} assume 0 == ~cond; {29065#false} is VALID [2022-04-08 14:45:14,067 INFO L290 TraceCheckUtils]: 140: Hoare triple {29065#false} ~cond := #in~cond; {29065#false} is VALID [2022-04-08 14:45:14,067 INFO L272 TraceCheckUtils]: 139: Hoare triple {29065#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {29065#false} is VALID [2022-04-08 14:45:14,067 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29064#true} {29065#false} #57#return; {29065#false} is VALID [2022-04-08 14:45:14,067 INFO L290 TraceCheckUtils]: 137: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,067 INFO L290 TraceCheckUtils]: 136: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,067 INFO L290 TraceCheckUtils]: 135: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,067 INFO L272 TraceCheckUtils]: 134: Hoare triple {29065#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,067 INFO L290 TraceCheckUtils]: 133: Hoare triple {29539#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {29065#false} is VALID [2022-04-08 14:45:14,068 INFO L290 TraceCheckUtils]: 132: Hoare triple {29543#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29539#(< |main_#t~post5| 20)} is VALID [2022-04-08 14:45:14,068 INFO L290 TraceCheckUtils]: 131: Hoare triple {29543#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29543#(< ~counter~0 20)} is VALID [2022-04-08 14:45:14,068 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29064#true} {29543#(< ~counter~0 20)} #55#return; {29543#(< ~counter~0 20)} is VALID [2022-04-08 14:45:14,069 INFO L290 TraceCheckUtils]: 129: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,069 INFO L290 TraceCheckUtils]: 128: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,069 INFO L290 TraceCheckUtils]: 127: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,069 INFO L272 TraceCheckUtils]: 126: Hoare triple {29543#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,069 INFO L290 TraceCheckUtils]: 125: Hoare triple {29543#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {29543#(< ~counter~0 20)} is VALID [2022-04-08 14:45:14,070 INFO L290 TraceCheckUtils]: 124: Hoare triple {29568#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29543#(< ~counter~0 20)} is VALID [2022-04-08 14:45:14,071 INFO L290 TraceCheckUtils]: 123: Hoare triple {29568#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29568#(< ~counter~0 19)} is VALID [2022-04-08 14:45:14,071 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29064#true} {29568#(< ~counter~0 19)} #55#return; {29568#(< ~counter~0 19)} is VALID [2022-04-08 14:45:14,071 INFO L290 TraceCheckUtils]: 121: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,071 INFO L290 TraceCheckUtils]: 120: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,071 INFO L290 TraceCheckUtils]: 119: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,071 INFO L272 TraceCheckUtils]: 118: Hoare triple {29568#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,072 INFO L290 TraceCheckUtils]: 117: Hoare triple {29568#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {29568#(< ~counter~0 19)} is VALID [2022-04-08 14:45:14,072 INFO L290 TraceCheckUtils]: 116: Hoare triple {29593#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29568#(< ~counter~0 19)} is VALID [2022-04-08 14:45:14,072 INFO L290 TraceCheckUtils]: 115: Hoare triple {29593#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29593#(< ~counter~0 18)} is VALID [2022-04-08 14:45:14,073 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29064#true} {29593#(< ~counter~0 18)} #55#return; {29593#(< ~counter~0 18)} is VALID [2022-04-08 14:45:14,073 INFO L290 TraceCheckUtils]: 113: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,073 INFO L290 TraceCheckUtils]: 112: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,073 INFO L290 TraceCheckUtils]: 111: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,073 INFO L272 TraceCheckUtils]: 110: Hoare triple {29593#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,073 INFO L290 TraceCheckUtils]: 109: Hoare triple {29593#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {29593#(< ~counter~0 18)} is VALID [2022-04-08 14:45:14,074 INFO L290 TraceCheckUtils]: 108: Hoare triple {29618#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29593#(< ~counter~0 18)} is VALID [2022-04-08 14:45:14,074 INFO L290 TraceCheckUtils]: 107: Hoare triple {29618#(< ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29618#(< ~counter~0 17)} is VALID [2022-04-08 14:45:14,075 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29064#true} {29618#(< ~counter~0 17)} #55#return; {29618#(< ~counter~0 17)} is VALID [2022-04-08 14:45:14,075 INFO L290 TraceCheckUtils]: 105: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,075 INFO L290 TraceCheckUtils]: 104: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,075 INFO L290 TraceCheckUtils]: 103: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,075 INFO L272 TraceCheckUtils]: 102: Hoare triple {29618#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,075 INFO L290 TraceCheckUtils]: 101: Hoare triple {29618#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {29618#(< ~counter~0 17)} is VALID [2022-04-08 14:45:14,076 INFO L290 TraceCheckUtils]: 100: Hoare triple {29456#(<= ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29618#(< ~counter~0 17)} is VALID [2022-04-08 14:45:14,076 INFO L290 TraceCheckUtils]: 99: Hoare triple {29456#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29456#(<= ~counter~0 15)} is VALID [2022-04-08 14:45:14,077 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29064#true} {29456#(<= ~counter~0 15)} #55#return; {29456#(<= ~counter~0 15)} is VALID [2022-04-08 14:45:14,077 INFO L290 TraceCheckUtils]: 97: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,077 INFO L290 TraceCheckUtils]: 96: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,077 INFO L290 TraceCheckUtils]: 95: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,077 INFO L272 TraceCheckUtils]: 94: Hoare triple {29456#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,077 INFO L290 TraceCheckUtils]: 93: Hoare triple {29456#(<= ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {29456#(<= ~counter~0 15)} is VALID [2022-04-08 14:45:14,078 INFO L290 TraceCheckUtils]: 92: Hoare triple {29431#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29456#(<= ~counter~0 15)} is VALID [2022-04-08 14:45:14,078 INFO L290 TraceCheckUtils]: 91: Hoare triple {29431#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29431#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:14,079 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29064#true} {29431#(<= ~counter~0 14)} #55#return; {29431#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:14,079 INFO L290 TraceCheckUtils]: 89: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,079 INFO L290 TraceCheckUtils]: 88: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,079 INFO L290 TraceCheckUtils]: 87: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,079 INFO L272 TraceCheckUtils]: 86: Hoare triple {29431#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,079 INFO L290 TraceCheckUtils]: 85: Hoare triple {29431#(<= ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {29431#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:14,080 INFO L290 TraceCheckUtils]: 84: Hoare triple {29406#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29431#(<= ~counter~0 14)} is VALID [2022-04-08 14:45:14,080 INFO L290 TraceCheckUtils]: 83: Hoare triple {29406#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29406#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:14,081 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29064#true} {29406#(<= ~counter~0 13)} #55#return; {29406#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:14,081 INFO L290 TraceCheckUtils]: 81: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,081 INFO L290 TraceCheckUtils]: 80: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,081 INFO L290 TraceCheckUtils]: 79: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,081 INFO L272 TraceCheckUtils]: 78: Hoare triple {29406#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,081 INFO L290 TraceCheckUtils]: 77: Hoare triple {29406#(<= ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {29406#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:14,082 INFO L290 TraceCheckUtils]: 76: Hoare triple {29381#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29406#(<= ~counter~0 13)} is VALID [2022-04-08 14:45:14,082 INFO L290 TraceCheckUtils]: 75: Hoare triple {29381#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29381#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:14,082 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29064#true} {29381#(<= ~counter~0 12)} #55#return; {29381#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:14,083 INFO L290 TraceCheckUtils]: 73: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,083 INFO L290 TraceCheckUtils]: 72: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,083 INFO L290 TraceCheckUtils]: 71: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,083 INFO L272 TraceCheckUtils]: 70: Hoare triple {29381#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,083 INFO L290 TraceCheckUtils]: 69: Hoare triple {29381#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {29381#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:14,084 INFO L290 TraceCheckUtils]: 68: Hoare triple {29356#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29381#(<= ~counter~0 12)} is VALID [2022-04-08 14:45:14,084 INFO L290 TraceCheckUtils]: 67: Hoare triple {29356#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29356#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:14,085 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29064#true} {29356#(<= ~counter~0 11)} #55#return; {29356#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:14,085 INFO L290 TraceCheckUtils]: 65: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,085 INFO L290 TraceCheckUtils]: 64: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,085 INFO L290 TraceCheckUtils]: 63: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,085 INFO L272 TraceCheckUtils]: 62: Hoare triple {29356#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,085 INFO L290 TraceCheckUtils]: 61: Hoare triple {29356#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {29356#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:14,086 INFO L290 TraceCheckUtils]: 60: Hoare triple {29331#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29356#(<= ~counter~0 11)} is VALID [2022-04-08 14:45:14,086 INFO L290 TraceCheckUtils]: 59: Hoare triple {29331#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29331#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:14,087 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29064#true} {29331#(<= ~counter~0 10)} #55#return; {29331#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:14,087 INFO L290 TraceCheckUtils]: 57: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,087 INFO L290 TraceCheckUtils]: 56: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,087 INFO L290 TraceCheckUtils]: 55: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,087 INFO L272 TraceCheckUtils]: 54: Hoare triple {29331#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {29331#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {29331#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:14,088 INFO L290 TraceCheckUtils]: 52: Hoare triple {29306#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29331#(<= ~counter~0 10)} is VALID [2022-04-08 14:45:14,088 INFO L290 TraceCheckUtils]: 51: Hoare triple {29306#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29306#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:14,089 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29064#true} {29306#(<= ~counter~0 9)} #55#return; {29306#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:14,089 INFO L290 TraceCheckUtils]: 49: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,089 INFO L272 TraceCheckUtils]: 46: Hoare triple {29306#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {29306#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {29306#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:14,090 INFO L290 TraceCheckUtils]: 44: Hoare triple {29281#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29306#(<= ~counter~0 9)} is VALID [2022-04-08 14:45:14,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {29281#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29281#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:14,091 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29064#true} {29281#(<= ~counter~0 8)} #55#return; {29281#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:14,091 INFO L290 TraceCheckUtils]: 41: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,091 INFO L290 TraceCheckUtils]: 39: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,091 INFO L272 TraceCheckUtils]: 38: Hoare triple {29281#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {29281#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {29281#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:14,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {29256#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29281#(<= ~counter~0 8)} is VALID [2022-04-08 14:45:14,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {29256#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29256#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:14,093 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29064#true} {29256#(<= ~counter~0 7)} #55#return; {29256#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:14,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,093 INFO L272 TraceCheckUtils]: 30: Hoare triple {29256#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {29256#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {29256#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:14,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {29231#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29256#(<= ~counter~0 7)} is VALID [2022-04-08 14:45:14,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {29231#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29231#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:14,095 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29064#true} {29231#(<= ~counter~0 6)} #55#return; {29231#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:14,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,095 INFO L272 TraceCheckUtils]: 22: Hoare triple {29231#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {29231#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {29231#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:14,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {29206#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29231#(<= ~counter~0 6)} is VALID [2022-04-08 14:45:14,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {29206#(<= ~counter~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 * ~y~0 * ~y~0 + ~x~0; {29206#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:14,097 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29064#true} {29206#(<= ~counter~0 5)} #55#return; {29206#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:14,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,097 INFO L272 TraceCheckUtils]: 14: Hoare triple {29206#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {29206#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {29206#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:14,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {29181#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29206#(<= ~counter~0 5)} is VALID [2022-04-08 14:45:14,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {29181#(<= ~counter~0 4)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {29181#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:14,098 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29064#true} {29181#(<= ~counter~0 4)} #53#return; {29181#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:14,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {29064#true} assume true; {29064#true} is VALID [2022-04-08 14:45:14,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {29064#true} assume !(0 == ~cond); {29064#true} is VALID [2022-04-08 14:45:14,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {29064#true} ~cond := #in~cond; {29064#true} is VALID [2022-04-08 14:45:14,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {29181#(<= ~counter~0 4)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {29064#true} is VALID [2022-04-08 14:45:14,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {29181#(<= ~counter~0 4)} 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; {29181#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:14,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {29181#(<= ~counter~0 4)} call #t~ret6 := main(); {29181#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:14,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29181#(<= ~counter~0 4)} {29064#true} #61#return; {29181#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:14,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {29181#(<= ~counter~0 4)} assume true; {29181#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:14,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {29064#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);~counter~0 := 0; {29181#(<= ~counter~0 4)} is VALID [2022-04-08 14:45:14,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {29064#true} call ULTIMATE.init(); {29064#true} is VALID [2022-04-08 14:45:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 32 proven. 450 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 14:45:14,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:45:14,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198876683] [2022-04-08 14:45:14,101 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:45:14,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538364178] [2022-04-08 14:45:14,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538364178] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:45:14,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:45:14,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2022-04-08 14:45:14,102 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:45:14,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [826324312] [2022-04-08 14:45:14,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [826324312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:45:14,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:45:14,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 14:45:14,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453314999] [2022-04-08 14:45:14,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:45:14,103 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Word has length 143 [2022-04-08 14:45:14,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:45:14,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:45:14,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:45:14,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 14:45:14,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:45:14,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 14:45:14,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:45:14,220 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:45:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:45:14,852 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2022-04-08 14:45:14,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 14:45:14,852 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Word has length 143 [2022-04-08 14:45:14,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:45:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:45:14,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 158 transitions. [2022-04-08 14:45:14,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:45:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 158 transitions. [2022-04-08 14:45:14,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 158 transitions. [2022-04-08 14:45:14,984 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 14:45:14,986 INFO L225 Difference]: With dead ends: 158 [2022-04-08 14:45:14,986 INFO L226 Difference]: Without dead ends: 148 [2022-04-08 14:45:14,987 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=581, Invalid=901, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 14:45:14,987 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:45:14,987 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 153 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:45:14,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-08 14:45:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-04-08 14:45:15,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:45:15,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:45:15,223 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:45:15,223 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:45:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:45:15,225 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2022-04-08 14:45:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2022-04-08 14:45:15,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:45:15,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:45:15,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 148 states. [2022-04-08 14:45:15,225 INFO L87 Difference]: Start difference. First operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 148 states. [2022-04-08 14:45:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:45:15,227 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2022-04-08 14:45:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2022-04-08 14:45:15,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:45:15,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:45:15,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:45:15,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:45:15,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:45:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2022-04-08 14:45:15,229 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 143 [2022-04-08 14:45:15,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:45:15,229 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2022-04-08 14:45:15,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:45:15,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 150 transitions. [2022-04-08 14:45:15,456 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 14:45:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2022-04-08 14:45:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-08 14:45:15,472 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:45:15,472 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:45:15,488 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 14:45:15,672 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 14:45:15,672 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:45:15,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:45:15,673 INFO L85 PathProgramCache]: Analyzing trace with hash 780571829, now seen corresponding path program 29 times [2022-04-08 14:45:15,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:45:15,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [870523053] [2022-04-08 14:45:15,745 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:45:15,745 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:45:15,745 INFO L85 PathProgramCache]: Analyzing trace with hash 780571829, now seen corresponding path program 30 times [2022-04-08 14:45:15,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:45:15,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257205706] [2022-04-08 14:45:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:45:15,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:45:15,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:45:15,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1047360931] [2022-04-08 14:45:15,784 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:45:15,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:45:15,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:45:15,785 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 14:45:15,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process